• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.12
• /
• pp.2687-2696
• /
• 2011

A Clustering problem is one of the organizational problems to improve network lifetime and scalability in underwater acoustic sensor networks. This paper propose an algorithm to obtain an optimal clustering solution to be able to minimize a total transmission power for all deployed nodes to transmit data to the sink node through its clusterhead. In general, as the number of nodes increases, the amount of calculation for finding the solution would be too much increased. To obtain the optimal solution within a reasonable computation time, we propose a genetic algorithm to obtain the optimal solution of the cluster configuration. In order to make a search more efficient, we propose some efficient neighborhood generating operations of the genetic algorithm. We evaluate those performances through some experiments in terms of the total transmission power of nodes and the execution time of the proposed algorithm. The evaluation results show that the proposed algorithm is efficient for the cluster configuration in underwater acoustic sensor networks.

• The KIPS Transactions:PartC
• /
• v.18C no.1
• /
• pp.15-22
• /
• 2011

Usually time synchronization is performed after routing tree is constructed. This thesis proposes a time synchronization algorithm combined with single-flooding routing tree construction algorithm in a single path. TSRA (Time Synchronization Routing Algorithm) uses routing packets to construct a routing tree. Two types of time information are added to the routing packet: one is the packet receiving time, and the other is the packet sending time. Time offset and transmission time-delay between parent node and child node could be retrieved from the added time information using LTS (Lightweight Time Synchronization) algorithm. Then parent node sends the time offset and transmission time to children nodes and children nodes can synchronize their time to the parent node time along the routing tree. The performance of proposed algorithm is compared to the TPSN (Timing-sync Protocol for Sensor Networks) which is known to have high accuracy using NS2 simulation tool. The simulation result shows that the accuracy of time synchronization is comparable to TPSN, the synchronization time of all sensor nodes is faster than TPSN, and the energy consumption is less than TPSN.

• The Journal of the Korea Contents Association
• /
• v.9 no.2
• /
• pp.88-96
• /
• 2009

In this paper we suggest the EEF technique to improve the performance of U-Health System. The idea of the EEF technique is that a sensor node sends only the abnormal data of patients to the base node. This technique reduces the amount of data transfer between a base node and sensor nodes, and so the power consumption of sensor nodes will be saved. And also the processing cost of base node will be reduced. In the suggested U-Health System based on EEF technique, electrocardiogram sensors and GPS sensors are used to send the electrocardiogram and position information of patients to a server. The server analyzes the health state of patients from base nodes and sends the information about the patients in the emergent state to the nearest hospital. Through the simulation, we have confirmed the suitability of EEF technique for U-Health System.

• Journal of KIISE:Software and Applications
• /
• v.33 no.4
• /
• pp.378-387
• /
• 2006

A programming model for ubiquitous sensor network (USN) applications based on Nano-Qplus is proposed. USN applications mean programs of nodes which are components of sensor network such as sensor, router, sink and actuator. Developers can automatically generate programs of USN applications by setting attributes values of nodes using a script after they model a sensor network. A script for setting attributes values of a node is proposed in this paper. The algorithm of automatic code generation is also described. Developers can easily implement USN applications even if they do not know details of low-level communication, data sharing, and collective operations because the applications are automatically generated from a script. They set only attributes values of nodes using the script. Efforts for USN applications development also are reduced because of automatic code generation. Furthermore, developers can correct errors of applications in the early stage of development through ear]y test based on rapid code generation.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.06a
• /
• pp.360-363
• /
• 2007

In sensor network, the importance of transporting data with reliability is growing gradually to support communications. Data flow from sink to nodes needs reliability for the control or management, that is very sensitive and intolerable, however relatively, data flow from nodes to sink is tolerable. In this paper, with emphasis of the data flow from sink to nodes, we proposed the mechanism that establishes confidence interval for transport. Establishing confidence interval hop-by-hop, not end to end, if errors happen or there's missing data, this mechanism recovers them with selective acknowledgement using fixed window. In addition, this mechanism supports traffic congestion control depending on the buffer condition. Through the simulation, we showed that this mechanism has an excellent performance for error recovery in sensor network.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.1
• /
• pp.227-247
• /
• 2018

