A Mobile Beacon-Assisted Localization Algorithm Based on Network-Density Clustering for Wireless Sensor Networks

Most existing mobile beacon-assisted localization algorithms do not make effective use of the node distribution information and let the mobile landmark traverse the entire network, which causes large path length and low utilization rate of beacon messages. In order to reduce the path length and use the mobile beacon more effectively, a novel mobile beacon-assisted localization algorithm based on network-density clustering (MBL(ndc)) for wireless sensor networks is presented, which combines node clustering, incremental localization and mobile beacon assisting together. Simulation results demonstrate that the proposed MBL(ndc) algorithm offers comparable localization accuracy as the mobile beacon-assisted localization algorithm with HILBERT trajectory, but with less than 50% path length of the later, which shortens the period of positioning the whole network.

[1]  Dimitrios Koutsonikolas,et al.  Path planning of mobile landmarks for localization in wireless sensor networks , 2006, Comput. Commun..

[2]  Hans-Peter Kriegel,et al.  A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise , 1996, KDD.

[3]  Mihail L. Sichitiu,et al.  Localization of wireless sensor networks with a mobile beacon , 2004, 2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE Cat. No.04EX975).

[4]  T.V. Srinath.  Localization in resource constrained sensor networks using a mobile beacon with in-ranging , 2006, 2006 IFIP International Conference on Wireless and Optical Communications Networks.

[5]  Ying Zhang,et al.  Localization from mere connectivity , 2003, MobiHoc '03.

[6]  Mukesh Singhal,et al.  Mobile Ad Hoc and Sensor Systems , 2006, Int. J. Wirel. Inf. Networks.

[7]  Gergely V. Záruba,et al.  Static Path Planning for Mobile Beacons to Localize Sensor Networks , 2007, Fifth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PerComW'07).

[8]  Károly F. Pál,et al.  Genetic algorithms for the traveling salesman problem based on a heuristic crossover operation , 1993, Biological Cybernetics.