A mobile anchor assisted localization algorithm based on regular hexagon in wireless sensor networks

Localization is one of the key technologies in wireless sensor networks (WSNs), since it provides fundamental support for many location-aware protocols and applications. Constraints of cost and power consumption make it infeasible to equip each sensor node in the network with a global position system(GPS) unit, especially for large-scale WSNs. A promising method to localize unknown nodes is to use several mobile anchors which are equipped with GPS units moving among unknown nodes and periodically broadcasting their current locations to help nearby unknown nodes with localization. This paper proposes a mobile anchor assisted localization algorithm based on regular hexagon (MAALRH) in two-dimensional WSNs, which can cover the whole monitoring area with a boundary compensation method. Unknown nodes calculate their positions by using trilateration. We compare the MAALRH with HILBERT, CIRCLES, and S-CURVES algorithms in terms of localization ratio, localization accuracy, and path length. Simulations show that the MAALRH can achieve high localization ratio and localization accuracy when the communication range is not smaller than the trajectory resolution.The work is supported by the Natural Science Foundation of Jiangsu Province of China, no. BK20131137; the Applied Basic Research Program of Nantong Science and Technology Bureau, no. BK2013032; and the Guangdong University of Petrochemical Technology's Internal Project, no. 2012RC0106. Jaime Lloret's work has been partially supported by the "Ministerio de Ciencia e Innovacion," through the "Plan Nacional de I+D+i 2008-2011" in the "Subprograma de Proyectos de Investigacion Fundamental," Project TEC2011-27516. Joel J. P. C. Rodrigues's work has been supported by "Instituto de Telecomunicacoes," Next Generation Networks and Applications Group (NetGNA), Covilha Delegation, by national funding from the Fundacao para a Ciencia e a Tecnologia (FCT) through the Pest-OE/EEI/LA0008/2013 Project.Han, G.; Zhang, C.; Lloret, J.; Shu, L.; Rodrigues, JJPC. (2014). A mobile anchor assisted localization algorithm based on regular hexagon in wireless sensor networks. Scientific World Journal. https://doi.org/10.1155/2014/219371SLiu, Y., Yang, Z., Wang, X., & Jian, L. (2010). Location, Localization, and Localizability. Journal of Computer Science and Technology, 25(2), 274-297. doi:10.1007/s11390-010-9324-2Akcan, H., Kriakov, V., Brönnimann, H., & Delis, A. (2010). Managing cohort movement of mobile sensors via GPS-free and compass-free node localization. Journal of Parallel and Distributed Computing, 70(7), 743-757. doi:10.1016/j.jpdc.2010.03.007Akyildiz, I. F., Weilian Su, Sankarasubramaniam, Y., & Cayirci, E. (2002). A survey on sensor networks. IEEE Communications Magazine, 40(8), 102-114. doi:10.1109/mcom.2002.1024422Vupputuri, S., Rachuri, K. K., & Siva Ram Murthy, C. (2010). Using mobile data collectors to improve network lifetime of wireless sensor networks with reliability constraints. Journal of Parallel and Distributed Computing, 70(7), 767-778. doi:10.1016/j.jpdc.2010.03.010Zeng, Y., Cao, J., Hong, J., Zhang, S., & Xie, L. (2010). Secure localization and location verification in wireless sensor networks: a survey. The Journal of Supercomputing, 64(3), 685-701. doi:10.1007/s11227-010-0501-4Han, G., Xu, H., Duong, T. Q., Jiang, J., & Hara, T. (2011). Localization algorithms of Wireless Sensor Networks: a survey. Telecommunication Systems, 52(4), 2419-2436. doi:10.1007/s11235-011-9564-7Al-Fuqaha, A. (2013). A Precise Indoor Localization Approach based on Particle Filter and Dynamic Exclusion Techniques. Network Protocols and Algorithms, 5(2), 50. doi:10.5296/npa.v5i2.3717Chaurasiya, V. K., Jain, N., & Nandi, G. C. (2014). A novel distance estimation approach for 3D localization in wireless sensor network using multi dimensional scaling. Information Fusion, 15, 5-18. doi:10.1016/j.inffus.2013.06.003Diallo, O., Rodrigues, J. J. P. C., & Sene, M. (2012). Real-time data management on wireless sensor networks: A survey. Journal of Network and Computer Applications, 35(3), 1013-1021. doi:10.1016/j.jnca.2011.12.006Amundson, I., & Koutsoukos, X. D. (2009). A Survey on Localization for Mobile Wireless Sensor Networks. Lecture Notes in Computer Science, 235-254. doi:10.1007/978-3-642-04385-7_16Ding, Y., Wang, C., & Xiao, L. (2010). Using mobile beacons to locate sensors in obstructed environments. Journal of Parallel and Distributed Computing, 70(6), 644-656. doi:10.1016/j.jpdc.2010.03.002Chenji, H., & Stoleru, R. (2010). Mobile Sensor Network Localization in Harsh Environments. Lecture Notes in Computer Science, 244-257. doi:10.1007/978-3-642-13651-1_18Campos, A. N., Souza, E. L., Nakamura, F. G., Nakamura, E. F., & Rodrigues, J. J. P. C. (2012). On the Impact of Localization and Density Control Algorithms in Target Tracking Applications for Wireless Sensor Networks. Sensors, 12(6), 6930-6952. doi:10.3390/s120606930Ou, C.-H., & He, W.-L. (2013). Path Planning Algorithm for Mobile Anchor-Based Localization in Wireless Sensor Networks. IEEE Sensors Journal, 13(2), 466-475. doi:10.1109/jsen.2012.2218100Koutsonikolas, D., Das, S. M., & Hu, Y. C. (2007). Path planning of mobile landmarks for localization in wireless sensor networks. Computer Communications, 30(13), 2577-2592. doi:10.1016/j.comcom.2007.05.048Cui, H., & Wang, Y. (2012). Four-mobile-beacon assisted localization in three-dimensional wireless sensor networks. Computers & Electrical Engineering, 38(3), 652-661. doi:10.1016/j.compeleceng.2011.10.012Ssu, K.-F., Ou, C.-H., & Jiau, H. C. (2005). Localization With Mobile Anchor Points in Wireless Sensor Networks. IEEE Transactions on Vehicular Technology, 54(3), 1187-1197. doi:10.1109/tvt.2005.844642Guo, Z., Guo, Y., Hong, F., Jin, Z., He, Y., Feng, Y., & Liu, Y. (2010). Perpendicular Intersection: Locating Wireless Sensors With Mobile Beacon. IEEE Transactions on Vehicular Technology, 59(7), 3501-3509. doi:10.1109/tvt.2010.2049391Bin Xiao, Hekang Chen, & Shuigeng Zhou. (2008). Distributed Localization Using a Moving Beacon in Wireless Sensor Networks. IEEE Transactions on Parallel and Distributed Systems, 19(5), 587-600. doi:10.1109/tpds.2007.70773Lee, S., Kim, E., Kim, C., & Kim, K. (2009). Localization with a mobile beacon based on geometric constraints in wireless sensor networks. IEEE Transactions on Wireless Communications, 8(12), 5801-5805. doi:10.1109/twc.2009.12.090319Han, G., Choi, D., & Lim, W. (2009). Reference node placement and selection algorithm based on trilateration for indoor sensor networks. Wireless Communications and Mobile Computing, 9(8), 1017-1027. doi:10.1002/wcm.65

