Evaluation of the Probability of K-Hop Connection in Homogeneous Wireless Sensor Networks

Given a wireless sensor network (WSN) whose sensors are randomly and independently distributed in a bounded area following a homogeneous Poisson process with density rho and each sensor has a uniform transmission radius of r0, we investigate the probability that two random sensors separated by a known distance x are fc-hop neighbors for some positive integer k in this paper. We give a closed-form equation for computing this probability for k = 2; and also give a recursive equation for evaluating this probability for k > 2 by using some approximations. The accuracy of the approximate analytical solution is validated by simulations. Furthermore, we present an empirical method to correct the discrepancies between the analytical results and the simulation results caused by the approximation. The result of this paper can be useful in a number of sensor network problems, e.g., estimating the transmission delay between two sensors and energy consumed in the transmission, and WSN routing problems.

[1]  Christian Bettstetter,et al.  On the minimum node degree and connectivity of a wireless multihop network , 2002, MobiHoc '02.

[2]  C. Rosenberg,et al.  An address-light, integrated MAC and routing protocol for wireless sensor networks , 2006, IEEE/ACM Transactions on Networking.

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

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

[5]  Sajal K. Das,et al.  Coverage and Connectivity Issues in Wireless Sensor Networks , 2005 .

[6]  Brian D. O. Anderson,et al.  Wireless sensor network localization techniques , 2007, Comput. Networks.

[7]  Gianluigi Ferrari,et al.  Optimal Transmit Power in Wireless Sensor Networks , 2006, IEEE Transactions on Mobile Computing.

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

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

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

[11]  Asser N. Tantawi,et al.  Connectivity properties of a packet radio network model , 1989, IEEE Trans. Inf. Theory.

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

[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.