A two-phase localization algorithm for wireless sensor network

In most sensor network applications, the information gathered by sensors will be meaningless without the location of the sensor nodes. Node localization has been a topic of active research in recent years. 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 two-phase localization algorithm (TPLA) for wireless sensor network. During the first phase, genetic algorithm (GA) is used to obtain an accurate estimation of location. During the second phase, simulated annealing algorithm (SAA) is used to refine the location estimates of those nodes that are likely to have flip ambiguity problem. Four example problems are used to evaluate the performance of the proposed algorithm. Simulation results show that our algorithm can achieve higher accurate position estimation than semi-definite programming with gradient search localization (SDPL).

[1]  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).

[2]  David E. Culler,et al.  System architecture directions for networked sensors , 2000, SIGP.

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

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

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

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

[7]  Gregory J. Pottie,et al.  Wireless integrated network sensors , 2000, Commun. ACM.

[8]  John H. Holland,et al.  Distributed genetic algorithms for function optimization , 1989 .

[9]  Craig Gotsman,et al.  Distributed Graph Layout for Sensor Networks , 2004, Graph Drawing.

[10]  Wheeler Ruml,et al.  Improved MDS-based localization , 2004, IEEE INFOCOM 2004.

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

[12]  Martin Mauve,et al.  A survey on position-based routing in mobile ad hoc networks , 2001, IEEE Netw..

[13]  Deborah Estrin,et al.  An Empirical Study of Epidemic Algorithms in Large Scale Multihop Wireless Networks , 2002 .

[14]  Branka Vucetic,et al.  Simulated annealing based localization in wireless sensor network , 2005, The IEEE Conference on Local Computer Networks 30th Anniversary (LCN'05)l.

[15]  Richard W. Eglese,et al.  Simulated annealing: A tool for operational research , 1990 .

[16]  Gaetano Borriello,et al.  Location Systems for Ubiquitous Computing , 2001, Computer.

[17]  Gaurav S. Sukhatme,et al.  Connecting the Physical World with Pervasive Networks , 2002, IEEE Pervasive Comput..

[18]  B. Fidan,et al.  Analysis of Flip Ambiguities in Distributed Network Localization , 2007, 2007 Information, Decision and Control.