• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38C no.5
• /
• pp.486-496
• /
• 2013

Time synchronization in underwater environment is challenging due to high propagation delay and mobility of sensor nodes. Previous researches do not consider practical issues affecting on the accuracy of time synchronization such as high-channel access delay and relative position between sensor nodes. Also, those protocols using bidirectional message exchange shorten the network lifetime and decrease the network throughput because numerous transmission, reception and unnecessary overhearing can be occurred. Therefore, in our research, we suggest enhanced time synchronization based on features of underwater environment. It controls the instant of transmission by exploiting the feature of an oceanic movement and node deployment. Moreover, the protocol uses more accurate time information by removing channel access delay from the timestamp. The proposed scheme is also practical on the underwater sensor network requiring low-power consumption because the scheme conducts time-synchronization with smaller transmission and reception compared with previous works. Finally, simulation results show that the proposed protocol deceases time error by 2.5ms and 0.56ms compared with TSHL and MU-Sync respectively, reducing energy consumption by 68.4%.

• Journal of KIISE:Information Networking
• /
• v.41 no.4
• /
• pp.177-185
• /
• 2014

It has been occurred many times that wireless sensor networks (WSNs) had congested areas because all the sensing data collected by multiple sensor nodes are delivered to one sink node. Typically, in order to control congested areas, it used to reduce the traffic by increasing the sensing period or discarding packets. However, those schemes have a disadvantage that it loses the reliability when delivering sensing data. Moreover, there are no schemes considering case of having poor quality of links between nodes in practical terms. In this paper, we suggest a scheme not to reduce the traffic but to distribute the traffic by changing routing paths depends on the traffic and the quality of links. Also, it can be seen that the reliability of delivering of the sensing data is improved with the experiments improving collection rates and shortening end-to-end delay.

• 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.

• Journal of Digital Contents Society
• /
• v.18 no.4
• /
• pp.753-760
• /
• 2017

In this paper, we propose a new method to improve the performance of a Quorum-based NDP (Neighbor Discovery Protocol) in heterogeneous wireless sensor networks. It creates a new set of discovery schedules by combining two different Quorum-based matrices. The original Quorum-based schedule guarantees only two overlapping active slots with a cycle, but the newly created matrix greatly increases the chance of neighbor discovery. Therefore, although the size of the combined matrix of the proposed method increases, the number of discovery chances with neighboring nodes considerably increases, and the new approach is superior to the original Quorum-based neighbor node discovery protocol. In this study, we compares the performance of the proposed method to the Quorum-based protocols such as SearchLight and Hedis using TOSSIM. We assume all sensor nodes operates in a different duty cycle in the experiment. The experimental results show that the proposed algorithm is superior to other Quorum-based methods.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38B no.6
• /
• pp.446-453
• /
• 2013

Clustering schemes have been adopted as an efficient solution to prolong network lifetime and improve network scalability. In such clustering schemes cluster ratio is represented by the rate of the number of cluster heads and the number of total nodes, and affects the performance of clustering schemes. In this paper, we mathematically analyze an optimal clustering ratio in wireless sensor networks. We consider a multi-hop to one-hop transmission case and aim to provide the optimal cluster ratio to minimize the system hop-count and maximize packet reception ratio between nodes. We examine its performance through a set of simulations. The simulation results show that the proposed optimal cluster ratio effectively reduce transmission count and enhance energy efficiency in wireless sensor networks.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.4B
• /
• pp.227-235
• /
• 2012

Holes that generated by the unpredictable and harsh nature application environment or uneven energy consumption are an inevitable phenomenon in wireless sensor networks. Most of the existing schemes for this hole problem tend to use a static detour path to bypass a hole. The static detour path may lead to uneven energy consumption of the nodes on the boundary of the hole, thus it may enlarge the region of holes. At the same time, traffic would concentrate on the nodes on the boundary of the hole and tend to be depleted quickly. To solve this problem, we introduce energy-efficient grid-based geographic routing and hole-detouring scheme by taking advantage of grid anchor point in wireless sensor network with holes. The location of hole detour anchor node is dynamically shifted in grid cell. just generating dynamic hole detour paths to reduce total energy consumption. Simulation results are provided to validate the claims.

