Improve the Robustness of Range-Free Localization Methods on Wireless Sensor Networks using Recursive Position Estimation Algorithm

The position of a sensor node at wireless sensor networks determines the received data sensing accuracy. By the knowledge of sensor positioning, the location of target sensed can be estimated. Localization techniques used to find out the position of sensor node by considering the distance of this sensor from the vicinity reference nodes.  Centroid Algorithm is a robust, simple and low cost localization technique without dependence on hardware requirement. We propose Recursive Position Estimation Algorithm to obtain the more accurate node positioning on range-free localization technique. The simulation result shows that this algorithm has the ability on increasing position accuracy up to 50%.  The trade off factor shows the smaller the number of reference nodes the higher the computational time required. The new method on the availability on sensor power controlled is proposed to optimize the estimated position

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

A practical approach for outdoors distributed target localization in wireless sensor networks

Wireless sensor networks are posed as the new communication paradigm where the use of small, low-complexity, and low-power devices is preferred over costly centralized systems. The spectra of potential applications of sensor networks is very wide, ranging from monitoring, surveillance, and localization, among others. Localization is a key application in sensor networks and the use of simple, efficient, and distributed algorithms is of paramount practical importance. Combining convex optimization tools with consensus algorithms we propose a distributed localization algorithm for scenarios where received signal strength indicator readings are used. We approach the localization problem by formulating an alternative problem that uses distance estimates locally computed at each node. The formulated problem is solved by a relaxed version using semidefinite relaxation technique. Conditions under which the relaxed problem yields to the same solution as the original problem are given and a distributed consensusbased implementation of the algorithm is proposed based on an augmented Lagrangian approach and primaldual decomposition methods. Although suboptimal, the proposed approach is very suitable for its implementation in real sensor networks, i.e., it is scalable, robust against node failures and requires only local communication among neighboring nodes. Simulation results show that running an additional local search around the found solution can yield performance close to the maximum likelihood estimate

Improvement of range-free localization technology by a novel DV-hop protocol in wireless sensor networks

International audienceLocalization is a fundamental issue for many applications in wireless sensor networks. Without the need of additional ranging devices, the range-free localization technology is a cost-effective solution for low-cost indoor and outdoor wireless sensor networks. Among range-free algorithms, DV-hop (Distance Vector - hop) has the advantage to localize the mobile nodes which has less than three neighbour anchors. Based on the original DV-hop algorithm, this paper presents two improved algorithms (Checkout DV-hop and Selective 3-Anchor DV-hop). Checkout DV-hop algorithm estimates the mobile node position by using the nearest anchor, while Selective 3-Anchor DV-hop algorithm chooses the best 3 anchors to improve localization accuracy. Then, in order to implement these DV-hop based algorithms in network scenarios, a novel DV-hop localization protocol is proposed. This new protocol is presented in detail in this paper, including the format of data payloads, the improved collision reduction method E-CSMA/CA, as well as parameters used in deciding the end of each DV-hop step. Finally, using our localization protocol, we investigate the performance of typical DV-hop based algorithms in terms of localization accuracy, mobility, synchronization and overhead. Simulation results prove that Selective 3-Anchor DV-hop algorithm offers the best performance compared to Checkout DV-hop and the original DV-hop algorithm

Development an accurate and stable range-free localization scheme for anisotropic wireless sensor networks

With the high-speed development of wireless radio technology, numerous sensor nodes are integrated into wireless sensor networks, which has promoted plentiful location-based applications that are successfully applied in various fields, such as monitoring natural disasters and post-disaster rescue. Location information is an integral part of wireless sensor networks, without location information, all received data will lose meaning. However, the current localization scheme is based on equipped GPS on every node, which is not cost-efficient and not suitable for large-scale wireless sensor networks and outdoor environments. To address this problem, research scholars have proposed a rangefree localization scheme which only depends on network connectivity. Nevertheless, as the representative range-free localization scheme, Distance Vector-Hop (DV-Hop) localization algorithm demonstrates extremely poor localization accuracy under anisotropic wireless sensor networks. The previous works assumed that the network environment is evenly and uniformly distributed, ignored anisotropic factors in a real setting. Besides, most research academics improved the localization accuracy to a certain degree, but at expense of high communication overhead and computational complexity, which cannot meet the requirements of high-precision applications for anisotropic wireless sensor networks. Hence, finding a fast, accurate, and strong solution to solve the range-free localization problem is still a big challenge. Accordingly, this study aspires to bridge the research gap by exploring a new DV-Hop algorithm to build a fast, costefficient, strong range-free localization scheme. This study developed an optimized variation of the DV-Hop localization algorithm for anisotropic wireless sensor networks. To address the poor localization accuracy problem in irregular C-shaped network topology, it adopts an efficient Grew Wolf Optimizer instead of the least-squares method. The dynamic communication range is introduced to refine hop between anchor nodes, and new parameters are recommended to optimize network protocol to balance energy cost in the initial step. Besides, the weighted coefficient and centroid algorithm is employed to reduce cumulative error by hop count and cut down computational complexity. The developed localization framework is separately validated and evaluated each optimized step under various evaluation criteria, in terms of accuracy, stability, and cost, etc. The results of EGWO-DV-Hop demonstrated superior localization accuracy under both topologies, the average localization error dropped up to 87.79% comparing with basic DV-Hop under C-shaped topology. The developed enhanced DWGWO-DVHop localization algorithm illustrated a favorable result with high accuracy and strong stability. The overall localization error is around 1.5m under C-shaped topology, while the traditional DV-Hop algorithm is large than 20m. Generally, the average localization error went down up to 93.35%, compared with DV-Hop. The localization accuracy and robustness of comparison indicated that the developed DWGWO-DV-Hop algorithm super outperforms the other classical range-free methods. It has the potential significance to be guided and applied in practical location-based applications for anisotropic wireless sensor networks

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

