Highly-resilient, energy-efficient multipath routing in wireless sensor networks
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
Performance of multihop wireless networks: shortest path is not enough
ACM SIGCOMM Computer Communication Review
Taming the underlying challenges of reliable multihop routing in sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
Dynamic power allocation and routing for satellite and wireless networks with time varying channels
Dynamic power allocation and routing for satellite and wireless networks with time varying channels
ExOR: opportunistic multi-hop routing for wireless networks
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
Maximizing Queueing Network Utility Subject to Stability: Greedy Primal-Dual Algorithm
Queueing Systems: Theory and Applications
Resource Allocation and Cross Layer Control in Wireless Networks (Foundations and Trends in Networking, V. 1, No. 1)
Visibility: a new metric for protocol design
Proceedings of the 5th international conference on Embedded networked sensor systems
Metrics for packet reordering—A comparative analysis
International Journal of Communication Systems
Symbol-level network coding for wireless mesh networks
Proceedings of the ACM SIGCOMM 2008 conference on Data communication
Horizon: balancing tcp over multiple paths in wireless mesh network
Proceedings of the 14th ACM international conference on Mobile computing and networking
Order optimal delay for opportunistic scheduling in multi-user wireless uplinks and downlinks
IEEE/ACM Transactions on Networking (TON)
Proceedings of the 7th ACM Conference on Embedded Networked Sensor Systems
Queue back-pressure random access in multihop wireless networks: optimality and stability
IEEE Transactions on Information Theory
Delay reduction via lagrange multipliers in stochastic network optimization
WiOPT'09 Proceedings of the 7th international conference on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks
Reliable data delivery in large-scale low-power sensor networks
ACM Transactions on Sensor Networks (TOSN)
Super-fast delay tradeoffs for utility optimal fair scheduling in wireless networks
IEEE Journal on Selected Areas in Communications
Backpressure-based routing protocol for DTNs
Proceedings of the ACM SIGCOMM 2010 conference
Handling inelastic traffic in wireless sensor networks
IEEE Journal on Selected Areas in Communications - Special issue on simple wireless sensor networking solutions
Back-pressure routing and rate control for ICNs
Proceedings of the sixteenth annual international conference on Mobile computing and networking
eShare: a capacitor-driven energy storage and sharing network for long-term operation
Proceedings of the 8th ACM Conference on Embedded Networked Sensor Systems
TinyOS meets wireless mesh networks
Proceedings of the 8th ACM Conference on Embedded Networked Sensor Systems
Towards a life without link estimation
Proceedings of the 8th ACM Conference on Embedded Networked Sensor Systems
XPRESS: a cross-layer backpressure architecture for wireless multi-hop networks
MobiCom '11 Proceedings of the 17th annual international conference on Mobile computing and networking
TinyWiFi: making network protocol evaluation portable across multiple phy-link layers
WiNTECH '11 Proceedings of the 6th ACM international workshop on Wireless network testbeds, experimental evaluation and characterization
Self-adaptive routing in multi-hop sensor networks
Proceedings of the 7th International Conference on Network and Services Management
Design, implementation, and tracing of dynamic backpressure routing for ns-3
Proceedings of the 4th International ICST Conference on Simulation Tools and Techniques
Multi-path OLSR performance analysis in a large testbed environment
ICDCN'12 Proceedings of the 13th international conference on Distributed Computing and Networking
Low power, low delay: opportunistic routing meets duty cycling
Proceedings of the 11th international conference on Information Processing in Sensor Networks
Achieving long-term operation with a capacitor-driven energy storage and sharing network
ACM Transactions on Sensor Networks (TOSN)
Timescale decoupled routing and rate control in intermittently connected networks
IEEE/ACM Transactions on Networking (TON)
Towards a queueing-based framework for in-network function computation
Queueing Systems: Theory and Applications
Packet-level attestation (PLA): A framework for in-network sensor data reliability
ACM Transactions on Sensor Networks (TOSN)
Proceedings of the 10th ACM Conference on Embedded Network Sensor Systems
Broadcast-free collection protocol
Proceedings of the 10th ACM Conference on Embedded Network Sensor Systems
Managing software evolution in large-scale wireless sensor and actuator networks
ACM Transactions on Sensor Networks (TOSN)
LIFO-backpressure achieves near-optimal utility-delay tradeoff
IEEE/ACM Transactions on Networking (TON)
CTP: An efficient, robust, and reliable collection tree protocol for wireless sensor networks
ACM Transactions on Sensor Networks (TOSN)
Delay-based back-pressure scheduling in multihop wireless networks
IEEE/ACM Transactions on Networking (TON)
Hi-index | 0.00 |
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.