Rethinking the design of the Internet: the end-to-end arguments vs. the brave new world
ACM Transactions on Internet Technology (TOIT)
A delay-tolerant network architecture for challenged internets
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Performance analysis of mobility-assisted routing
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
Performance modeling of epidemic routing
Computer Networks: The International Journal of Computer and Telecommunications Networking
Impact of Human Mobility on Opportunistic Forwarding Algorithms
IEEE Transactions on Mobile Computing
DTN routing as a resource allocation problem
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
Efficient routing in intermittently connected mobile networks: the multiple-copy case
IEEE/ACM Transactions on Networking (TON)
An optimal joint scheduling and drop policy for Delay Tolerant Networks
WOWMOM '08 Proceedings of the 2008 International Symposium on a World of Wireless, Mobile and Multimedia Networks
IEEE Communications Surveys & Tutorials
Delay-tolerant networking: an approach to interplanetary Internet
IEEE Communications Magazine
DTN: an architectural retrospective
IEEE Journal on Selected Areas in Communications
A novel DTN based energy neutral transfer scheme for energy harvested WSN Gateways
ACM SIGMETRICS Performance Evaluation Review
Fairness and satisfaction model for DTN applications using various transportation means
WWIC'11 Proceedings of the 9th IFIP TC 6 international conference on Wired/wireless internet communications
Traffic management strategy for delay-tolerant networks
Journal of Network and Computer Applications
| Hi-index | 0.00 |
Delay Tolerant Networks (DTNs) are able to provide communication services in challenged networks where the end-to-end path between the source and destination does not exist. In order to increase the probability of delivery, DTN routing mechanisms may require nodes in the network to store and carry messages in their local buffer and replicate many copies. When the limited buffer is consumed, choosing the appropriate messages to drop is critical to maximizing the system performance. Current methods for this are sub-optimal or assume unrealistic conditions. In this paper, we propose an adaptive optimal buffer management scheme for DTN in the situations where the bandwidth is limited and messages vary in size. In our proposal, the mobility model is adjusted according to the nodes' historical meeting information, and the message dropping policies are designed to optimize certain network performance goals, such as maximizing the average delivery rate or minimizing the average delivery delay. Furthermore, we theoretically prove that the designed message dropping policies are optimal to achieve the best system performance.