A stochastic analysis of greedy routing in a spatially dependent sensor network

For a sensor network, a tractable spatially-dependent node deployment model is presented with the property that the density is inversely proportional to the sink distance. A stochastic model is formulated to examine message advancements under greedy routing in such a sensor network. The aim of this work is to demonstrate that an inhomogeneous Poisson process can be used to model a sensor network with spatially-dependent node density. Elliptic integrals and asymptotic approximations are used to describe the random behaviour of hops. Types of dependence that affect hop advancements are examined. We observe that the dependence between successive jumps in a multihop path is captured by including only the previous forwarding node location. We include a simple uncoordinated sleep scheme, and observe that the complexity of the model is reduced when enough nodes are asleep. All expressions involving multidimensional integrals are derived and evaluated with quasi-Monte Carlo integration methods based on Halton sequences and recently-developed lattice rules. An importance sampling function is derived to speed up the quasi-Monte Carlo methods. The ensuing results agree extremely well with simulations.

[1]  J. Halton.  On the efficiency of certain quasi-random sequences of points in evaluating multi-dimensional integrals , 1960 .

[2]  Brad Karp,et al.  Greedy Perimeter Stateless Routing for Wireless Networks , 2000 .

[3]  Holger Paul Keeler,et al.  A model framework for greedy routing in a sensor network with a stochastic power scheme , 2011, TOSN.

[4]  Frances Y. Kuo,et al.  Lifting the Curse of Dimensionality , 2005 .

[5]  Evgueni A. Haroutunian,et al.  Information Theory and Statistics , 2011, International Encyclopedia of Statistical Science.

[6]  Arpit A. Almal,et al.  Lifting the Curse of Dimensionality , 2007 .

[7]  Ivan Stojmenovic,et al.  Routing with Guaranteed Delivery in Ad Hoc Wireless Networks , 1999, DIALM '99.

[8]  Jerome Spanier,et al.  Quasi-Random Methods for Estimating Integrals Using Relatively Small Samples , 1994, SIAM Rev..

[9]  B. C. Carlson.  Numerical computation of real or complex elliptic integrals , 2005, Numerical Algorithms.

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

[11]  Holger Paul Keeler,et al.  Stochastic routing models in sensor networks , 2010 .

[12]  D. Manjunath,et al.  Path coverage by a sensor field: The nonhomogeneous case , 2009, TOSN.

[13]  François Baccelli,et al.  Stochastic Geometry and Wireless Networks, Volume 1: Theory , 2009, Found. Trends Netw..

[14]  François Baccelli,et al.  Stochastic geometry and wireless networks , 2009 .

[15]  Jeffrey G. Andrews,et al.  Stochastic geometry and random graphs for the analysis and design of wireless networks , 2009, IEEE Journal on Selected Areas in Communications.

[16]  F. Baccelli,et al.  Stochastic Geometry and Wireless Networks, Part I: Theory , 2009 .

[17]  Martin Mauve,et al.  A survey on position-based routing in mobile ad hoc networks , 2001, IEEE Netw..

[18]  Ivan Stojmenovic,et al.  Position-based routing in ad hoc networks , 2002, IEEE Commun. Mag..

[19]  B. C. Carlson.  Computing elliptic integrals by duplication , 1979 .

[20]  Harald Niederreiter,et al.  2. Quasi-Monte Carlo Methods for Numerical Integration , 1992 .

[21]  Chee-Yee Chong,et al.  Sensor networks: evolution, opportunities, and challenges , 2003, Proc. IEEE.

[22]  D. Stoyan,et al.  Stochastic Geometry and Its Applications , 1989 .

[23]  Michele Zorzi,et al.  Geographic Random Forwarding (GeRaF) for Ad Hoc and Sensor Networks: Multihop Performance , 2003, IEEE Trans. Mob. Comput..

[24]  Yan Zhang,et al.  Geometric ad-hoc routing: of theory and practice , 2003, PODC '03.

[25]  T. Mattfeldt.  Stochastic Geometry and Its Applications , 1996 .

[26]  Holger Paul Keeler,et al.  A Stochastic Analysis of a Greedy Routing Scheme in Sensor Networks , 2010, SIAM J. Appl. Math..

[27]  Mika Ishizuka,et al.  Stochastic node placement improving fault tolerance in wireless sensor networks , 2007 .

[28]  Harald Niederreiter,et al.  Random number generation and Quasi-Monte Carlo methods , 1992, CBMS-NSF regional conference series in applied mathematics.

[29]  Michele Zorzi,et al.  Geographic Random Forwarding (GeRaF) for Ad Hoc and Sensor Networks: Energy and Latency Performance , 2003, IEEE Trans. Mob. Comput..

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

[31]  Robert B. Ash,et al.  Information Theory , 2020, The SAGE International Encyclopedia of Mass Media and Society.

[32]  I. Sobol.  On the distribution of points in a cube and the approximate evaluation of integrals , 1967 .

[33]  Raghu Kacker,et al.  Digital Library of Mathematical Functions , 2003 .

[34]  M. Ishizuka,et al.  Performance study of node placement in sensor networks , 2004, 24th International Conference on Distributed Computing Systems Workshops, 2004. Proceedings..

[35]  Roderick Wong,et al.  Asymptotic approximations of integrals , 1989, Classics in applied mathematics.

[36]  Archana Bharathidasan,et al.  Sensor Networks : An Overview , 2002 .

[37]  Benjamin J. Waterhouse,et al.  Quasi-Monte Carlo for finance applications , 2008 .

[38]  Emil Wolf,et al.  Asymptotic approximations to integrals , 1999 .