Open AccessAn Optimal Network Selection and Efficient Two Level Cluster-Based Routing Mechanisms for Seamless Vertical Handover in Vehicular Networks
Author(s) -
S.Angelin Sophy*,
Dr.I. Laurence Aroquiaraj
Publication year - 2019
Publication title -
international journal of innovative technology and exploring engineering
Language(s) - English
Resource type - Journals
ISSN - 2278-3075
DOI - 10.35940/ijitee.b8133.129219
Subject(s) - computer science , handover , computer network , node (physics) , routing (electronic design automation) , vehicular ad hoc network , network packet , wireless ad hoc network , routing protocol , destination sequenced distance vector routing , distributed computing , link state routing protocol , wireless , engineering , telecommunications , structural engineering
Mobile Ad Hoc Network includes the crucial type Vehicular Ad-hoc Networks, (VANET). In this developed work, nodes are considered from vehicles and transmission capabilities are outfitted with its interconnected vehicles forming a network. Roadside equipment is fixed as all vehicles nearby are equipped with fixed equipment thus enabled communications in real-life application of VANET. In existing methodologies, designs of mobility are required by VANET specifically from Vertical Hand Over decision approach. This fails as of failure in links in networks on focusing issues. Thus, in dissemination of networks, routing is mandatory. Hence, our designed work of Effective two-layer cluster based Routing Mechanism is implemented in VANET to diminish the problems of failures in link. So, hybrid model is incorporated with Biogeography-Based Optimization (BBO) for choosing best available network done and process of vertical handover are done by ant colony optimization. Specific node for vertical handover is chosen based on the weight value from the hybrid model and deploys the SVM classification. On unsteady shape of topology, Effective Two-Level Cluster-based Routing Mechanism is used for maintenance of route. Initially, two clusters are formed with both links as strong and weak from divided nodes to perform routing among cluster members and the best route is chosen by greedy algorithm. High packet delivery ratio and low end to end delay is attained in this proposed approach from the analyzed results against existing methods.