A DTN Routing Protocol Based on Hierarchy Forwarding and Cluster Control

Abstract

The existing opportunistic protocols of Delay Tolerant Network (DTN) occupy much storage and the prediction-based protocols need to calculate and spread much predication information and the scheduling protocols can't accommodate to huge complex network. This paper analyses and summarizes the existing DTN protocols and proposes a new DTN routing protocol called CRHC which is based on hierarchical forwarding and cluster control mechanism. CRHC can efficiently control the routing overhead locally and forward message quickly across the whole network. At last, we compare the CRHC with the classic Epidemic and SMART protocol through OPNET simulation. The result demonstrates that the CRHC can effectively reduce the delivery delay and improve the successive delivery rate.

GrAnt: Inferring best forwarders from complex networks’ dynamics through a greedy Ant Colony Optimization

“…In POIs scenario, with one interface and TTL of 2400 minutes, for example, GrAnt delivered 65.67% of the messages (against 32.63% of PROPHET and 36.28% of Epidemic) with only 6.66 of redundancy ratio (26.07 of PROPHET and 24.85 of Epidemic) and only 52% of dropped messages (92% of PROPHET and Epidemic). The only drawback of GrAnt is its small increase in the delay of the messages delivery (19,573 seconds) as compared to Epidemic (15,705) and PROPHET (11,666) due to its process of choosing the best forwarders. In WD scenario, GrAnt delivered 65.19% of the messages (30.35% of PROPHET and 35.63% of Epidemic), generated only 13.17 of redundancy (108.31 of PROPHET and 196.28 of Epidemic), dropped only 23% of the messages (82% of PROPHET and 87% of Epidemic) and delivered the messages with an average delay of 55,239 (57,488 of PROPHET and 67,171 of Epidemic).…”

“…Congestion can occur when a large amount of data is stored in the nodes' buffer and it is expected to transfer INRIA them when an opportunity arises; (2) Prediction-based [8] [9] [16] [17] [18]: try to predict which nodes are useful for delivering messages based on historical encounters between nodes, node's context information, node location-visiting pattern, and social information; (3) Scheduling protocols [19] [20]: rely on the complexity task of controlling the trajectory of special nodes to improve the rate of messages delivery. So, it is mainly used in sparse networks [11].…”

“…Existent DTN routing protocols can be summarized into three categories [11]: (1) Flooding or Controlled flooding-based [12] [13]: forward messages to all or almost all encountered nodes without predicting which ones are good message forwarders. This category of protocols can be effective only when the nodes' buffer is infinite which is not feasible in wireless networks [14].…”

Threshold Based Best Custodian Routing Protocol for Delay Tolerant Network

“…This module is invoked after the threshold computation and before the transmission of messages. ing, ni forward Vdi [16][17] to nj. Vdi hold ids of delivered messages known by ni.…”

“…Therefore, the message can reach to its destination via multiple intermediate nodes. As a result, multi copy routing protocols minimize the delivery delay and maximize the delivery [14][15][16][17][18].…”