Distributed joint iterative localization algorithm for WSN

The Distributed Iterative Localization algorithm (DILOC) is an attractive algorithm for wireless sensor network (WSN), which is used to locate sensors (with unknown locations) in m dimensional space. DILOC algorithm needs a minimal number of m +1 anchors (with known their exact locations). However, the convex hull test requires that sensors must be inside of the convex hull, so it will require relatively large communication radius. Considering this defect of DILOC, this paper proposes an improved algorithm that called distributed joint iterative localization (DJIL), through employing loop iteration and weighted average, which is capable of reducing communication radius and enhancing the precision of localization. The DJIL algorithm improves the convex hull test, and uses some sensors, which have known locations, participating in the second localization, and further improving centroid localization algorithm for reliability and practicality. Simulation results show that the communication radius is significantly reduced and error is also decreased for the DJIL algorithm. Compared with DILOC algorithm, if fewer anchors are distributed in region unequally, and the region contains more sensors, DJIL algorithm can reduce the communication radius of 30% and increase location accuracy of 21%. So DJIL algorithm is very flexible for scenarios of anchors uneven distribution.

[1]  Kung Yao,et al.  Source localization and beamforming , 2002, IEEE Signal Process. Mag..

[2]  Tarek F. Abdelzaher,et al.  Range-free localization schemes for large scale sensor networks , 2003, MobiCom '03.

[3]  Brian D. O. Anderson,et al.  Sensor network localization with imprecise distances , 2006, Syst. Control. Lett..

[4]  Soummya Kar,et al.  Distributed Sensor Localization in Random Environments Using Minimal Number of Anchor Nodes , 2008, IEEE Transactions on Signal Processing.

[5]  Gregory J. Pottie,et al.  Wireless integrated network sensors (WINS) , 1999, Smart Structures.

[6]  U.A. Khan,et al.  A linear iterative algorithm for distributed sensor localization , 2008, 2008 42nd Asilomar Conference on Signals, Systems and Computers.

[7]  John Anderson,et al.  Wireless sensor networks for habitat monitoring , 2002, WSNA '02.

[8]  Stefan Friedrich,et al.  Topology , 2019, Arch. Formal Proofs.

[9]  W. Rabiner,et al.  Design considerations for distributed microsensor systems , 1999, Proceedings of the IEEE 1999 Custom Integrated Circuits Conference (Cat. No.99CH36327).

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

[11]  B. Sinopoli,et al.  Distributed sensor localization in Euclidean spaces: Dynamic environments , 2008, 2008 46th Annual Allerton Conference on Communication, Control, and Computing.

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

[13]  Mani B. Srivastava,et al.  The n-Hop Multilateration Primitive for Node Localization Problems , 2003, Mob. Networks Appl..

[14]  Deborah Estrin,et al.  Next Century Challenges: Mobile Networking for Smart Dust , 1999, MobiCom 1999.

[15]  Satish Kumar,et al.  Next century challenges: scalable coordination in sensor networks , 1999, MobiCom.

[16]  M J Sippl,et al.  Cayley-Menger coordinates. , 1986, Proceedings of the National Academy of Sciences of the United States of America.

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

[18]  Christopher Taylor,et al.  Localization in Sensor Networks , 2005, Handbook of Sensor Networks.

[19]  Randy H. Katz,et al.  Next century challenges: mobile networking for “Smart Dust” , 1999, MobiCom.

[20]  Robert Nowak,et al.  Distributed optimization in sensor networks , 2004, Third International Symposium on Information Processing in Sensor Networks, 2004. IPSN 2004.