An Adaptive Localization Approach for Wireless Sensor Networks Based on Gauss-Markov Mobility Model (original) (raw)
Related papers
A Novel Approach for Localization of Moving Target Nodes in Wireless Sensor Networks
International Journal of Grid and Distributed Computing
Localization of a target node is a fundamental and important requirement in wireless sensor network (WSN) because the sensor data is useless if we don't know the exact location of the occurring event. So, most of the applications in WSNs requires the geographical location of the sensor nodes. This paper proposes the application of PSO based computation intelligence algorithm for distributed optimal localization of randomly moving target nodes. Anchor nodes are deployed at the edges of the sensing field. The performance based results on experimental mobile sensor network data demonstrate the effectiveness of the proposed algorithms by comparing the performance in terms of the number of nodes localized, localization accuracy and scalability.
Impact of static trajectories on localization in wireless sensor networks
Abstract A Wireless Sensor Network (WSN) consists of many sensors that communicate wirelessly to monitor a physical region. Location information is critical essential and indispensable for many applications of WSNs. A promising solution for localizing statically deployed sensors is to benefit from mobile location-aware nodes called beacons. However, the essential problem is to find the optimum path that the mobile beacon should travel in order to improve localization accuracy, time and success as well as energy efficiency. In this paper, we evaluate the performance of five mobile beacon trajectories; Random Way Point, Scan, Hilbert, Circles and Localization algorithm with a Mobile Anchor node based on Trilateration (LMAT) based on three different localization techniques such as Weighted Centroid Localization and trilateration with time priority and accuracy priority. This evaluation aims to find effective and essential properties that the trajectory should have. Our simulations show that a random movement cannot guarantee the performance of localization. The results also show the efficiency of LMAT regarding accuracy, success and collinearity while the Hilbert space filling curve has lower energy consumption. Circles path planning can help to localize unknown sensors faster than others at the expense of lower localization precision.
Localization in Mobile Wireless Sensor Networks (WSNs), particularly in areas like surveillance applications, necessitates triggering re-localization in different time periods in order to maintain accurate positioning. Further, the re-localization process should be designed for time and energy efficiency in these resource constrained networks. In this paper, an energy and time efficient algorithm is proposed to determine the optimum number of localized nodes that collaborate in the re-localization process. Four different movement methods (Random Waypoint Pattern, Modified Random Waypoint pattern, Brownian motion and Levy walk) are applied to model node movement. In order to perform re-localization, a server/head/anchor node activates the optimal number of localized nodes in each island/cluster. A Markov Decision Process (MDP) based algorithm is proposed to find the optimal policy to select those nodes in better condition to cooperate in the re-localization process. The simulation shows that the proposed MDP algorithm decreases the energy consumption in the WSN between 0.6% and 32%.
An Enhanced Localization Scheme for Mobile Sensor Networks
Localization in mobile sensor networks is more challenging than in static sensor networks because mobility increases the uncertainty of nodes positions. The localization algorithms used in the Mobile sensor networks (MSN)are mainly based on Sequential Monte Carlo (SMC) method. The existing SMC based localization algorithms commonly rely on increasing beacon density in order to improve localization accuracy and suffers from low sampling efficiency and also sampling in those algorithms are static and have high energy consumption. Those algorithms cannot able to localize sensor nodes in some circumstances.The main reason for that is in some time slots the sensor node cannot hear any beaconnode. This results in localization failure. The Improved Monte Carlo Localization (IMCL) algorithm achieves high sampling efficiency, high localization accuracy even in the case when there is a low beacon density. This can be achieved using bounding box and weight computation techniques. This algorithm also uses time series forecasting and dynamic sampling method for solving the problem of localization failure. Simulation results showed that the proposed method has a better performance in sparse networks in comparison with previous existing method
Enhancement of Localization Algorithm in Wireless Sensor Networks
2015
Localization is that the main sensible issue in wireless sensor networks as a result of several applications need the sensing element to understand their actual position with a high degree of exactitude. In WSN, due to limitations of nodes energy, energy potency is a vital factor which should be considered when protocols are designing. In wireless sensor network due to Varied localization methods supported mobile anchor nodes are projected for helping the sensing element in node to see their location. Consequently, this paper presents a path designing theme, which ensures that the flight of the mobile anchor node minimizes the localization error and guarantees that everyone of the sensing element node will verify their location further as LEACH protocol plays a vital role in response to the uneven energy distribution that’s caused by the randomness of cluster heads forming. The performance of the projected theme is evaluated through a series of simulations with the .NET. The result ...
Localization protocols for mobile wireless sensor networks: A survey
Computers & Electrical Engineering, 2017
Wireless Sensor Networks (WSNs) were emerged with the recent advances in the field of microelectronics and the emergence of wireless communication technology. Although, it has been shown that mobility alleviates several issues relating to sensor network like the coverage optimization and the connectivity. The need for node localization is one of the most important challenges when considering mobility. Localization in WSN means estimating the position or spatial coordinates of nodes. This paper addresses the various issues in localization and presents the state of the art of localization algorithms in Mobile WSNs (MWSNs). In this paper, we classified the localization algorithms based on the localization technique, the anchor based/cooperative, the nodes' mobility state and the information state and, we presented a detailed analysis of the representative localization algorithms. Moreover, we compared the existing localization algorithms and we discussed some possible directions of future research for the localization algorithms in MWSNs.
Anchor-guiding mechanism for beacon-assisted localization in wireless sensor networks
IEEE Sensors Journal, 2012
Localization is one of the most important issues in wireless sensor networks (WSNs). In the most widely proposed range-free algorithms, nodes estimate location by employing the geometric constraints imposed by the location of the mobile anchor. However, none of them addresses how the mobile anchor moves to optimize the improvement of location inaccuracies and minimize the anchor's movement. This paper assumes that previous range-free algorithms have been executed for a period of time and the deployed sensors are of different location inaccuracies. According to the size of the estimative region of each static sensor, an anchor-guiding mechanism is proposed to determine the beacon locations and construct an efficient path for the mobile anchor. Experimental study reveals that the proposed anchor-guiding mechanism effectively guides the mobile anchor to move along an efficient path, thereby saving the time required for improving or balancing the location inaccuracies of all sensor nodes.
2011 Localization algorithms of Wireless Sensor Networks a survey (TS 2011)
In Wireless Sensor Networks (WSNs), localization is one of the most important technologies since it plays a critical role in many applications, e.g., target tracking. If the users cannot obtain the accurate location information, the related applications cannot be accomplished. The main idea in most localization methods is that some deployed nodes (landmarks) with known coordinates (e.g., GPS-equipped nodes) transmit beacons with their coordinates in order to help other nodes localize themselves. In general, the main localization algorithms are classified into two categories: range-based and range-free. In this paper, we reclassify the localization algorithms with a new perspective based on the mobility state of landmarks and unknown nodes, and present a detailed analysis of the representative localization algorithms. Moreover, we compare the existing localization algorithms and analyze the future research directions for the localization algorithms in WSNs.
Progressive Localization using Mobile Anchor in Wireless Sensor Network
International Journal Of Engineering And Computer Science, 2017
Wireless sensor network (WSN) is employed to gather and forward information to the destination. It is very crucial to know the location of the event or collected information. This location information may be obtained using GPS or localiza-tion technique in wireless sensor networks. Randomly deployed WSN needs a large amount of GPS-enabled sensor nodes for localization, this necessitates progressive approach. However, nodes with sparse connectivity remain unlocalized. In this paper, a progressive mobile anchor based technique is proposed for node localization. Initially, sensor nodes are localized using anchors in the neighborhood, then these localized nodes progressively localized remaining nodes using multilateration. Mobile anchor node moves randomly in field and broadcast position information. Its localized nodes with sparse connectivity. Simulation results show that proposed approach localize all sensor nodes with good accuracy.
MOBILE ANCHOR BASED LOCALIZATION SCHEME IN WIRELESS SENSOR NETWORK Prof
2015
Wireless Sensor Network technology is the fast growing field so the challenges are also quit much, the main and important parameter in any network is the location of the nodes. The performance of any system is decided on the basis that how much it is clever to find the exact location with the minimum error in minimum time, also can it be able to find obstacle and identify them.in this paper we proposed the Mobıle Anchor Based Localızatıon Scheme In Wıreless Sensor Network. With two mobile anchor node to find the location of other sensor node in obstacloe based envornment. And finaly simulate the result in NS-2.