Distributed Deployment Algorithms for Efficient Coverage in a Network of Mobile Sensors With Nonidentical Sensing Capabilities

In this paper, efficient deployment algorithms are proposed for a mobile sensor network to improve the coverage area. The proposed algorithms find the target position of each sensor iteratively, based on the existing coverage holes in the network. The multiplicatively weighted Voronoi (MW-Voronoi) d...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on vehicular technology 2014-10, Vol.63 (8), p.3998-4016
Main Authors: Mahboubi, Hamid, Moezzi, Kaveh, Aghdam, Amir G., Sayrafian-Pour, Kamran
Format: Article
Language:English
Subjects:
Algorithms
Boundaries
Computer simulation
Detection
Mobile communication
Mobile computing
Networks
Optimization
Position sensing
Protocols
Sensors
Silicon
Wireless sensor networks
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper, efficient deployment algorithms are proposed for a mobile sensor network to improve the coverage area. The proposed algorithms find the target position of each sensor iteratively, based on the existing coverage holes in the network. The multiplicatively weighted Voronoi (MW-Voronoi) diagram is used to discover the coverage holes corresponding to different sensors with different sensing ranges. Three sensor deployment algorithms are provided, which tend to either move sensors out of densely packed areas or place them in proper positions with respect to the boundaries of the MW-Voronoi regions. Under the proposed procedures, the sensors move in such a way that the coverage holes in the target field are reduced. Simulations confirm the effectiveness of the deployment algorithms proposed in this paper.
ISSN:0018-9545
1939-9359
DOI:10.1109/TVT.2014.2302232