Comparison of DTN Routing Protocols in Realistic Scenario

Agussalim, .; Tsuru, Masato

doi:10.1109/incos.2014.80

Cited by 9 publications

(8 citation statements)

References 7 publications

(8 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…One other sophisticated scheme is MaxProp [13], in which the path cost is computed based on the meeting probability of each hop along the destination, and the shortest cost path is selected. Note that our previous work [4] showed that PRoPHETv2 (PV2) [12] outperformed MaxProp in the island scenario. As another example, You et al proposed a hop-count-based heuristic routing protocol for mobile DTNs, which calculates heuristic estimations based on hop count information [14].…”

Section: Forwardingmentioning

confidence: 86%

“…are stationary and located at some areas that are different from the source node's areas. In our previous study, we compared several popular DTN routing protocols via simulation and found that there is no single best routing algorithm for the island scenario under different conditions (e.g., congestion levels) [4]. This motivated us to develop a new routing protocol that includes efficient buffer management (involving message scheduling) to increase the performance of DTNs in the island scenario.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Spray Router with Node Location Dependent Remaining-TTL Message Scheduling in DTNs

Agussalim

Tsuru

2016

Journal of Information Processing

Self Cite

View full text Add to dashboard Cite

Delay and disruption tolerant networks (DTNs) adopt the store-carry-and-forward paradigm. Each node stores messages in a buffer storage and waits for either an appropriate forwarding opportunity or the message's expiration time, i.e., its time-to-live (TTL). There are two key issues that influence the performance of DTN routing: the forwarding policy that determines whether a message should be forwarded to an encountered node, and the buffer management policy that determines which message should be sent from the queue (i.e., message scheduling) and which message should be dropped when the buffer storage is full. This paper proposes a DTN routing protocol, called sprayand hop-distance-based with remaining-TTL consideration (SNHD-TTL) which integrates three features: (1) binary spray; (2) hop-distance-based forwarding; and (3) node location dependent remaining-TTL message scheduling. The aim is to better deliver messages which are highly congested especially in the "island scenario." We evaluate it by simulation-based comparison with other popular protocols, namely Epidemic as a baseline and PRoPHETv2 that performs well according to our previous study. Our simulation results show that SNHD-TTL is able to outperform other routing protocols, significantly reduce overhead, and at the same time, increase the total size of delivered messages.

show abstract

Section: Forwardingmentioning

confidence: 86%

Section: Introductionmentioning

confidence: 99%

Spray Router with Node Location Dependent Remaining-TTL Message Scheduling in DTNs

Agussalim

Tsuru

2016

Journal of Information Processing

Self Cite

View full text Add to dashboard Cite

show abstract

“…The performances of DTN, and consecutively VDTN, can be measured by several Key Performance Indicators (KPIs). In this study, we utilize three commonly used KPIs in previous studies on this topic [5,6,7,8,9]. We discuss on each of them in the following subsections.…”

Section: The Key Performance Indicators (Kpis)mentioning

confidence: 99%

“…The Opportunistic Networking Environment (ONE) simulator [32] was used to evaluate the VDTN-based data collections' networking performances. As we mentioned previously, we apply three KPIs for the performance evaluation, namely Delivery Probability, Average Latency, and Overhead Ratio [5,6,7,8,9].…”

Section: Performance Evaluationmentioning

confidence: 99%

See 1 more Smart Citation

DC4LED: A Hierarchical VDTN Routing for Data Collection in Smart Cities

Singh

Bonnin

2019

2019 16th IEEE Annual Consumer Communications &Amp; Networking Conference (CCNC)

View full text Add to dashboard Cite

In smart cities, the mobility of vehicles can be used to collect data produced by connected objects and to deliver them to several applications which are delay tolerant. The Vehicular Delay Tolerant Networks (VDTN) can be utilized for such services. This paper introduces DC4LED (Data Collection for Low Energy Devices): a hierarchical VDTN routing which takes advantage of the specific mobility patterns of the various type of vehicles. It provides a low-cost delivery service for applications that need to gather data produced from the field. The idea is to propose a simple routing scheme where cars, taxis, and buses route data hierarchically in a storecarry-forward mechanism to any of the several available Internet Point-of-Presences in the city. This paper aims to explore the possibility of implementing a very simple mechanism for very simple services, as opposed to utilizing complex VDTN mechanisms proposed in the literature. Our simulations compare the performance of DC4LED routing with two legacy VDTN routing schemes which represent the extreme ends of VDTN routing spectrum: First-contact and Epidemic routing. It show that DC4LED has much lower network overhead in comparison with the two legacy routing schemes, which is advantageous for its implementation scalability. The DC4LED also maintains comparable data delivery probability and latency to Epidemic routing.

show abstract