Academic Journals Database
Disseminating quality controlled scientific knowledge

Optimal Deployment with Self-Healing Movement Algo-rithm for Particular Region in Wireless Sensor Network

ADD TO MY LIST
 
Author(s): Fan ZHU | Hongli LIU | Shugang LIU | Jie ZHAN

Journal: Wireless Sensor Network
ISSN 1945-3078

Volume: 01;
Issue: 03;
Start page: 212;
Date: 2009;
Original page

Keywords: Optimal Deployment | Self-Healing Movement | Particular Region | Euclidean Minimum Spanning Tree (EMST) | Improved Virtual Force Algorithm (IVFA)

ABSTRACT
Optimizing deployment of sensors with self-healing ability is an efficient way to solve the problems of cov-erage, connectivity and the dead nodes in WSNs. This work discusses the particular relationship between the monitoring range and the communication range, and proposes an optimal deployment with self-healing movement algorithm for closed or semi-closed area with irregular shape, which can not only satisfy both coverage and connectivity by using as few nodes as possible, but also compensate the failure of nodes by mobility in WSNs. We compute the maximum efficient range of several neighbor sensors based on the dif-ferent relationships between monitoring range and communication range with consideration of the complex boundary or obstacles in the region, and combine it with the Euclidean Minimum Spanning Tree (EMST) algorithm to ensure the coverage and communication of Region of Interest (ROI). Besides, we calculate the location of dead nodes by Geometry Algorithm, and move the higher priority nodes to replace them by an-other Improved Virtual Force Algorithm (IVFA). Eventually, simulation results based-on MATLAB are presented, which do show that this optimal deployment with self-healing movement algorithm can ensure the coverage and communication of an entire region by requiring the least number of nodes and effectively compensate the loss of the networks.
Why do you need a reservation system?      Affiliate Program