Mobility

Scheduling Algorithms for Tree-Based Data Collection in Wireless Sensor Networks

Free registration required

Executive Summary

Data collection is a fundamental operation in Wireless Sensor Networks (WSN) where sensor nodes measure attributes about a phenomenon of interest and transmit their readings to a common base station. In this chapter, the author's survey contention-free Time Division Multiple Access (TDMA) based scheduling protocols for such data collection applications over tree-based routing topologies. They classify the algorithms according to their common design objectives, identifying the following four as the most fundamental and most studied with respect to data collection in WSNs: minimizing schedule length, minimizing latency, minimizing energy consumption, and maximizing fairness.

  • Format: PDF
  • Size: 286.3 KB