• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.5
• /
• pp.2181-2202
• /
• 2016

In Wireless Sensor Networks (WSNs) and even in the Internet of Things (IoT) ecosystem, the reconfiguration of sensor variables is an important problem when the role of a system (or application) program's sensor nodes needs to be adjusted in a particular situation. For example, the outdoor temperature in a volcanic zone, which is usually updated in a system every 10 s, should be updated every 1 s during an emergency situation. To solve this problem, this paper proposes a novel approach based on changing only a set of sensor variables in a part of a program, rather than modifying the entire program, in order to reduce both network congestion and the sensor nodes' battery consumption. To validate our approach, we demonstrate an implementation of a proof-of-concept prototype system and also present results of comparative studies showing the performance and effectiveness of our proposed method.

• Journal of Institute of Control, Robotics and Systems
• /
• v.22 no.11
• /
• pp.984-990
• /
• 2016

In wireless mesh sensor networks (WMSNs), sensor nodes are connected in the form of a mesh topology and transfer sensor data by multi-hop routing. A data aggregation method for WMSNs is required to minimize the number of routing hops and the energy consumption of each node with limited battery power. This paper presents a shortest path data aggregation method for WMSNs. The proposed method utilizes a simple hash function based on shuffled row major indexing for addressing sensor nodes. This allows sensor data to be aggregated without complex routing tables and calculation for deciding the next hop. The proposed data aggregation algorithms work in a fractal fashion with different mesh sizes. The method repeatedly performs gathering and moves sensor data to sink nodes in higher-level clusters. The proposed method was implemented and simulations were performed to confirm the accuracy of the proposed algorithms.

• The Journal of the Convergence on Culture Technology
• /
• v.4 no.4
• /
• pp.367-372
• /
• 2018

This paper proposed an algorithm that detects boundary nodes effectively in wireless sensor network. A boundary node is a sensor that lies on the border of network holes or the outer boundary of wireless sensor network. Proposed algorithm detects boundary nodes using only the position information of sensors. In addition, to improve detect performance, sensor computes the overlap area of nearest sensor first. Simulation is performed to validate the process of the proposed algorithm. In Simulation, several obstacles are placed and varying number of sensors in the range of 500~1500 are deployed in the area in order to reflect real world. The simulation results shows that proposed algorithm detects boundary nodes effectively that are located on the border of holes and the outer boundary of wireless sensor network.

• Journal of Korea Multimedia Society
• /
• v.9 no.2
• /
• pp.172-188
• /
• 2006

Sensor localization is one of the fundamental problems in wireless sensor networks. Previous localization algorithms can be classified into two categories, the GGB (Global Geometry-Based) approaches and the LGB (Local Geometry-Based). In the GGB approaches, there are a fixed set of reference nodes of which the coordinates are pre-determined. Other nodes determine their positions based on the distances from the fixed reference nodes. In the LGB approaches, meanwhile, the reference node set is not fixed, but grows up dynamically. Most GGB algorithms assume that the nodes are deployed in a convex shape area. They fail if either nodes are in a concave shape area or there are obstacles that block the communications between nodes. Meanwhile, the LGB approach is vulnerable to the errors in the distance estimations. In this paper, we propose new localization algorithms to cope with those two limits. The key technique employed in our algorithms is to determine, in a fully distributed fashion, if a node is in the line-of-sight from another. Based on the technique, we present two localization algorithms, one for anchor-based, another for anchor-free localization, and compare them with the previous algorithms.

• Journal of the Korea Society of Computer and Information
• /
• v.10 no.5 s.37
• /
• pp.209-216
• /
• 2005

In wireless sensor networks, an estimation method is proposed for distances between nodes within two hops. The method uses only proximity information of nodes without physiccal distance measurements. It drastically improves the performance of localization algorithms based on Proximity information. In addition, it is the first method that estimates distances between nodes exactly in two hops. The distances are estimated from the number of common neighbors under an assumption that the number of common neighbors is proportional to the intersection of two unit disks centered at the two nodes. Simulation analysis shows that the estimation error is roughly from 10 to 20 percent of real distances. Meanwhile, the number of messages required by a distributed algorithm realizing this method is only two times the number of nodes.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2015.05a
• /
• pp.116-119
• /
• 2015

