An Ad-Hoc network is a collection of wireless mobile nodes dynamically forming a temporary network without the use of any evolving network infrastructure or centralized administration. Due to the limitations of the wireless environment it may be necessary for one mobile node to enlist the need of other hosts in forwarding a packet to its destination. Thus multiple network hops may be needed for one node to exchange data with another across the network. For this purpose a routing protocol is used to discover routes between these nodes. Ad-Hoc networking has certain characteristics that impose certain new demands on the routing protocols. The most important is the dynamic topology which is a consequence of node mobility. So the protocol should be able to adapt quickly to the changing topology. Also generally the nodes in a Ad-Hoc environment have limited resources. So the main aim of the protocol should be to minimize the control traffic, like the update messages. So the protocol should be reactive, thus calculating routes upon receiving specific requests. In this project we study and compare 3 protocols - Destination Sequenced Distance Vector DSDV, Cluster Based Routing Protocol CBRP and Zone Routing Protocol ZRP. We use these protocols for different scenarios, number of nodes etc and evaluate their parameters like the packet delivery ratio, the end-to-end delay. A simulation model with MAC and physical layer models is used to study interlayer interactions and their performance implications. We use these parameters to compare these protocols. The evaluation and the comparison of these protocols show the relative performance of table-driven and demand-based protocols and will help us chooses a particular one for our use depending on the environment.