A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2003; you can also visit the original URL.
The file type is
Wireless ad hoc networks are becoming increasingly important in today's world. The most challenging problem of ad hoc networking is routing, where the trajectory of the packets traveling over the network needs to be determined. For large-scale ad hoc networks scalability of the routing approach is extremely important; one of the approaches to scale up ad hoc routing is geographical location based routing. In this paper, a new routing algorithm is proposed which does not require all but a subsetdoi:10.1109/percom.2003.1192781 dblp:conf/percom/ZarubaCS03 fatcat:ej3cw3kptrhojnwod5z3by3o3y