In mobile ad hoc networks, routing protocols are becoming more complicated and problematic. Routing in mobile ad hoc networks is multi-hop because of the limited communication range of wireless radios. Since nodes in the network can move freely and randomly, an efficient routing protocol is needed in order for such networks to be able to perform well in such an environment. In this environment the routing strategy is applied such that it is flexible enough to handle large populations and mobility and be able to minimize the use of the battery. Also it should be designed to achieve maximum packet delivery ratio. Further more, the routing protocol must perform well in terms of fast convergence, low routing delay, and low control overhead traffic. In this paper an improved implementation of the Fisheye State Routing (FSR) protocols is presented, where a new selection routing criteria that utilizes a minimum number of hops is a selection metric. The results obtained from simulation indicate that the fewer number of hops used the better and more efficient the output for packet delivery ratio was generated.
Manet Routing Protocols
Existing wireless routing schemes can be classified into four categories: (a) distance vector based, (b) link state (LS) based, (c) on-demand based, and (d) location based. Historically, the first type of routing scheme used in early packet networks, such as the ARPANET, was the distance vector type. The main advantages of the distance vector approach are simplicity and computation efficiency. However, this approach suffers from slow convergence and a tendency to create routing loops. While several approaches were proposed that solve the looping problem (Murthy & Garcia-Luna Aceves, 1996; Bhagwat, 1994). None of them overcome the problem of slow convergence. The solutions to both convergence and looping come in the form of the LS approach. LS is the preferred scheme for wired nets. In LS, global network topology information is maintained in all routers by the periodic flooding of LS updates by each node. Any link change triggers an immediate update. As a result, the time required for a router to converge to the new topology is much less than in the distance vector approach. Due to global topology knowledge, preventing a routing loop is also easier.