A Multi-Hop Relay Based Routing Algorithm for Vehicular Visible Light Communication Networks

Yin, Rui; Ghassemlooy, Zabih; Zhao, Ning; Yuan, Huaili; Raza, Mohsin; Eso, Elizabeth; Zvánovec, Stanislav

doi:10.1109/csndsp49049.2020.9249630

Cited by 5 publications

(1 citation statement)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A new routing metric is used to find how suitable a communication link to route information between the nodes. The routing metric considers communication link quality on the basis of received optical power p r [36], which is mathematically defined in Equation (10).…”

Section: Derivation Of Fitness Functionmentioning

confidence: 99%

Dynamic Route Discovery Using Modified Grasshopper Optimization Algorithm in Wireless Ad-Hoc Visible Light Communication Network

Vadivel¹,

Konda²,

Balmuri³

et al. 2021

Electronics

View full text Add to dashboard Cite

In recent times, visible light communication is an emerging technology that supports high speed data communication for wireless communication systems. However, the performance of the visible light communication system is impaired by inter symbol interference, the time dispersive nature of the channel, and nonlinear features of the light emitting diode that significantly reduces the bit error rate performance. To address these problems, many environments offer a rich infrastructure of light sources for end-to-end communication. In this research paper, an effective routing protocol named the modified grasshopper optimization algorithm is proposed to reduce communication interruptions, and to provide alternative routes in the network without the need of previous topology knowledge. In this research paper, the proposed routing protocol is implemented and analyzed using the MATLAB environment. The experimental result showed that the proposed routing protocol adapts to dynamic changes in the communication networks, like obstacles and shadows. Hence, the proposed protocol achieved better performance in data transmission in terms of throughput, packet delivery ratio, end-to-end delay, and routing overhead. In addition, the performance is analyzed by varying the number of nodes like 50, 100, 250, and 500. From the experimental analysis, the proposed routing protocol achieved maximum of 16.69% and minimum of 2.20% improvement in packet delivery ratio, and minimized 0.80 milliseconds of end-to-end delay compared to the existing optimization algorithms.

show abstract

Section: Derivation Of Fitness Functionmentioning

confidence: 99%