Development of Optimal Routing Algorithms In Ad Hoc Networks

Abstract

newlineWith the increasing demands of wireless services, the existence of wireless networks is newlinesignificant. Due to a fixed infrastructure in traditional wireless networks there arises some newlineproblems like more cost of deployment, more hardware requirement, and more time required newlinefor establishing the communication. This makes the traditional wireless networks unsuitable. newlineTherefore, for a dynamic environment and for mission-critical applications, the ad-hoc newlinewireless networks are of keen interest for the research exploration. The ad-hoc wireless newlinenetworks are infrastructureless networks that work without any central coordination. In these newlinenetworks, nodes are very dynamic and every node acts as a router. Due to dynamic nature of newlinethe nodes and bandwidth constraints, the ad-hoc wireless network routing is more complex as newlinecompared to routing in traditional wireless networks. Therefore, in ad-hoc wireless networks, newlinevarious approaches are used for the performance improvement of the routing protocol. newline