Sparse Localization with a Mobile Beacon Based on LU Decomposition in Wireless Sensor Networks

Node localization is the core in wireless sensor network. It can be solved by powerful beacons, which are equipped with global positioning system devices to know their location information. In this article, we present a novel sparse localization approach with a mobile beacon based on LU decomposition. Our scheme firstly translates node localization problem into a 1-sparse vector recovery problem by establishing sparse localization model. Then, LU decomposition pre-processing is adopted to solve the problem that measurement matrix does not meet the re¬stricted isometry property. Later, the 1-sparse vector can be exactly recovered by compressive sensing. Finally, as the 1-sparse vector is approximate sparse, weighted Cen¬troid scheme is introduced to accurately locate the node. Simulation and analysis show that our scheme has better localization performance and lower requirement for the mobile beacon than MAP+GC, MAP-M, and MAP-M&N schemes. In addition, the obstacles and DOI have little effect on the novel scheme, and it has great localization performance under low SNR, thus, the scheme proposed is robust

A survey of localization in wireless sensor network

Localization is one of the key techniques in wireless sensor network. The location estimation methods can be classified into target/source localization and node self-localization. In target localization, we mainly introduce the energy-based method. Then we investigate the node self-localization methods. Since the widespread adoption of the wireless sensor network, the localization methods are different in various applications. And there are several challenges in some special scenarios. In this paper, we present a comprehensive survey of these challenges: localization in non-line-of-sight, node selection criteria for localization in energy-constrained network, scheduling the sensor node to optimize the tradeoff between localization performance and energy consumption, cooperative node localization, and localization algorithm in heterogeneous network. Finally, we introduce the evaluation criteria for localization in wireless sensor network

