Mobile Wireless Sensor Networks K-Covering Algorithm

Article Preview

Abstract:

In mobile wireless sensor networks, sensor nodes may due to their own moves, energy loss, physical damage, errors and failures or other factors, will result the case of coverage holes, and then lead to inefficient network coverage. This paper designed a new algorithm based on clustering approach for mobile wireless sensor network, can monitor the network in real-time and repairing coverage holes quickly. Simulation results show that, the algorithm used in mobile wireless sensor network not only can achieve the desired uniformity of coverage, but also increase the coverage area, and better performance than the Virtual force algorithm(VFA) [1].

You might also be interested in these eBooks

Info:

Periodical:

Pages:

617-620

Citation:

Online since:

March 2011

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2011 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Yi Zou and Krishnendu Chakrabarty: Sensor Deployment and Target Localization Based on Virtual Forces, IEEE INFOCOM (2003).

DOI: 10.1109/infcom.2003.1208965

Google Scholar

[2] Akyildiz I.F., Su W. and Sankarasubramaniam Y.: Wireless Sensor Networks: a Survey[J]. Computer Networks. 2002, 38.

DOI: 10.1016/s1389-1286(01)00302-4

Google Scholar

[4] 393-422.

Google Scholar

[3] Sriram Chellappan: On Deployment and Security in Mobile Wireless Sensor Networks: Algorithms Design, Vulnerability Assessment and Analysis, ISBN: 363918257X. VDM Verlag, July 19, (2009).

Google Scholar

[4] Jie Wu and Shuhui Yang: SMART: A Scan-Based Movement-Assisted Sensor Deployment Method in Wireless Sensor Networks, Proceedings INFOCOM (2005).

DOI: 10.1109/infcom.2005.1498518

Google Scholar