loading...
Coverage-Driven Self-Deployment for Cluster Based Mobile Sensor Networks
Seoul, Korea September 20-September 22
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/CIT.2006.66Sixth IEEE International Conference o ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Xiaoling Wu, Kyung Hee University, Korea
Lei Shu, Kyung Hee University, Korea
Min Meng, Kyung Hee University, Korea
Jinsung Cho, Kyung Hee University, Korea
Sungyoung Lee, Kyung Hee University, Korea
Coverage, energy efficiency and connectivity are important metrics for sensor network deployment. In this paper, we propose a relay shift based approach to eliminate coverage hole due to the initial random dropping or the existence of faulty sensors. The sensors in our model are assumed to have only limited mobility. Firstly, the optimal number of clusters are determined by energy function and the optimal cluster head positions are determined by Fuzzy C-mean (FCM). We use proposed Relay Shift Based Algorithm (A*-RSBA) for movement assisted sensor deployment. A* algorithm is applied to find a shortest path from a redundant sensor node to a virtual node point in an uncovered area, and each sensor moves along this path by relay shift based on the principle that evenly distributed sensors can provide better coverage. Simulation results show that our approach can improve coverage within a short time and limited movement distance as well as ensuring connectivity and energy efficiency.
Citation:
Xiaoling Wu, Lei Shu, Min Meng, Jinsung Cho, Sungyoung Lee, "Coverage-Driven Self-Deployment for Cluster Based Mobile Sensor Networks," cit, pp.226, Sixth IEEE International Conference on Computer and Information Technology (CIT'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.