Mobility increases the capacity of ad hoc wireless networks
IEEE/ACM Transactions on Networking (TON)
A delay-tolerant network architecture for challenged internets
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
A message ferrying approach for data delivery in sparse mobile ad hoc networks
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
A cost-benefit flow control for reliable multicast and unicast in overlay networks
IEEE/ACM Transactions on Networking (TON)
Message ferry route design for sparse ad hoc networks with mobile nodes
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
Alternative custodians for congestion control in delay tolerant networks
Proceedings of the 2006 SIGCOMM workshop on Challenged networks
Delay- and Disruption-Tolerant Networking
Delay- and Disruption-Tolerant Networking
Logarithmic Store-Carry-Forward Routing in Mobile Ad Hoc Networks
IEEE Transactions on Parallel and Distributed Systems
Scalable routing in delay tolerant networks
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
Delay/fault-tolerant mobile sensor networks (dft-msn's): a new paradigm for pervasive information gathering
Efficient routing in intermittently connected mobile networks: the single-copy case
IEEE/ACM Transactions on Networking (TON)
Dynamic Programming and Optimal Control, Vol. II
Dynamic Programming and Optimal Control, Vol. II
Congestion avoidance in a data-centric opportunistic network
Proceedings of the ACM SIGCOMM workshop on Information-centric networking
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
| Hi-index | 0.00 |
In delay tolerant networks, custody transfer can provide certain degree of reliability as a custodian node cannot discard a message unless its life time expires or the custody is transferred to another node after a commitment. This creates a challenging decision making problem at a node in determining whether to accept a custody transfer: on one hand, it is beneficial to accept a large number of messages as it can potentially advance the messages toward their ultimate destinations and network utilization can be maximized; on the other hand, if the receiving node over-commits itself by accepting too many messages, it may find itself setting aside an excessive amount of storage and thereby preventing itself from receiving further potentially important, high yield (in terms of network utilization) messages. To solve this problem, in this paper, we apply the concept of revenue management, and employ dynamic programming to develop a congestion management strategy for delay tolerant networks. For a class of network utility functions, we show that the optimal solution is completely distributed in nature where only the local information such as available storage space of a node is required. This is particularly important given the nature of delay tolerant networks where global information is often not available and the network is inherently dynamic. Our simulation results show that the proposed congestion management scheme is effective in avoiding congestion and balancing network load among the nodes.