Name
Title | ||
|---|---|---|
On-Demand Node Reclamation and Replacement for Guaranteed Area Coverage in Long-Lived Sensor Networks |
Abstract | ||
|---|---|---|
To achieve required sensing coverage for a very long period of time is an important and challenging problem in sensor network design. Recently, Tong et al. have proposed a node replacement and reclamation (NRR) strategy, and designed an adaptive rendezvous-based two-tier scheduling (ARTS) scheme. However, the ARTS scheme only considers point coverage but not area coverage, which is required in many applications. To address this limitation, we propose in this paper a new implementing scheme for the NRR strategy based on a novel staircase-based scheduling model. Extensive simulations have been conducted to verify that the proposed scheme is effective and efficient. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1007/978-3-642-10625-5_10 | Lecture Notes of the Institute for Computer Sciences, Social Informatics, and Telecommunications Engineering |
Keywords | Field | DocType |
Sensor Networks,Reclamation and Replacement,Duty-cycle Scheduling | On demand,Scheduling (computing),Computer science,Computer network,Land reclamation,Rendezvous,Wireless sensor network,Area coverage | Conference |
Volume | ISSN | Citations |
22 | 1867-8211 | 11 |
PageRank | References | Authors |
0.99 | 17 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Bin Tong | 1 | 129 | 8.13 |
| Zi Li | 2 | 355 | 19.59 |
| Guiling Wang | 3 | 573 | 34.93 |
| Wensheng Zhang | 4 | 1415 | 80.30 |