Distributed minimal time convergecast scheduling for small or sparse data sources

• RTSS07

Many applications of sensor networks require the 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, many 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.

• go to publisher site »

read more

• download PDF (364K)

citation

Zhang, Y. ; Gandham, S.; Huang, Q. Distributed minimal time convergecast scheduling for small or sparse data sources. 28th IEEE Real Time Systems Symposium (RTSS 2007); 2007 December 3-6; Tucson, AZ. Los Alamitos, CA: IEEE; 2007; 301-310.