We present Greedy Perimeter Stateless Routing (GPSR), a novel routing protocol for wireless datagram networks that uses the positions of routers and a packet’s destination to ma...
Wireless sensor networks are collections of large number of sensor nodes. The sensor nodes are featured with limited energy, computation and transmission power. Each node in the n...
— Several problems are required to be fixed in order to apply geographical routing protocol Greedy Perimeter Stateless Routing (GPSR) in wireless sensor networks. First, GPSR is...
We propose a new routing graph, the Restricted Delaunay Graph (RDG), for ad hoc networks. Combined with a node clustering algorithm, RDG can be used as an underlying graph for geo...
Jie Gao, Leonidas J. Guibas, John Hershberger, Li ...
Existing geographic routing algorithms depend on the planarization of the network connectivity graph for correctness, and the planarization process gives rise to a welldefined no...