Distributed K -coverage self-location estimation scheme based on Voronoi diagram
Authors:
- 22 January 2010
- journal article
- Published by Institution of Engineering and Technology (IET) in IET Communications
- Vol. 4 (2) , 167-177
Abstract
The success of many wireless sensor network (WSN) applications, such as moving target tracking or environment monitoring, is dependent upon achieving ‘k-coverage’ of the sensed area, that is every point in the surveillance area is monitored by at least k sensors. This study presents a novel distributed self-location estimation scheme based on a Voronoi diagram to achieve k-coverage in a WSN with mobile nodes. The simulation results show that the proposed scheme effectively to perform k-coverage within the sensing field and fast convergent to fulfil more than 88% k-coverage ratio following three movements for the minimal required sensor deployment.Keywords
This publication has 11 references indexed in Scilit:
- Fault-tolerant decision fusion via collaborative sensor fault detection in wireless sensor networksIEEE Transactions on Wireless Communications, 2008
- Randomized k-Coverage Algorithms For Dense Sensor Networks2007
- Maximal Lifetime Scheduling for Sensor Surveillance Systems with K Sensors to One TargetIEEE Transactions on Parallel and Distributed Systems, 2006
- Coverage by randomly deployed wireless sensor networksIEEE Transactions on Information Theory, 2006
- Random coverage with guaranteed connectivity: joint scheduling for wireless sensor networksIEEE Transactions on Parallel and Distributed Systems, 2006
- Movement-assisted sensor deploymentIEEE Transactions on Mobile Computing, 2006
- On deriving the upper bound of α-lifetime for large sensor networks2004
- Coverage Control for Mobile Sensing NetworksIEEE Transactions on Robotics and Automation, 2004
- A survey on sensor networksIEEE Communications Magazine, 2002
- VORONOI DIAGRAMS and DELAUNAY TRIANGULATIONS1992