• The KIPS Transactions:PartA
• /
• v.16A no.1
• /
• pp.17-26
• /
• 2009

Large-scale wireless sensor network are expected to play an increasingly important role for the data collection in harmful area. However, the physical fragility of sensor node makes reliable routing in harmful area a challenging problem. Since several sensor nodes in harmful area could be damaged all at once, the network should have the availability to recover routing from node failures in large area. Many routing protocols take accounts of failure recovery of single node but it is very hard these protocols to recover routing from large scale failures. In this paper, we propose a routing protocol, which we refer to as LSFA, to recover network fast from failures in large area. LSFA detects the failure by counting the packet loss from parent node and in case of failure detection LSFAdecreases the routing interval to notify the failure to the neighbor nodes. Our experimental results indicate clearly that LSFA could recover large area failures fast with less packets than previous protocols.

• Journal of Industrial Technology
• /
• v.27 no.B
• /
• pp.235-243
• /
• 2007

Sensor network is used to obtain sensing data in various area. The interval to sense the events depends on the type of target application and the amounts of data generated by sensor nodes are not constant. Many applications exploit long sensing interval to enhance the life time of network but there are specific applications that requires very short interval to obtain fine-grained, high-precision sensing data. If the number of nodes in the network is increased and the interval to sense data is shortened, the amounts of generated data are greatly increased and this leads to increased amount of packets to transfer to the network. To transfer large amount of packets fast, it is necessary that the delay between successive packet transmissions should be minimized as possible. In Sensor network, since the Operating Systems are worked on the event driven, the Timer Event is used to transfer packets successively. However, since the transferring time of packet completely is varies very much, it is very hard to set appropriate interval. The longer the interval, the higher the delay and the shorter the delay, the larger the fail of transfer request. In this paper, we propose ESTEO which reduces the delay between successive packet transmissions by using SendDone Event which informs that a packet transmission has been completed.In ESTEO, the delay between successive packet transmissions is shortened very much since the transmission of next packet starts at the time when the transmission of previous packet has completed, irrespective of the transmission timee. Therefore ESTEO could provide high packet transmission rate given large amount of packets.

• Journal of the Korea Society of Computer and Information
• /
• v.10 no.3 s.35
• /
• pp.237-247
• /
• 2005

Ubiquitous Sensor Network(USN) is the very core of a technology for the Ubiquitous environments. There is the weakness from various security attacks such that tapping of sensor informations, flowing of abnormal packets, data modification and Denial of Service(DoS) etc. And it's required counterplan with them. Especially it's restricted by the capacity of battery and computing. By reasons of theses. positively, USN security technology needs the lightweighted design for the low electric energy and the minimum computing. In this paper, we propose lightweight USN mutual authentication methology based on trust model to solve above problems. The proposed authentication model can minimize the measure of computing because it authenticates the sensor nodes based on trust information represented by subjective logic model. So it can economize battery consumption and resultingly increse the lifetime of sensor nodes.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39B no.9
• /
• pp.614-619
• /
• 2014

In WSN (Wireless Sensor Networks) based surveillance system, it needs to know the occurrence of events or objects and their locations, because the data have no meaning without location information. Using traditional 2D localization mechanisms provide good accuracy where altitude is fixed. But the mapping the position estimated by 2D localization to the real world can cause an error. Even though 3D localization mechanisms provide better accuracy than 2D localization, they need four reference nodes at least and high processing overhead. In our surveillance system, it is needed to estimate the height of the detected object in order to determine if the object is human. In this paper, we propose a height estimation mechanism which does not require many reference nodes and high complexity. Finally, we verify the performance of our proposed mechanism through various experiments.