Tight analysis of shortest path convergecast in wireless sensor networks
CATS '11 Proceedings of the Seventeenth Computing: The Australasian Theory Symposium - Volume 119
Tight analysis of shortest path convergecast in wireless sensor networks
CATS 2011 Proceedings of the Seventeenth Computing on The Australasian Theory Symposium - Volume 119
| Hi-index | 0.00 |
base station to collect all the data generated by sensor nodes. As a consequence many-to-one communication pattern, referred to as convergecast, is prevalent in sensor networks. In this paper, we address the challenge of fast and reliable convergecast on top of the collision-prone CSMA MAC layer. More specifically, we extend previous work by considering the following two situations: (1) the length of the packets generated by nodes is much smaller than the maximum length of a data frame that can be transmitted in one time slot and (2) not every node in the network has data to transmit and for those that have, may have lots of data that require more than one packet. The first situation leads to the possibility of improvement by data piggybacking/aggregation; the second scenario arises in networks where nodes locally store the data and serves query request on-demand. We present distributed minimal time scheduling algorithms for both the cases. Simulation results have shown significant performance improvements of our new approaches over existing solutions.