Skip to main content
Log in

VN-APIT: virtual nodes-based range-free APIT localization scheme for WSN

  • Published:
Wireless Networks Aims and scope Submit manuscript

Abstract

As an important supporting technology, the localization technology has become the basis of the practical applications of wireless sensor networks for information acquisition and processing . APIT (approximate Point-In-Triangulation) localization scheme is widely used for localization estimation in wireless sensor networks due to the advantages of the high localization accuracy and easy to deploy. However, there are some inherent defects caused by the uneven distribution of sensor nodes in APIT scheme. To overcome the problem, in this paper a novel virtual nodes-based range-free localization scheme, i.e., VN-APIT, is proposed to improve the APIT scheme. By rationally deploying virtual nodes in sensor network according to the proposed VN-APIT test theory, VN-APIT localization scheme can determine independently that whether a target node is inside or outside the triangle formed by three certain anchor nodes. Therefore, it will not subject to the effect of the density and distribution of sensor nodes and there is no the problem of the In-to-Out error and the Out-to-In error in VN-APIT scheme. Simulation evaluation shows that the proposed VN-APIT scheme is more robust and has a lower average localization error (ALE) than the conventional APIT scheme.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13

Similar content being viewed by others

References

  1. Hofmann-Wellenhof, B., Lichtenegger, H., & Collins, J. (2001). Global positioning system: Theory and practice. Verlag Wien: Springer.

    Book  Google Scholar 

  2. Pal, A. (2010). Localization algorithms in wireless sensor networks: Current approaches and future challenges. Network Protocols and Algorithms, 2(1), 45–73.

    Article  Google Scholar 

  3. Shu, Y., Cheng, P., Gu, Y., Chen, J., He, T. (2014). Toc: Localizing wireless rechargeable sensors with time of charge. In Proceedings IEEE (INFOCOM’2014) (pp. 388–396). Toronto: Canada.

  4. Wang, J., Gao, Q., Cheng, P., Yu, Y., Xin, K., & Wang, H. (2014). Lightweight robust device-free localization in wireless networks. IEEE Transactions on Industrial Electronics, 61(10), 5681–5689.

    Article  Google Scholar 

  5. Wang, J., Gao, Q., Wang, H., Cheng, P., & Xin, K. (2015). Device-free localization with multidimensional wireless link information. IEEE Transactions on Vehicular Technology, 64(1), 356–366.

    Article  Google Scholar 

  6. Bahl, P., & Padmanabhan, V. N. (2000). RADAR: An in-building RF-based user location and tracking system. Nineteenth Annual joint conference of the IEEE computer and communications societies (INFOCOM’2010) (pp. 775–784). Tel Aviv, Israel.

  7. Zhang, W., Yin, Q., Feng, X., & Wang, W. (2010). Distributed TDOA estimation for wireless sensor networks based on frequency-hopping in multipath environment. In Vehicular technology conference (VTC’2010-Spring) (pp. 1–5). Taipei.

  8. Niculescu, D., & Nath, B. (2003). Ad hoc positioning system (APS) using AOA. In Twenty-second annual joint conference of the IEEE computer and communications (INFOCOM’2003) (pp. 1734–1743). NJ, USA.

  9. Kumar, P., Reddy, L., & Varma, S. (2009). Distance measurement and error estimation scheme for RSSI based localization in wireless sensor networks. In 2009 Fifth IEEE conference on wireless communication and sensor networks (WCSN’2009) (pp. 1–4). Allahabad, India.

  10. Bulusu, N., Heidemann, J., & Estrin, D. (2000). Gps-less low-cost outdoor localization for very small devices. Personal Communications IEEE, 7(5), 28–34.

    Article  Google Scholar 

  11. Niculescu, D., & Nath, B. (2003). Dv based positioning in ad hoc networks. Telecommunication Systems, 22(1–4), 267–280.

    Article  Google Scholar 

  12. Nagpal, R. (1999). Organizing a global coordinate system from local information on an amorphous computer. AI Memo 1666, MIT.

  13. He, T., Huang, C., Blum, B. M., Stankovic, J. A., & Abdelzaher, T. (2003). Range-free localization schemes for large scale sensor networks. In Proceedings of the 9th annual international conference on Mobile computing and networking (pp. 81–95). New York, USA.

  14. Deng, B., Huang, G., Zhang, L., & Liu, H. (2008). Improved centroid localization algorithm in WSNs. In 3rd international conference on intelligent system and knowledge engineering (ISKE’2008) (pp. 1260–1264). Xiamen, China.

  15. Tian, S., Zhang, X., Liu, P., Sun, P., & Wang, X. (2007). A RSSI-based dv-hop algorithm for wireless sensor networks. In International conference on wireless communications, networking and mobile computing (WiCom’2007) (pp. 2555–2558). Shanghai, China.

  16. Qian, Q., Shen, X., & Chen, H. (2011). An improved node localization algorithm based on dv-hop for wireless sensor networks. Computer Science and Information Systems, 8(4), 953–972.

    Article  Google Scholar 

  17. Cheng, W., Li, J., & Li, H. (2012). An improved APIT location algorithm for wireless sensor networks. Advances in electrical engineering and automation (pp. 113–119). Netherlands: Springer.

    Chapter  Google Scholar 

  18. Han, G., Xu, H., Duong, T. Q., Jiang, J., & Hara, T. (2013). Localization algorithms of wireless sensor networks: a survey. Telecommunication Systems, 52(4), 2419–2436.

    Article  Google Scholar 

  19. Xiangqun, L., Heng, G., & Linlin, L. (2009). An improved APIT algorithm based on direction searching. In 5th International conference on wireless communications, networking and mobile computing (WiCom’09) (pp. 1–4). Beijing, China.

  20. Xu, D., Zhang, B., & Hou, Z. (2012). Novel PIT localization algorithm based on coverage of anchors in WSN. Journal of Networks, 7(9), 1349–1354.

    Article  Google Scholar 

  21. zeng Wang, J., & Jin, H. (2009). Improvement on APIT localization algorithms for wireless sensor networks. In International conference on networks security, wireless communications and trusted computing (NSWCTC’09) (pp. 719–723). Wuhan, China.

  22. Hosseinirad, S. M., Niazi, M., Pourdeilami, J., Basu, S. K., & Pouyan, A. A. (2014). On improving APIT algorithm for better localization in WSN. Journal of AI and Data Mining, 2(2), 97–104.

    Google Scholar 

  23. Rappaport, T. S. (2002). Wireless communications: principles and practice. New Jersey: PTR.

    MATH  Google Scholar 

  24. Ganesan, D., Krishnamachari, B., Woo, A., Culler, D., Estrin, D., & Wicker, S. (2002). Complex behavior at scale: An experimental study of low-power wireless sensor networks. Technical Report UCLA/CSD-TR, 02(13), 1–11.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jilong Liu.

