For Project Enquiry +91 9791 044 044

DTN-FLOW: INTER-LANDMARK DATA FLOW FOR

HIGH-THROUGHPUT ROUTING IN DTNS

ABSTRACT

In this paper, we focus on the efficient routing of data among different areas in delay tolerant networks (DTNs). In current algorithms, packets are forwarded gradually through nodes with higher probability of visiting the destination node or area. However, the number of such nodes usually is limited, leading to insufficient throughput performance. To solve this problem, we propose an inter-landmark data routing algorithm, namely DTNFLOW. It selects popular places that nodes visit frequently as landmarks and divides the entire DTN area into subareas represented by landmarks. Nodes transiting between landmarks relay packets among landmarks, even though they rarely visit the destinations of these packets. Specifically, the number of node transits between two landmarks is measured to represent the forwarding capacity between them, based on which routing tables are built on each landmark to guide packet routing. Each node predicts its transits based on its previous landmark visiting records using the order-Markov predictor. When routing a packet, the landmark determines the next-hop landmark based on its routing table and forwards the packet to the node with the highest probability of transiting to the selected landmark. Thus, DTN-FLOW fully utilizes all node movements to route packets along landmark-based paths to their destinations. We analyzed two real DTN traces to support the design of DTN-FLOW. We deployed a small DTN-FLOW system on our campus for performance evaluation. We also proposed advanced extensions to improve its efficiency and stability. The real deployment and trace-driven simulation demonstrate the high efficiency of DTN-FLOW in comparison to state-of-the-art DTN routing algorithms.

EXISTING SYSTEM	PROPOSED SYSTEM
EXISTING CONCEPT:- The problem has the added constraints of _nite bu_ers at each node and the general property that no con-temporaneous 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 _nd an existing end-to-end path. In this system further specifying forwarding and storing priorities based on the probability of successful delivery.	PROPOSED CONCEPT:- We propose an inter-landmark data routing algorithm, namely DTNFLOW. It selects popular places that nodes visit frequently as landmarks and divides the entire DTN area into subareas represented by landmarks. The number of node transits between two landmarks is measured to represent the forwarding capacity between them, based on which routing tables are built on each landmark to guide packet routing.
EXISTING ALGORITHM:- PROPHET Routing Algorithm.	PROPOSED ALGORITHM:- DTN FLOW -Inter land mark data routing algorithm.
ALGORITHM DEFINITION:- The Minimum Conductance Cut Problem to compute different approximations to the NCP plot. the shape of the NCP plot provides insight into the community structure of a graph	ALGORITHM DEFINITION:- Edge Connect is to adjust the vertex degrees one-by-one with operation adding Edge to let every vertex share the same degree with other vertices in at least k different communities. Procedures creation and mergence are utilized in this algorithm.
DRAWBACKS:- In the above technique a packet is always individually forwarded to nodes that have higher probabilities to meet its destination. The number of landmarks is high and cost also high.	ADVANTAGES:- In this technique all node mobility can be better utilized to realize efficient data forwarding among different areas in DTNs. The number of landmarks often is very limited, the total cost is limited.