scholarly journals An Efficient Delay Tolerant Networks Routing Protocol for Information-Centric Networking

Electronics ◽  
2020 ◽  
Vol 9 (5) ◽  
pp. 839
Author(s):  
Min Wook Kang ◽  
Dong Yeong Seo ◽  
Yun Won Chung
Keyword(s):  
Routing Protocol ◽  
Content Distribution ◽  
Delay Tolerant Networks ◽  
Data Delivery ◽  
Relay Nodes ◽  
Information Centric Networking ◽  
Delivery Probability ◽  
Multiple Provider ◽  
Dtn Routing ◽  
Delay Tolerant

Delay tolerant networks (DTN) is a good candidate for delivering information-centric networking (ICN) messages in fragmented networks due to disaster. In order to efficiently deliver ICN messages in DTN, the characteristics of multiple requester nodes for the same content and multiple provider nodes for the same request should be used efficiently. In this paper, we propose an efficient DTN routing protocol for ICN. In the proposed protocol, requester information for request packet, which is called an Interest in ICN, is shared by exchanging status table with requested Data ID, requester ID, and satisfaction flag, where satisfaction flag is defined to show the delivery status of Data, so that unnecessary forwarding of Data is avoided. Data is forwarded to a more probable node by comparing average delivery predictability to a set of requesters. Performance of the proposed protocol was evaluated using simulation from the aspect of Data delivery probability and Data overhead, for varying buffer sizes, number of relay nodes, and time-to-live (TTL) of Data. The results show that the proposed protocol has better Data delivery probability, compared to content distribution and retrieval framework in disaster networks for public protection (CIDOR) and opportunistic forwarding (OF) protocols, although there is a tradeoff from the aspect of Data overhead for varying buffer sizes and number of relay nodes.

scholarly journals A Probabilistic VDTN Routing Scheme Based on Hybrid Swarm-Based Approach

2020 ◽  
Vol 12 (11) ◽  
pp. 192
Author(s):  
Youcef Azzoug ◽  
Abdelmadjid Boukra ◽  
Vasco N. G. J. Soares
Keyword(s):  
Delay Tolerant Network ◽  
Relay Nodes ◽  
Hybrid Swarm ◽  
Recovery Method ◽  
Delivery Delay ◽  
Delivery Probability ◽  
Glowworm Swarm Optimization ◽  
Dtn Routing ◽  
Metaheuristic Techniques ◽  
Delay Tolerant

The probabilistic Delay Tolerant Network (DTN) routing has been adjusted for vehicular network (VANET) routing through numerous works exploiting the historic routing profile of nodes to forward bundles through better Store-Carry-and-Forward (SCF) relay nodes. In this paper, we propose a new hybrid swarm-inspired probabilistic Vehicular DTN (VDTN) router to optimize the next-SCF vehicle selection using the combination of two bio-metaheuristic techniques called the Firefly Algorithm (FA) and the Glowworm Swarm Optimization (GSO). The FA-based strategy exploits the stochastic intelligence of fireflies in moving toward better individuals, while the GSO-based strategy mimics the movement of glowworm towards better area for displacing and food foraging. Both FA and GSO are executed simultaneously on each node to track better SCF vehicles towards each bundle’s destination. A geography-based recovery method is performed in case no better SCF vehicles are found using the hybrid FA–GSO approach. The proposed FA–GSO VDTN scheme is compared to ProPHET and GeoSpray routers. The simulation results indicated optimized bundles flooding levels and higher profitability of combined delivery delay and delivery probability.

scholarly journals Genetic Improvement of Routing Protocols for Delay Tolerant Networks

2021 ◽  
Vol 1 (1) ◽  
pp. 1-37
Author(s):  
Michela Lorandi ◽  
Leonardo Lucio Custode ◽  
Giovanni Iacca
Keyword(s):  
Routing Protocols ◽  
Genetic Improvement ◽  
Ad Hoc ◽  
Delay Tolerant Networks ◽  
Unmanned Vehicles ◽  
Test Cases ◽  
Urban Networks ◽  
Delivery Probability ◽  
Apply Genetic ◽  
Delay Tolerant

