DTN Routing Mechanism Based on Area Dipartition

2013 ◽  
Vol 756-759 ◽  
pp. 851-854
Author(s):  
Yun Yang ◽  
Long Sheng Han ◽  
Ran Yan ◽  
Xiu Ping Kong ◽  
Wen Chun Xu
Keyword(s):  
Network Architecture ◽  
Data Transfer ◽  
Routing Algorithm ◽  
Network Routing ◽  
Message Delivery ◽  
Transfer Path ◽  
Delivery Probability ◽  
Dtn Routing ◽  
Routing Mechanism ◽  
Delay Tolerant

Delay Tolerant Networks (DTN) has been widely used in challenge networks as an emerging network architecture. Among all studies , routing mechanism is the key problem in DTN. Because of high latency and low data rate, the traditional network routing algorithm can not apply to DTN. This paper proposed a DTN routing mechanism based on area dipartition. The mechanism divided the space into several regions, and calculated the probability of occurrence of each node in each region to determine data transfer path according to the probability. Finally, the simulation results show that the mechanism can significantly enhance the message delivery probability and reduce the packet loss rate.

scholarly journals Location-assistant content distribution scheme for emergency rescue

2018 ◽  
Vol 14 (9) ◽  
pp. 155014771880046
Author(s):  
Guomin Zhang ◽  
Lihua Song ◽  
Haitao Wang ◽  
Chao Hu ◽  
Na Wang
Keyword(s):  
Content Distribution ◽  
Routing Algorithm ◽  
Mobility Model ◽  
Network Routing ◽  
Delay Tolerant Network ◽  
Message Delivery ◽  
Emergency Rescue ◽  
Course Of Action ◽  
Distribution Scheme ◽  
Delay Tolerant

In order to optimize the timeliness and pertinence of message delivery in emergency rescue scenarios and improve the service performance of emergency communications network, we propose a location-assistant content distribution scheme based on delay tolerant network. First of all, considering that the movement patterns of rescue teams tend to follow a predetermined course of action, we design a location-based group mobility model. Due to the intermittent network connectivity and variety of emergency service, a content-classification-based publish/subscribe architecture and a GenericSpray routing algorithm based on the prediction of overlap opportunity in spatio-temporal positions are proposed. Furthermore, we also give a cache management strategy based on the content significance. Since location-assistant content distribution scheme can predict the overlap of activity between rescue teams through the course of action, not only can the number of copy forwarding and message delivery delays be significantly reduced but also the priority delivery of important messages can be ensured by message classification. Simulation experiments show that compared with the traditional delay tolerant network routing algorithm and the classic first-in-first-out caching strategy, location-assistant content distribution scheme improves the performance of message delivery rate, transmission delay, and control overhead significantly.

Network Routing Mechanism Simulation Research Based on VANETs

2014 ◽  
Vol 651-653 ◽  
pp. 1868-1874
Author(s):  
Li Zhu ◽  
Lan Bai
Keyword(s):  
Routing Protocol ◽  
Vehicular Networks ◽  
Routing Algorithm ◽  
Dynamic Network ◽  
Network Routing ◽  
On Demand ◽  
Routing Mechanism ◽  
Demand Routing ◽  
On The Road ◽  
Low Efficiency

VANETs is a rapid developed wireless mobile MANETs network with special challenge nature. It is a distributed and self-organized communication network based on moving vehicle. This network has characteristics like limited bandwidth, strong mobility, strong dynamic network topology, limited node degrees freedom, equipment capacity constraints and weak physical security. These characteristics usually make typical routing protocol in mobile MANET show a low efficiency in mobile VANETs, even fail. MANET routing algorithm is roughly divided into two categories, namely table driven routing protocol and on-demand routing protocol. It is due to the particularity of driving cars on the road. So how to improve network routing protocol in the performance is now a challenging problem. The purpose of this article studies network routing mechanism based on wireless vehicular networks simulation method. On the basis of analyzing the performance of typical routing protocols in MANET, such as DSDV, AODV and DSR, the improved scheme of AODV on-demand routing algorithm is put forward.

scholarly journals A Framework and Mathematical Modeling for the Vehicular Delay Tolerant Network Routing

