Social Network Analysis Based Localization Technique with Clustered Closeness Centrality for 3D Wireless Sensor Networks

[EN] In this paper, we proposed a new wireless localization technique based on the ideology of social network analysis (SNA), to study the different properties of networks as a graph. Centrality is a main concept in SNA, so we propose using closeness centrality (CC) as a measurement to denote the importance of the node inside the network due to its geo-location to others. The node with highest degree of CC is chosen as a cluster heads, then each cluster head can form its trilateration process to collect data from its cluster. The selection of closest cluster based on CC values, and the unknown node's location can be estimated through the trilateration process. To form a perfect trilateration, the cluster head chooses three anchor nodes. The proposed algorithm provides high accuracy even in different network topologies like concave shape, O shape, and C shape as compared to existing received signal strength indicator (RSSI) techniques. Matlab simulation results based on practical radio propagation data sets showed a localization error of 0.32 m with standard deviation of 0.26 m.This work was fully supported by the Vice Chancellor Doctoral Scholarship at Auckland University of Technology, New Zealand.Ahmad, T.; Li, XJ.; Seet, B.; Cano, J. (2020). Social Network Analysis Based Localization Technique with Clustered Closeness Centrality for 3D Wireless Sensor Networks. Electronics. 9(5):1-19. https://doi.org/10.3390/electronics9050738S11995Zhou, B., Yao, X., Yang, L., Yang, S., Wu, S., Kim, Y., & Ai, L. (2019). Accurate Rigid Body Localization Using DoA Measurements from a Single Base Station. Electronics, 8(6), 622. doi:10.3390/electronics8060622Ahmad, T., Li, X., & Seet, B.-C. (2017). Parametric Loop Division for 3D Localization in Wireless Sensor Networks. Sensors, 17(7), 1697. doi:10.3390/s17071697Kaur, A., Kumar, P., & Gupta, G. P. (2019). A weighted centroid localization algorithm for randomly deployed wireless sensor networks. Journal of King Saud University - Computer and Information Sciences, 31(1), 82-91. doi:10.1016/j.jksuci.2017.01.007Khelifi, F., Bradai, A., Benslimane, A., Rawat, P., & Atri, M. (2018). A Survey of Localization Systems in Internet of Things. Mobile Networks and Applications, 24(3), 761-785. doi:10.1007/s11036-018-1090-3Sanchez-Iborra, R., G. Liaño, I., Simoes, C., Couñago, E., & Skarmeta, A. (2018). Tracking and Monitoring System Based on LoRa Technology for Lightweight Boats. Electronics, 8(1), 15. doi:10.3390/electronics8010015Sayed, A. H., Tarighat, A., & Khajehnouri, N. (2005). Network-based wireless location: challenges faced in developing techniques for accurate wireless location information. IEEE Signal Processing Magazine, 22(4), 24-40. doi:10.1109/msp.2005.1458275Maşazade, E., Ruixin Niu, Varshney, P. K., & Keskinoz, M. (2010). Energy Aware Iterative Source Localization for Wireless Sensor Networks. IEEE Transactions on Signal Processing, 58(9), 4824-4835. doi:10.1109/tsp.2010.2051433Yang, X., Kong, Q., & Xie, X. (2009). One-Dimensional Localization Algorithm Based on Signal Strength Ratio. International Journal of Distributed Sensor Networks, 5(1), 79-79. doi:10.1080/15501320802571822Xie, S., Wang, T., Hao, X., Yang, M., Zhu, Y., & Li, Y. (2019). Localization and Frequency Identification of Large-Range Wide-Band Electromagnetic Interference Sources in Electromagnetic Imaging System. Electronics, 8(5), 499. doi:10.3390/electronics8050499Zhu, X., Wu, X., & Chen, G. (2013). Relative localization for wireless sensor networks with linear topology. Computer Communications, 36(15-16), 1581-1591. doi:10.1016/j.comcom.2013.07.007Meng, W., Xiao, W., & Xie, L. (2011). An Efficient EM Algorithm for Energy-Based Multisource Localization in Wireless Sensor Networks. IEEE Transactions on Instrumentation and Measurement, 60(3), 1017-1027. doi:10.1109/tim.2010.2047035Lim, H., & Hou, J. C. (2009). Distributed localization for anisotropic sensor networks. ACM Transactions on Sensor Networks, 5(2), 1-26. doi:10.1145/1498915.1498917Xiaohong Sheng, & Yu-Hen Hu. (2005). Maximum likelihood multiple-source localization using acoustic energy measurements with wireless sensor networks. IEEE Transactions on Signal Processing, 53(1), 44-53. doi:10.1109/tsp.2004.838930Yun Wang, Xiaodong Wang, Demin Wang, & Agrawal, D. P. (2009). Range-Free Localization Using Expected Hop Progress in Wireless Sensor Networks. IEEE Transactions on Parallel and Distributed Systems, 20(10), 1540-1552. doi:10.1109/tpds.2008.239Huang, H., & Zheng, Y. R. (2018). Node localization with AoA assistance in multi-hop underwater sensor networks. Ad Hoc Networks, 78, 32-41. doi:10.1016/j.adhoc.2018.05.005Zàruba, G. V., Huber, M., Kamangar, F. A., & Chlamtac, I. (2006). Indoor location tracking using RSSI readings from a single Wi-Fi access point. Wireless Networks, 13(2), 221-235. doi:10.1007/s11276-006-5064-1Singh, M., & Khilar, P. M. (2015). An analytical geometric range free localization scheme based on mobile beacon points in wireless sensor network. Wireless Networks, 22(8), 2537-2550. doi:10.1007/s11276-015-1116-8Yiqiang Chen, Qiang Yang, Jie Yin, & Xiaoyong Chai. (2006). Power-efficient access-point selection for indoor location estimation. IEEE Transactions on Knowledge and Data Engineering, 18(7), 877-888. doi:10.1109/tkde.2006.112Alzoubi, K., Li, X.-Y., Wang, Y., Wan, P.-J., & Frieder, O. (2003). Geometric spanners for wireless ad hoc networks. IEEE Transactions on Parallel and Distributed Systems, 14(4), 408-421. doi:10.1109/tpds.2003.1195412Safa, H. (2014). A novel localization algorithm for large scale wireless sensor networks. Computer Communications, 45, 32-46. doi:10.1016/j.comcom.2014.03.020Kaemarungsi, K., & Krishnamurthy, P. (2012). Analysis of WLAN’s received signal strength indication for indoor location fingerprinting. Pervasive and Mobile Computing, 8(2), 292-316. doi:10.1016/j.pmcj.2011.09.003Patwari, N., Hero, A. O., Perkins, M., Correal, N. S., & O’Dea, R. J. (2003). Relative location estimation in wireless sensor networks. IEEE Transactions on Signal Processing, 51(8), 2137-2148. doi:10.1109/tsp.2003.814469Niculescu, D. (2003). Telecommunication Systems, 22(1/4), 267-280. doi:10.1023/a:1023403323460Mahyar, H., Hasheminezhad, R., Ghalebi K., E., Nazemian, A., Grosu, R., Movaghar, A., & Rabiee, H. R. (2018). Compressive sensing of high betweenness centrality nodes in networks. Physica A: Statistical Mechanics and its Applications, 497, 166-184. doi:10.1016/j.physa.2017.12.145Plets, D., Bastiaens, S., Martens, L., & Joseph, W. (2019). An Analysis of the Impact of LED Tilt on Visible Light Positioning Accuracy. Electronics, 8(4), 389. doi:10.3390/electronics8040389RSSI Datasethttps://github.com/pspachos/RSSI-DatasetAhmad, T., Li, X. J., & Seet, B.-C. (2019). Noise Reduction Scheme for Parametric Loop Division 3D Wireless Localization Algorithm Based on Extended Kalman Filtering. Journal of Sensor and Actuator Networks, 8(2), 24. doi:10.3390/jsan8020024Benson, S. J., Ye, Y., & Zhang, X. (2000). Solving Large-Scale Sparse Semidefinite Programs for Combinatorial Optimization. SIAM Journal on Optimization, 10(2), 443-461. doi:10.1137/s105262349732800

