A Realistic And Efficient Information Gathering In Tree Based Wireless Sensor Networks

Main Article Content

M. Chilakarao
D. Ravi Babu, R. Shiva Shankar


How fast can information are collected from a wireless sensor network organized as tree? We evaluate a number of different techniques using realistic simulation models under the many-to-one communication paradigm known as converge cast. Consider time scheduling on a single frequency channel with the aim of minimizing the number of time slots required to complete a converge cast. Next, we 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. We give lower bounds on the schedule length when interference is completely eliminated, and propose algorithms that achieve these bounds. Then, the data collection rate no longer remains limited by interference but by the topology of the routing tree. we construct degree-constrained spanning trees and capacitated minimal spanning trees, and show significant improvement in scheduling performance over different deployment densities.


Download data is not yet available.

Article Details