Appendix

Appendix

1.1 Proofs of Proposition 1 and 2

Proposition 1

If M is inside triangle \(\triangle ABC\), when M is shifted in any directions which are perpendicular to the trilateral of triangle \(\triangle ABC\) respectively, the new position of M mustn’t be nearer to or further from all three anchors A, B and C simultaneously.

Proof

As shown in Fig. 14(a), M is inside triangle \(\triangle ABC\) and assuming \({\mathrm{MM}}_{{1}}^{\mathrm{'}}\), \({\mathrm{MM}}_{{2}}^{\mathrm{'}}\) and \({\mathrm{MM}}_{{3}}^{\mathrm{'}}\) are perpendicular to the trilateral BC, AC and AB of \(\triangle ABC\) respectively. We first prove that M can’t be closer to the three vertexes simultaneously when M moves to \({\mathrm{M}}_{{1}}^{\mathrm{'}}\). Consider the two cases:

Case 1: A, M and \({\mathrm{M}}_{{1}}^{\mathrm{'}}\) are on the same line. Clearly, AM \(<{\mathrm{AM}}_{{1}}^{\mathrm{'}}\). And in view of the hypotenuse is greater than the right-angle side, we easily get that \({\mathrm{BM}}_{{1}}^{\mathrm{'}}<{\mathrm{BM}}\) and \({\mathrm{CM}}_{{1}}^{\mathrm{'}} <{\mathrm{CM}}\).

