Name
Abstract | ||
|---|---|---|
Maintaining a long network lifetime with stringent energy constraints on tiny sensor nodes poses an extremely challenging task for wireless sensor networks. This paper provides a thorough analysis on a randomized algorithm that makes scheduling decisions without the help of geographic information. The analytical results precisely describe the relationship among achievable network coverage, energy saving, and node density. We also analyze the performance of the randomized algorithm with time asynchrony and propose a heuristic randomized scheduling scheme to improve the performance. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1007/11422778_77 | Networking |
Keywords | Field | DocType |
achievable network coverage,randomized algorithm,randomized coverage-preserving scheduling scheme,challenging task,energy saving,wireless sensor network,long network lifetime,heuristic randomized scheduling scheme,tiny sensor node,stringent energy constraint,analytical result | Sensor node,Key distribution in wireless sensor networks,Randomized algorithm,Wireless network,Heuristic,Fair-share scheduling,Computer science,Scheduling (computing),Computer network,Wireless sensor network,Distributed computing | Conference |
Volume | ISSN | ISBN |
3462 | 0302-9743 | 3-540-25809-4 |
Citations | PageRank | References |
8 | 0.77 | 8 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Chong Liu | 1 | 468 | 21.25 |
| Kui Wu | 2 | 1024 | 82.25 |
| Valerie King | 3 | 1276 | 99.39 |