The design of efficient routing protocols for dynamical changing network topologies is a
crucial part of building power-efficient and scalable ad hoc wireless networks. If position …

Geographic routing algorithms use position information for making packet forwarding
decisions. Unlike topological routing algorithms, they do not need to exchange and maintain …

Geographic routing protocols base their forwarding decisions on the location of the current
device, its neighbors, and the packets destination. Early proposed heuristic greedy routing …

Greedy geographic routing is attractive for large multi-hop wireless networks because of its
simple and distributed operation. However, it may easily result in dead ends or hotspots …

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 …

Geographic ad hoc networks use position information for routing. They often utilize stateless
greedy forwarding and require the use of recovery algorithms when the greedy approach …

Wireless ad hoc routing has been extensively studied and many clever schemes have been
proposed over the last several years. One class of ad hoc routing is geographic routing …

Routing protocols for mobile ad-hoc networks can be broadly classified as position-based
(geographic) and topology-based. Geographic routing uses location information of nodes to …

In this paper, we propose a new geographic routing algorithm that alleviates the effect of
location errors on routing in wireless ad hoc networks. In most previous work, geographic …

Highly dynamic topology is a fundamental characteristic of mobile ad hoc networks. For this
reason, maintaining a consistent state for routing purposes can be a very difficult task. The …