Geographic routing

About: Geographic routing is a research topic. Over the lifetime, 11687 publications have been published within this topic receiving 302224 citations.

Geographic Routing Using Hyperbolic Space

Abstract: We propose a scalable and reliable point-to-point routing algorithm for ad hoc wireless networks and sensor-nets. Our algorithm assigns to each node of the network a virtual coordinate in the hyperbolic plane, and performs greedy geographic routing with respect to these virtual coordinates. Unlike other proposed greedy routing algorithms based on virtual coordinates, our embedding guarantees that the greedy algorithm is always successful in finding a route to the destination, if such a route exists. We describe a distributed algorithm for computing each node's virtual coordinates in the hyperbolic plane, and for greedily routing packets to a destination point in the hyperbolic plane. (This destination may be the address of another node of the network, or it may be an address associated to a piece of content in a Distributed Hash Table. In the latter case we prove that the greedy routing strategy makes a consistent choice of the node responsible for the address, irrespective of the source address of the request.) We evaluate the resulting algorithm in terms of both path stretch and node congestion.

Minimum-energy broadcast routing in static ad hoc wireless networks

Abstract: Energy conservation is a critical issue in ad hoc wireless networks for node and network life, as the nodes are powered by batteries only. One major approach for energy conservation is to route a communication session along the routes which requires the lowest total energy consumption. This optimization problem is referred to as minimum-energy routing. While minimum-energy unicast routing can be solved in polynomial time by shortest-path algorithms, it remains open whether minimum-energy broadcast routing can be solved in polynomial time, despite the NP-hardness of its general graph version. Previously three greedy heuristics were proposed in Wieselthier et al. (2000): MST (minimum spanning tree), SPT (shortest-path tree), and BIP (broadcasting incremental power). They have been evaluated through simulations in Wieselthier et al.], but little is known about their analytical performance. The main contribution of this paper is the quantitative characterization of their performances in terms of approximation ratios. By exploring geometric structures of Euclidean MSTs, we have been able to prove that the approximation ratio of MST is between 6 and 12, and the approximation ratio of BIP is between /sup 13///sub 3/ and 12. On the other hand, the approximation ratio of SPT is shown to be at least /sup n///sub 2/, where n is the number of receiving nodes. To our best knowledge, these are the first analytical results for minimum-energy broadcasting.

Geographical routing using partial information for wireless ad hoc networks

Abstract: This paper presents an algorithm for routing in wireless and ad hoc networks using information regarding the geographic location of the nodes. The algorithm, which is a new type of distributed, adaptive and asynchronous algorithm, is known as a geographical routing algorithm (GRA). The authors describe the GRA, and discuss it in relation to other routing algorithms in the literature. A system model and a problem statement are presented. Issues related to position information inaccuracy and inconsistency, and mobility are discussed, along with simulation results.

Source-location privacy in energy-constrained sensor network routing

Abstract: As sensor-driven applications become increasingly integrated into our lives, issues related to sensor privacy will become increasingly important. Although many privacy-related issues can be addressed by security mechanisms, one sensor network privacy issue that cannot be adequately addressed by network security is confidentiality of the source sensor's location. In this paper, we focus on protecting the source's location by introducing suitable modifications to sensor routing protocols to make it difficult for an adversary to backtrack to the origin of the sensor communication. In particular, we focus on the class of flooding protocols. While developing and evaluating our privacy-aware routing protocols, we jointly consider issues of location-privacy as well as the amount of energy consumed by the sensor network. Motivated by the observations, we propose a flexible routing strategy, known as phantom routing, which protects the source's location. Phantom routing is a two-stage routing scheme that first consists of a directed walk along a random direction, followed by routing from the phantom source to the sink. Our investigations have shown that phantom routing is a powerful technique for protecting the location of the source during sensor transmissions.

Geographical routing using partial information for wireless ad hoc networks

Abstract: We present an algorithm for routing in wireless ad hoc networks using information about the geographical location of the nodes. We assume each node knows its geographical position and the position of the node to which it wants to send a packet. Initially, the nodes know only their neighbors. But over time they discover other nodes in the network. The routing table at a node S is a list , where p/sub i/ is a geographical position and S/sub i/ is a neighbor of node S. When node S receives a packet for a node D at position pos(D), it finds the p/sub i/ in its routing table which is closest to pos(D) and forwards the packet to the neighbor S/sub i/. We prove the correctness of the algorithm and show that our algorithm naturally aggregates the nodes so that the routing tables remain small. We show that the mean routing table size is O(L~logn), where L~ is the average number of hops between two nodes and n is the number of nodes in the network. We also present methods for taking positional errors, node failures and mobility into account. We justify the results through simulation.