Because a delay tolerant network (DTN) can often be partitioned, routing is a challenge. However, routing benefits considerably if one can take advantage of knowledge concerning node mobility. This paper addresses this problem with a generic algorithm based on the use of a high-dimensional Euclidean space, that we call MobySpace, constructed upon nodes' mobility patterns. We provide here an analysis and a large scale evaluation of this routing scheme in the context of ambient networking by replaying real mobility traces. The specific MobySpace evaluated is based on the frequency of visits of nodes to each possible location. We show that routing based on MobySpace can achieve good performance compared to that of a number of standard algorithms, especially for nodes that are present in the network a large portion of the time. We determine that the degree of homogeneity of node mobility patterns has a high impact on routing. And finally, we study the ability of nodes to learn their own mobility patterns.
Some work concerning routing in DTNs has been performed with scheduled contacts, such as the paper by @cite_28 that tries to improve the connectivity of an isolated village to the internet based on knowledge of when a low-earth orbiting relay satellite and a motor bike might be available to make the necessary connections. Also of interest, work on interplanetary networking @cite_18 @cite_26 uses predicted contacts such as the ones between planets within the framework of a DTN architecture.
@cite_28 @cite_18 @cite_26
2162076967 2082199994 2097625638
We formulate the delay-tolerant networking routing problem, where messages are to be moved end-to-end across a connectivity graph that is time-varying but whose dynamics may be known in advance. The problem has the added constraints of finite buffers at each node and the general property that no contemporaneous end-to-end path may ever exist. This situation limits the applicability of traditional routing approaches that tend to treat outages as failures and seek to find an existing end-to-end path. We propose a framework for evaluating routing algorithms in such environments. We then develop several algorithms and use simulations to compare their performance with respect to the amount of knowledge they require about network topology. We find that, as expected, the algorithms using the least knowledge tend to perform poorly. We also find that with limited additional knowledge, far less than complete global knowledge, efficient algorithms can be constructed for routing in such environments. To the best of our knowledge this is the first such investigation of routing issues in DTNs. The developments in the space technologies are enabling the realization of deep space scientific missions such as Mars exploration. InterPlaNetary (IPN) Internet is expected to be the next step in the design and development of deep space networks as the Internet of the deep space planetary networks. However, there exist significant challenges to be addressed for the realization of this objective. Many researchers and several international organizations are currently engaged in defining and addressing these challenges and developing the required technologies for the realization of the InterPlaNetary Internet. In this paper, the current status of the research efforts to realize the InterPlaNetary Internet objective is captured. The communication architecture is presented, and the challenges posed by the several aspects of the InterPlaNetary Internet are introduced. The existing algorithms and protocols developed for each layer and the other related work are explored, and their shortcomings are pointed out along with the open research issues for the realization of the InterPlaNetary Internet. The objective of this survey is to motivate the researchers around the world to tackle these challenging problems and help to realize the InterPlaNetary Internet. Increasingly, network applications must communicate with counterparts across disparate networking environments characterized by significantly different sets of physical and operational constraints; wide variations in transmission latency are particularly troublesome. The proposed Interplanetary Internet, which must encompass both terrestrial and interplanetary links, is an extreme case. An architecture based on a "least common denominator" protocol that can operate successfully and (where required) reliably in multiple disparate environments would simplify the development and deployment of such applications. The Internet protocols are ill suited for this purpose. We identify three fundamental principles that would underlie a delay-tolerant networking (DTN) architecture and describe the main structural elements of that architecture, centered on a new end-to-end overlay network protocol called Bundling. We also examine Internet infrastructure adaptations that might yield comparable performance but conclude that the simplicity of the DTN architecture promises easier deployment and extension.