A balanced deployment algorithm for mobile sensor networks

Authors:
Kil-Woong Jang;Byung-Soon Kim
Affiliations:
Dept. of Mathematical and Information Science, Korea Maritime University, Busan, Korea;Dept. of Computer Education, Andong National University, Andong, Korea
Venue:
ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part II
Year:
2006

Citing 4
Cited 0

An Incremental Self-Deployment Algorithm for Mobile Sensor Networks

Autonomous Robots
A Bidding Protocol for Deploying Mobile Sensors

ICNP '03 Proceedings of the 11th IEEE International Conference on Network Protocols
An application-specific protocol architecture for wireless microsensor networks

IEEE Transactions on Wireless Communications
A survey on sensor networks

IEEE Communications Magazine

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper describes a grid-based deployment algorithm to maximize the network coverage in mobile sensor networks. The algorithm divides target areas with scattered mobile sensors into some grids and selects a grid header in each grid. The grid header is responsible for collecting the information of nodes in the grid. If the number of nodes in the grid is less than the average number of nodes, the grid header requests the node movement to neighboring grids. After the node movement from the neighboring grids, if the number of nodes in the grid is below the average, it requests the node movement to the two-hop grids apart through the neighboring grids. After the node movement from the two-hop grids, the grid header performs to relocate its members in the grid. By performing three procedures, the algorithm is able to deploy uniformly the given nodes in the target area. This paper presents the operation of a balanced deployment algorithm and shows performance evaluation of the deployment algorithm.