Efficient geographic routing in multihop wireless networks

Abstract

We propose a new link metric called normalized advance (NADV) for geographic routing in multihop wireless networks. NADV selects neighbors with the optimal trade-off between proximity and link cost. Coupled with the local next hop decision in geographic routing, NADV provides an adaptive and efficient costaware routing strategy. Depending on the objective or message priority, applications can use the NADV framework to minimize various types of link cost. In this paper we present efficient methods for link cost estimation and perform detailed simulations in diverse scenarios. Our results show that NADV outperforms current schemes in many aspects: for example, in high noise environments with frequent packet losses, the use of NADV leads to 83% higher delivery ratio. When compared to centralized routing, geographic routing using NADV finds paths whose cost is close to the optimum.

An exploration of geographic routing with k-hop based searching in wireless sensor networks

“…However, it is promising that multi-hop information can lead to better performance in many aspects including routing, message broadcasting and channel access scheduling [7], [13]- [15]. Details of several distributed information exchange schemes and efficient algorithms in computing 2-hop neighborhood information for wireless ad hoc and sensor networks can be found in [16]- [18].…”

“…In [7], a link metric called normalized advance (NADV) is proposed for wireless multihop networks. It selects neighbor nodes in tradeoff between link cost and proximity to destination.…”

“…Our work here is more related to them. The new routing metric proposed in Section IV is inspired by the concept of expected advance per transmission in [7].…”

“…One may also consider it as an ARQ (automatic repeat request) mechanism but with dynamic PRR. Most geographic routing protocols use 1-hop information, but generalization to 2-hop searching or more is also possible [7]. The above metric uses 1-hop information.…”

“…However, it is worth pointing out that most studies in this topic are located on 1-hop neighborhood information based schemes which often address a quite limited optimization. The generalization to 2-hop or more generally k-hop based routing has not been profoundly investigated despite interesting and possible [7]. An exploration will be helpful to provide a reference for future design and consideration, especially for the purpose in emerging real-time wireless sensor networks (WSN) [8] and some demanding applications [9].…”