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
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
Joint congestion control, routing, and MAC for stability and fairness in wireless networks
IEEE Journal on Selected Areas in Communications
Using buffer space advertisements to avoid congestion in mobile opportunistic DTNs
WWIC'11 Proceedings of the 9th IFIP TC 6 international conference on Wired/wireless internet communications
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
Backpressure scheduling in IEEE 802.11 wireless mesh networks: Gap between theory and practice
Computer Networks: The International Journal of Computer and Telecommunications Networking
Timescale decoupled routing and rate control in intermittently connected networks
IEEE/ACM Transactions on Networking (TON)
LIFO-backpressure achieves near-optimal utility-delay tradeoff
IEEE/ACM Transactions on Networking (TON)
Hi-index | 0.00 |
We study a network composed of multiple clusters of wireless nodes. Within each cluster, nodes can communicate directly using the wireless links; however, these clusters are far away 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 source to destination clusters. There are several applications of our network model (e.g., clusters of mobile soldiers connected via unmanned aerial vehicles). At the same time, much interest has been garnered by cross-layer design for wireless networks in order to improve efficiency and better allocate resources. In this paper, we focus on queue based cross-layer technique known as back-pressure algorithm. The algorithm is known to be throughput optimal, as well as resilient to disruptions in the network, making it an ideal place to start when designing communication protocols for our intermittently connected network. In this paper, we design a back-pressure routing/rate control algorithm for intermittently connected networks (ICNs). We implement a modified back-pressure routing algorithm on a 16-node experimental test bed, discuss some of the issues regarding design and implementation, and present our experimental results.