On reducing the computational cost of Geographic Routing1

The Geographic Routing project at Rutgers University attempts to answer the question of how to efficiently transport data packets through an internetwork using only geographic information. Our process uses arbitrary geographical regions (denoted by longitude and latitude) instead of logical computer addresses as the criteria to route a packet. This paper endeavors to reduce the overall computational cost of geographically routing a packet and the methods devised to do so are herein detailed. These methods were tested using event-driven network simulation. In particular, among the results discovered is the ratio of the contribution of pruning and polygon intersection to the network-wide cost of a geocast.