Geographic routing with limited information in sensor networks

Geographic routing with greedy relaying strategies have been widely studied as a routing scheme in sensor networks. These schemes assume that the nodes have perfect information about the location of the destination. When the distance between the source and destination is normalized to unity, the asymptotic routing delays in these schemes are Θ( 1 M(n) ), where M(n) is the maximum distance traveled in a single hop (transmission range of a radio). Three scenarios are considered: (i) where nodes have location errors (imprecise GPS), (ii) where only coarse geographic information about the destination is available, such as the quadrant or half-plane in which the destination is located, and (iii) where only a small fraction of the nodes have routing information. In this paper, it is shown that even with such imprecise or limited destination-location information, the routing delays are Θ( 1 M(n) ). Further, routing delays of this magnitude can be obtained even if only a small fraction of t...

• Type: Conference
• Year: 2005
• Where: IPSN
• Authors: Sundar Subramanian, Sanjay Shakkottai
• Keywords: IPSN 2005, Progressive Routing, Routing, Routing Delays, Sensor Networks