Machine Learning in Wireless Sensor Networks: Algorithms, Strategies, and Applications

Wireless sensor networks monitor dynamic environments that change rapidly over time. This dynamic behavior is either caused by external factors or initiated by the system designers themselves. To adapt to such conditions, sensor networks often adopt machine learning techniques to eliminate the need for unnecessary redesign. Machine learning also inspires many practical solutions that maximize resource utilization and prolong the lifespan of the network. In this paper, we present an extensive literature review over the period 2002-2013 of machine learning methods that were used to address common issues in wireless sensor networks (WSNs). The advantages and disadvantages of each proposed algorithm are evaluated against the corresponding problem. We also provide a comparative guide to aid WSN designers in developing suitable machine learning solutions for their specific application challenges.Comment: Accepted for publication in IEEE Communications Surveys and Tutorial

Coverage Protocols for Wireless Sensor Networks: Review and Future Directions

The coverage problem in wireless sensor networks (WSNs) can be generally defined as a measure of how effectively a network field is monitored by its sensor nodes. This problem has attracted a lot of interest over the years and as a result, many coverage protocols were proposed. In this survey, we first propose a taxonomy for classifying coverage protocols in WSNs. Then, we classify the coverage protocols into three categories (i.e. coverage aware deployment protocols, sleep scheduling protocols for flat networks, and cluster-based sleep scheduling protocols) based on the network stage where the coverage is optimized. For each category, relevant protocols are thoroughly reviewed and classified based on the adopted coverage techniques. Finally, we discuss open issues (and recommend future directions to resolve them) associated with the design of realistic coverage protocols. Issues such as realistic sensing models, realistic energy consumption models, realistic connectivity models and sensor localization are covered

