Localization refinement for wireless sensor networks

Being a key supporting technology, localization is of significance to the research and implement of other attracting applications in wireless sensor networks. The positioning accuracy and energy consumption are two major indicators of localization performance. In this paper, we are concerned with the problem of optimization for coordinates calculation in localization process, regardless of the specific underlying localization mechanism. In order to improve accuracy and avoid extra energy consumption, we develop three schemes based on least squares and multilateration: Taylor-LS, WLS and CTLS. Moreover, we develop a generalized Cramer-Rao lower bound on the localization errors in multihop scenario to help us theoretically analyze the performance of our localization refinement methods. We evaluate the proposed methods via simulations under various environmental settings. Overall, the simulation results validate the practicality of our proposed localization refinement methods, and show that they outperform multilateration at a certain extent under a wide range of conditions and have no extra communication overhead.

[1]  Anant Sahai,et al.  Estimation bounds for localization , 2004, 2004 First Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks, 2004. IEEE SECON 2004..

[2]  P. D. Groen An Introduction to Total Least Squares , 1998, math/9805076.

[3]  Gianluca Mazzini,et al.  Localization in sensor networks with fading and mobility , 2002, The 13th IEEE International Symposium on Personal, Indoor and Mobile Radio Communications.

[4]  Erik G. Larsson,et al.  Cramer-Rao bound analysis of distributed positioning in sensor networks , 2004, IEEE Signal Processing Letters.

[5]  S. Nash,et al.  Numerical methods and software , 1990 .

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

[7]  Mani B. Srivastava,et al.  The bits and flops of the n-hop multilateration primitive for node localization problems , 2002, WSNA '02.

[8]  John Heidemann,et al.  Density Adaptive Algorithms for Beacon Placement in Wireless Sensor Networks , 2001, ICDCS 2001.

[9]  A. Ralston A first course in numerical analysis , 1965 .

[10]  Koen Langendoen,et al.  Distributed localization in wireless sensor networks: a quantitative compariso , 2003, Comput. Networks.

[11]  J. Mendel,et al.  Constrained total least squares , 1987, ICASSP '87. IEEE International Conference on Acoustics, Speech, and Signal Processing.

[12]  Anant Sahai,et al.  Cramér-Rao-Type Bounds for Localization , 2006, EURASIP J. Adv. Signal Process..

[13]  Miodrag Potkonjak,et al.  Location errors in wireless embedded sensor networks: sources, models, and effects on applications , 2002, MOCO.

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

[15]  Alfred O. Hero,et al.  Relative location estimation in wireless sensor networks , 2003, IEEE Trans. Signal Process..

[16]  Jan M. Rabaey,et al.  Location in distributed ad-hoc wireless sensor networks , 2001, 2001 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings (Cat. No.01CH37221).

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

[18]  Mani B. Srivastava,et al.  Dynamic fine-grained localization in Ad-Hoc networks of sensors , 2001, MobiCom '01.

[19]  Jerry M. Mendel,et al.  The constrained total least squares technique and its applications to harmonic superresolution , 1991, IEEE Trans. Signal Process..

[20]  Krishna M. Sivalingam,et al.  Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications , 2002 .

[21]  Mani B. Srivastava,et al.  IEEE TRANSACTIONS ON MOBILE COMPUTING 1 An Analysis of Error Inducing Parameters in Multihop Sensor Node Localization , 2004 .

[22]  Ian F. Akyildiz,et al.  Wireless sensor networks: a survey , 2002, Comput. Networks.