• Kanika Pasrija

Over the past decade or so, there has been rapid growth in wireless and mobile applications technologies. More recently, an increasing emphasis has been on the potential of infrastructure less wireless mobile networks that are easy, fast and in-expensive to set up, with the view that such technologies will enable numerous new applications in a wide range of areas. Such networks are commonly referred to as mobile ad hoc networks. In MANET, data is sent from one node to another node by using links, called path. Routing protocol is responsible to find out the path to be followed by the packets from source to destination. For MANET, there are different type of protocols are available and as per the requirement, we can use any one. Each protocol has its own criteria to find the path from source to destination. Some of researchers explored the concept of shortest path routing over ad hoc network. In this paper, we will discuss the solution given by them.

Ad-hoc network, Bellman Ford, Dijkstra, MANET, Routing Protocol, Shortest Path

"SHORTEST PATH ROUTING OVER MOBILE AD HOC NETWORKS", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.6, Issue 6, page no.679-685, June 2019, Available :http://www.jetir.org/papers/JETIR1908704.pdf

"SHORTEST PATH ROUTING OVER MOBILE AD HOC NETWORKS", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.6, Issue 6, page no. pp679-685, June 2019, Available at : http://www.jetir.org/papers/JETIR1908704.pdf