For intermittently connected wireless sensor networks deployed in hash environments, sensor nodes may fail due to internal or external reasons at any time. In the process of data collection and recovery, we need to speed up as much as possible so that all the sensory data can be restored by accessing as few survivors as possible. In this paper a novel redundant data storage algorithm based on minimum spanning tree and quasi-randomized matrix-QRNCDS is proposed. QRNCDS disseminates k source data packets to n sensor nodes in the network (n>k) according to the minimum spanning tree traversal mechanism. Every node stores only one encoded data packet in its storage which is the XOR result of the received source data packets in accordance with the quasi-randomized matrix theory. The algorithm adopts the minimum spanning tree traversal rule to reduce the complexity of the traversal message of the source packets. In order to solve the problem that some source packets cannot be restored if the random matrix is not full column rank, the semi-randomized network coding method is used in QRNCDS. Each source node only needs to store its own source data packet, and the storage nodes choose to receive or not. In the decoding phase, Gaussian Elimination and Belief Propagation are combined to improve the probability and efficiency of data decoding. As a result, part of the source data can be recovered in the case of semi-random matrix without full column rank. The simulation results show that QRNCDS has lower energy consumption, higher data collection efficiency, higher decoding efficiency, smaller data storage redundancy and larger network fault tolerance.

• Journal of Korea Multimedia Society
• /
• v.13 no.1
• /
• pp.122-132
• /
• 2010

The analysis of ocean environment offers us essential information for ocean exploration. But ocean environment has a lot of environmental variables such as the movements of nodes by an ocean current, corrosion by salt water, attenuation of radio wave, occurrences of multi-path and difficulty of sensor nodes' deployment. It is accordingly difficult and complex to gather and process the environmental information through ocean data communication due to these constraints of ocean environment unlike the terrestrial wireless networks. To overcome these problems, we organized ocean communication network for monitoring underwater environment by real experiment in Gyeongpoho similar to ocean environment. Therefore, this paper aims at overcoming major obstacles in ocean environment, effectively deploying sensor nodes for ocean environment monitoring and defining an efficient structure suitable for communication environment by the implementation of ocean environment monitoring system in Gyeongpoho.

• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.3
• /
• pp.321-325
• /
• 2008

Void areas(holes) as an inevitable phenomenon exist in geographic routing of wireless sensor networks, because the unpredictable and harsh nature application environment or uneven energy consumption. Most of the existing schemes for the issue tend to construct a static detour path to bypass a hole. The static detour path may lead to uneven energy consumption of the nodes on the perimeter of the hole; thus it may enlarge the hole. At the same time, traffic would concentrate on the peripheral node of the hole; thus the nodes on the perimeter of the hole tend to be depleted quietly. In previous work, we have proposed a hole geometric model to reduce the energy consumption and packet collisions of the nodes on the hole boundary. This scheme, however, still has the static detour path problem. Therefore, we extend the previous work by constructing a dynamic detour path hole geometric model for wireless sensor networks in this paper. The location of hole detour anchors is dynamically shifted according to Gaussian function, just generating dynamic hole detour paths.

• Journal of Digital Convergence
• /
• v.11 no.10
• /
• pp.419-429
• /
• 2013

The Wireless sensor network(WSN) consisting of a large number of sensors aims to gather data in a variety of environments. The sensor nodes operate on battery of limited power. so, To extend network life time is major goals of research in the WSN. In this paper, we state the key point of a energy consumption with minimum&load balancing. The proposed protocol guarantee balance of number of cluster member nodes using the node memory threshold and optimization of distribution of cluster head using the optimized clustering method. The results show that the proposed protocol could support the load balancing and high energy efficiency by distributing the clusters with a reasonable number of member nodes. The simulation results show that our schme ensure longer life time in WSN as compare with existing schemes such as LEACH and CBLM.

• Journal of Communications and Networks
• /
• v.17 no.2
• /
• pp.184-197
• /
• 2015

This paper builds on a recent method, chain routing with even energy consumption (CREEC), for designing a wireless sensor network with chain topology and for scheduling the communication to ensure even average energy consumption in the network. In here a new suboptimal design is proposed and compared with the CREEC design. The chain topology in CREEC is reconfigured after each group of n converge-casts with the goal of making the energy consumption along the new paths between the nodes in the chain as even as possible. The new method described in this paper designs a single near-optimal Hamiltonian circuit, used to obtain multiple chains having only the terminal nodes different at different converge-casts. The advantage of the new scheme is that for the whole life of the network most of the communication takes place between same pairs of nodes, therefore keeping topology reconfigurations at a minimum. The optimal scheduling of the communication between the network and base station in order to maximize network lifetime, given the chosen minimum length circuit, becomes a simple linear programming problem which needs to be solved only once, at the initialization stage. The maximum lifetime obtained when using any combination of chains is shown to be upper bounded by the solution of a suitable linear programming problem. The upper bounds show that the proposed method provides near-optimal solutions for several wireless sensor network parameter sets.