Mobile-Beacon Assisted Sensor Localization with Dynamic Beacon Mobility Scheduling (original) (raw)
Related papers
2010
Abstract: Wireless sensor network is tremendously being used in different environments to perform various monitoring task such as search, rescue, disaster relief, target tracking and a number of tasks in smart environment. In this paper a unique localization algorithm is proposed that gives the high accuracy in wireless sensor network. We propose a mobile beacon algorithm and then merge it with DV-hop algorithm to introduce a unique approach which solves the localization problem in wireless sensor network.
Path planning for Mobile Beacon based Iterative Localization in Wireless Sensor Network
2019
Wireless sensor network (WSN) is deployed to gather and forward information to the faraway destination. It is very important to aware about the location of the event occurred. This location information may be obtained using manual deployment of sensor nodes or GPS, but this become prohibitive due to increased price. The localization technique in wireless sensor networks can obtained positional information of nodes with some GPS enable nodes called beacon nodes. Randomly deployed WSN needs a large amount of GPS-enabled sensor nodes for localization, this necessitates iterative approach or a mobile beacon node to localize all sensor nodes. However, nodes with sparse connectivity remain unlocalized. In this paper, a iterative mobile beacon based technique is proposed for node localization. Initially, sensor nodes are localized using beacons in the neighborhood, then these localized nodes iteratively localized remaining nodes using multilateration. A Mobile beacon node follow zigzag pat...
Superior Path Planning Mechanism for Mobile Beacon-Assisted Localization in Wireless Sensor Networks
Abstract—In many wireless sensor network applications, such as warning systems or healthcare services, it is necessary to update the captured data with location information. A promising solution for statically deployed sensors is to benefit from mobile beacon-assisted localization. The main challenge is to design and develop an optimum path planning mechanism for a mobile beacon to decrease the required time for determining location, increase the accuracy of the estimated position, and increase the coverage. In this paper, we propose a novel superior path planning mechanism called Z-curve. Our proposed trajectory can successfully localize all deployed sensors with high precision and the shortest required time for localization. We also introduce critical metrics, including the ineffective position rate for further evaluation of mobile beacon trajectories. In addition, we consider an accurate and reliable channel model, which helps to provide more realistic evaluation. Z-curve is compared with five existing path planning schemes based on three different localization techniques such as weighted centroid localization and trilateration with time priority and accuracy priority. Furthermore, the performance of the Z-curve is evaluated at the presence of obstacles and Z-curve obstacle-handling trajectory is proposed to mitigate the obstacle problem on localization. Simulation results show the advantages of our proposed path planning scheme over the existing schemes.
Algorithm Aspects of Dynamic Coordination of Beacons in Localization of Wireless Sensor Networks
Wireless Sensor Networks(WSNs) consists of hundreds of nodes which are of low power, low cost, and tiny devices. The main functionality of these nodes is to sense the environment and send the sensed data to the observer. In order to validate and get the significance of sensing data, location information of the sensor node needs to be combined with the sensed data. In addition to this, there are many other issues of WSN such as routing, coverage, etc. which also need the location information of sensor nodes. Several approaches, including rangebased and range-free, have been proposed to calculate positions for randomly deployed sensor nodes. In this paper, we proposed a distributed technique for localization of sensor nodes using few mobile anchor nodes. These mobile anchor nodes move in the network space and periodically broadcast beacon messages about their location. Static sensor nodes receive these messages as soon as they come under the communication range of any mobile anchor node and compute their position based on the range based technique. Another contribution of this paper is to identify the importance of mobile anchor node over static anchor node in localization. The performance of the proposed algorithm is carried out using the Castalia simulator. The simulation result shows that mobile anchor node provide better accuracy as compared to static anchor node for sensor node localization.
A Dynamic MDS-Based Localization Algorithm for Mobile Sensor Networks
2006 IEEE International Conference on Robotics and Biomimetics, 2006
In this paper, we proposed a dynamic mobilityassisted MDS-based localization algorithms for sparse mobile sensor network. For sparse networks, the assumption of the existing MDS-based localization algorithms is not necessary valid and the network may even be nonrigid, which significantly affects the application and accuracy of the existing MDS-based algorithms. In the proposed algorithm, we utilize the mobile capability of sensors in a mobile network. By moving the sensors in a random direction and recording the distances to their neighbors during the movement, virtual nodes are added. The distances between virtual nodes and real nodes provide more information about network, which leads to significantly better localization than existing methods for sparse networks. Experiments and evaluation of the proposed algorithm are provided.
Localization of Wireless Sensor Networks with a Mobile Beacon
Wireless sensor networks have the potential to become the pervasive sensing (and actuating) technology of the future. For many applications, a large number of inexpensive sensors is preferable to a few expensive ones. The large number of sensors in a sensor network and most application scenarios preclude hand placement of the sensors. Determining the physical location of the sensors after they have been deployed is known as the problem of localization. In this paper, we present a localization technique based on a single mobile beacon aware of its position (e.g. by being equipped with a GPS receiver). Sensor nodes receiving beacon packets infer proximity constraints to the mobile beacon and use them to construct and maintain position estimates. The proposed scheme is radio-frequency based, and thus no extra hardware is necessary. The accuracy (on the order of a few meters in most cases) is sufficient for most applications. An implementation is used to evaluate the performance of the proposed approach.
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.
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.
Dynamic Localization Protocols for Mobile Sensor Networks
The ability of a sensor node to determine its physical location within a network (Localization) is of fundamental importance in sensor networks. Interpretating data from sensors is not possible unless the context of the data is known; the context of the data is most often determined by tracking its physical location and the sample time. Existing research has focused on localization in static sensor networks where localization is a one-time or low frequency activity. In contrast, this paper considers localization for mobile sensors: when sensors are mobile, localization must be invoked periodically to enable the sensors to track their location. Localizing more frequently allows the sensors to more accurately track their location in the presence of mobility. However, localization is a costly operation since it involves both communication and computation. In this paper, we propose and investigate adaptive and predictive protocols that control the time of localization based on sensor mobility behavior to reduce the energy requirements for localization while bounding the localization error. We show that such protocols can significantly reduce the localization energy without sacrificing accuracy (in fact, improving accuracy for most situations). Using simulation and analysis we explore the tradeoff between energy efficiency and localization error due to mobility for several protocols.
… & Workshops, 2009 …, 2009
Wireless sensor networks (WSNs) is emerging as a key tool for data acquisition in many applications, and localization algorithms of the sensors have a vital importance due to the intrinsic characteristics of this type of networks. The objective of this paper is to propose an algorithm of range-free localization for WSNs using a mobile beacon node equipped with a rotary directional antenna. The azimuthally defined area localization algorithm (ADAL) is executed in each sensor node and is based only on the analysis of the information received from the mobile beacon node, therefore is energy efficient and contributes to extend the lifetime of the sensor network. Additionally the proposed algorithm has the advantage of being simple and economical. The simulation results show that the proposed algorithm is a practical, effective and accurate method to localize sensor nodes in a WSN.