A Game Theoretical Analysis of Localization Security in Wireless Sensor Networks with Adversaries

Wireless Sensor Networks (WSN) support data collection and distributed data processing by means of very small sensing devices that are easy to tamper and cloning: therefore classical security solutions based on access control and strong authentication are difficult to deploy. In this paper we look at the problem of assessing security of node localization. In particular, we analyze the scenario in which Verifiable Multilateration (VM) is used to localize nodes and a malicious node (i.e., the adversary) try to masquerade as non-malicious. We resort to non-cooperative game theory and we model this scenario as a two-player game. We analyze the optimal players' strategy and we show that the VM is indeed a proper mechanism to reduce fake positions.Comment: International Congress on Ultra Modern Telecommunications and Control Systems 2010. (ICUMT'10

Group behavior impact on an opportunistic localization scheme

In this paper we tackled the localization problem from an opportunistic perspective, according to which a node can infer its own spatial position by exchanging data with passing by nodes, called peers. We consider an opportunistic localization algorithm based on the linear matrix inequality (LMI) method coupled with a weighted barycenter algorithm. This scheme has been previously analyzed in scenarios with random deployment of peers, proving its effectiveness. In this paper, we extend the analysis by considering more realistic mobility models for peer nodes. More specifically, we consider two mobility models, namely the Group Random Waypoint Mobility Model and the Group Random Pedestrian Mobility Model, which is an improvement of the first one. Hence, we analyze by simulation the opportunistic localization algorithm for both the models, in order to gain insights on the impact of nodes mobility pattern onto the localization performance. The simulation results show that the mobility model has non-negligible effect on the final localization error, though the performance of the opportunistic localization scheme remains acceptable in all the considered scenarios

Jointly Optimizing Placement and Inference for Beacon-based Localization

The ability of robots to estimate their location is crucial for a wide variety of autonomous operations. In settings where GPS is unavailable, measurements of transmissions from fixed beacons provide an effective means of estimating a robot's location as it navigates. The accuracy of such a beacon-based localization system depends both on how beacons are distributed in the environment, and how the robot's location is inferred based on noisy and potentially ambiguous measurements. We propose an approach for making these design decisions automatically and without expert supervision, by explicitly searching for the placement and inference strategies that, together, are optimal for a given environment. Since this search is computationally expensive, our approach encodes beacon placement as a differential neural layer that interfaces with a neural network for inference. This formulation allows us to employ standard techniques for training neural networks to carry out the joint optimization. We evaluate this approach on a variety of environments and settings, and find that it is able to discover designs that enable high localization accuracy.Comment: Appeared at 2017 International Conference on Intelligent Robots and Systems (IROS

Opportunistic Localization Scheme Based on Linear Matrix Inequality

Enabling self-localization of mobile nodes is an important problem that has been widely studied in the literature. The general conclusions is that an accurate localization requires either sophisticated hardware (GPS, UWB, ultrasounds transceiver) or a dedicated infrastructure (GSM, WLAN). In this paper we tackle the problem from a different and rather new perspective: we investigate how localization performance can be improved by means of a cooperative and opportunistic data exchange among the nodes. We consider a target node, completely unaware of its own position, and a number of mobile nodes with some self-localization capabilities. When the opportunity occurs, the target node can exchange data with in-range mobile nodes. This opportunistic data exchange is then used by the target node to refine its position estimate by using a technique based on Linear Matrix Inequalities and barycentric algorithm. To investigate the performance of such an opportunistic localization algorithm, we define a simple mathematical model that describes the opportunistic interactions and, then, we run several computer simulations for analyzing the effect of the nodes duty-cycle and of the native self-localization error modeling considered. The results show that the opportunistic interactions can actually improve the self-localization accuracy of a strayed node in many different scenarios

An opportunistic indoors positioning scheme based on estimated positions

The localization requirements for mobile nodes in wireless (sensor) networks are increasing. However, most research works are based on range measurements between nodes which are often oversensitive to the measurement error. In this paper we propose a location estimation scheme based on moving nodes that opportunistically exchange known positions. The user couples a linear matrix inequality (LMI) method with a barycenter computation to estimate its position. Simulations have shown that the accuracy of the estimation increases when the number of known positions increases, the radio range decreases and the node speeds increase. The proposed method only depends on a maximum RSS threshold to take into account a known position, which makes it robust and easy to implement. To obtain an accuracy of 1 meter, a user may have to wait at the same position for 5 minutes, with 8 pedestrians moving within range on average