An ad hoc network is a collection of wireless mobile hosts forming a network without the aid of any established infrastructure or centralized administration. In such an environment, it may be necessary for one mobile host to enlist the aid of other hosts in forwarding a packet to its destination due to the limited range of each mobile host\u27s wireless transmissions. Many protocols have been proposed to route packets between the hosts in such a network; The on-demand routing protocol is a well-known method. It establishes the routes and uses them only when a need arises. For wireless communication channels, the problem is further complicated by the mobility of the nodes, which induces structural changes in the routing. So, the mobility management of mobile nodes is important in mobile ad hoc networks; Clustering is a scheme to build a network control structure that increases network availability, reduces the delay in responding to changes in network state, and improves data security. It promotes more efficient use of resources in controlling large dynamic networks. Clustering is crucial for scalability as the performance can be improved by simply adding more nodes to the cluster; This thesis presents a protocol for routing in ad hoc networks that uses ad-hoc on-demand routing and also takes care of the mobility management. The protocol adapts quickly to frequent host movement, yet requires little or no overhead during periods in which hosts move less frequently. Moreover, the protocol routes packets through a dynamically established and nearly optimal path between two wireless nodes. We propose a self-organizing clustering protocol to store the routing data in multiple nodes and to distribute the routing load. It also achieves higher reliability---if a node in a cluster fails, the data is still accessible via other cluster nodes
