Routing in a delay tolerant network
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Network coding for efficient communication in extreme networks
Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking
Performance of ad hoc networks with two-hop relay routing and limited packet lifetime
valuetools '06 Proceedings of the 1st international conference on Performance evaluation methodolgies and tools
Contention-aware analysis of routing schemes for mobile opportunistic networks
Proceedings of the 1st international MobiSys workshop on Mobile opportunistic networking
Reliable and efficient message delivery in delay tolerant networks using rateless codes
Proceedings of the 1st international MobiSys workshop on Mobile opportunistic networking
Efficient routing in intermittently connected mobile networks: the single-copy case
IEEE/ACM Transactions on Networking (TON)
Stochastic analysis of network coding in epidemic routing
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
The problem of computing the throughput capacity of general unicast in a Delay-Tolerant Network under the finite-buffer regime is addressed in this paper. A sparse mobile wireless network deployed on an M × M square-grid is considered, wherein m unique mobile source/destination pairs communicate with the aid of n mobile relay nodes using the store, carry, and forward paradigm. Each mobile relay node is equipped with a finite storage. Thus, several source/destination pairs contend for limited network resources. Under this setup, the throughput achieved per source-destination pair at steady-state node-mobility is analyzed, incorporating practical considerations such as node-to-node contention and finite communication range, for a class of two-hop relay protocols. In addition, two different approaches for buffer management are considered. The paper shows that, using a novel approach based on embedded Markov-chains, accurate analysis of the throughput can be achieved for the above model, as it is validated by simulations. A significant conclusion of this work is that considerable throughput improvements can be achieved by judicially managing the relay-node buffer-space.