• Management Science and Financial Engineering
• /
• v.16 no.3
• /
• pp.85-93
• /
• 2010

Given an undirected network with a set of source-sink pairs, we are assumed to get a benefit if a pair of source and sink nodes are connected. The k-edge survivability of a network is defined as the total benefit secured after arbitrarily selected k edges are destroyed. The problem of computing k-edge survivability is known to be NP-hard and has applications of evaluating the survivability or vulnerability of a network. In this paper, we consider the k-edge survivability problem restricted to ring networks and develop an algorithm to solve it in O($n^3$|K|) time where n is the number of nodes and K is the set of source-sink pairs.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.11
• /
• pp.1431-1439
• /
• 2016

In this paper, we propose a new location service and location-based routing for data dissemination from a source to a mobile group sink in less energy consumption of the sensor node. Unlike the existing protocols, the proposed protocol uses a leader sink instead of a group area as the location information to represent a mobile sink group. The proposed protocol also uses grid leaders on virtual grid structure to support sink mobility in location service. By using a leader sink as a representative and grid leaders for mobility supporting, the proposed protocol can exploit an efficient hierarchical location service and data dissemination method without using flooding. Accordingly, the proposed protocol carries out upper layer location services and data dissemination between a leader sink and a source and lower layer location services and data dissemination between the leader sink and member sinks. Simulation results demonstrate that the proposed protocol achieves energy-efficiency.

• Proceedings of the Korean Information Science Society Conference
• /
• 2007.10d
• /
• pp.240-243
• /
• 2007

Geographic routing has been considered as an efficient simple, and scalable routing protocol for wireless sensor networks since it exploits pure location information instead of global topology information to route data packets. Geographic routing requires the sources nodes to be aware of the location of the sinks. In this paper, we propose a scheme named Sink Location Service for geographic routing in wireless Sensor Networks, in which the source nodes can get and update the location of sinks with low overhead. In this scheme, a source and a sink send data announcement and query messages along two paths respectively by geographic routing. The node located on the crossing point of the two paths informs the source about the location of the sink. Then the source can send data packet to the sink by geographic routing. How to guarantee that these two paths have at least one crossing point in any irregular profile of sensor network is the challenge of this paper.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.3A
• /
• pp.287-295
• /
• 2010

In wireless sensor networks(WSNs), the studies that support sink mobility without global position information exploit a Backbone-based Virtual Infrastructure (BVI) which considers one-hop clusters and a backbone-based tree. Since the clusters of a sink and a source node are connected via flooding into the infrastructure, it causes high routing cost. Although the network could reduce the number of clusters via multi-level clusters, if the source nodes exist at nearest clusters from the cluster attached by the sink and they are in different branches of the tree, the data should be delivered via detour paths on the tree. Therefore, to reduce the number of clusters, we propose a novel multi-hop cluster based communication protocol supporting sink mobility without global position information. We exploit a rendezvous cluster head for sink location service and data dissemination but the proposed protocol effectively reduces data detour via comparing cluster hops from the source. Simulation shows that the proposed protocol is superior to the existing protocols in terms of the data delivery hop counts.

• Solar Energy
• /
• v.18 no.4
• /
• pp.11-22
• /
• 1998

Floor panel heating system using hot water is the primary heating system of domestic residential building. This paper presents the results of performance analysis of the heat pump system with air source evaporator and single unit dual sink(SUDSk) condenser. The heat exchanger combines two separated condensers into a single condenser and the object of the SUDSk condenser is to release energy to dual sinks, i.e. air for air heating system and water for panel heating system in one single unit. Simulation program is developed for single unit dual source(SUDS) SUDSk heat pump system and some experimental data are obtained and compared with simulation results. Differences of heating capacity and COP in dual source operating mode are 7% and 8% respectively. Simulation results are in good agreement with test results. Therefore, developed program is effectively used for design and performance prediction of dual source dual sink heat pump system with SUDS evaporator and SUDSk condenser.

• ETRI Journal
• /
• v.30 no.1
• /
• pp.13-20
• /
• 2008

We evaluate the sink capacity of wireless code division multiple access (CDMA) sensor networks with layered architecture. We introduce a model of interference at a sink considering two kinds of interference: multiple access interference (MAI) and node interference (NI). We also investigate the activity of sensor nodes around the sink in relation to gathering data under a layered architecture. Based on the interference model and the activity of sensor nodes around the sink, we derive the failure probability of the transmission from a source node located one hop away from the sink using Gaussian approximation. Under the requirement of 1% failure probability of transmission, we determine the sink capacity, which is defined as the maximum number of concurrent sensor nodes located one hop away from the sink. We demonstrate that as the node activity of the MAI decreases, the variation of the sink capacity due to the node activity of the NI becomes more significant. The analysis results are verified through computer simulations.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.10
• /
• pp.4814-4834
• /
• 2018