In this paper we propose an algorithm for environment monitoring using multiple mobile sensor (MS) nodes. Our focus is on maximizing sensing coverage of a group of MS nodes for monitoring a phenomenon in an unknown and open area over time. In the proposed algorithm, MS nodes are iteratively relocated to new positions at which a higher sensing coverage can be obtained. We formulated an integer linear programming (ILP) optimization problem to find the optimal positions for MS nodes with the objective of coverage maximization. The performance evaluation was performed to confirm that the proposed algorithm can enable MS nodes to relocate to high interest positions, and obtain a maximum sensing coverage.

• Journal of Communications and Networks
• /
• v.12 no.3
• /
• pp.231-239
• /
• 2010

In cluster-based wireless sensor networks, the energy could be saved when the nodes that have data to transmit participate in cooperative multiple-input multiple-output (MIMO). In this paper, by making the idle nodes that have no data to transmit participate in the cooperative MIMO, it is found that much more energy could be saved. The number of the idle nodes that participate in the cooperative MIMO is optimized to minimize the total energy consumption. It is also found that the optimal number of all the nodes participating in cooperative communication does not vary with the number of nodes that have data to transmit. The proposition is proved mathematically. The influence of long-haul distance and modulation constellation size on the total energy consumption is investigated. A cooperative MIMO scheme with help-node participation is proposed and the simulation results show that the proposed scheme achieves significant energy saving.

• The KIPS Transactions:PartC
• /
• v.12C no.4 s.100
• /
• pp.525-534
• /
• 2005

We present several distributed algorithms for localizing nodes of a wireless sensor network. Our algorithms determine locations of nodes based on the connectivity between nodes. The basic idea behind our algorithms is to estimate distances between nearby nodes by counting their common neighbors. We analyze the performance of our algorithms experimentally. The results of experiments show that our algorithms achieve performance improvements upon the existing algorithms

• Journal of information and communication convergence engineering
• /
• v.10 no.4
• /
• pp.365-371
• /
• 2012

In recent years, researchers have been attracted to clustering methods to improve communication and data transmission in a network. Compared with traditional wireless networks, wireless sensor networks are energy constrained and have lower data rates. The concept of implementing a clustering algorithm in an existing project on gateway relocation is being explored here. Low energy adaptive clustering hierarchy (LEACH) is applied to an existing study on relocating a gateway. The study is further improved by moving the gateway to a specific cluster based on the number or significance of the events detected. The protocol is improved so that each cluster head can communicate with a mobile gateway. The cluster heads are the only nodes that can communicate with the mobile gateway when it (the mobile gateway) is out of the cluster nodes' transmission range. Once the gateway is in range, the nodes will begin their transmission of real-time data. This alleviates the load of the nodes that would be located closest to the gateway if it were static.

• Journal of the Korea Society of Computer and Information
• /
• v.23 no.2
• /
• pp.35-43
• /
• 2018

In this paper, we propose a grid-based efficient routing protocol for a mobile sink in wireless sensor networks. In the proposed protocol, the network is partitioned into grids and each grid has a grid head. For the efficient routing to a mobile sink, the proposed protocol uses a mobile sink representative node to send the data to a mobile sink and grid heads are used as a mobile sink representative node. Furthermore, the proposed protocol uses nodes in the boundary of the center grid as position storage nodes. The position storage nodes store the position of a mobile sink representative node and provide source nodes with it for data delivery. With these features, the proposed protocol can reduce a lot of overhead to update the position information and improve the delay of data delivery to a mobile sink. The proposed protocol performs better than other protocols in terms of the delay and the energy consumption per node in the performance evaluation.