Utility-Based Delay Tolerant Networking Routing Protocol in VANET

Author(s):  
Yongliang Sun ◽  
Yinhua Liao ◽  
Kanglian Zhao ◽  
Weixiao Meng
Electronics ◽  
2021 ◽  
Vol 10 (4) ◽  
pp. 521
Author(s):  
Min Wook Kang ◽  
Yun Won Chung

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.


2013 ◽  
Vol 19 (6) ◽  
pp. 1299-1316 ◽  
Author(s):  
Kyoung-Hak Jung ◽  
Wan-Seon Lim ◽  
Jae-Pil Jeong ◽  
Young-Joo Suh

Author(s):  
Lars Baumgartner ◽  
Paul Gardner-Stephen ◽  
Pablo Graubner ◽  
Jeremy Lakeman ◽  
Jonas Hochst ◽  
...  

2014 ◽  
Vol 2014 ◽  
pp. 1-12 ◽  
Author(s):  
Lei You ◽  
Jianbo Li ◽  
Changjiang Wei ◽  
Chenqu Dai ◽  
Jixing Xu ◽  
...  

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.


Sign in / Sign up

Export Citation Format

Share Document