Distributed Deployment Algorithms for Improved Coverage in Mobile Sensor Networks

Published

September 28, 2011

Author(s)

Vladimir V. Marbukh, Kamran Sayrafian, Hamid Mahboubi, Kaveh Moezzi, Amir G. Aghdam

Abstract

In this paper, various sensor deployment strategies are studied for effective coverage in wireless sensor networks. In the proposed algorithms, each sensor discovers the coverage holes within its Voronoi polygons, and then moves in a proper direction to minimize them. Novel edge-based and vertex-based strategies are proposed for efficient sensor deployment, and their features are compared with existing techniques. The algorithms proposed in this paper consider the distances of each sensor and the points inside its corresponding Voronoi polygon from the edges or vertices of the polygon. It is shown that the methods introduced in this work outperform existing strategies. Simulations confirm the effectiveness of the proposed deployment algorithms, and their superiority over the techniques reported in the literature.

Proceedings Title

2011 IEEE Multi-conference on Systems and Control

Conference Dates

September 28-30, 2011

Conference Location

Denver, CO

Pub Type

Conferences

Keywords

mobile sensor network, deployment, coverage

Citation

Marbukh, V. , Sayrafian, K. , Mahboubi, H. , Moezzi, K. and Aghdam, A. (2011), Distributed Deployment Algorithms for Improved Coverage in Mobile Sensor Networks, 2011 IEEE Multi-conference on Systems and Control, Denver, CO (Accessed October 13, 2025)