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

We study the effect of routing topologies on maximizing the aggregated data collection rate and minimizing the maximum packet delay in TDMA-based sensor networks. We propose a bi-criteria formulation to the optimal routing tree construction problem, and show that a tree with bounded node degree and minimum radius can achieve the best trade-off between the data collection rate and packet delays.