• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.1
• /
• pp.126-148
• /
• 2015

Different from the existing works on coverage problems in wireless sensor networks (WSNs), this paper considers the exposure-path prevention problem by using the percolation theory in three dimensional (3D) WSNs, which can be implemented in intruder detecting applications. In this paper, to avoid the loose bounds of critical density, a bond percolation-based scheme is proposed to put the exposure-path problem into a 3D uniform lattice. Within this scheme, the tighter bonds of critical density for omnidirectional and directional sensor networks under random sensor deployment-a 3D Poisson process are derived. Extensive simulation results show that our scheme generates tighter bounds of critical density with no exposure path in 3D WSNs.

• Journal of Korea Multimedia Society
• /
• v.13 no.11
• /
• pp.1657-1666
• /
• 2010

Underwater wireless sensor networks (UWSN) need stable efficient data transmission methods because of environmental characteristics such as limited energy resource, limited communication bandwidth, variable propagation delay and so on. In this paper, we explain an enhanced hybrid transmission method that uses a hexagon tessellation with an ideal cell size in a two-dimensional underwater wireless sensor network model (2D) that consists of fixed position sensors on the bottom of the ocean. We also propose an energy efficient sensing and communication coverage method for effective data transmission in a three-dimensional underwater wireless sensor network model (3D) that equips anchored sensors on the bottom of the ocean. Our simulation results show that proposed methods are more energy efficient than the existing methods for each model.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.3 no.6
• /
• pp.597-611
• /
• 2009

With the advent of ubiquitous computing society, many advanced technologies have enabled wireless sensor networks which consist of small sensor nodes. However, the sensor nodes have limited computing resources such as small size memory, low battery life, short transmission range, and low computational capabilities. Thus, decreasing energy consumption is one of the most significant issues in wireless sensor networks. In addition, numerous applications for wireless sensor networks are recently spreading to various fields (health-care, surveillance, location tracking, unmanned monitoring, nuclear reactor control, crop harvesting control, u-city, building automation etc.). For many of them, supporting security functionalities is an indispensable feature. Especially in case wireless sensor networks should provide a sufficient variety of security functions, sensor nodes are required to have more powerful performance and more energy demanding features. In other words, simultaneously providing security features and saving energy faces a trade-off problem. This paper presents a novel energy-efficient security architecture in an IEEE 802.15.4-based wireless sensor network called the Hybrid Adaptive Security (HAS) framework in order to resolve the trade off issue between security and energy. Moreover, we present a performance analysis based on the experimental results and a real implementation model in order to verify the proposed approach.

• Journal of Communications and Networks
• /
• v.11 no.1
• /
• pp.57-71
• /
• 2009

Networking together hundreds or thousands of cheap sensor nodes allows users to accurately monitor a remote environment by intelligently combining the data from the individual nodes. As sensor nodes are typically battery operated, it is important to efficiently use the limited energy of the nodes to extend the lifetime of the wireless sensor network (WSN). One of the fundamental issues in WSNs is the coverage problem. In this paper, the border coverage problem in WSNs is rigorously analyzed. Most existing results related to the coverage problem in wireless sensor networks focused on planar networks; however, three dimensional (3D) modeling of the sensor network would reflect more accurately real-life situations. Unlike previous works in this area, we provide distributed algorithms that allow the selection and activation of an optimal border cover for both 2D and 3D regions of interest. We also provide self-healing algorithms as an optimization to our border coverage algorithms which allow the sensor network to adaptively reconfigure and repair itself in order to improve its own performance. Border coverage is crucial for optimizing sensor placement for intrusion detection and a number of other practical applications.

• The KIPS Transactions:PartD
• /
• v.13D no.3 s.106
• /
• pp.391-398
• /
• 2006

This paper verifies deployment algorithms in wireless sensor networks using SPIN, a widely used model checking tool. In this paper, two deployment algorithms, DSSA(Distributed Self Spreading Algorithm) and TBDA(Tree Based Deployment Algorithm), are verified to check their stability against oscillation as well as energy consumption that is an important factor in wireless sensor networks.

• Smart Media Journal
• /
• v.3 no.1
• /
• pp.28-32
• /
• 2014

It is practical nowadays to automate data recording in order to prevent loss and tampering of records. There are existing technologies that satisfy this needs and one of them is wireless sensor networks (WSN). Wireless body sensor networks (WBSN) are wireless networks and information-processing systems which are deployed to monitor medical condition of patients. In terms of performance, WBSNs are restricted by energy, and communication between nodes. In this paper, we focused in improving the performance of communication to achieve less energy consumption and to save power. The main idea of this paper is to prioritize nodes that exhibit a sudden change of vital signs that could put the patient at risk. Cluster head is the main focus of this study in order to be effective; its main role is to check the sent data of the patient that exceeds threshold then transfer to the sink node. The proposed scheme implemented added a time-based protocol to sleep/wakeup mechanism for the sensor nodes. We seek to achieve a low energy consumption and significant throughput in this study.

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

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

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.30 no.6
• /
• pp.975-980
• /
• 2020

To protect wireless sensor networks (WSNs), various key distribution and management schemes have been proposed. However, most of them conducted simulations and experiments for performance evaluation by considering only the two-dimensional (2D) environments. In this paper, we investigate the effect of real-world three-dimensional (3D) topographic features on the key pre-distribution schemes for WSNs. For this purpose, we analyze and compare the performance of three pairwise key pre-distribution schemes in 2D and 3D environments: full pairwise (FP), random pairwise (RP), and full and random pairwise (FRP) schemes. For the experiments, we employ a network simulator NS-3 and 3D graphic tools such as Blender and Unity. As a result, we confirm that there was a difference in the performance of each scheme according to the actual 3D terrain and that the location-based FRP that considers deployment errors, has the highest efficiency in many aspects.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.9C
• /
• pp.573-580
• /
• 2011

WSNs (Wireless Sensor Networks) are becoming more widely used in various fields, and improving localization performance is a crucial and essential issue for sensor network applications. In this paper, we propose a low-complexity localization mechanism for WSNs that operates in 3D (Three-Dimensional) space. The basic idea is to use aerial vehicles or flying objects that are deliberately equipped with the anchor nodes. These anchor nodes periodically broadcast beacon signals containing their current locations, and the unknown nodes receive these signals as soon as they enter the communication range of the anchors. We estimate the locations of the unknown nodes based on the proposed scheme that transforms the 3D problem into 2D computations to reduce the complexity of 3D localization. Simulated results show that our approach is an effective scheme for 3D self-positioning in WSNs.