Fast Data Collection in Tree-Based Wireless Sensor Networks
The authors investigate the following fundamental question - how fast can information be collected from a wireless sensor network organized as tree? To address this, they explore and evaluate a number of different techniques using realistic simulation models under the many-to-one communication paradigm known as convergecast. They first consider time scheduling on a single frequency channel with the aim of minimizing the number of time slots required (schedule length) to complete a convergecast. Next, they combine scheduling with transmission power control to mitigate the effects of interference, and show that while power control helps in reducing the schedule length under a single frequency, scheduling transmissions using multiple frequencies is more efficient.