Scalable Routing in Cyclic Mobile Networks

Abstract:

The nonexistence of an end-to-end path poses a challenge in adapting traditional routing algorithms to delay-tolerant networks (DTNs). Previous works have covered centralized routing approaches based on deterministic mobility, ferry-based routing with deterministic or semi deterministic mobility, flooding-based approaches for networks with general mobility, and probability-based routing for semi deterministic mobility models. Unfortunately, none of these methods can guarantee both scalability and delivery then; we extend it to handle a moderate level of uncertainty in contact prediction. Analytical studies and show that the performance of our proposed routing algorithm, DTN Hierarchical Routing (DHR), is comparable to that of the optimal time-space Dijkstra algorithm in terms of delay and hop count. At the same time, the per-node storage overhead is substantially reduced and becomes scalable.


Algorithm / Technique used:

DTN Hierarchical Routing (DHR) Algorithm.





Algorithm Description:

Our proposed DHR is quite straightforward after the hierarchical network has been built. DHR is also a hop by- hop routing. Each node makes its forwarding decision in two phases. The first phase runs only when the highest level, on which the cluster of the current node and that of the destination are different.


Existing System:

Routing in communication networks involves the indirection from a persistent name (or ID) to a locator and delivering packets based upon the locator. In a large-scale, highly dynamic network, the ID-to-locator mappings are both large in number, and change often. Traditional routing protocols require high overhead to keep these indirections up-to-date. In this paper, we propose Weak State Routing (WSR), a routing mechanism for large-scale highly dynamic networks. WSRâ„¢s novelty is that it uses random directional walks biased occasionally by weak indirection state information in intermediate nodes. The indirection state information is weak, i.e. interpreted not as absolute truth, but as probabilistic hints. Nodes only have partial information about the region a destination node is likely to be. This method allows us to aggregate information about a number of remote locations in a geographic region. In other words, the state information maps a set-of-IDs to a geographical region.


Proposed System:

In this paper, we extend the investigation of scalable deterministic routing in DTNs with repetitive mobility based on our previous works. Instead of routing with global contact knowledge, we propose a routing algorithm that routes on contact information compressed by three combined methods. We address the challenge of efficient information aggregation and compression in the time-space domain while maintaining critical information for efficient routing.



Hardware Requirements:

¢ System : Pentium IV 2.4 GHz.
¢ Hard Disk : 40 GB.
¢ Floppy Drive : 1.44 Mb.
¢ Monitor : 15 VGA Colour.
¢ Mouse : Logitech.
¢ Ram : 256 Mb.


Software Requirements:

¢ Operating system : - Windows XP Professional.
¢ Coding Language : - Java.
¢ Tool Used : - Eclipse.