Evaluating DTN Routing Performance with Random Contact Misses

Mobility models are drawing increasing attention since it plays an indispensable role in delay tolerant networks performance evaluation (e.g., routing performance evaluation). Random Waypoint with Base Point (RWPBP) mobility model aims to model the movement characteristics in catastrophe rescue scenario. RWPBP mobility model can represent different movement styles according to different parameters. In this paper, we consider the traffic scenario that all the data generated by the nodes need to be sent to the base point, and evaluate the performance of the five DTN routing protocols (i.e., DirectDelivery, Epidemic, PROPHET, SpayAndWait and FirstContact) under the RWPBP mobility model with different parameters. Epidemic performs best in our experiment, since the traffic is not heavy in catastrophe rescue scenario.

Download Full-text

Comment on “DIO Suppression Attack Against Routing in the Internet of Things”

10.36227/techrxiv.11346335.v1 ◽

2019 ◽

Author(s):

Abhishek Verma ◽

Virender Ranga

Keyword(s):

Internet Of Things ◽

Network Topology ◽

Impact Analysis ◽

The Internet ◽

Routing Performance ◽

Routing Attack ◽

The Internet Of Things ◽

Specific Reason

<div>We have thoroughly studied the paper of Perazzo et al., which presents a routing attack named DIO suppression attack with its impact analysis. However, the considered simulation grid of size 20mx20m does not correspond to the results presented in their paper. We believe that the incorrect simulation detail needs to be rectified further for the scientific correctness of the results. In this comment, it is shown that the suppression attack on such small sized network topology does not have any major impact on routing performance, and specific reason is discussed for such behavior.</div>

Download Full-text

An Efficient Routing Protocol with Overload Control for Group Mobility in Delay-Tolerant Networking

Electronics ◽

10.3390/electronics10040521 ◽

2021 ◽

Vol 10 (4) ◽

pp. 521

Author(s):

Min Wook Kang ◽

Yun Won Chung

Keyword(s):

Routing Protocol ◽

Overload Control ◽

Group Mobility ◽

Movement Model ◽

Delay Tolerant Networking ◽

Group Movement ◽

Dtn Routing ◽

Military Networks ◽

Delay Tolerant ◽

Stable Routing

In delay-tolerant networking (DTN), messages are delivered to destination nodes by using opportunistic contacts between contact nodes, even if stable routing paths from source nodes to destination nodes do not exist. In some DTN network environments, such as military networks, nodes movement follows a group movement model, and an efficient DTN routing protocol is required to use the characteristics of group mobility. In this paper, we consider a network environment, where both intra- and intergroup routing are carried out by using DTN protocols. Then, we propose an efficient routing protocol with overload control for group mobility, where delivery predictability for group mobility is defined and proactive overload control is applied. Performance evaluation results show that the proposed protocol had better delivery ratios and overhead ratios than compared protocols, although the delivery latency was increased.

Download Full-text

A Social-Based DTN Routing in Cooperative Vehicular Sensor Networks

International Journal of Cooperative Information Systems ◽

10.1142/s0218843017410039 ◽

2018 ◽

Vol 27 (01) ◽

pp. 1741003 ◽

Cited By ~ 2

Author(s):

Tong Wang ◽

Yongzhe Zhou ◽

Xibo Wang ◽

Yue Cao

Keyword(s):

Information System ◽

Sensor Networks ◽

High Speed ◽

Delivery Ratio ◽

Dtn Routing ◽

Replication Strategy ◽

Social Metrics ◽

Routing Mechanism ◽

Network Overhead ◽

Overhead Ratio

As a cooperative information system, vehicles in Vehicular Sensor Networks deliver messages based on collaboration. Due to the high speed of vehicles, the topology of the network is highly dynamic, and the network may be disconnected frequently. So how to transfer large files in such network is worth considering. The encountering nodes which never meet before flood messages blindly cause tremendous network overhead. We address this challenge by introducing the Encounter Utility Rank Router (EURR) based on social metrics. EURR includes three cases: Utility Replication Strategy, Lifetime Replication Strategy and SocialRank Replication Strategy. The Lifetime Replication is promising and complements Utility Replication. It enhances the delivery ratio by relaying the copy via the remaining lifetime. Considering the network overhead, the SocialRank Replication replicates a copy according to the SocialRank when two communicating nodes have not met before. The routing mechanism explores the utility of history encounter information and social opportunistic forwarding. The results under the scenario show an advantage of the proposed EURR over the compared algorithms in terms of delivery ratio, average delivery latency and overhead ratio.

Download Full-text