This paper presents an architecture for wireless sensor networks (WSNs) with blind source separation (BSS) applied to retrieve the received mixing signals of the sink nodes first. The little-to-no need of prior knowledge about the source signals of the sink nodes in the BSS method is obviously advantageous for WSNs. The optimization problem of the BSS of multiple independent source signals with complex and noncircular distributions from observed sensor nodes is considered and addressed. This paper applies Castella's reference-based scheme to Novey's negentropy-based algorithms, and then proposes a novel fast fixed-point (FastICA) algorithm, defined as the reference-signal negentropy complex FastICA (RSNT-cFastICA) for complex-valued noncircular-distribution source signals. The proposed method for the sink nodes is substantially more efficient than Novey's quasi-Newton algorithm in terms of computational speed under large numbers of samples, can effectively improve the power consumption effeciency of the sink nodes, and is significantly beneficial for WSNs and wireless communication networks (WCNs). The effectiveness and performance of the proposed method are validated and compared with three related BSS algorithms through theoretical analysis and simulations.

• Korean Journal of Soil Science and Fertilizer
• /
• v.6 no.2
• /
• pp.95-105
• /
• 1973

Sink (grain)-filling rates of IR667 line (Suwon 213 and 214) and local leading varieties (Jinheung and Paldal) were investigated in relation to sink-source ratio, sink-source distance, forms of photosynthates, and weather factors. The results are as follows. 1. IR667 line have higher maximum filling rate (g. grain/day. ear) and shorter duration to reach maximum filling rate than local varieties. The curve pattern of sink-filling rate was high and steep type in IR667 line and low and broad type in local varieties. 2. Weather factors seem to give little effect on the curve pattern of sink-filling rate. 3. The functional sink-source distance (actual sink-source distance multiplied by the contribution rate of leaf for grain production) was shorter in upper leaves (flag and 2nd leaf) for IR667 line, the upper leaf-dependent type in grain production, and was longer in lower leaves (3rd and 4th) for local varieties, the lower leaf-dependent type. Specially short first internode from top may contribute to the upper leaf depencency of IR667 line. 4. According to free sugar-starch ratio (sugar/starch) in the culm and leaf sheath IR667 line could be classified as the high sugar type and the local varieties as the high starch type. The ratio of transportable form (sugar) to non transportable photosynthate (starch) seems to relate with sink-filling rate. And high sugar type is expected to have higher efficiency for grain production in view of energy balance. 5. A hypothesis that the higher in the uniformity within the series of productive structure the more efficient in grain production is proposed and discussed in relation to productivity. 6. According to the pattern of percent nutrient retention of each leaf blade IR667 showed the central retention type and Jinheung showed the apical retention type and each retention type appears to be a cause of each canopy conservation pattern. 7. From the content and percent distribution of nutrient in various organ IR667 could be classified as the leaf sheath dominant type and Jinheung as the leaf blade dominant type. 8. The fact that the greater the percent translocation of nutrient into grain the greater the percent nutrient retention in leaf blade was held between nitrogen and phosphorus within a variety and between varieties within a nutrient (N, P or K).

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.7
• /
• pp.1707-1718
• /
• 1996

Given a signal net N=s, 1,...,n to be the set of nodes, with s the source and the remaining nodes sinks, an MRDPT (minimum-cost rectilinear Steiner distance -preserving tree) has the property that the length of every source to sink path is equal to the rectilinear distance between the source and sink. The minimum- cost rectilinear Steiner distance-preserving tree minimizes the total wore length while maintaining minimal source to sink length. Recently, some heuristic algorithms have been proposed for the problem offending the MRDPT. In this paper, we investigate an optimal structure on the MRDPT and present a theoretical breakthrough which shows that the min-cost flow formulation leads to an efficient O(n2logm)2) time algorithm. A more practical extension is also in vestigated along with interesting open problems.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.2
• /
• pp.686-710
• /
• 2019

This work proposes a model to solve the problem of Network Coding over a one-session multicast network. The model is based on a system of restrictions that defines the packet flows received in the sink nodes as functions of the outgoing flows from the source node. A multicast network graph is used to derive a directed labeled line graph (DLLG). The successive powers of the DLLG adjacency matrix to the convergence in the null matrix permits the construction of the jump matrix Source-Sinks. In its reduced form, this shows the dependency of the incoming flows in the sink nodes as a function of the outgoing flows in the source node. The emerging packets for each outgoing link from the source node are marked with a tag that is a linear combination of variables that corresponds to powers of two. Restrictions are built based on the dependence of the outgoing and incoming flows and the packet tags as variables. The linear independence of the incoming flows to the sink nodes is mandatory. The method is novel because the solution is independent of the Galois field size where the packet contents are defined.