• Convergence Security Journal
• /
• v.13 no.6
• /
• pp.69-76
• /
• 2013

A lot of researches have been done to improve the energy efficiency of Wireless Sensor Networks. But all the current researches are based on the idea of direct communication between cluster head and sink node. Previous results assume that node can intelligently regulate signal energy according to the distance between nodes. It is difficult to implement algorithms based on this assumption. We present a multi-level routing algorithm from the sink node to all other nodes which have fixed radio wave radius. We also show the energy saving efficiency and the implementation in real WSN using the simulation result.

• Journal of Information Processing Systems
• /
• v.14 no.4
• /
• pp.926-940
• /
• 2018

In clustering-based approaches, cluster heads closer to the sink are usually burdened with much more relay traffic and thus, tend to die early. To address this problem, distance-aware clustering approaches, such as energy-efficient unequal clustering (EEUC), that adjust the cluster size according to the distance between the sink and each cluster head have been proposed. However, the network lifetime of such approaches is highly dependent on the distribution of the sensor nodes, because, in randomly distributed sensor networks, the approaches do not guarantee that the cluster energy consumption will be proportional to the cluster size. To address this problem, we propose a novel approach called CACD (Clustering Algorithm Considering node Distribution), which is not only distance-aware but also node density-aware approach. In CACD, clusters are allowed to have limited member nodes, which are determined by the distance between the sink and the cluster head. Simulation results show that CACD is 20%-50% more energy-efficient than previous work under various operational conditions considering the network lifetime.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.46 no.5
• /
• pp.79-85
• /
• 2009

A sink node and its neighbor nodes spend more energy than other nodes since a stationary sink node collects data from wireless sensor networks(WSNs). For larger WSNs, the unbalanced energy of nodes causes the operation of WSNs to stop rapidly. This paper proposes a data gathering method by adapting the mobile sink to prolong the life time of large WSNs. After partitioning a network into several clusters, a mobile sink visits each cluster and collects data from it. An efficient algorithm is proposed to improve the energy efficiency by delivering the message from the mobile sink to the cluster head as well as to reduce the data gathering delay, which is the disadvantage of the mobile sink. Also, The algorithm is analyzed for the energy consumption and the data gathering delay. The validity of the ananlysis result is confirmed by the simulation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.10A
• /
• pp.1004-1014
• /
• 2007

In sensor networks, it is crucial to reliably and energy-efficiently deliver sensed information from each source to a sink node. Specifically, in mobile sink (user) applications, due to the sink mobility, a stationary dissemination path may no longer be effective. The path will have to be continuously reconfigured according to the current location of the sink. Moreover, the dynamic optimal path from each source to the sink is required in order to reduce end-to-end delay and additional energy wastage. In this paper, an Adaptive Reversal Optimal path Tree (AROT) protocol is proposed. Information delivery from each source to a mobile sink can be easily achieved along the AROT without additional control overhead, because the AROT proactively performs adaptive sink mobility management. In addition, the dynamic path is optimal in terms of hop counts and the AROT can maintain a robust tree structure by quickly recovering the partitioned tree with minimum packet transmission. Finally, the simulation results demonstrate that the AROT is a considerably energy-efficient and robust protocol.

• Journal of KIISE
• /
• v.42 no.1
• /
• pp.114-121
• /
• 2015

Large-scale wireless sensor networks are constructed by using a large number of sensor nodes that are non-uniformly deployed over a wide area. As a result, the data collected by the sensor nodes are similar to that from one another since a high density of the sensor nodes may cause an overlap. As a result of the characteristics of the traffic, data is collected from a plurality of sensor nodes by a sink node, and when the sensor nodes transmit their collected data to the sink node, the sensor nodes around the sink node have a higher amount of traffic than the sensor nodes far away from the sink node. Thus, the former sensor encounter bottlenecks due to traffic congestion and have an energy hole problem more often than the latter ones, increasing energy consumption. This paper proposes a congestion control scheme that considers traffic flows in order to control traffic congestion of the sensor nodes that are non-uniformly deployed over a large-scale wireless sensor network.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39C no.11
• /
• pp.1068-1077
• /
• 2014

In this paper, we propose a novel method for path setup that optimizes energy consumptions for wireless sensor network. Existing studies usually generate paths according to Random way point approach so that it requires unnecessary energy consumptions for estimating location of the mobile sink node and transmission paths of packets. To address this problem, we propose a method that creates paths for mobile sink node using the Hilbert curve. Moreover, our method adjusts the path of the mobile sink node according to the density of sensor nodes to minimize data transmission delay. In our experiments, the proposed method outperforms existing work such as TTDD and CBPER by up to 50 times in terms of energy efficiency.

• 전자공학회논문지 IE
• /
• v.46 no.3
• /
• pp.55-61
• /
• 2009

This paper describes an assistant system for elders who live alone. The developed system is composed of a wearable RFID system, a gateway system, and server system. The wearable RFID system is installed in glove. The wearable RFID system can be considered as a wireless sensor network which has a sink node and sensor node with a RFID reader. The sensor node can read RFID tags on the various objects used in daily living such as furniture, medicines, sugar and salt bottles, and ok. The sensor node transmits wireless packets to the sink node. The sink node sends the received packet immediately to a server system via a gateway system. The gateway provides users with audio-visual information of objects. The server system is composed of a database server and a web server. The data from each wearable RFID system is collected into a database, and then the data are processed to visualize the measurement of daily living activities of users. The processed data can be provided for someone who wants to know about user's daily living patterns in house such as family, caregivers, and medical crew.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2018.10a
• /
• pp.571-573
• /
• 2018

Wireless sensor networks have unbalanced energy consumption due to the convergence structure in which data is concentrated to sink nodes. To solve this problem, in the previous research, the relay node was placed between the source node and the sink node to merge the data before being concentrated to the sink node. However, selecting a relay node that does not consider the link quality causes packet loss according to the link quality of the reconfigured routing path. Therefore, in this paper, we propose a link cost calculation method for data reliability in routing path reconfiguration for relay node selection. We propose a link cost estimation formula considering the number of hops and RSSI as the routing metric value and select the RSSI threshold value through the packet transmission experiment between the sensor modules.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.47 no.8
• /
• pp.53-60
• /
• 2010

This paper proposes an efficient path maintaining scheme in the grid based wireless sensor networks. The proposed scheme provides the shortest path from a source node to a mobile sink node in a re-established dissemination path. The shortest path can save energy consumption to deliver data to the destination. The proposed scheme can also reduce the cost for path maintenance by reusing the existing path. The simulation results show that the proposed scheme reduces the path maintenance cost by 60% compared to the conventional schemes.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.4 no.3
• /
• pp.224-242
• /
• 2010

Data routing in wireless sensor networks must be energy-efficient because tiny sensor nodes have limited power. A cluster-based hierarchical routing is known to be more efficient than a flat routing because only cluster-heads communicate with a sink node. Existing hierarchical routings, however, assume unrealistically large radio transmission ranges for sensor nodes so they cannot be employed in real environments. In this paper, by considering the practical transmission ranges of the sensor nodes, we propose a clustering and routing method for hierarchical sensor networks: First, we provide the optimal ratio of cluster-heads for the clustering. Second, we propose a d-hop clustering scheme. It expands the range of clusters to d-hops calculated by the ratio of cluster-heads. Third, we present an intra-cluster routing in which sensor nodes reach their cluster-heads within d-hops. Finally, an inter-clustering routing is presented to route data from cluster-heads to a sink node using multiple hops because cluster-heads cannot communicate with a sink node directly. The efficiency of the proposed clustering and routing method is validated through extensive simulations.