Self-Deployment Algorithms for Coverage Problem in a Network of Mobile Sensors with Unidentical Sensing Ranges

In this paper, efficient sensor deployment algorithms are proposed to improve the coverage area in the target field. The proposed algorithms calculate the position of the sensors iteratively, based on the existing coverage holes in the target field. The multiplicatively weighted Voronoi (MW-Voronoi)...

Full description

Saved in:
Bibliographic Details
Main Authors: Mahboubi, H, Moezzi, K, Aghdam, A G, Sayrafian-Pour, K, Marbukh, V
Format: Conference Proceeding
Language:English
Subjects:
Bismuth
IEEE Communications Society
Mobile communication
Peer to peer computing
Sensor phenomena and characterization
Silicon
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper, efficient sensor deployment algorithms are proposed to improve the coverage area in the target field. The proposed algorithms calculate the position of the sensors iteratively, based on the existing coverage holes in the target field. The multiplicatively weighted Voronoi (MW-Voronoi) diagram is used to discover the coverage holes corresponding to different sensors with different sensing ranges. Under the proposed procedures, the sensors move in such a way that the coverage holes in the target field are reduced. Simulation results are provided to demonstrate the effectiveness of the deployment schemes proposed in this paper.
ISSN:1930-529X
2576-764X
DOI:10.1109/GLOCOM.2010.5683204