Estimating coverage holes and enhancing coverage in mixed sensor networks

Area coverage is one of the most fundamental problems in ad hoc wireless sensor networks because it directly relates to optimization of resources in a sensing field. Maximizing the coverage area while maintaining a lower cost of deployment has always been a challenge, especially when the monitoring...

Full description

Saved in:
Bibliographic Details
Main Author: Ghosh, A.
Format: Conference Proceeding
Language:English
Subjects:
Application software
Applied sciences
Batteries
Collaboration
Computer science
control theory
systems
Computer systems and distributed systems. User interface
Costs
Exact sciences and technology
Intelligent networks
Intelligent sensors
Laboratories
Mechanical sensors
Signal processing algorithms
Software
Wireless sensor networks
Citations: Items that cite this one
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Area coverage is one of the most fundamental problems in ad hoc wireless sensor networks because it directly relates to optimization of resources in a sensing field. Maximizing the coverage area while maintaining a lower cost of deployment has always been a challenge, especially when the monitoring region is unknown and possibly hazardous. In this paper, we present a method to deterministically estimate the exact amount of coverage holes under random deployment using Voronoi diagrams and use the static nodes to collaborate and estimate the number of additional mobile nodes needed to be deployed and relocated to optimal positions to maximize coverage. We follow a two-step deployment process in a mixed sensor network and we argue by simulation and analysis that our collaborative coverage enhancing algorithm (COVEN) can achieve a tradeoff between the cost of deployment and percentage of area covered.
ISSN:0742-1303
DOI:10.1109/LCN.2004.53