1st International ICST Workshop on Advances in Sensor Networks

Research Article

Efficient Scheduling for Sensor Networks

  • @INPROCEEDINGS{10.1109/MOBIQW.2006.361783,
        author={Andreea Berfield and Daniel  Mosse},
        title={Efficient Scheduling for Sensor Networks},
        proceedings={1st International ICST Workshop on Advances in Sensor Networks},
  • Andreea Berfield
    Daniel Mosse
    Year: 2007
    Efficient Scheduling for Sensor Networks
    DOI: 10.1109/MOBIQW.2006.361783
Andreea Berfield1, Daniel Mosse1
  • 1: Dept. of Comput. Sci., Pittsburgh Univ., PA


Sensor networks opened new opportunities to monitor the environment In order to retrieve the desired data, sensors are usually organized into a hierarchy and synchronize when transmitting the data towards the base station. Many scheduling schemes have been proposed with the goal of allowing sensors to sleep as much as possible and ultimately save energy. In this paper, we propose two new scheduling algorithms that assign predefined slots to each sensor. These algorithms are distributed, need very little global information and do not need knowledge about the location of sensors or the network topology. As others, we also assume that loose clock synchronization is available. The experimental results confirm our expectations. They show a significant reduction in the average time awake per node of at least three times compared to more traditional routing protocols like TAG