Mobile Wireless Sensor Networks K-Covering Algorithm

Abstract:

Article Preview

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

Info:

Periodical:

Edited by:

Yuhang Yang, Xilong Qu, Yiping Luo and Aimin Yang

Pages:

617-620

DOI:

10.4028/www.scientific.net/AMR.216.617

Citation:

X. L. Zhou et al., "Mobile Wireless Sensor Networks K-Covering Algorithm", Advanced Materials Research, Vol. 216, pp. 617-620, 2011

Online since:

March 2011

Export:

Price:

$35.00

In order to see related information, you need to Login.

In order to see related information, you need to Login.