Paper Title:
Mobile Wireless Sensor Networks K-Covering Algorithm
  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].

  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, B. Xiao, J. L. Cheng, "Mobile Wireless Sensor Networks K-Covering Algorithm", Advanced Materials Research, Vol. 216, pp. 617-620, 2011
Online since
March 2011
Export
Price
$32.00
Share

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

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

Authors: Rui Ren
Chapter 10: Intelligence Algorithm, Optimization Algorithm and their Applications
Abstract:Wireless sensor network is added on traditional GPS to realize double location in this paper. The widely used distributed distance measure...
1561
Authors: Jiun Huei Ho, Hong Chi Shih, Bin Yih Liao, Jeng Shyang Pan
Chapter 7: Sensors, Mechatronics and Robotics
Abstract:In this paper, a grade diffusion algorithm is proposed to solve the sensor node’s transmission problem and the sensor node’s loading problem...
2064
Authors: Xia Ling Zeng
Chapter 10: Computer Networks, Communication Technology and E-Commerce
Abstract:For sparse overlay network built by static sensor nodes, this paper proposes the introduction of heterogeneous mobile sensor nodes, and...
1119