Range-free selective anchor node center of the smallest communication overlap polygon localization algorithm in wireless networks

This paper presents a range-free selective anchor node center of the smallest communication overlap polygon localization algorithm in wireless networks. The algorithm is range-free which does not require ranging devices. To estimate the location of unknown (location unaware) nodes it uses node connectivity based on selected anchor (location aware) nodes. The algorithm first selects appropriate anchor nodes. Then, the True Intersection Points (TIPs) constituting the vertices of the smallest communication overlap polygon (SCOP) of these selected anchor nodes' communication ranges are found. Finally, the location of the unknown node is estimated at the center of the SCOP which is formed from these TIPs. The algorithm performance is evaluated using MatLab simulation and compares favorably to state-of-the-art algorithms: Centroid, improved version of CPE, Mid-perpendicular and CSCOP localization algorithms. The results show the proposed algorithm outperforms other state-of-the-art algorithms in location accuracy and it has reasonable computational complexity.

[1]  Deborah Estrin,et al.  GPS-less low-cost outdoor localization for very small devices , 2000, IEEE Wirel. Commun..

[2]  Chi-Chang Chen,et al.  Range-Free Localization Scheme in Wireless Sensor Networks Based on Bilateration , 2013, Int. J. Distributed Sens. Networks.

[3]  Jean-Marc Pierson,et al.  Novel reliable range-free geo-localization algorithm in wireless networks: Centre of the smallest communication overlap polygon (CSCOP) , 2015, 2015 IEEE International Black Sea Conference on Communications and Networking (BlackSeaCom).

[4]  Guozhi Song,et al.  Two Novel DV-Hop Localization Algorithms for Randomly Deployed Wireless Sensor Networks , 2015, Int. J. Distributed Sens. Networks.

[5]  Chih-Shun Hsu,et al.  A distributed location estimating algorithm for wireless sensor networks , 2006, IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing (SUTC'06).

[6]  Chih-Shun Hsu,et al.  A Distributed Localization Scheme for Wireless Sensor Networks with Improved Grid-Scan and Vector-Based Refinement , 2008, IEEE Transactions on Mobile Computing.

[7]  Fang Liu,et al.  TPSS: A Time-Based Positioning Scheme for Sensor Networks with Short Range Beacons , 2005, ICCNMC.

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

[9]  Linqing Gui,et al.  A Novel Two-Class Localization Algorithm in Wireless Sensor Networks , 2011, Netw. Protoc. Algorithms.

[10]  B. R. Badrinath,et al.  Ad hoc positioning system (APS) using AOA , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[11]  Linqing Gui,et al.  A Two-Level Range-Free Localization Algorithm for Wireless Sensor Networks , 2010, 2010 6th International Conference on Wireless Communications Networking and Mobile Computing (WiCOM).

[12]  Chansik Park,et al.  Multihop range-free localization with approximate shortest path in anisotropic wireless sensor networks , 2014, EURASIP J. Wirel. Commun. Netw..

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