z-logo
open-access-imgOpen Access
An improved harmony search algorithm for optimized link state routing protocol in vehicular ad hoc network
Author(s) -
Mustafa Raad Hammoodi,
Ravie Chandren Muniyand
Publication year - 2018
Publication title -
international journal of engineering and technology
Language(s) - English
Resource type - Journals
ISSN - 2227-524X
DOI - 10.14419/ijet.v7i2.14.12820
Subject(s) - optimized link state routing protocol , computer science , computer network , vehicular ad hoc network , mobile ad hoc network , wireless ad hoc network , ad hoc wireless distribution service , routing protocol , network packet , distributed computing , wireless , telecommunications
Vehicle Ad-hoc Network (VANET) is a direct application of Mobile Ad-hoc Network (MANET). Nodes in VANET are vehicles that communicate using vehicle to vehicle (V2V) or vehicle to infrastructure (V2I). These types of communications have led to the emergence of various applications that provide safer driving. Due to the high changing of topology and frequent fragmentation of VANET, routing pack-ets in this type of network is a hard task. In this work, the authors deal with the well-known MANET proactive Optimized Link State Rout-ing protocol (OLSR). The deployment of OLSR in VANET gives the moderate performance; this is due to its necessity of constant ex-changing of control packets. The performance of OLSR is highly dependent on its parameters, thus finding optimal parameters configura-tions that best fit VANETs environment and improves the network is essential before its deployment. Therefore, this research proposes a modified Harmony Search optimization (HSO) by incorporating selection methods in its memory consideration; roulette wheel selection to obtain fine-tuned OLSR for high density and velocity scenario. The experimental analysis showed that the OLSR with the proposed ap-proach acquired promising results regarding packet delivery ratio, end-to-end delay and overhead when compared with previous approaches.  

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here