• KIPS Transactions on Computer and Communication Systems
• /
• v.5 no.12
• /
• pp.455-462
• /
• 2016

Wireless sensor networks have been researched to gather data about events on sensor fields from sources at sinks. Multipath routing is one of attractive approaches to reliably send data against the problem of frequent breakages on paths from sources to sinks due to node and link failures. As mobile events such as humans, animals, and vehicles are considered, sources may be continuously generated according to the movement of the mobile event. Thus, mobile events provide new challenging issue in multipath routing. However, the research on multipath routing mainly focus on both efficient multipath construction from sources to static sinks and fast multipath reconstruction against path breakages. Accordingly, the previous multipath routing protocols request each source continuously generated by a mobile event to construct individual multipath from the source to sinks. This induces the increase of multipath construction cost in the previous protocols in proportion to the number of source. Therefore, we propose efficient multipath routing protocol for supporting continuous sources generated by mobile events. In the proposed protocol, new source efficiently reconstructs its multipath by exploiting the existing multipath of previous sources. To do this, the proposed protocol selects one among three reconstruction methods: a local reconstruction, a global partial one, and a global full one. For a selection decision, we provide an analytical energy consumption cost model that calculates the summation of both the multipath reconstruction cost and the data forwarding cost. Simulation results show that the proposed protocol has better performance than the previous protocol to provide multipath routing for mobile events.

• KIPS Transactions on Computer and Communication Systems
• /
• v.5 no.12
• /
• pp.447-454
• /
• 2016

The research on multipath routing has been studied to solve the problem of frequent path breakages due to node and link failures and to enhance data delivery reliability in wireless sensor networks. In the multipath routing, mobile sinks such as soldiers in battle fields and rescuers in disaster areas bring about new challenge for handling their mobility. The sink mobility requests new multipath construction from sources to mobile sinks according to their movement path. Since mobile sinks have continuous mobility, the existing multipath can be exploited to efficiently reconstruct to new positions of mobile sinks. However, the previous protocols do not address this issue. Thus, we proposed an efficient multipath reconstruction protocol called LGMR for mobile sinks in wireless sensor networks. The LGMR address three multipath reconstruction methods based on movement types of mobile sinks: a single hop movement-based local multipath reconstruction, a multiple hop movement-based local multipath reconstruction, and a multiple hop movement-based global multipath reconstruction. Simulation results showed that the LGMR has better performance than the previous protocol in terms of energy consumption and data delivery delay.

• The Journal of the Korea Contents Association
• /
• v.9 no.1
• /
• pp.115-122
• /
• 2009

In this paper, we proposed scheme that we use a difference of timestamp in time in Ubiquitous environments as we use the Diffie-Hellman method that OTP was applied to when it deliver a key between nodes, and can detect a malicious node at these papers. Existing methods attempted the malicious node detection in the ways that used correct synchronization or directed antenna in time. We propose an intermediate malicious node detection way at these papers without an directed antenna addition or the Trusted Third Party (TTP) as we apply the OTP which used timestamp to a Diffie-Hellman method, and we verify safety regarding this. A way to propose at these papers is easily the way how application is possible in Ubiquitous environment.

• Journal of Advanced Navigation Technology
• /
• v.15 no.1
• /
• pp.54-60
• /
• 2011

The development of wireless sensor networks (WSN) can be motivated by several types of applications. However, these applications demand an energy-efficient WSN that can prolong the network lifetime and can provide high throughput, low latency and delay. Designing wireless sensor networks with the capability of prolonging network lifetime catch the attention of many researchers in wireless system and network field. Contrasts with Mobile Ad Hoc Network system, Wireless Sensor Networks designs focused more on survivability of each node in the network instead of maximizing data throughput or minimizing end-to-end delay. In this paper, we will study part of data link layer in Open Systems Interconnection (OSI) model, called medium access control (MAC) layer. Since the MAC development of energy aware MAC Protocol for wireless sensor layer controls the physical radio part, it has a large impact on the overall energy consumption and the lifetime of a node. This paper proposes a analytical approach that tries to reduce idle energy consumption, and shows the increasement of network end-to-end arrival rate due to efficiency in energy consumption from time slot management.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.17 no.1
• /
• pp.167-172
• /
• 2017

