A novel approach towards source-to-destination distance estimation in wireless sensor networks

In WSNs (Wireless Sensor Networks), a source node sends its packets via multi-hop relays to a destination node if the source cannot communicate with the destination directly. Estimation of the Euclidean distance between the source and its destination is an important research issue. Among many other distance estimation techniques, the one based on the hop-count information has attracted a lot of research interests. The basic idea is to seek a herustic/analytical transformation from the observed hop-count information to an unknown distance. We observe that the neighbors of a destination can have different hop-counts relative to the same source, and such information can be used to enhance the distance estimation. In this paper, we propose a novel distance estimation method, which not only uses the hop-count information of a destination, but also exploits the hop-count information of the destination's neighbors. Simulation results show that our method outperforms other well-known hop-count-based distance estimation methods.

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

[2]  Radhika Nagpal,et al.  Organizing a Global Coordinate System from Local Information on an Ad Hoc Sensor Network , 2003, IPSN.

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

[4]  Wanjiun Liao,et al.  Hop Count Distribution of Multihop Paths in Wireless Networks With Arbitrary Node Density: Modeling and Its Applications , 2007, IEEE Transactions on Vehicular Technology.

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

[6]  Hojung Cha,et al.  HCRL: A Hop-Count-Ratio based Localization in Wireless Sensor Networks , 2007, 2007 4th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks.

[7]  John A. Silvester,et al.  Optimum transmission radii for packet radio networks or why six is a magic number , 1978 .

[8]  Brian D. O. Anderson,et al.  On the Probability of K-hop Connection in Wireless Sensor Networks , 2007, IEEE Communications Letters.

[9]  Michael T. Heath,et al.  Scientific Computing: An Introductory Survey , 1996 .

[10]  Michele Zorzi,et al.  On the hop count statistics for randomly deployed wireless sensor networks , 2006, Int. J. Sens. Networks.

[11]  Dharma P. Agrawal,et al.  Range-Free Localization Using Expected Hop Progress in Wireless Sensor Networks , 2009, IEEE Transactions on Parallel and Distributed Systems.

[12]  S. Dulman,et al.  Statistically enhanced localization schemes for randomly deployed wireless sensor networks , 2004, Proceedings of the 2004 Intelligent Sensors, Sensor Networks and Information Processing Conference, 2004..

[13]  Winston Khoon Guan Seah,et al.  Density-aware hop-count localization (DHL) in wireless sensor networks with variable density , 2005, IEEE Wireless Communications and Networking Conference, 2005.

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

[15]  B. R. Badrinath,et al.  Ad hoc positioning system (APS) , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

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