Localization in wireless sensor networks using tabu search and simulated annealing

Sensor localization is a fundamental and crucial issue for wireless sensor networks operation and management. Accurate self-localization capability is highly desirable in wireless sensor network. A fundamental problem in distance-based sensor network localization is whether a given sensor network is uniquely localizable or not. Flip ambiguity is a main problem that can make the sensor network not uniquely localized. It causes large errors in the location estimates. This paper proposes a method in which the localization is done through two steps. During the first step, tabu search (TS) is used to obtain an accurate estimation of the nodes' location. During the second step, simulated annealing algorithm (SAA) is used to refine the location estimates of those nodes that are likely to have flip ambiguity problem. The simulation results confirm that the proposed algorithm has better performance than that of the existing algorithms.

[1]  David C. Moore,et al.  Robust distributed network localization with noisy range measurements , 2004, SenSys '04.

[2]  Y. Ye,et al.  A Gradient Search Method to Round the Semideflnite Programming Relaxation Solution for Ad Hoc Wireless Sensor Network Localization , 2004 .

[3]  L. El Ghaoui,et al.  Convex position estimation in wireless sensor networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[4]  Ian F. Akyildiz,et al.  Sensor Networks , 2002, Encyclopedia of GIS.

[5]  Branka Vucetic,et al.  Simulated Annealing based Wireless Sensor Network Localization , 2006, J. Comput..

[6]  Padraig Cunningham,et al.  Biclustering of expression data using simulated annealing , 2005, 18th IEEE Symposium on Computer-Based Medical Systems (CBMS'05).

[7]  Rob A. Rutenbar,et al.  Simulated annealing algorithms: an overview , 1989, IEEE Circuits and Devices Magazine.

[8]  Fred W. Glover,et al.  Tabu Search - Part I , 1989, INFORMS J. Comput..

[9]  Celso C. Ribeiro,et al.  Metaheuristics and Applications to Optimization Problems in Telecommunications , 2006, Handbook of Optimization in Telecommunications.

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

[11]  Kazi Chandrima Rahman,et al.  A Survey on Sensor Network , 2010 .

[12]  Fred Glover,et al.  Tabu Search - Part II , 1989, INFORMS J. Comput..

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

[14]  Yinyu Ye,et al.  Semidefinite programming for ad hoc wireless sensor network localization , 2004, Third International Symposium on Information Processing in Sensor Networks, 2004. IPSN 2004.

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

[16]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.