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. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Jang, K. W., & Kim, B. S. (2006). A balanced deployment algorithm for mobile sensor networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3981 LNCS, pp. 671–680). Springer Verlag. https://doi.org/10.1007/11751588_70
Mendeley helps you to discover research relevant for your work.