This paper designed a location aware routing scheme for Delay Tolerant Networks that can deliver more messages within shorter delays, therefore improves the network intensively and compares with other representative DTN routing schemes.
Abstract:
In this paper, we sought to understand the reasons causing failures and delays of message delivery in Delay Tolerant Networks (DTN), and to use this understanding for improving the network. By studying two real-world datasets, we found that node isolation is prevalent, which largely accounts for the inefficiencies in DTN's message delivery. In addition, by analyzing nodes' contact-location relationship, we found that individual and system-wide key locations exist and their existence suggests potential improvements. Motivated by our observations, we designed a location aware routing scheme for DTN networks. With simulation-based experiments, we compared our proposal with other representative DTN routing schemes, and showed that with the awareness of the location information, our solution can deliver more messages within shorter delays, therefore improves the network intensively.
TL;DR: Few recent approaches which proposed different schemes to reduce the energy consumption of node and also increase the delivery probability and by using different aspects of the conservation of energy the energy efficiency has been increased.
TL;DR: The findings reveal that the expected contact information overhead in Smart City scenarios significantly reduces data exchange success and increases energy consumption on portable handheld devices, thereby threatening the feasibility of the technology.
TL;DR: The structure of the routing ferry for ICMNs is provided, the problem of the planning of routing ferries based on graph is formally described, and a dynamic programming algorithm is provided to plan the movement of the routed ferries.
TL;DR: This paper surveys the state-of-the-art routing protocols and gives a comparison of them with respect to the important challenging issues in DTNs and separates them into flooding families and forwarding families.
TL;DR: This paper is intended to serve as a “roadmap” for future generations of scientists and historians to consider the search for extraterrestrial intelligence during the period of World War II.
TL;DR: This work introduces Epidemic Routing, where random pair-wise exchanges of messages among mobile hosts ensure eventual message delivery and achieves eventual delivery of 100% of messages with reasonable aggregate resource consumption in a number of interesting scenarios.
TL;DR: A new routing scheme, called Spray and Wait, that "sprays" a number of copies into the network, and then "waits" till one of these nodes meets the destination, which outperforms all existing schemes with respect to both average message delivery delay and number of transmissions per message delivered.
TL;DR: This work forms the delay-tolerant networking routing problem, where messages are to be moved end-to-end across a connectivity graph that is time-varying but whose dynamics may be known in advance, and proposes a framework for evaluating routing algorithms in such environments.
TL;DR: This paper proposes PRoPHET, a probabilistic routing protocol for intermittently connected networks and shows that it is able to deliver more messages than Epidemic Routing with a lower communication overhead.
TL;DR: BUBBLE is designed and evaluated, a novel social-based forwarding algorithm that utilizes the aforementioned metrics to enhance delivery performance and empirically shows that BUBBLE can substantially improve forwarding performance compared to a number of previously proposed algorithms including the benchmarking history-based PROPHET algorithm, and social- based forwarding SimBet algorithm.
Q1. What are the contributions mentioned in the paper "Location-aware routing for delay tolerant networks" ?
In this paper, the authors sought to understand the reasons causing failures and delays of message delivery in Delay Tolerant Networks ( DTN ), and to use this understanding for improving the network. In addition, by analyzing nodes ’ contact-location relationship, the authors found that individual and system-wide key locations exist and their existence suggests potential improvements. With simulation-based experiments, the authors compared their proposal with other representative DTN routing schemes, and showed that with the awareness of the location information, their solution can deliver more messages within shorter delays, therefore improves the network intensively.
Q2. What is the definition of a contact graph?
Given a dataset d, a contact graph G(d, t) = (V,E) is defined as an undirected graph, with V as the vertex set where each node in the dataset corresponds to a vertex.
Q3. What is the definition of the intercomponent delay?
With the weighted contact graph, the intra-component delay is defined as the mean distance between any two nodes in a same component using the MED algorithm[2], and the intercomponent delay is defined as the mean distance between one component and one isolated node.
Q4. What are the two metrics of a contact graph?
With node isolation widely observed, to investigate its implication on the DTN routing problem, the authors studied two metrics of a contact graph, namely the intra-component delay and the inter-component delay.
Q5. Why do the authors believe that Location is the route for message delivery?
The authors believe this is because by the replicating operation in the Location scheme, the source node has more chances to forward the message into the destination node’s component.
Q6. What is the main reason for the latency and the failure in DTN’s message delivery?
The observation suggeststhat node isolation is the major reason for the latency and the failure in DTN’s message delivery, and should be their focus in designing the routing scheme.
Q7. How many source/destination pairs did the authors randomly select for each routing scheme?
In their first experiment, for each routing scheme, the authors randomly selected one hundred source/destination pairs for message delivery, and the authors did not restrict the delay constraint.
Q8. What is the metric for the inter-contact delay?
To define the metrics, the authors modified the contact graph into a weighted contact graph Gw(d), where for each edge on the graph, its weight is defined as the averaged inter-contact time between the two corresponding nodes.