A Survey and Classification of Distributed Scheduling Algorithms for Sensor Networks

Authors:
Shubham Jain;Sanjay Srivastava
Affiliations:
-;-
Venue:
SENSORCOMM '07 Proceedings of the 2007 International Conference on Sensor Technologies and Applications
Year:
2007

Citing 0
Cited 2

A distributed and energy-efficient framework for Neyman-Pearson detection of fluctuating signals in large-scale sensor networks

IEEE Journal on Selected Areas in Communications - Special issue on simple wireless sensor networking solutions
Formal analysis of a scheduling algorithm for wireless sensor networks

ICFEM'11 Proceedings of the 13th international conference on Formal methods and software engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

Wireless sensor networks is an emerging field which has tremendous contributions in the area of scheduling. We have selected 8 algorithms on distributed scheduling in sen- sor networks. A summary of all the algorithms is given in the paper with a comparative discussion and classification of them. A person who is new to the area of distributed scheduling can start with the paper and then go into details by referring the cited papers. A variety of algorithms exist for distributed scheduling in sensor networks and are fairly comparable. One can find out which algorithm is suitable to his/her application on the basis of his/her application re- quirements.