Mobile node operates not only as a host but also as a router, forwarding packets for other mobile nodes in the network that may not be within direct wireless transmission range of each other. Each node participates in an ad hoc routing protocol that allows it to discover “multi-hop” paths through the network to any other node.

In Table-driven routing protocols each node maintains one or more tables containing routing information to every other node in the network. All nodes update these tables so as to maintain a consistent and up-to-date view of the network. Because of multiple and diverse ad hoc protocols there is an obvious need for a general taxonomy to classify protocols considered. Traditional classification is to divide protocols to table-driven and to source-initiated on-demand driven protocols [1].

The Destination-Sequenced Distance-Vector (DSDV) Routing Algorithm [2] is based on the idea of the classical Bellman-Ford Routing Algorithm with certain improvements.

The Wireless Routing Protocol (WRP) [3] is a table-based distance-vector routing protocol. Each node in the network maintains a Distance table, a Routing table, a Link-Cost table and a Message Retransmission list. The Wireless Routing Protocol (WRP) [4] is a proactive, destination-based protocol. WRP belong to the class of path finding algorithms.

Global State Routing (GSR) [5] is similar to DSDV. It takes the idea of link state routing but improves it by avoiding flooding of routing messages. Global State Routing (GSR) [6] is a uniform, topology oriented, proactive routing protocol. It is a variant of traditional link-state protocols; in which each node send slink-state information to every node in the network each time its connectivity changes.

Fisheye State Routing (FSR) [7] is an improvement of GSR. The large size of update messages in GSR wastes a considerable amount of network bandwidth. In FSR, each update message does not contain information about all nodes. Instead, it exchanges information about closer nodes more frequently than it does about farther nodes thus reducing the update message size.

2

protocol proposed for ad hoc mobile networks. We analyzed that any particular algorithm or class of algorithm is not the best for all scenarios; each protocol has specific advantages and disadvantages. Ad hoc mobile networks is rapidly growing and changing, and while there are still many challenges that need to be met, it is likely that such networks will see widespread.

[1] E.M. Royer, C-K. Toh, A Review of Current Routing Protocols for Ad-Hoc Mobile Wireless Networks, IEEE Personal Communications Magazine, April 1999, pp. 46-55. [2] C.E. Perkins and P. Bhagwat, "Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for Mobile Computers", Comp. Comm. Rev., Oct. 1994, pp.234-244. [3] S. Murthy and J.J. Garcia-Luna-Aceves, "An Efficient Routing Protocol for Wireless Networks", ACM Mobile Networks and App. J., Special Issue on Routing in Mobile Communication Networks, Oct. 1996, pp. 183-97. [4] S. Murphy, J.J. Garcia-Luna-Aceves, “An Efficient Routing Protocol for Wireless Networks”, ACM Mobile Networks and Applications Journal, pages 183-197, Nov.1996. [5] Tsu-Wei Chen and Mario Gerla, "Global State Routing: A New Routing Scheme for Ad-hoc Wireless Networks" Proc. IEEE ICC'98, 5 pages. [6] T. Chen, M. Gerla, “Global State Routing: A new Routing Scheme for Ad-Hoc Wireless Networks”, Proceedings of IEEE ICC’98, pages 171-175, August 1998.