An ad hoc network is a collection of wireless mobile nodes dynamically forming a temporary network without the use of any existing network infrastructure or centralized administration. Due to the limited transmission range of wireless network interfaces, multiple network "hops " may be needed for one node to exchange data with another across the network. In recent years, a variety of new routing protocols targeted specifically at this environment have been developed, but little performance information on each protocol and no realistic performance comparison between them is available. This paper presents the results of a detailed packet-level simulation comparing four multi-hop wireless ad hoc network routing protocols that cover a range of design choices: DSDV, TORA, DSR, and AODV. We have extended the ns-2 network simulator to accurately model the MAC and physical-layer behavior of the IEEE 802.11 wireless LAN standard, including a realistic wireless transmission channel model, and present the results of simulations of networks of 50 mobile nodes. 1

In this paper, we describe our experiences building a multi-hop wireless ad hoc network of 8 nodes driving around a 700 m by 300 m site. Each node runs the Dynamic Source Routing (DSR) protocol and interfaces seamlessly with existing Internet infrastructure and the Mobile IP protocol. The issues discussed in this paper range from logistical and management issues, to protocol design and performance analysis issues. We also present an early characterization of the testbed performance, and describe a significant new challenge for ad hoc network routing protocols. The major goal of the paper, however, is to share our

Much progress has been made toward solving the problem of routing packets inside an ad hoc network, but there are presently no complete proposals for connecting ad hoc networks together to form larger networks, or for integrating them with wired internets. This paper describes a technique that allows a single ad hoc network to span across heterogeneouslink layers. Using this technique, we can both integrate ad hoc networks into the hierarchical Internet and support the migration of mobile nodes from the Internet into and out of ad hoc networks via Mobile IP. Taken together, these solutions improve the scalability of flat ad hoc networks by introducing hierarchy, and they enable all nodes participating in the ad hoc network to be reachable from anywhere in the world. We have implemented each of the solutions in a real testbed of 8 nodes using the Dynamic Source Routing (DSR) protocol. Generalizing our solutions, we describe several abstract scenarios and present our ideas for solving them.

An ad-hoc network is a self-supporting collection of mobile nodes that happen to exist within a close proximity in an interval of time. The adhoc networks use a set of rules for transforming the data from one wireless station to another wireless station which we call as routing protocols. In recent years, many routing protocols have been developed, but the information about the evaluation of performance of these routing protocols is not fully understandable. In our paper we are going to propose a benchmark which will take atmost constraints i.e. (Network