Delay-tolerant routing and message scheduling for CR-VANETs

Wang, Jing; Zhang, Huyin; Tang, Xing; Li, Zongpeng

doi:10.1016/j.future.2020.04.026

Cited by 13 publications

(11 citation statements)

References 34 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The authors in [14] proposed a routing, message scheduling scheme and buffer management policy. For scheduling, an optimized binary tree replication algorithm is introduced.…”

Section: Related Workmentioning

confidence: 99%

“…This sub-section evaluates the proposed work with existing works to prove our proposed approach's efficacy. We compared our work with existing works such as Markov routing [14] and GWOA-GA [15]. These two algorithms have been discussed in detail in section II.…”

Section: A Comparative Analysismentioning

confidence: 99%

“…In [14], they used an optimized binary tree replication algorithm. The route is selected based on the channel availability and transmission range.…”

Section: A Comparative Analysismentioning

confidence: 99%

“…Communication overhead is the number of control messages sent to construct and manage the routes by routing protocols. We have again compared our work with two previous works, Markov routing [14] and GWOA-GA [15]. Figure 11 represents a communication overhead for a variable number of nodes.…”

Section: ) Analysis Of Communication Overheadmentioning

confidence: 99%

“…iii) The computational complexity of the Hawks location update (including searching for the best location and updating the location vector of all Markov-routing [14] 's computational complexity is O(K × N), where N is the number of nodes in CR-VANETs, and K is the number of road segments. GWOA-GA routing algorithm [15] used a whale optimization algorithm, a tree-based routing protocol, and an optimal link-state routing protocol (OLSR).…”

Section: Computational Complexitymentioning

confidence: 99%

See 4 more Smart Citations

Multi-Objective Harris Hawks Optimization Algorithm Based 2-Hop Routing Algorithm for CR-VANET

et al. 2021

View full text Add to dashboard Cite

Vehicular Ad Hoc Network (VANET) emerges to ameliorate road accident, traffic congestion, and infotainment. Cognitive radio (CR) is integrated with VANET (termed as CR-VANET) to deal with the spectrum scarcity problems. For better data transmission, routing is very important in a highly dynamic CR-VANET environment. Routing in CR-VANET has several challenges due to vehicles' high-speed movements and channel accessibility issues. This paper proposes a 2-Hop routing algorithm based on the Multi-Objective Harris Hawks Optimization (2HMO-HHO) algorithm that chooses the optimal forwarders between the source and destination vehicles. Selecting 2-hops instead of multiple hops or the entire route increases the selected route's stability and assures successful data transmission. The simulations performed in OMNeT++ with SUMO show that the proposed algorithm achieves promising results on throughput, delay, packet delivery ratio, packet loss rate and communication overhead.INDEX TERMS VANET; routing algorithm; 2-hop routing; Harris Hawks Optimization; cognitive radio; throughput; packet delivery ratio; delay; packet loss rate; communication overhead.

show abstract

“…The authors in [14] proposed a routing, message scheduling scheme and buffer management policy. For scheduling, an optimized binary tree replication algorithm is introduced.…”

Section: Related Workmentioning

confidence: 99%

Section: A Comparative Analysismentioning

confidence: 99%

“…In [14], they used an optimized binary tree replication algorithm. The route is selected based on the channel availability and transmission range.…”

Section: A Comparative Analysismentioning

confidence: 99%

Section: ) Analysis Of Communication Overheadmentioning

confidence: 99%

Section: Computational Complexitymentioning

confidence: 99%

See 3 more Smart Citations