A Framework for Routing Performance Analysis in Delay Tolerant Networks with Application to Noncooperative Networks

ABSTRACT:-
In this paper, we introduce a theoretical framework for analyzing routing performance in delay tolerant networks which is aimed at characterizing the exact distribution of the fundamental performance metrics described above, namely packet delivery delay and communication cost. Our proposed framework is based on a characterization of the routing process as a stochastic coloring process, and can be applied to model performance of most stateless delay tolerant routing protocols we have introduced a framework for deriving the exact packet delivery delay and communication cost distribution for a large class of delay tolerant network routing protocols. We have also presented examples of application of our framework to specific routing protocols, namely epidemic and two-hops routing. Furthermore, we have shown how accurate characterization of the packet delivery delay distribution can be used to investigate epidemic routing performance in presence of different degrees of node cooperation within the network.

 SYSTEM ARCHITECTURE

 
EXISTING SYSTEM:-

We show how packet delivery delay distribution can be used to estimate how the performance of epidemic routing changes in presence of different degrees of node cooperation within the network. We stress that node cooperation is fundamental to ensure acceptable performance in DTNs: in fact, differently from more traditional (fully connected) types of wireless multi-hop networks, nodes are typically requested not only to act as packet forwarders, but also to store in their own buffer other nodes’ packets for a very long time interval (storeand- forward communication).

DISADVANTAGES OF EXISTING SYSTEM:-
Ø Network traffic is very high and low density.
Ø Slow transmissions because node will be disconnection frequently so the data load neighbor node loss of data and slow down process.
Ø Our existing systems harm the routing protocols.
Ø  Poor performance gain in the Network.

PROPOSED SYSTEM:-
Our proposed framework is based on a characterization of the routing process as a stochastic coloring process, and can be applied to model performance of most stateless delay tolerant routing protocols. We then show how the proposed framework can be used to faithfully compare performance of the two considered routing protocols, in terms of both expected PDR and average communication cost.

The proposed framework is based upon the following assumptions:
1) Low load: network traffic is low, so that buffer capacity on the nodes is not an issue (i.e., it can be considered as virtually infinite).
2) Transmission range and encounter: two nodes can communicate if they are within distance r, where r is the transmission range; this is equivalent to assuming isotropic, deterministic propagation of the radio signal with distance. We say that an encounter between two nodes occur when they come into each other transmission range.
3) No contention: any communicating pair of nodes does not interfere with any other pair communicating at the same time. This assumption is justified by the very low node density in a typical DTN scenario, and by the relatively low network load scenario considered in this paper.
4) Fast transmissions: relative speed between arbitrary node pairs is very low compared to transmission time; in other words, we assume that the duration of node encounters is always sufficient for the two nodes to exchange the content of their buffers.



ADVANTAGES OF PROPOSED SYSTEM: -
Ø The packet delivery delay distribution can be used to estimate how the performance of epidemic routing changes in presence of different degrees of node cooperation within the network.
Ø The performances gain the exact packet delivery delay and communication distribution systems.
Ø When the transfer of data to another node is very fast communication.


MODULES:
ü Network Construction Module
ü Analysis of Two-Hops Routing
ü Finding packet delivery delay
ü Finding communication cost
MODULE DESCRIPTION:

Network Construction Module
In this module, we construct the network framework for finding the routing performance analysis in delay tolerant network. We build the network simulation environment by considering the entities as Source node, two-hops, and then the destination node. The source node is capable of sending data to the destination node. The source node can select the data and transmit to the destination by providing the IP address for the destination node. Initially to calculate the routing performance, the packets are being split in the source node. Then the packets are being routed to the destination.

Analysis of Two-Hops Routing
In this section, we show how the framework presented can be used to approximate the packet delivery delay distribution of two-hops routing. The derivation in case of two-hops routing is much more involved than in case of epidemic routing, since the process of spreading the packet in the network is asymmetric. More specifically, during the spraying phase the coloring process is asymmetric, since only the source is in CA State, while the other colored nodes are in CI state and can color only the destination. In the wait phase, the coloring process becomes symmetric, since all colored nodes (including the source, which now holds only the last copy of the packet) are in CI state. As we shall see, the difficulty in deriving the exact packet delivery delay and communication cost distribution with two-hops routing lies in the asymmetry of coloring during the spraying phase.

Finding packet delivery delay
In this module, we introduce a theoretical framework for analyzing routing performance in delay tolerant networks which is aimed at characterizing the exact distribution of the fundamental performance metrics described above, namely, packet delivery delay. This is in sharp contrast with existing work, which either considers only expected value of the metrics of interest.


Finding communication cost
Delay Tolerant Networks (DTN) is widely used to model and study wireless sensor, ad-hoc, and even satellite networks. Usually, such networks are characterized by limited computational and power source capabilities. Thus, it is necessary to provide an efficient method for producing routing decisions. In this module we examine a deterministic DTN and propose a group of algorithms that find optimal routing paths with a low computational cost, using the special structure of the connectivity graphs of DTNs. Our approach can be integrated with many one-to-many shortest path algorithms used in network optimization.

SYSTEM REQUIREMENTS:
HARDWARE REQUIREMENTS:

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


SOFTWARE REQUIREMENTS:

•         Operating system           : - Windows XP.
•         Coding Language :  JAVA

REFERENCE:
Giovanni Resta and Paolo Santi, “A Framework for Routing Performance Analysis
in Delay Tolerant Networks with Application to Noncooperative Networks”, IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, VOL. 23, NO. 1, JANUARY 2012