Routing in Delay/Disruption Tolerant Networks: A Taxonomy, Survey and Challenges

Cao, Yue; Sun, Zhili

doi:10.1109/surv.2012.042512.00053

Cited by 318 publications

(182 citation statements)

References 126 publications

Supporting

Mentioning

178

Contrasting

Unclassified

Order By: Relevance

“…Given that N 1 encounters another node N 2 , with Ψ(t 2,5 ) where t 2,5 = 2200s, then the historical information about N 5 , as recorded in Ψ(t 1,5 ), is updated according to that of in Ψ(t 2,5 ) because of (t 2,5 > t 1,5 ). In another case that if N 2 did not meet N 5 in the past, then Ψ(t 2,5 ) is simply updated towards that of in Ψ(t 1,5 ).…”

Section: A Information Updatementioning

confidence: 99%

“…With this in mind, Delay/Disruption Tolerant Networks (DTNs) [1] receive great interest from research community and are envisioned for many terrestrial applications. Apart from InterPlanetary Networks (IPNs) [2], other examples of DTNs include sparse Vehicular Ad hoc NETworks (VANETs) [3], ocean sensor networks [4] and Pocket Switched Networks (PSNs) [5].…”

Section: Introductionmentioning

confidence: 99%

“…Different from topology based routing, geographic routing exploits the geographic information instead of topological connectivity information to relay messages, in order to gradually approach and eventually reach the intended destination. Although numerous previous works have been proposed in designing powerful routing scheme using historical topology information, geographic routing in DTNs has not received much attention, as reviewed in [1].…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Geographic-Based Spray-and-Relay (GSaR): An Efficient Routing Scheme for DTNs

Cao

Sun

Wang

et al. 2015

IEEE Trans. Veh. Technol.

Self Cite

View full text Add to dashboard Cite

Abstract-In this article, we design and evaluate the proposed Geographic-based Spray-and-Relay (GSaR) routing scheme in Delay/Disruption Tolerant Networks (DTNs). To the best of our knowledge, GSaR is the first spray based geographic routing scheme using the historical geographic information for making routing decision. Here, the term spray means only a limited number of message copies are allowed for replication in the network.By estimating a movement range of destination via the historical geographic information, GSaR expedites message being sprayed towards this range, meanwhile prevents that away from and postpones that out of this range. As such, the combination of them intends to fast and efficiently spray the limited number of message copies towards this range, and effectively spray them within range, in order to reduce the delivery delay and increase the delivery ratio. Furthermore, GSaR exploits Delegation Forwarding (DF) to enhance the reliability of routing decision and handle the local maximum problem, considered as the challenges for applying geographic routing scheme in sparse networks. We evaluate GSaR under three city scenarios abstracted from real world, with other routing schemes for comparison. Results show that GSaR is reliable for delivering messages before expiration deadline and efficient for achieving low routing overhead ratio. Further observation indicates that GSaR is also efficient in terms of a low and fair energy consumption over the nodes in the network.

show abstract

Section: A Information Updatementioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Geographic-Based Spray-and-Relay (GSaR): An Efficient Routing Scheme for DTNs

Cao

Sun

Wang

et al. 2015

IEEE Trans. Veh. Technol.

Self Cite

View full text Add to dashboard Cite

show abstract

“…In such a condition the connection between pairs of nodes is brought about when they come into range of each other. So that, mobility effects intermittent connectivity [2]. The following part discusses the existing routing protocols in brief.…”

Section: Related Workmentioning

confidence: 99%

Encounter based Routing and Buffer Management Scheme in Delay Tolerant Networks

Patel¹,

Gondaliya²

2015

IJCA

View full text Add to dashboard Cite

Delay Tolerant Networks (DTNs) are one of the most interesting evolutions of MANETs where frequent disconnection of networks is there so that end to end path not establish between source to destination. When seeing routing protocols of DTNs, a forwarding and buffer management are important to be considered for successful message delivery. "Encounter Based Routing (EBR)" which increase delivery ratio by decreasing overhead and delay using the encounter value of the nodes. EBR takes the average Encounter Value (EV) of the node and decide that how many copies of the message to be sent to the other nodes. Higher the EV value, the node will get more number of message copies. We propose the modified EBR which optimizes the performance of the existing EBR. We consider the change of rate of EV with respect to time and then intelligently decide the number of replicas to be sent to the encountered nodes. The modified EBR scheme performs better in terms of delivery ratio than the existing EBR protocol. We also propose the buffer management policy using EV of the node to decide the dropping of the message in the Epidemic routing protocol. These schemes are HEV (High Encounter Value) and LEV (Low Encounter Value) and they are compared with the existing traditional policies such as LIFO and FIFO. The simulation results show that our proposed dropping policy improves the overhead ratio, delivery delay and hop count metrics than the existing ones.

show abstract

“…With ICN logic, the naming of content objects allows for interception of passing-through data items [3], facilitating the content-aware caching at network intermediate nodes. Therefore, coupling ICN with mobile cellular network could be an attractive solution [4] [15][27] [28], in order to resolve the tension between the tremendous growth of mobile content traffic and backhaul bottleneck. For instance, it will be of great flexibility to satisfy mobile users' demands locally by caching popular contents at a clustering point, such as at routers or base stations, thereby reducing backhaul traffic and improving overall network capacity.…”

Section: Introductionmentioning

confidence: 99%

A cooperation-driven ICN-based caching scheme for mobile content chunk delivery at RAN

Zhang

Cao

2017

2017 13th International Wireless Communications and Mobile Computing Conference (IWCMC)

Self Cite

View full text Add to dashboard Cite

Abstract-In order to resolve the tension between continuously growing mobile users' demands on content access and the scarcity of the bandwidth capacity over backhaul links, we propose in this paper a fully distributed ICN-based caching scheme for content objects in Radio Access Network (RAN) at eNodeBs. Such caching scheme operates in a cooperative way within neighbourhoods, aiming to reduce cache redundancy so as to improve the diversity of content distribution. The caching decision logic at individual eNodeBs allows for adaptive caching, by taking into account dynamic context information, such as content popularity and availability. The efficiency of the proposed distributed caching scheme is evaluated via extensive simulations, which show great performance gains, in terms of a substantial reduction of backhaul content traffic as well as great improvement on the diversity of content distribution, etc.

show abstract

Routing in Delay/Disruption Tolerant Networks: A Taxonomy, Survey and Challenges

Cited by 318 publications

References 126 publications

Geographic-Based Spray-and-Relay (GSaR): An Efficient Routing Scheme for DTNs

Geographic-Based Spray-and-Relay (GSaR): An Efficient Routing Scheme for DTNs

Encounter based Routing and Buffer Management Scheme in Delay Tolerant Networks

A cooperation-driven ICN-based caching scheme for mobile content chunk delivery at RAN

Contact Info

Product

Resources

About