skip to main content
10.1145/1791212.1791246acmconferencesArticle/Chapter ViewAbstractPublication PagescpsweekConference Proceedingsconference-collections
research-article

Routing without routes: the backpressure collection protocol

Published: 12 April 2010 Publication History

Abstract

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 effect of link losses, large packet delays, and scalability. Addressing these concerns, we present the Backpressure Collection Protocol (BCP) for sensor networks, the first ever implementation of dynamic backpressure routing in wireless networks. In particular, we demonstrate for the first 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.

References

[1]
Tutornet. http://enl.usc.edu/projects/tutornet/.
[2]
U. Akyol, M. Andrews, P. Gupta, and J. Hobby. Joint scheduling and congestion control in mobile ad-hoc networks. IEEE INFOCOM, Jan 2008.
[3]
M. Bathula, M. Ramezanali, I. Pradhan, N. Patel, J. Gotschall, and N. Sridhar. A sensor network system for measuring traffic in short-term construction work zones. DCOSS, Jan 2009.
[4]
S. Biswas and R. Morris. Exor: opportunistic multi-hop routing for wireless networks. ACM SIGCOMM, Jan 2005.
[5]
L. Bui, R. Srikant, and A. Stolyar. Novel architectures and algorithms for delay reduction in back-pressure scheduling and routing. ACM Infocom mini-conference, 2008.
[6]
J. Burke, D. Estrin, M. Hansen, and A. Parker. Participatory sensing. World Sensor Web Workshop, Jan 2006.
[7]
J. I. Choi, M. A. Kazandjieva, M. Jain, and P. Levis. The case for a network protocol isolation layer. Sensys, Oct 2009.
[8]
J. I. Choi, J. W. Lee, M. Wachs, and P. Levis. Opening the sensornet black box. Proceedings of the International Workshop on Wireless Sensornet Architecture (WWSNA), Mar 2007.
[9]
D. Couto, D. Aguayo, B. Chambers, and R. Morris. Performance of multihop wireless networks: Shortest path is not enough. ACM SIGCOMM, Jan 2003.
[10]
L. Filipponi, S. Santini, and A. Vitaletti. Data collection in wireless sensor networks for noise pollution monitoring. DCOSS, Jan 2008.
[11]
R. Fonseca, O. Gnawali, K. Jamieson, and P. Levis. Four-bit wireless link estimation. HotNets, Oct 2007.
[12]
D. Ganesan, R. Govindan, S. Shenker, and D. Estrin. Highly-resilient, energy-efficient multipath routing in wireless sensor networks. ACM SIGMOBILE, Jan 2001.
[13]
Y. Ganjali and N. McKeown. Routing in a highly dynamic topology. IEEE SECON, Jan 2005.
[14]
L. Georgiadis, M. Neely, M. Neely, and L. Tassiulas. Resource allocation and cross layer control in wireless networks. 2006.
[15]
O. Gnawali, R. Fonseca, K. Jamieson, D. Moss, and P. Levis. Collection tree protocol. ACM Sensys, Apr 2009.
[16]
L. Huang and M. J. Neely. Delay reduction via lagrange multipliers in stochastic network optimization. WiOpt, Apr 2009.
[17]
A. Jayasumana, N. Piratla, T. Banka, A. Bare, and R. Whitner. Improved packet reordering metrics. IETF RFC 5236.
[18]
L. Jiang and J. Walrand. A distributed csma algorithm for throughput and utility maximization in wireless networks. Proc. Allerton Conf. on Comm., Jan 2008.
[19]
S. Katti and H. Balakrishnan. Symbol-level network coding for wireless mesh networks. ACM SIGCOMM, 2008.
[20]
C. Li and M. Neely. Energy-optimal scheduling with dynamic channel acquisition in wireless downlinks. IEEE CDC, Jan 2007.
[21]
J. Liu, A. Stolyar, M. Chiang, and H. Poor. Queue back-pressure random access in multi-hop wireless networks: Optimality and stability. IEEE Trans on Information Theory, Jan 2008.
[22]
M. Neely. Order optimal delay for opportunistic scheduling in multi-user wireless uplinks and downlinks. IEEE/ACM TON, Jan 2008.
[23]
M. Neely and R. Urgaonkar. Opportunism, backpressure, and stochastic optimization with the wireless broadcast advantage. IEEE SSC, Jan 2008.
[24]
M. J. Neely. Dynamic power allocation and routing for satellite and wireless networks with time varying channels. PhD Thesis, Massachusetts Institute of Technolog, 2003.
[25]
M. J. Neely. Super-fast delay tradeoffs for utility optimal fair scheduling in wireless networks. IEEE JSAC, Aug 2006.
[26]
M. J. Neely. Intelligent packet dropping for optimal energy-delay tradeoffs in wireless downlinks. IEEE TAC, Feb 2009.
[27]
M. J. Neely, E. Modiano, and C.-P. Li. Fairness and optimal stochastic control for heterogeneous networks. IEEE INFOCOM, Sep 2005.
[28]
J. Ni and R. Srikant. Q-csma: Queue-length based csma/ca algorithms for achieving maximum throughput and low delay in wireless networks. Proc. of Information Theory and Applications Workshop, Jan 2009.
[29]
N. Piratla and A. Jayasumana. Reordering of packets due to multipath forwarding-an analysis. IEEE ICC, Jan 2006.
[30]
N. Piratla and A. Jayasumana. Metrics for packet reordering-a comparative analysis. International Journal of Communication Systems, Jan 2008.
[31]
D. Puccinelli and M. Haenggi. Reliable data delivery in large-scale low-power sensor networks. ACM TOSN, Sep 2009.
[32]
B. Radunovic, C. Gkantsidis, and D. Gunawardena. Horizon: Balancing tcp over multiple paths in wireless mesh network. ACM MOBICOM, Jan 2008.
[33]
T. Schoellhammer, B. Greenstein, and D. Estrin. Hyper: A routing protocol to support mobile users of sensor networks. Tech Report 2013, CENS, Oct 2006.
[34]
A. Sridharan, S. Moeller, and B. Krishnamachari. Implementing backpressure-based rate control in wireless networks. ITA Workshop, Sep 2008.
[35]
A. Sridharan, S. Moeller, and B. Krishnamachari. Making distributed rate control using lyapunov drifts a reality in wireless sensor networks. WiOpt, 2008.
[36]
A. Stolyar. Maximizing queueing network utility subject to stability: Greedy primal-dual algorithm. Queueing Systems, Jan 2005.
[37]
L. Tassiulas and A. Ephremides. Stability properties of constrained queueing systems and schedulingpolicies for maximum throughput in multihop radio networks. IEEE Transactions on Automatic Control, 1992.
[38]
M. Wachs, J. I. Choi, J. W. Lee, K. Srinivasan, Z. Chen, M. Jain, and P. Levis. Visibility: A new metric for protocol design. ACM Sensys, Sep 2007.
[39]
A. Warrier, S. Janakiraman, S. Ha, and I. Rhee. Diffq: Practical differential backlog congestion control for wireless networks. INFOCOM, Jan 2009.
[40]
A. Woo, T. Tong, and D. Culler. Taming the underlying challenges of reliable multihop routing in sensor networks. ACM Sensys, 2003.
[41]
W. Ye, J. Heidemann, and D. Estrin. An energy-efficient mac protocol for wireless sensor networks. IEEE INFOCOM, Jan 2002.
[42]
L. Ying, S. Shakkottai, and A. Reddy. On combining shortest-path and back-pressure routing over multihop wireless networks. Proceedings of the IEEE INFOCOM, Jan 2009.

