In this paper, we present an algorithm for routing in wireless ad hoc networks using information about geographical location of the nodes. We assume each node knows its geographical position and the position of the node to which it wants to send a packet. Initially, the nodes only know their neighbors but over time they discover other nodes in the network. The routing table at a node S is a list ((pi, Si)) where pi is a geographical position and Si is a neighbor of node 5’. When node S receives a packet for a node D at position pos(D), it finds the pi in its routing table which is closest...