Fast Data Collection in Tree-Based Wireless Sensor Networks

—We investigate the following fundamental question—how fast can information be collected from a wireless sensor network organized as tree? To address this, we explore and evaluate a number of different techniques using realistic simulation models under the many-to-one communication paradigm known as convergecast. We 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, 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. We also evaluate the performance of various channel assignment methods and find empirically that for m...

• Type: Journal
• Year: 2012
• Where: TMC
• Authors: Özlem Durmaz Incel, Amitabha Ghosh, Bhaskar Krishnamachari, Krishna Chintalapudi
• Keywords: Communication Paradigm, Logical Reasoning, Minimal Spanning Trees, TMC 2012, Wireless Sensor Network