Abstract
Wireless Sensor Networks (WSNs) has many important issues. Famous issues are self-deployment and Energy problem. Many self-deployment schemes are based on Voronoi algorithm. But Voronoi algorithm has two problems. First problem is hard to search all the area. Second problem is tiny movement in the last part. Tiny movements sharply increase energy consumption. We proposed a scheme with two qualities: full coverage and few numbers of rounds. The simulation results show that our scheme can have a fast, efficient, and full coverage of the area.
Original language | English |
---|---|
Pages (from-to) | 8549-8554 |
Number of pages | 6 |
Journal | Information (Japan) |
Volume | 16 |
Issue number | 12 A |
Publication status | Published - 2013 Dec |
Keywords
- Coverage speed
- Energy Consumption
- Grid
- Maximum moving round
- Sensor
ASJC Scopus subject areas
- Information Systems