Fast Data Collection in Tree-Based Wireless Sensor Networks
Fast Data Collection in Tree-Based Wireless Sensor NetworksAIM :To improve the performance of various channel assignment methodswith fast convergecast in WSNAbstract: We explore and evaluate a number of different techniques using realistic simulationmodels under the many-to-one communication paradigm known as convergecast. We firstconsider time scheduling on a single frequency channel with the aim of minimizing the numberof time slots required (schedule length) to complete a convergecast. Next, we combinescheduling with transmission power control to mitigate the effects of interference, and show thatwhile power control helps in reducing the schedule length under a single frequency, schedulingtransmissions using multiple frequencies is more efficient. We give lower bounds on theschedule length when interference is completely eliminated, and propose algorithms that achievethese bounds. Then, the data collection rate no longer remains limited by interference but by thetopology of the routing tree. To this end, we construct degree-constrained spanning trees andcapacitated minimal spanning trees, and show significant improvement in schedulingperformance over different deployment densities.