Genetic Algorithm Based Wireless Sensor Network Localization

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. This paper proposes a genetic algorithm based localization (GAL). The proposed genetic algorithm adopts two new genetic operators: single-vertex-neighborhood mutation and the descend-based arithmetic crossover. 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) [11] and simulated annealing based localization (SAL)[13]. Compared to the usual crossover operator: simple arithmetic crossover, whole arithmetic crossover and single-point crossover, the proposed crossover can obtain a lower mean position error.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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