Routing plays a fundamental role in network applications, but it is especially challenging in Delay Tolerant Networks (DTNs). These are a kind of mobile ad hoc networks made of, e.g., (possibly, unmanned) vehicles and humans where, despite a lack of continuous connectivity, data must be transmitted while the network conditions change due to the nodes’ mobility. In these contexts, routing is NP-hard and is usually solved by heuristic “store and forward” replication-based approaches, where multiple copies of the same message are moved and stored across nodes in the hope that at least one will reach its destination. Still, the existing routing protocols produce relatively low delivery probabilities. Here, we genetically improve two routing protocols widely adopted in DTNs, namely, Epidemic and PRoPHET, in the attempt to optimize their delivery probability. First, we dissect them into their fundamental components, i.e., functionalities such as checking if a node can transfer data, or sending messages to all connections. Then, we apply Genetic Improvement (GI) to manipulate these components as terminal nodes of evolving trees. We apply this methodology, in silico, to six test cases of urban networks made of hundreds of nodes and find that GI produces consistent gains in delivery probability in four cases. We then verify if this improvement entails a worsening of other relevant network metrics, such as latency and buffer time. Finally, we compare the logics of the best evolved protocols with those of the baseline protocols, and we discuss the generalizability of the results across test cases.

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

Electronics ◽  
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.

A link contact duration-based routing protocol in delay-tolerant networks

2013 ◽  
Vol 19 (6) ◽  
pp. 1299-1316 ◽  
Author(s):  
Kyoung-Hak Jung ◽  
Wan-Seon Lim ◽  
Jae-Pil Jeong ◽  
Young-Joo Suh
Keyword(s):  
Routing Protocol ◽  
Delay Tolerant Networks ◽  
Contact Duration ◽  
Delay Tolerant

scholarly journals A Hop Count Based Heuristic Routing Protocol for Mobile Delay Tolerant Networks

2014 ◽  
Vol 2014 ◽  
pp. 1-12 ◽  
Author(s):  
Lei You ◽  
Jianbo Li ◽  
Changjiang Wei ◽  
Chenqu Dai ◽  
Jixing Xu ◽  
...  
Keyword(s):  
Routing Protocol ◽  
Ad Hoc ◽  
Delay Tolerant Networks ◽  
Network Partitioning ◽  
Heuristic Function ◽  
Hop Count ◽  
Dynamic Topology ◽  
Mobile Ad Hoc ◽  
Hoc Networks ◽  
Delay Tolerant

Routing in delay tolerant networks (DTNs) is a challenge since it must handle network partitioning, long delays, and dynamic topology. Meanwhile, routing protocols of the traditional mobile ad hoc networks (MANETs) cannot work well due to the failure of its assumption that most network connections are available. In this paper, we propose a hop count based heuristic routing protocol by utilizing the information carried by the peripatetic packets in the network. A heuristic function is defined to help in making the routing decision. We formally define a custom operation for square matrices so as to transform the heuristic value calculation into matrix manipulation. Finally, the performance of our proposed algorithm is evaluated by the simulation results, which show the advantage of such self-adaptive routing protocol in the diverse circumstance of DTNs.

SnLocate: A Location-Based Routing Protocol for Delay-Tolerant Networks

2021 ◽  
pp. 459-483
Author(s):  
Elizabete Moreira ◽  
Naercio Magaia ◽  
Paulo Rogério Pereira ◽  
Constandinos X. Mavromoustakis ◽  
George Mastorakis ◽  
...  
Keyword(s):  
Routing Protocol ◽  
Delay Tolerant Networks ◽  
Delay Tolerant

Multidimensional Routing Protocol in Human-Associated Delay-Tolerant Networks

2013 ◽  
Vol 12 (11) ◽  
pp. 2132-2144 ◽  
Author(s):  
Longxiang Gao ◽  
Ming Li ◽  
Alessio Bonti ◽  
Wanlei Zhou ◽  
Shui Yu
Keyword(s):  
Routing Protocol ◽  
Delay Tolerant Networks ◽  
Delay Tolerant
Sign in / Sign up

Export Citation Format

Share Document