Abstract
In wireless sensor networks, beacons are always treated as infrastructures for localization. After beacons are deployed, non-beacon nodes can be located by simple schemes such as multilateration and multidimensional scaling (MDS). Deploying as many beacons as needed is an efficient way to improve localization accuracy where a global positioning system does not work well or a higher location accuracy is required. With more beacons to be deployed, the configuration of beacons’ positions will have to be done manually. Therefore position auto-configuration using measured distances between these beacons can save a lot of efforts for the deployment. One challenge of this auto-configuration is that the positions should be uniquely determined based on the measured distances. In graph theory, it is a problem of unique realization in which the positions of vertices are determined by edges between them. Addressing this problem is one major aspect of this paper. To determine whether the topology of a network is a unique realization, this paper proposes a novel category of topology named Uniquely Determined Topology, with which edges in a d-dimensional space can be reduced from \(d+1\) to d in each extension, which is less strict and more suitable for beacon deployment. The other aspect of this paper is to improve localization accuracy of the deployed beacons. In MDS and curvilinear component analysis, a shortest-path algorithm is adopted to approximately reconstruct the distance matrix between each two nodes, and our proposed Uniquely Determined Topology has a feature that a distance calculation model can be adopted to replace the shortest-path algorithm, therefore that the local distance matrix can be reconstructed more accurately. Theoretical analysis shows that it has a low computational complexity to determine whether a deployment is a Uniquely Determined Topology. Simulations show the advantages of the improved localization scheme, in that they do not depend on the connectivity level of the networks, and they can provide accurate localization when the estimation accuracy of distances is high.
Similar content being viewed by others
References
Aspnes, J., Eren, T., Goldenberg, D., Morse, A., Whiteley, W., Yang, Y., et al. (2006). A theory of network localization. IEEE Transactions on Mobile Computing, 5(12), 1663–1678.
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.
Camp, T., Boleng, J., & Davies, V. (2002). A survey of mobility models for ad hoc network research. Wireless Communications & Mobile Computing (WCMC): Special Issue on Mobile Ad Hoc Networking: Research, Trends and Applications, 2(5), 483–502.
Akyildiz, I. F., Su, W., Sankarasubramaniam, Y., & Cayirci, E. (2002). Wireless sensor networks: A survey. Computer Networks, 38(4), 393–422.
Atzoria, L., Ierab, A., & Morabito, G. (2010). The internet of things: A survey. Computer Networks, 54(15), 2787–2805.
Heidari, E., Gladisch, A., Moshiri, B., & Tavangarian, D. (2013). Survey on location information services for vehicular communication networks. Wireless Networks, 20, 1085–1105.
Liu, Y., Yang, Z., Wang, X., & Jian, L. (2010). Location, localization, and localizability. Journal of Computer Science and Technology, 25(2), 274–297.
Farid, Z., Nordin, R., & Ismail, M. (2013). Recent advances in wireless indoor localization techniques and system. Journal of Computer Networks and Communications, 2013, 1–12.
Beutel, J., Romer, K., Ringwald, M., & Woehrle, M. (2009). Deployment techniques for sensor networks. In Sensor Networks (pp. 219–248). Springer.
Esnaashari, M., & Meybodi, M. (2013). Deployment of a mobile wireless sensor network with k-coverage constraint: A cellular learning automata approach. Wireless Networks, 19(5), 945–968.
Shang, Y., Ruml, W., Zhang, Y., & Fromherz, M. P. J. (2003). Localization from mere connectivity. In Proceedings of the 4th ACM international symposium on mobile ad hoc networking & computing.
Borg, I., & Groenen, P. J. (2005). Modern multidimensional scaling, theory and applications. Berlin: Springer.
Shang, Y., & Ruml, W. (2004). Improved MDS-based localization. In INFOCOM (Vol. 4, pp. 2640–2651).
Li, L., & Kunz, T. (2009). Cooperative node localization using nonlinear data projection. ACM Transactions on Sensor Networks, 5(1), 1:1–1:26.
Alikhani, S., St-Hilaire, M., & Kunz, T. (2009). iCCA-MAP a new mobile node localization algorithm. In WIMOB ’09 proceedings of the 2009 IEEE international conference on wireless and mobile computing, networking and communications (pp. 382–387).
Connelly, R. (2005). Generic global rigidity. Discrete & Computational Geometry, 33(4), 549–563.
Saxe, J. (1979). Embeddability of weighted graphs in k-space is strongly np-hard. In The 17th Allerton conference on communications, control, and computing.
Goldenberg, D. K., Bihler, P., & Cao, M. (2006). Localization in sparse networks using sweeps. In The 12th annual international conference on mobile computing and networking.
Jackson, B., Jordan, T., & Szabadka, Z. (2006). Globally linked pairs of vertices in equivalent realizations of graphs. Discrete & Computational Geometry, 35(3), 493–512.
Hendrickson, B. (1992). Conditions for unique graph realizations. SIAM Journal on Computing, 21(1), 65–84.
Eren, T., Goldenberg, D., & Whiteley, W. (2004). Rigidity computation, and randomization in network localization. In IEEE INFOCOM (pp. 2673–2684).
Yang, Z., Liu, Y., & Li, X. Y. (2009). Beyond trilateration: On the localizability of wireless ad-hoc networks. In IEEE INFOCOM.
Chen, C. C., Chang, C. Y., & Li, Y. N. (2013). Range-free localization scheme in wireless sensor networks based on bilateration. International Journal of Distributed Sensor Networks, 2013, 1–10.
Priyantha, N. B. (2005). The cricket indoor location system. Technical report, MIT Computer Science and Artificial Intelligence Lab.
Priyantha, N. B., Chakraborty, A., & Balakrishnan, H. (2000). The cricket location-support system. In Proceedings of ACM MobiCom.
Priyantha, N., Miu, A., Balakrishnan, H., & Teller, S. (2001). The cricket compass for context-aware mobile applications. In 6th ACM MOBICOM.
Wylie, M., Holtzman, J. (1996). The non-line of sight problem in mobile location estimation. In Universal Personal Communications (pp. 827–831).
Jacksona, B., & Jordan, T. (2005). Connected rigidity matroids and unique realizations of graphs. Journal of Combinatorial Theory, Series B, 94(1), 1–29.
Raab, F., Blood, E., Steiner, T., & Jones, H. (1979). Magnetic position and orientation tracking system. IEEE Transactions on Aerospace and Electronic Systems, 15, 709–718.
Acknowledgments
This paper owes great gratitude to Dr. Ying Zhang at Palo Alto Research Center and Yi Shang at University of Missouri-Columbia for their kindness to provide the MDS-MAP(P) code, and also owes great gratitude to Li Li at Communications Research Centre Canada and Thomas at Kunz Carleton University for their kindness to provide the CCA code, which speeds up our work a lot. Thanks again.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Sun, D., Leung, V.C.M., Qian, Z. et al. Beacon deployment strategy for guaranteed localization in wireless sensor networks. Wireless Netw 22, 1947–1959 (2016). https://doi.org/10.1007/s11276-015-1071-4
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11276-015-1071-4