Mobile nodes are used for prolonging the life-time of the entire wireless sensor networks and many studies that use drones to collected data have been actively conducted with the development of drone related technology. In case of associating a drone and tactical wireless sensor networks, real-time feature and efficiency are improved. The previous studies so focus on reducing drone's flight distance that the energy consumption of sensor nodes is unbalanced. This unbalanced energy consumption accelerates the network partition and increases drone's flight distance. In this paper, we proposed a new selection scheme considered drone's flight distance and nodes' life-time to solve this problem when rendezvous nodes that collect data from their cluster and directly communicate with a drone are selected.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.3
• /
• pp.733-739
• /
• 2011

Recently, a lots of research proposals and results on mobile sensor network are actively announced. The most of such works are based on general-purposed network simulators such as ns-2, mathlab, etc. But, It is not easy to model and simulate the detail activities of each sensor node, data deliveries between them, and its cost such as power consumption and resource utilization, so that the simulation results of those simulators show the limited aspects of overall networks features or performance metrics. In this paper proposed, power consumption of each node, performance, mobility, and location information in operation-level of the network that can simulate a wireless sensor network simulator platform. Because the network routing algorithm analysis of being developed in an existing becomes available, the proposed simulator can usability in the new network routing algorithm development.

• The KIPS Transactions:PartC
• /
• v.15C no.1
• /
• pp.31-36
• /
• 2008

The clock frequency difference of sensor nodes is one of main parameters in TOF estimation and affect to degrade ranging algorithms to estimate positions of mobile nodes in wireless sensor networks. The specification of IEEE802.15.4a describes asynchronous TWR and SDS-TWR insensitive to frequency difference without any additional network synchronization. But the TWR and SDS-TWR can not eliminate sufficiently the effect of frequency difference of node pair, packet processing delay and its difference. Especially use of low cost oscillator with wide range offset, sensor node with different hardware and software can make the positioning errors worse. We propose an estimation method of frequency differences, and apply the measured frequency differences to TWR and SDS-TWR. We evaluate the performance of the proposed algorithm with simulation, and make certain that the proposed method enhances the performance of existing algorithms with positioning errors less than 25 cm.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.12
• /
• pp.4856-4871
• /
• 2015

Backpressure based scheduling has been considered as a promising technique for improving the throughput of a wide range of communication networks. However, this scheduling technique has not been well studied for heterogeneous wireless networks. In this paper, we propose a virtual-queue based backpressure scheduling (VQB) algorithm for heterogeneous multi-hop wireless networks. The VQB algorithm introduces a simple virtual queue for each flow at a node for backpressure scheduling, whose length depends on the cache size of the node. When calculating flow weights and making scheduling decisions, the length of a virtual queue is used instead of the length of a real queue. We theoretically prove that VQB is throughput-optimal. Simulation results show that the VQB algorithm significantly outperforms a classical backpressure scheduling algorithm in heterogeneous multi-hop wireless networks in terms of the packet delivery ratio, packet delivery time, and average sum of the queue lengths of all nodes per timeslot.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.9
• /
• pp.2243-2250
• /
• 2014

In wireless sensor networks(WSNs), geographical routing algorithms can enhance the network capacity. However, in real WSNs, it is difficult for each node to know its physical location accurately. Especially, indoor environments contain various obstacles such as concrete wall, furniture which cause non-line-of-sight(NLOS) conditions. To solve the problem, we propose location error compensation algorithm by using two difference topology constructions. First topology is based on mobile node's location which is obtained from anchor nodes. Second topology is based on mutual distance from neighbor nodes. The proposed algorithm efficiently detects and corrects the location errors and significantly enhances the network performance of geographic routing in the presence of location errors.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.7
• /
• pp.1314-1320
• /
• 2008

Recently, LBS(Location Based Service) which provides useful service based on the location of objects or human has drawn the attention of the research community. To provide LBS, many researchers have proposed many localization systems such as Cricket or Ubisense, however, these systems have the limit that it is very hard to perform the complicated computation on these systems because these systems consist of sensor nodes which have very limited computing power. In the paper, we propose a new localization system with the gateway node which has very high computing power and resource which is suitable for the complicated computation needed for localization.