Randomized coverage-preserving scheduling schemes for wireless sensor networks

Authors:
Chong Liu;Kui Wu;Valerie King
Affiliations:
Dept. of Computer Science, University of Victoria, Victoria, BC, Canada;Dept. of Computer Science, University of Victoria, Victoria, BC, Canada;Dept. of Computer Science, University of Victoria, Victoria, BC, Canada
Venue:
NETWORKING'05 Proceedings of the 4th IFIP-TC6 international conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communication Systems
Year:
2005

Citing 7
Cited 3

A coverage-preserving node scheduling scheme for large wireless sensor networks

WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Infrastructure tradeoffs for sensor networks

WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Calibration as parameter estimation in sensor networks

WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Smart Dust: Communicating with a Cubic-Millimeter Computer

Computer
PEAS: A Robust Energy Conserving Protocol for Long-lived Sensor Networks

ICNP '02 Proceedings of the 10th IEEE International Conference on Network Protocols
Set k-cover algorithms for energy efficient monitoring in wireless sensor networks

Proceedings of the 3rd international symposium on Information processing in sensor networks
Network coverage using low duty-cycled sensors: random & coordinated sleep algorithms

Proceedings of the 3rd international symposium on Information processing in sensor networks

Random Coverage with Guaranteed Connectivity: Joint Scheduling for Wireless Sensor Networks

IEEE Transactions on Parallel and Distributed Systems
On lightweight node scheduling scheme for wireless sensor networks

IWDC'05 Proceedings of the 7th international conference on Distributed Computing
Traffic-Aware Density-Based Sleep Scheduling and Energy Modeling for Two Dimensional Gaussian Distributed Wireless Sensor Network

Wireless Personal Communications: An International Journal

Quantified Score

Hi-index	0.00

Visualization

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.