ACM Transactions on Computer Systems (TOCS)
Probabilistic routing in intermittently connected networks
ACM SIGMOBILE Mobile Computing and Communications Review
Routing in a delay tolerant network
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
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
Practical routing in delay-tolerant networks
Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking
Spray and wait: an efficient routing scheme for intermittently connected mobile networks
Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking
Maximizing Queueing Network Utility Subject to Stability: Greedy Primal-Dual Algorithm
Queueing Systems: Theory and Applications
Inter-Regional Messenger Scheduling in Delay Tolerant Mobile Networks
WOWMOM '06 Proceedings of the 2006 International Symposium on on World of Wireless, Mobile and Multimedia Networks
Integrating DTN and MANET routing
Proceedings of the 2006 SIGCOMM workshop on Challenged networks
DTN routing as a resource allocation problem
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
Horizon: balancing tcp over multiple paths in wireless mesh network
Proceedings of the 14th ACM international conference on Mobile computing and networking
Network adiabatic theorem: an efficient randomized protocol for contention resolution
Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems
EZ-Flow: removing turbulence in IEEE 802.11 wireless mesh networks without message passing
Proceedings of the 5th international conference on Emerging networking experiments and technologies
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
Routing without routes: the backpressure collection protocol
Proceedings of the 9th ACM/IEEE International Conference on Information Processing in Sensor Networks
Implementing utility-optimal CSMA
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Back-pressure routing for intermittently connected networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
Retiring replicants: congestion control for intermittently-connected networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
Max-contribution: on optimal resource allocation in delay tolerant networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
Back-pressure routing and rate control for ICNs
Proceedings of the sixteenth annual international conference on Mobile computing and networking
Simple yet efficient, transparent airtime allocation for TCP in wireless mesh networks
Proceedings of the 6th International COnference
Joint congestion control, routing, and MAC for stability and fairness in wireless networks
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
We study an intermittently connected network (ICN) composed of multiple clusters of wireless nodes. Within each cluster, nodes can communicate directly using the wireless links. However, these clusters are far away from each other such that direct communication between the clusters is impossible except through "mobile" contact nodes. These mobile contact nodes are data carriers that shuffle between clusters and transport data from the source to the destination clusters. There are several applications of our network model, such as clusters of mobile soldiers connected via unmanned aerial vehicles. Our work here focuses on a queue-based cross-layer technique known as the back-pressure algorithm. The algorithm is known to be throughput-optimal, as well as resilient to disruptions in the network, making it an ideal candidate communication protocol for our intermittently connected network. In this paper, we design a back-pressure routing/rate control algorithm for ICNs. Though it is throughput-optimal, the back-pressure algorithm has several drawbacks when used in ICNs, including long end-to-end delays, large number of potential queues needed, and loss in throughput due to intermittency. We present a modified back-pressure algorithm that addresses these issues. We implement our algorithm on a 16-node experimental testbed and present our experimental results in this paper.