Bounded-Degree Minimum-Radius Spanning Trees for Fast Data Collection in Sensor Networks

Download Now Date Added: Feb 2010
Format: PDF

In sensor networks that require fast and timely collection of aggregated data to a common sink over a tree-based routing topology, the authors define aggregated sink throughput as the inverse of the total number of time slots required to schedule all the tree edges once per TDMA frame, and delay as the number of hops a packet traverses to reach the sink. Two primary factors that directly affect the sink throughput and packet delays are: efficiency of the link scheduling protocol, and structure of the routing tree. Typical sensor nodes can either transmit or receive a single packet at any given time slot due to their single half-duplex transceivers.