Download now Free registration required
The authors investigate the tradeoff between two mutually conflicting performance objectives - throughput and delay - for fast, periodic data collection in tree-based sensor networks arbitrarily deployed in 2-D. Two primary factors that affect the data collection rate (throughput) and timeliness (delay) are: efficiency of the link scheduling protocol, and structure of the routing tree in terms of its node degrees and radius. In this paper, they utilize multiple frequency channels and design an efficient link scheduling protocol that gives a constant factor approximation on the optimal throughput in delivering aggregated data from all the nodes to the sink.
- Format: PDF
- Size: 1615.1 KB