A New Scheme of Routing in Mobile Ad hoc Networks for Reducing Delay and Finding Shortest Path

Abstract

Wireless networks offer more flexibility and adapt easily to changes in the configuration of the network. Wireless ad hoc network is a decentralized type of wireless network. Mobile ad hoc network is a type of ad hoc network, in which each and every node can change its location. Frequent link breakages exist due to its high mobility of nodes which leads to frequent path failures and route discoveries. An efficient and fundamental data dissemination mechanism is broadcasting, the mobile node blindly rebroadcasts the first received route request, even if there is no route to destination leads to broadcast storm problem.. In this paper a hybrid protocol is proposed, which combines the advantages of neighbor coverage based probabilistic rebroadcast protocol and adhoc on demand distance vector routing protocol and is simulated by Network Simulator. The neighbor coverage and probabilistic mechanism significantly decreases the number of retransmissions so as to reduce the routing overhead. Adhoc on demand distance vector routing protocol finds the shortest path to destination by evaluating the hop count. The shortest path reduces the average end to end delay more effectively. Thus hybrid protocol improves the routing performance.