Reference Nodes Selection for Anchor-Free Localization in Wireless Sensor Networks

Dizertační práce se zabývá návrhem nového bezkotevního lokalizačního algoritmu sloužícího pro výpočet pozice uzlů v bezdrátových senzorových sítích. Provedené studie ukázaly, že dosavadní bezkotevní lokalizační algoritmy, pracující v paralelním režimu, dosahují malých lokalizačních chyb. Jejich nevýhodou ovšem je, že při sestavení množiny referenčních uzlu spotřebovávají daleko větší množství energie než algoritmy pracující v inkrementálním režimu. Paralelní lokalizační algoritmy využívají pro určení pozice referenční uzly nacházející se na protilehlých hranách bezdrátové sítě. Nový lokalizační algoritmus označený jako BRL (Boundary Recognition aided Localization) je založen na myšlence decentralizovaně detekovat uzly ležící na hranici síti a pouze z této množiny vybrat potřebný počet referenčních uzlu. Pomocí navrženého přístupu lze znažně snížit množství energie spotřebované v průběhu procesu výběru referenčních uzlů v senzorovém poli. Dalším přínosem ke snížení energetických nároku a zároveň zachování nízké lokalizační chyby je využití procesu multilaterace se třemi, eventuálně čtyřmi referenčními body. V rámci práce byly provedeny simulace několika dílčích algoritmu a jejich funkčnost byla ověřena experimentálně v reálné senzorové síti. Navržený algoritmus BRL byl porovnán z hlediska lokalizační chyby a počtu zpracovaných paketů s několika známými lokalizačními algoritmy. Výsledky simulací dokázaly, že navržený algoritmus představuje efektivní řešení pro přesnou a zároveň nízkoenergetickou lokalizaci uzlů v bezdrátových senzorových sítích.The doctoral thesis is focused on a design of a novel anchor free localization algorithm for wireless sensor networks. As introduction, the incremental and concurrent anchor free localization algorithms are presented and their performance is compared. It was found that contemporary anchor free localization algorithms working in the concurrent manner achieve a low localization error, but dissipate signicant energy reserves. A new Boundary Recognition Aided Localization algorithm presented in this thesis is based on an idea to recognize the nodes placed on the boundary of network and thus reduce the number of transmission realized during the reference nodes selection phase of the algorithm. For the position estimation, the algorithm employs the multilateration technique that work eectively with the low number of the reference nodes. Proposed algorithms are tested through the simulations and validated by the real experiment with the wireless sensor network. The novel Boundary Recognition Aided Localization algorithm is compared with the known algorithms in terms of localization error and the communication cost. The results show that the novel algorithm presents powerful solution for the anchor free localization.

Dead Reckoning Localization Technique for Mobile Wireless Sensor Networks

Localization in wireless sensor networks not only provides a node with its geographical location but also a basic requirement for other applications such as geographical routing. Although a rich literature is available for localization in static WSN, not enough work is done for mobile WSNs, owing to the complexity due to node mobility. Most of the existing techniques for localization in mobile WSNs uses Monte-Carlo localization, which is not only time-consuming but also memory intensive. They, consider either the unknown nodes or anchor nodes to be static. In this paper, we propose a technique called Dead Reckoning Localization for mobile WSNs. In the proposed technique all nodes (unknown nodes as well as anchor nodes) are mobile. Localization in DRLMSN is done at discrete time intervals called checkpoints. Unknown nodes are localized for the first time using three anchor nodes. For their subsequent localizations, only two anchor nodes are used. The proposed technique estimates two possible locations of a node Using Bezouts theorem. A dead reckoning approach is used to select one of the two estimated locations. We have evaluated DRLMSN through simulation using Castalia simulator, and is compared with a similar technique called RSS-MCL proposed by Wang and Zhu .Comment: Journal Paper, IET Wireless Sensor Systems, 201