On Multihop Distances in Wireless Sensor Networks with Random Node Locations

Location and intersensor distance estimations are important functions for the operation of wireless sensor networks, especially when protocols can benefit from the distance information prior to network deployment. The maximum multihop distance that can be covered in a given number of hops in a sensor network is one such parameter related with coverage area, delay, and minimal multihop transmission energy consumption estimations. In randomly deployed sensor networks, intersensor distances are random variables. Hence, their evaluations require probabilistic methods, and distance models should involve investigation of distance distribution functions. Current literature on analytical modeling of the maximum distance distribution is limited to 1D networks using the Gaussian pdf. However, determination of the maximum multihop distance distribution in 2D networks is a quite complex problem. Furthermore, distance distributions in 2D networks are not accurately modeled by the Gaussian pdf. Hence, we propose a greedy method of distance maximization and evaluate the distribution of the obtained multihop distance through analytical approximations and simulations.

[1]  Eylem Ekici,et al.  Probability distribution of multi-hop-distance in one-dimensional sensor networks , 2007, Comput. Networks.

[2]  Liang Zhao,et al.  Hop-Distance Estimation in Wireless Sensor Networks with Applications to Resources Allocation , 2007, EURASIP J. Wirel. Commun. Netw..

[3]  Eylem Ekici,et al.  A Probabilistic Approach to Location Verification in Wireless Sensor Networks , 2006, 2006 IEEE International Conference on Communications.

[4]  Stefano Chessa,et al.  Bounds on hop distance in greedy routing approach in wireless ad hoc networks , 2006, Int. J. Wirel. Mob. Comput..

[5]  Daniel Medina,et al.  Hop distances and flooding in wireless multihop networks with randomized beamforming , 2005, MSWiM '05.

[6]  Martin Haenggi,et al.  On distances in uniformly random networks , 2005, IEEE Transactions on Information Theory.

[7]  Eylem Ekici,et al.  Analysis of hop-distance relationship in spatially random sensor networks , 2005, MobiHoc '05.

[8]  Eylem Ekici,et al.  Wave Addressing for Dense Sensor Networks , 2004 .

[9]  Sarvar Patel,et al.  Efficient authentication and key distribution in wireless IP networks , 2003, IEEE Wireless Communications.

[10]  J. Eberspacher,et al.  Hop distances in homogeneous ad hoc networks , 2003, The 57th IEEE Semiannual Vehicular Technology Conference, 2003. VTC 2003-Spring..

[11]  B. R. Badrinath,et al.  DV Based Positioning in Ad Hoc Networks , 2003, Telecommun. Syst..

[12]  Jan M. Rabaey,et al.  Robust Positioning Algorithms for Distributed Ad-Hoc Wireless Sensor Networks , 2002, USENIX Annual Technical Conference, General Track.

[13]  Leonard E. Miller,et al.  Distribution of Link Distances in a Wireless Network , 2001, Journal of research of the National Institute of Standards and Technology.

[14]  Theodore S. Rappaport,et al.  Wireless communications - principles and practice , 1996 .

[15]  S.A.G. Chandler,et al.  Calculation of number of relay hops required in randomly located radio network , 1989 .

[16]  Thomas G. Robertazzi,et al.  Critical connectivity phenomena in multihop radio models , 1989, IEEE Trans. Commun..