Cited By

View all
  • (2024)Passenger Routing Algorithm for COVID-19 Spread Prevention by Minimising OvercrowdingComputers10.3390/computers1302004713:2(47)Online publication date: 5-Feb-2024
  • (2024)Downlink Scheduler for Delay Guaranteed Services Using Deep Reinforcement LearningIEEE Transactions on Mobile Computing10.1109/TMC.2023.327669723:4(3376-3390)Online publication date: Apr-2024
  • (2024)Beyond Throughput-Optimal: Second-Order Smooth Backpressure Algorithm for Reducing Jitter and Delay2024 IEEE/ACM 32nd International Symposium on Quality of Service (IWQoS)10.1109/IWQoS61813.2024.10682945(1-10)Online publication date: 19-Jun-2024
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
IPSN '10: Proceedings of the 9th ACM/IEEE International Conference on Information Processing in Sensor Networks
April 2010
460 pages
ISBN:9781605589886
DOI:10.1145/1791212
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 12 April 2010

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. collection
  2. routing protocol
  3. stochastic network optimization
  4. testbed experiments
  5. wireless sensor networks

Qualifiers

  • Research-article

Funding Sources

Conference

IPSN '10
Sponsor:

Acceptance Rates

Overall Acceptance Rate 143 of 593 submissions, 24%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)29
  • Downloads (Last 6 weeks)5
Reflects downloads up to 17 Feb 2025

Other Metrics

Citations

Cited By

View all
  • (2024)Passenger Routing Algorithm for COVID-19 Spread Prevention by Minimising OvercrowdingComputers10.3390/computers1302004713:2(47)Online publication date: 5-Feb-2024
  • (2024)Downlink Scheduler for Delay Guaranteed Services Using Deep Reinforcement LearningIEEE Transactions on Mobile Computing10.1109/TMC.2023.327669723:4(3376-3390)Online publication date: Apr-2024
  • (2024)Beyond Throughput-Optimal: Second-Order Smooth Backpressure Algorithm for Reducing Jitter and Delay2024 IEEE/ACM 32nd International Symposium on Quality of Service (IWQoS)10.1109/IWQoS61813.2024.10682945(1-10)Online publication date: 19-Jun-2024
  • (2023)Analysis and Evaluation of Fully TCP-Compatible Backpressure-Driven Traffic EngineeringIEEE Transactions on Network Science and Engineering10.1109/TNSE.2023.3282642(1-15)Online publication date: 2023
  • (2023)Distributed Disaggregated Communications via Reinforcement Learning and Backpressure (D2CRaB)2023 IEEE International Systems Conference (SysCon)10.1109/SysCon53073.2023.10131166(1-3)Online publication date: 17-Apr-2023
  • (2023)System of Systems for Distributed Disaggregated Communications via Reinforcement Learning and Backpressure (D2CRaB)2023 18th Annual System of Systems Engineering Conference (SoSe)10.1109/SoSE59841.2023.10178551(1-7)Online publication date: 14-Jun-2023
  • (2023)An Online Learning Approach to Shortest Path and Backpressure Routing in Wireless NetworksIEEE Access10.1109/ACCESS.2023.328236511(57253-57267)Online publication date: 2023
  • (2022)Software-Defined Networking Meets Software-Defined Radio in Mobile ad hoc Networks: State of the Art and Future DirectionsIEEE Access10.1109/ACCESS.2022.314407210(9989-10014)Online publication date: 2022
  • (2022)TSBSAd Hoc Networks10.1016/j.adhoc.2022.102874132:COnline publication date: 1-Jul-2022
  • (2021)A Survey on Layer-Wise Security Attacks in IoT: Attacks, Countermeasures, and Open-IssuesElectronics10.3390/electronics1019236510:19(2365)Online publication date: 28-Sep-2021
  • Show More Cited By

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media