Skip to Main Content
Mobile Ad hoc networks are self-organizing and self-configuring multi hop wireless networks where, the structure of the network changes dynamically. Since a destination node might be out of range of a source node, a routing procedure is always needed to find a path, so as to forward the packets appropriately between the source and the destination. This paper proposes a new approach to evolve a suitable algorithm along with a brief review of the state of the art scenario of routing topologies for mobile ad hoc networks. This paper suggests an approach to minimize the routing overhead and focuses to on finding the shortest route to deliver the packet from source to destination and also minimize the time delay for finding the route.