Ad hoc networks have been extensively deployed in recent years. In such networks, obtaining a high efficiency is difficult to achieve due to mobility. Many routing approaches have been proposed to improve the performance of ad hoc networks, including table-driven and demanddriven routing protocols. Table-driven algorithms, maintain routing paths even when they are not currently in use. Hence, such algorithms typically waste large amounts of memory in storing possibly redundant data routes. By contrast, demand-driven approaches maintain routes only for so long as they are required. In an alternative approach known as geographic routing, a source only needs to know the location of the destination node and its one-hop neighbors to make a forwarding decision. Consequently, the need to establish and maintain routes between nodes is avoided. Geographic routing provides a suitable solution for large-scale and dynamic networks, and reduces link failure problems during packet routing.