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).We consider three scenarios: (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, we show that even with such imprecise or limited destination-location information, the routing delays are Θ(1/M(n)). We further show that routing delays of this magnitude can be obtained even if only a small fraction of the nodes have any location information, and other nodes simply forward the packet to a randomly chosen neighbor, and we validate our analysis with simulation.Finally, we consider the throughput-capacity of networks with progressive routing strategies that take packets closer to the destination in every step, but not necessarily along a straight-line. Such a routing strategy could potentially lead to spatial "hot spots" in the network where many data flows intersect at a spatial region (a node or group of nodes), due to "sub-optimal" routes with increased path-lengths. In this paper, we show that the effect of hot spots due to progressive routing does not reduce the network throughput-capacity in an order sense. In other words, the throughput-capacity with progressive routing is order-wise the same as the maximum achievable throughput-capacity.

[1]  Deborah Estrin,et al.  Data-Centric Storage in Sensornets with GHT, a Geographic Hash Table , 2003, Mob. Networks Appl..

[2]  Scott Shenker,et al.  Geographic routing without location information , 2003, MobiCom '03.

[3]  R. Srikant,et al.  Unreliable sensor grids: coverage, connectivity and diameter , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[4]  R. Govindan,et al.  On the effect of localization errors on geographic face routing in sensor networks , 2004, Third International Symposium on Information Processing in Sensor Networks, 2004. IPSN 2004.

[5]  Ian F. Akyildiz,et al.  Sensor Networks , 2002, Encyclopedia of GIS.

[6]  Mario Gerla,et al.  Fisheye state routing: a routing scheme for ad hoc wireless networks , 2000, 2000 IEEE International Conference on Communications. ICC 2000. Global Convergence Through Communications. Conference Record.

[7]  Panganamala Ramana Kumar,et al.  RHEINISCH-WESTFÄLISCHE TECHNISCHE HOCHSCHULE AACHEN , 2001 .

[8]  Roger Wattenhofer,et al.  Worst-Case optimal and average-case efficient geometric ad-hoc routing , 2003, MobiHoc '03.

[9]  Jorge Urrutia,et al.  Compass routing on geometric networks , 1999, CCCG.

[10]  Gregory J. Pottie,et al.  Protocols for self-organization of a wireless sensor network , 2000, IEEE Wirel. Commun..

[11]  Dario Pompili,et al.  Optimal local topology knowledge for energy efficient geographical routing in sensor networks , 2004, IEEE INFOCOM 2004.

[12]  Anne-Marie Kermarrec,et al.  SCAMP: Peer-to-Peer Lightweight Membership Service for Large-Scale Group Communication , 2001, Networked Group Communication.

[13]  Symeon Papavassiliou,et al.  A position-based multi-zone routing protocol for wide area mobile ad-hoc networks , 1999, 1999 IEEE 49th Vehicular Technology Conference (Cat. No.99CH36363).

[14]  Jie Gao,et al.  Localization and routing in sensor networks by local angle information , 2005, MobiHoc '05.

[15]  Keith Marzullo,et al.  Gossip versus Deterministic Flooding: Low Message Overhead and High Reliability for Broadcasting on Small Networks , 1999 .

[16]  Piyush Gupta,et al.  Critical Power for Asymptotic Connectivity in Wireless Networks , 1999 .

[17]  Deborah Estrin,et al.  Directed diffusion: a scalable and robust communication paradigm for sensor networks , 2000, MobiCom '00.

[18]  Amir Dembo,et al.  Large Deviations Techniques and Applications , 1998 .

[19]  Leonidas J. Guibas,et al.  Locating and Bypassing Holes in Sensor Networks , 2006, Mob. Networks Appl..

[20]  Rahul Jain,et al.  Geographical routing using partial information for wireless ad hoc networks , 2001, IEEE Wirel. Commun..

[21]  Leonidas J. Guibas,et al.  GLIDER: gradient landmark-based distributed routing for sensor networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[22]  Martin Vetterli,et al.  Locating nodes with EASE: last encounter routing in ad hoc networks through mobility diffusion , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[23]  Moshe Shaked,et al.  Stochastic orders and their applications , 1994 .

[24]  Devavrat Shah,et al.  Throughput-delay trade-off in wireless networks , 2004, IEEE INFOCOM 2004.

[25]  Brad Karp,et al.  GPSR: greedy perimeter stateless routing for wireless networks , 2000, MobiCom '00.

[26]  Ness B. Shroff,et al.  Delay and Capacity Trade-Offs in Mobile Ad Hoc Networks: A Global Perspective , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[27]  Tarek F. Abdelzaher,et al.  Range-free localization schemes for large scale sensor networks , 2003, MobiCom '03.

[28]  Rajeev Motwani,et al.  Randomized Algorithms , 1995, SIGA.

[29]  Imrich Chlamtac,et al.  A distance routing effect algorithm for mobility (DREAM) , 1998, MobiCom '98.

[30]  Bruce Hajek,et al.  Minimum Mean Hitting Times of Brownian Motion with Constrained Drift , 2001 .

[31]  Satish Kumar,et al.  Next century challenges: scalable coordination in sensor networks , 1999, MobiCom.