In this paper we survey various types of routing strategies proposed for wireless ad hoc networks. An a hoc network operates without a fixed infrastructure, and consists of a multitude of devices - hosts, repeaters or both. In this environment, as network size grows, multihopping over several intermediate devices to reach the final destination become prevalent, because of obstacles, spatial spectrum resue and power saving considerations. Mobility is also common in ad hoc networks, because of the nature of the applications they aer designed to support (e.g., disaster recovery, battlefield, search and rescue, sensor networks, etc.). Multihopping, mobility, large network size combined with device heterogeneity and bandwidth and battery power limitations make the design of adequate routing protocols a major challenge. In recent years, various different routing protocol "styles" have been proposed for wireless ad hoc networks. In the presentation, we will review a representative subset including traditional table-driven (distance vector, link state) protocols, reactive on-demand protocols, and location baded protocols that use position information provided by GPS. Using simultion results from the simulation platform using the PARSEC we will compare the protocols in different traffic and speed scenarios and under different performance criteria.