movement models, such as Random Waypoint, do not capture reliably the properties of movement in the real life scenarios. We present and analyse a movement model for delay-tolerant network simulations that is able to produce inter-contact time and contact time distributions that follow closely the ones found in the traces from the real-world measurement experiments. We validate the movement model using the ONE simulator.

In this paper, a method for calculating blocking experienced by dynamic multicast connections in a single link is presented. A service center at the root of a tree-type network provides a number of channels distributed to the users by multicast trees which evolve dynamically as users join and leave the channels. We reduce this problem to a generalized Engset system with nonidentical users and generally distributed holding times, and derive the call and channel blocking probabilities as well as the link occupancy distribution.

No abstract

The communication paradigms for delay-tolerant networking have been modeled after email. Supporting email over DTNs in a backwards compatible manner in a heterogeneous environment has yet to be fully defined. In this paper, we present a set of conventions for and extensions to the DTNRG architecture. We have implemented a system that is able to deliver emails within a DTN network, from a DTN network to the Internet, and from the Internet to the DTN network. Our system architecture includes multiple solutions for integrating traditional and DTN-based mail delivery: DTN-based messaging clients for mobile phones and PDAs, a dedicated, standalone DTN gateway between the Internet and the DTN network, and a personal DTN mail application proxy. The latter bridges to unmodified mail user agents running on a laptop.

Numerous routing protocols have been proposed for Delay Tolerant Networking. One class of routing protocols aims at optimizing the delivery performance by using knowledge of previous encounters for forecasting the future contacts to determine suitable next hops for a given packet. Protocols pursuing such an approach face a fundamental challenge of choosing the right protocol parameters and the right time scale for estimation. These, in turn, depend on the mobility characteristics of the mobile nodes which are likely to vary within one scenario and across different ones. We characterise this issue, which has been overlooked in this field so far, using PROPHET and MaxPROP as two representative routing protocols and derive mechanisms to dynamically and independently determine routing parameters in mobile nodes.