A kernel-based learning approach to ad hoc sensor network localization

We show that the coarse-grained and fine-grained localization problems for ad hoc sensor networks can be posed and solved as a pattern recognition problem using kernel methods from statistical learning theory. This stems from an observation that the kernel function, which is a similarity measure critical to the effectiveness of a kernel-based learning algorithm, can be naturally defined in terms of the matrix of signal strengths received by the sensors. Thus we work in the natural coordinate system provided by the physical devices. This not only allows us to sidestep the difficult ranging procedure required by many existing localization algorithms in the literature, but also enables us to derive a simple and effective localization algorithm. The algorithm is particularly suitable for networks with densely distributed sensors, most of whose locations are unknown. The computations are initially performed at the base sensors, and the computation cost depends only on the number of base sensors. The localization step for each sensor of unknown location is then performed locally in linear time. We present an analysis of the localization error bounds, and provide an evaluation of our algorithm on both simulated and real sensor networks.

[1]  Andy Hopper,et al.  The active badge location system , 1992, TOIS.

[2]  S. Seidel,et al.  914 MHz path loss prediction models for indoor wireless communications in multifloored buildings , 1992 .

[3]  H. Vincent Poor,et al.  An introduction to signal detection and estimation (2nd ed.) , 1994 .

[4]  Andy Hopper,et al.  A new location technique for the active office , 1997, IEEE Wirel. Commun..

[5]  Vladimir Vapnik,et al.  Statistical learning theory , 1998 .

[6]  Alexander J. Smola,et al.  Learning with kernels , 1998 .

[7]  Hari Balakrishnan,et al.  6th ACM/IEEE International Conference on on Mobile Computing and Networking (ACM MOBICOM ’00) The Cricket Location-Support System , 2022 .

[8]  Deborah Estrin,et al.  GPS-less low-cost outdoor localization for very small devices , 2000, IEEE Wirel. Commun..

[9]  Vladimir N. Vapnik,et al.  The Nature of Statistical Learning Theory , 2000, Statistics for Engineering and Information Science.

[10]  Paramvir Bahl,et al.  RADAR: an in-building RF-based user location and tracking system , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[11]  Deborah Estrin,et al.  Robust range estimation using acoustic and multimodal sensing , 2001, Proceedings 2001 IEEE/RSJ International Conference on Intelligent Robots and Systems. Expanding the Societal Role of Robotics in the the Next Millennium (Cat. No.01CH37180).

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

[13]  Jeffrey Hightower,et al.  Real-Time Error in Location Modeling for Ubiquitous Computing , 2001 .

[14]  Bernhard Schölkopf,et al.  Learning with kernels , 2001 .

[15]  Cameron Whitehouse The Design of Calamari : an Ad-hoc Localization System for Sensor Networks , 2002 .

[16]  Yu Hen Hu,et al.  Detection, classification, and tracking of targets , 2002, IEEE Signal Process. Mag..

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

[18]  Akbar M. Sayeed,et al.  Detection, Classification and Tracking of Targets in Distributed Sensor Networks , 2002 .

[19]  Akbar M. Sayeed,et al.  Collaborative Signal Processing for Distributed Classification in Sensor Networks , 2003, IPSN.

[20]  Yu Hen Hu,et al.  Energy Based Acoustic Source Localization , 2003, IPSN.

[21]  Nello Cristianini,et al.  Learning the Kernel Matrix with Semidefinite Programming , 2002, J. Mach. Learn. Res..