2016 ◽  
Vol 2016 ◽  
pp. 1-14 ◽  
Author(s):  
Mostofa Kamal Nasir ◽  
Rafidah Md. Noor ◽  
Mohsin Iftikhar ◽  
Muhammad Imran ◽  
Ainuddin Wahid Abdul Wahab ◽  
...  
Keyword(s):  
Vehicular Ad Hoc Networks ◽  
Network Routing ◽  
Packet Delivery Ratio ◽  
Packet Transmission ◽  
Delay Tolerant Network ◽  
Delivery Ratio ◽  
Intermediate Node ◽  
Packet Delivery ◽  
Dtn Routing ◽  
Delay Tolerant

Vehicular ad hoc networks (VANETs) are getting growing interest as they are expected to play crucial role in making safer, smarter, and more efficient transportation networks. Due to unique characteristics such as sparse topology and intermittent connectivity, Delay Tolerant Network (DTN) routing in VANET becomes an inherent choice and is challenging. However, most of the existing DTN protocols do not accurately discover potential neighbors and, hence, appropriate intermediate nodes for packet transmission. Moreover, these protocols cause unnecessary overhead due to excessive beacon messages. To cope with these challenges, this paper presents a novel framework and an Adaptive Geographical DTN Routing (AGDR) for vehicular DTNs. AGDR exploits node position, current direction, speed, and the predicted direction to carefully select an appropriate intermediate node. Direction indicator light is employed to accurately predict the vehicle future direction so that the forwarding node can relay packets to the desired destination. Simulation experiments confirm the performance supremacy of AGDR compared to contemporary schemes in terms of packet delivery ratio, overhead, and end-to-end delay. Simulation results demonstrate that AGDR improves the packet delivery ratio (5–7%), reduces the overhead (1–5%), and decreases the delay (up to 0.02 ms). Therefore, AGDR improves route stability by reducing the frequency of route failures.

scholarly journals Vehicular Delay Tolerant Network Routing Algorithm Based on Bayesian Network

IEEE Access ◽  
2020 ◽  
Vol 8 ◽  
pp. 18727-18740 ◽  
Author(s):  
Jiagao Wu ◽  
Yahang Guo ◽  
Hongyu Zhou ◽  
Lu Shen ◽  
Linfeng Liu
Keyword(s):  
Bayesian Network ◽  
Routing Algorithm ◽  
Network Routing ◽  
Delay Tolerant Network ◽  
Delay Tolerant

Validation of Fuzzy-Based Routing Algorithm for DTN

2014 ◽  
Vol 644-650 ◽  
pp. 1931-1934
Author(s):  
Fan Yang ◽  
Jia Zhe Lai ◽  
Ming Zhe Li
Keyword(s):  
Routing Algorithm ◽  
Simulation Software ◽  
Delay Tolerant Network ◽  
Research Issue ◽  
Network Environment ◽  
Opportunistic Network ◽  
Dtn Routing ◽  
Delay Tolerant ◽  
Spray And Wait

In the research of Delay Tolerant Network (DTN), DTN routing algorithm is a key research issue. The performance of a non-flooding routing algorithm is verified in our paper. The verified algorithm is an Adaptive Priority Routing Algorithm (APRA) which is based on fuzzy strategies. Firstly, we introduce the principle of APRA, then using Opportunistic Network Environment (ONE) -simulation software to compare the performance of Epidemic algorithm, Spray and Wait algorithm, PRoPHET algorithm and APRA. By comparing overhead of netword, rate of messages delivered and average dealy, it finds that the APRA performs better. At last, the weaknesses of this paper and further improvement are also discussed.

scholarly journals A Routing Algorithm for the Sparse Opportunistic Networks Based on Node Intimacy

2021 ◽  
Vol 2021 ◽  
pp. 1-9
Author(s):  
Gang Xu ◽  
Xinyue Wang ◽  
Na Zhang ◽  
Zhifei Wang ◽  
Lin Yu ◽  
...  
Keyword(s):  
Routing Algorithm ◽  
Opportunistic Networks ◽  
Network Routing ◽  
Routing Algorithms ◽  
Time Slice ◽  
Message Delivery ◽  
Opportunistic Network ◽  
Network Resources ◽  
Subsequent Time