Case 2: A, M and \({\mathrm{M}}_{\mathrm{1}}^{\mathrm{'}}\) are not on the same line. From A draw a perpendicular line to \({\mathrm{MM}}^{\mathrm{'}}\) meeting in at \({\mathrm{D}}_{\mathrm{1}}\). When when M moves to \({\mathrm{M}}_{{1}}^{\mathrm{'}}\), because of \({\mathrm{D}}_{{1}}<{\mathrm{MD}}_{{1}}{\mathrm{M}}_{{1}}^{\mathrm{'}}\), by Pythagorean Theorem, \({\mathrm{AM}}<{\mathrm{AM}}_{{1}}^{\mathrm{'}}\). As same as case 1, \({\mathrm{BM}}_{{1}}^{\mathrm{'}}<{\mathrm{BM}}\) and \({\mathrm{CM}}_{{1}}^{\mathrm{'}}<\hbox {CM}\).

Hence, M can’t be closer to the three vertexes simultaneously when M moves to \({\mathrm{M}}_{{1}}^{\mathrm{'}}\). Similarly, when M moves to \({\mathrm{M}}_{{2}}^{\mathrm{'}}\) and \({\mathrm{M}}_{{3}}^{\mathrm{'}}\) respectively, we can prove that M can’t be closer to the three vertexes simultaneously.

Fig. 14
figure 14

Proofs for Propositions. a Proposition 3. b Proposition 4

Proposition 2

If M is outside triangle \(\triangle ABC\), when M is shifted in any directions which are perpendicular to the trilateral of triangle \(\triangle ABC\) respectively, there must exist a direction in which the new position of M is closer to or further from all three anchors A, B and C simultaneously.

Proof

As shown in Fig. 14(a), we prove this proposition by a special case. For any point M exterior to \(\triangle ABC\), there is always a point \({\mathrm{M}}^{\mathrm{'}}\) on the side (or the extension line of the side) closest to M and M\({\mathrm{M}}^{\mathrm{'}}\) is perpendicular to the side. Without loss of generality, We might assume that \({\mathrm{M}}^{\mathrm{'}}\) is on the side of BC and M\({\mathrm{M}}^{\mathrm{'}}\) is perpendicular to BC. As same as Proposition 1, it also has two case. In the case 1, the proof is clear as proved in Proposition 1. Here we only consider the case 2. From a draw perpendicular line to M\({\mathrm{M}}^{\mathrm{'}}\) meeting in at \({\mathrm{D}}_{\mathrm{1}}\). When when M moves to \({\mathrm{M}}^{\mathrm{'}}\), because of \({\mathrm{D}}_{\mathrm{1}}{\mathrm{M}}^{\mathrm{'}} < {\mathrm{D}}_{\mathrm{1}}\)M, by Pythagorean Theorem, \({\mathrm{AM}}_{\mathrm{1}}^{\mathrm{'}} <{\mathrm{AM}}\). And similarly in view of the hypotenuse is greater than the right-angle side, we easily get that \({\mathrm{BM}}^{\mathrm{'}} <{\mathrm{BM}}\) and \({\mathrm{CM}}^{\mathrm{'}} <\hbox {CM}\).

Hence, when M moves to \({\mathrm{M}}^{\mathrm{'}}\), we proved that M is closer to all three anchors A, B and C simultaneously. In other words, when M is outside triangle \(\triangle ABC\), there must exist a perpendicular direction in which the shifted new position of M is closer to or further from all three anchors A, B and C simultaneously.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Liu, J., Wang, Z., Yao, M. et al. VN-APIT: virtual nodes-based range-free APIT localization scheme for WSN. Wireless Netw 22, 867–878 (2016). https://doi.org/10.1007/s11276-015-1007-z

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11276-015-1007-z

Keywords

Navigation