Modifying the MANET routing algorithm by GBR CNR-efficient neighbor selection algorithm

Abstract

In today’s worlds, Mobile Ad-Hoc Network (MANET) plays most important role in the field networks technology in the world. The MANET has been rapidly rising and becoming significant from the last decade. A MANET is a kind of wireless network which has been set-up without requirement of fixed infrastructure where mobile nodes are connected over wireless link. Due to moving nature of the devices, the network topology is unstable and will change dynamically. That’s why stable routing in MANET cannot work properly. In this research paper, a new routing algorithm is proposed to get better routing performance in the MANET. The proposed algorithm designed based on the number of neighbors in the network. Planned algorithm is the improvement of GBR-CNR-LN (GBR-CNR with less neighbors) by calculating the stay time between the selected neighbor nodes and the transmission nodes. If the stay time of sender node is more than the packet transmission time then the selected node is the efficient neighbor selection. The algorithm is implemented and results are analyzed. The results of this paper show the usefulness of the proposed algorithm. The Evaluation of AODV protocol was carried out using Python and outcome of this evaluation showed that proposed Algorithm gave better results than GBR-CNR with less neighbor in terms of End-to-End delay, Number of control message transferred(Routing Overhead) and Network Load. The proposed Algorithm (GC-ENS) decrease Average End-to-End delay 52.54 %, reduce Average Routing Overhead 60.54% and decline the Average load on Network 61.17%.