A study of geographical routing protocols in vehicular delay tolerant networks

Chourasia, Vishakha; Kumar, Sanjay; Pandey, Sudhakar

doi:10.1504/ijvics.2019.099024

Cited by 4 publications

(2 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…• Mobility: RB-MP, 63 DABFS, 62 DHC, 64 MPBRP 65 -Hybrid TO-GO, 33 HybTGR, 34 ERTO 66 -Target destination Unicast VIRTUS, 67 Time-insensitive GeoSpray, 87 GSaR 88 2015, 86 , 2019 89 Routing strategy Proactive AOMDV 49 -Reactive IOLSR, 50 VIRTUS 67 -Hybrid ZRP 90 , HARP 91 -…”

Section: Forwarder Selection Informationmentioning

confidence: 99%

Towards general Internet of Vehicles networking: Routing protocols survey

Ksouri

Jemili

Mosbah

et al. 2020

Concurrency and Computation

View full text Add to dashboard Cite

The specific characteristics of vehicular ad hoc networks, such as high speed of nodes and frequent topology changes, impose challenges for the routing process. In addition, the advent of the Internet of Vehicles (IoV) concept along with the autonomous and connected cars contribute to the proliferation of new innovative applications with different quality of service requirements, rising new challenging issues for data transfer.In this article, we review the different taxonomies of vehicular routing protocols, while giving an insight into the design of geographical protocols. Then, we outline several optimization techniques and paradigms used to enhance the routing process. Moreover, in order to promote the deployment of robust IoV routing protocols at large scale, we provide some directions for future research work.

show abstract

Section: Forwarder Selection Informationmentioning

confidence: 99%

Towards general Internet of Vehicles networking: Routing protocols survey

Ksouri

Jemili

Mosbah

et al. 2020

Concurrency and Computation

View full text Add to dashboard Cite

show abstract

“…The lack of connection opportunities in vehicular delay tolerant networks (VDTNs) results in unstable network topology. The sparsity of contact opportunities results low delivery ratio (DR) and high delay in delivery of messages from source to destination 1–4 . Several message dissemination approaches have been proposed to overcome these issues.…”

Section: Introductionmentioning

confidence: 99%

Improving the delivery ratio in vehicular delay‐tolerant network using customized binary particle swarm optimization‐based optimized throwbox deployment

Chourasia

Pandey

Chaurasiya

et al. 2022

Concurrency and Computation

Self Cite

View full text Add to dashboard Cite

Vehicular delay tolerant networks (VDTNs) suffer due to insufficient connection opportunities in sparse infrastructure. The sparsity of the network results in poor delivery ratio (DR). Deployment of additional small nodes named throwbox increases the contact opportunities, resulting in improved performance in terms of DR. However, randomly deployed throwboxes do not provide optimum results. Therefore, this article proposes the throwbox deployment as an optimization problem. Customized binary particle swarm optimization-based optimization method is employed to solve the problem. With the objective of maximizing the DR, the method optimize the placement of k-throwboxes in the network. The performance of the proposed methods is tested and compared by simulating a VDTN model in opportunistic network environment simulator. The optimization framework was implemented in Matlab. Exhaustive experiments were carried out by varying the number of throwboxes (k). A statistical comparison of the results with the existing throwbox deployment methods validates the effectiveness of the proposed optimization-based approach. The article also presents an analysis for choice of value of k for a desired network performance.

show abstract