Scott H Moeller, Avinash Sridharan, Bhaskar Krishnamachari, and Omprakash Gnawali, Routing Without Routes: The Backpressure Collection Protocol, Proc. of ACM/IEEE International Conference on Information Processing in Sensor Networks (IPSN), April 2010.


Current data collection protocols for wireless sensor networks are mostly based on quasi-static minimum-cost routing trees. We consider an alternative, highly-agile approach called backpressure routing, in which routing and forwarding decisions are made on a per-packet basis. Although there is a considerable theoretical literature on backpressure routing, it has not been implemented on practical systems to date due to concerns about packet looping, the e ect of link losses, large packet delays, and scalability. Addressing these concerns, we present the Backpressure Collection Protocol (BCP) for sensor networks, the rst ever implementation of dynamic backpressure routing in wireless networks. In particular, we demonstrate for the rst time that replacing the traditional FIFO queue service in backpressure routing with LIFO queues reduces the average end-to-end packet delays for delivered packets drastically (75% under high load, 98% under low load). Further, we improve backpressure scalability by introducing a new concept of floating queues into the backpressure framework. Under static network settings, BCP shows a more than 60% improvement in max-min rate over the state of the art Collection Tree Protocol (CTP). We also empirically demonstrate the superior delivery performance of BCP in highly dynamic network settings, including conditions of extreme external interference and highly mobile sinks.


 author = {Scott H Moeller and Avinash Sridharan and Bhaskar Krishnamachari and Omprakash Gnawali},
 title = {Routing Without Routes: The Backpressure Collection Protocol},
 booktitle = {Proc. of ACM/IEEE International Conference on Information Processing in Sensor Networks (IPSN)},
 year = {2010},
 location = {Stockholm, Sweden},
 publisher = {ACM},