Overlapping Multi-hop Clustering for Wireless Sensor Networks

Clustering is a standard approach for achieving efficient and scalable performance in wireless sensor networks. Traditionally, clustering algorithms aim at generating a number of disjoint clusters that satisfy some criteria. In this paper, we formulate a novel clustering problem that aims at generating overlapping multi-hop clusters. Overlapping clusters are useful in many sensor network applications, including inter-cluster routing, node localization, and time synchronization protocols. We also propose a randomized, distributed multi-hop clustering algorithm (KOCA) for solving the overlapping clustering problem. KOCA aims at generating connected overlapping clusters that cover the entire sensor network with a specific average overlapping degree. Through analysis and simulation experiments we show how to select the different values of the parameters to achieve the clustering process objectives. Moreover, the results show that KOCA produces approximately equal-sized clusters, which allows distributing the load evenly over different clusters. In addition, KOCA is scalable; the clustering formation terminates in a constant time regardless of the network size

K-Means Fingerprint Clustering for Low-Complexity Floor Estimation in Indoor Mobile Localization

Indoor localization in multi-floor buildings is an important research problem. Finding the correct floor, in a fast and efficient manner, in a shopping mall or an unknown university building can save the users' search time and can enable a myriad of Location Based Services in the future. One of the most widely spread techniques for floor estimation in multi-floor buildings is the fingerprinting-based localization using Received Signal Strength (RSS) measurements coming from indoor networks, such as WLAN and BLE. The clear advantage of RSS-based floor estimation is its ease of implementation on a multitude of mobile devices at the Application Programming Interface (API) level, because RSS values are directly accessible through API interface. However, the downside of a fingerprinting approach, especially for large-scale floor estimation and positioning solutions, is their need to store and transmit a huge amount of fingerprinting data. The problem becomes more severe when the localization is intended to be done on mobile devices which have limited memory, power, and computational resources. An alternative floor estimation method, which has lower complexity and is faster than the fingerprinting is the Weighted Centroid Localization (WCL) method. The trade-off is however paid in terms of a lower accuracy than the one obtained with traditional fingerprinting with Nearest Neighbour (NN) estimates. In this paper a novel K-means-based method for floor estimation via fingerprint clustering of WiFi and various other positioning sensor outputs is introduced. Our method achieves a floor estimation accuracy close to the one with NN fingerprinting, while significantly improves the complexity and the speed of the floor detection algorithm. The decrease in the database size is achieved through storing and transmitting only the cluster heads (CH's) and their corresponding floor labels.Comment: Accepted to IEEE Globecom 2015, Workshop on Localization and Tracking: Indoors, Outdoors and Emerging Network