Opportunistic networks are becoming more and more important in the Internet of Things. The opportunistic network routing algorithm is a very important algorithm, especially based on the historical encounters of the nodes. Such an algorithm can improve message delivery quality in scenarios where nodes meet regularly. At present, many kinds of opportunistic network routing algorithms based on historical message have been provided. According to the encounter information of the nodes in the last time slice, the routing algorithms predict probability that nodes will meet in the subsequent time slice. However, if opportunistic network is constructed in remote rural and pastoral areas with few nodes, there are few encounters in the network. Then, due to the inability to obtain sufficient encounter information, the existing routing algorithms cannot accurately predict whether there are encounters between nodes in subsequent time slices. For the purpose of improving the accuracy in the environment of sparse opportunistic networks, a prediction model based on nodes intimacy is proposed. And opportunistic network routing algorithm is designed. The experimental results show that the ONBTM model effectively improves the delivery quality of messages in sparse opportunistic networks and reduces network resources consumed during message delivery.

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 Delay-Tolerant Network Routing Algorithm for Periodical Mobile Nodes

2014 ◽  
Vol 15 (1) ◽  
pp. 1-9 ◽  
Author(s):  
Youngse Lee ◽  
Gowoon Lee ◽  
Hangki Joh ◽  
Intae Ryoo
Keyword(s):  
Routing Algorithm ◽  
Network Routing ◽  
Delay Tolerant Network ◽  
Mobile Nodes ◽  
Delay Tolerant

scholarly journals Analisis Performansi Algoritma Routing First Contact dengan Stationary Relay Node pada Delay Tolerant Network

2018 ◽  
Vol 4 (2) ◽  
pp. 123 ◽  
Author(s):  
LEANNA VIDYA YOVITA ◽  
JODI NUGROHO RESTU
Keyword(s):  
Routing Algorithm ◽  
Relay Node ◽  
Routing Algorithms ◽  
Delay Tolerant Network ◽  
Delivery Probability ◽  
Average Latency ◽  
End To End ◽  
Delay Tolerant ◽  
First Contact ◽  
Overhead Ratio

ABSTRAKAlgoritma routing pada jaringan klasik dapat berjalan jika hubungan end-to-end selalu ada.Algoritma routing ini bekerja dengan menggunakan informasi mengenai seluruh jalur yang tersedia.Untuk itu, pada jaringan dengan kondisi ekstrim seperti ini diperlukan algoritma routing yang sesuai.Salah satu algoritma routing yang dapat dijalankan pada Delay Tolerant Network (DTN) adalah First Contact.Algoritma iniakanmelakukan penggandaan pesan yang dibawanyauntuk kemudian diberikan kepada node lainnya yang pertama kali ditemui.Dalam penelitian ini ditambahkan stationary relay node untuk meningkatkan delivery probability.Dengan penambahan stationary relay node diperoleh peningkatan delivery probability 2 hingga 6% dibandingkan dengan jaringan tanpa stationary relay node. Parameter overhead ratio meningkat  sebesar 7-18% dibandingkan jaringan tanpa Stationary relay node. Algoritma First Contact dengan tambahan Stationary relay nodejuga memberikan tambahan average latency, 118 – 171 detik.Nilaiini berbanding lurus dengan jumlah mobile node DTN yang ada pada area tersebut.Kata kunci: Delay Tolerant Network, first contact,Stationaryrelaynode, routing algorithm, delivery probability, overhead ratio, average latency.ABSTRACTClassical routing algorithms only works if there is end to end connection.This algorithms uses the information about every available path, and then choose the best path related to spesific metric.. For the networks with the extreme condition, it is needed the suitable routing alorithms. One of the routing algorithms that is able to be applicated in Delay Tolerant Network (DTN) is First Contact. This algorithm will make a single copy message and then forward it to the first encountered node. In this research, the stationaryrelaynodes were added to improve delivery probability. The effect of adding stationary relay node is increasing the delivery probability about 2-6%, compared to networks without stationary relay node. The overhead ratio increased about  7-18% compared to networks without stationary relay node. First Contact algorithm with stationary relay node gives bigger average latency, 118 – 171 second. This value is directly proportional to the number of mobile DTN nodes that exist in the area.Keywords: Delay Tolerant Network, first contact, Stationaryrelaynode, routing algorithm, delivery probability, overhead ratio, average latency.. 

Sign in / Sign up

Export Citation Format

Share Document