Marbukh, V.
, Sayrafian, K.
, Mahboubi, H.
, Moezzi, K.
and Aghdam, A.
(2009),
Self-Deployment Algorithms for Coverage Problem in a Network of Mobile Sensors with Unidentical Sensing Range, IEEE Globecom 2010, Miami, FL
(Accessed December 11, 2024)
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
Secure .gov websites use HTTPS
A lock (
) or https:// means you’ve safely connected to the .gov website. Share sensitive information only on official, secure websites.
Self-Deployment Algorithms for Coverage Problem in a Network of Mobile Sensors with Unidentical Sensing Range
Published
Author(s)
, , Hamid Mahboubi, Kaveh Moezzi, Amir G. Aghdam
Abstract
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 diagram (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.Proceedings Title
IEEE Globecom 2010
Conference Dates
December 6-10, 2010
Conference Location
Miami, FL
Pub Type
Conferences
Keywords
coverage, mobile sensor network, self-deployment
Citation
Issues
If you have any questions about this publication or are having problems accessing it, please contact reflib@nist.gov.
Created December 6, 2009, Updated February 19, 2017