Localization of Sensor Node in Wireless Sensor Network (original) (raw)
Related papers
A novel range based node localization in Wireless Sensor Networks
2012
Sensor networks are a type of communication which gives a reliable communication at a low cost. These networks have collection of components which organize themselves autonomously in the network which gives a seamless communication at low cost and in a self-organized fashion. But for achieving this goal it poses certain kinds of new concepts and optimization problems like node localization, deployment and mobility management. In this paper we are addressing one of the crucial issues namely node localization by using Token Management Vector Manipulation (TMVM). With this novel approach, we can estimate the location of deployed nodes without depending on central synchronized time reference at receivers end and at the anchors/transmitter end. Vector Manipulation (VM) gives an approach for determining the coordinates of unknown nodes at greater ease. Results show that this newly proposed method gives a greater accuracy in terms of average distance error on different variance of Gaussian values and performs better than synergetic localization algorithm on higher values of variance.
A Survey on Method of Localization in Wireless Sensor Network
— Localization is essential process in Wireless Sensor Networks (WSNs) to identify the current location of the event. Manual configuration of location of each sensor node is not possible in inaccessible area. On the hand installing GPS to every sensor is not feasible due to high cost. One way is to equip some node with GPS called anchor node. Based on the location information given by anchor node, other nodes measure their location. Most of the technique use anchor concept. This paper give an overview of node localization component and method used in wireless sensor networks covering its problems. Classification of localization method and several algorithm using genetic algorithm is also discussed.
Wireless sensor networks have emerged from military needs and found its way into civil applications. Today wireless sensor networks have become a key technology for different kinds of smart environments. Sensor node localization which is determining where a given sensor node is physically or relatively located is extremely crucial for most of the applications in wireless sensor networks. The procedure through which the sensor nodes obtain their positions is called localization. Many localization algorithms have been proposed for wireless sensor networks. In this article, we describe our newly developed localization algorithm and performance evaluation of this localization algorithm with square, 'C' and 'L' shape network topology.
The current restricted area based range free localization schemes use various geometric shapes such as triangle, rectangle, and circle to determine the residence area of the sensor node. Then this residence area is used to localize the sensor node. However, the existing work requires higher density of anchor deployment to gain the acceptable accuracy of position estimation. In this paper, we overcome the density dependent accuracy of localization by proposing a new localization scheme called geometric anchor beacon (GAB). The proposed scheme is based on analytical geometry of an arc. In the proposed scheme, the Cramers rule is used, where the intersecting point of two perpendicular bisectors of the chords is taken as the estimated position of the sensor node. Simulation results show that, GAB shows less estimation error than any other range-free localization schemes such as CAB, Centroid, Convex, and APIT. Keywords WSN Á Localization Á GAB Á RSSI Á DOI
Analysis of Node Localization in Wireless Sensor Networks
2012
1. Abstract Sensor networks are dense wireless networks of small, low-cost sensors, which collect and disseminate environmental data. Sensor nodes are very small, lightweight, and unobtrusive. The problem of localization, that is, “determining where a given node is physically located in a network”, can be mainly divided into two parts range-based (fine-grained) or range-free (coarse-grained) schemes. This Paper presents the analysis of range based algorithms on the basis of few network parameters (Network Size, Anchor node Density, Array node density) and tried to find out the best range based algorithms by doing simulation on matlab. The metric selected for the analysis is Standard Deviation of localization error.
Localization System for Wireless Sensor Networks
2015
Sensors are frequently being used for monitoring different phenomena of environment, Military, Health, Industry, Automobiles etc., and the information derived from sensed data are being used for making important decisions which directly affects humans and at times human life. This sensed data can only be of use if we know the exact position of the sensor node. This is not always easy as in many real life scenario, the deployment is random and in hostile conditions. Further, replacing a dead or damaged node is not an option in many circumstances. Many different approaches have been proposed by research community for localization information of a node deployed in a target area. In this work, an attempt has been made to review most promising localization methods proposed so far in comparative manner.
Geometric and decentralized approach for localization in wireless sensor network
Journal of Ambient Intelligence and Humanized Computing, 2020
The main function of a sensor node is to collect data from its environment and forward it to base station. In the absence of further information concerning their locations, those data will be unnecessary. Hence, developing algorithms for localizing all nodes of wireless sensor network is extremely important. We present in this paper, a new approach to determine geographical coordinates of unknown nodes, by using mobile anchor. The mobile anchor adopts a spiral trajectory, and diffuses its position periodically during its travel. The proposed approach uses Received Signal Strength Indicator to estimate distance with all broadcast messages received from mobile anchor. To calculate position, our approach determines a cloud of points that surround the solution; these points are selected from the set of intersection points of all beacons received by unknown node, by considering some constraints. The estimated position of unknown node represents the geometric center of this cloud. The behavior of our algorithm was studied by varying some metrics; the average error was minimized compared to those proposed in literature.
Exploring Localization in wireless sensor network
Node Localization in Wireless Sensor Networks (WSN) refers to determining the location of sensor nodes which are deployed in sensor field that are responsible for monitoring applications like environment perceived applications, tracking, traffic monitoring etc. This paper covers the localization techniques and study which algorithm provides higher accuracy, low expense and better power utilization.
Comparative Study between Two and Three Dimensional Localization Algorithms in WSN
Research on Wireless Sensor Networks (WSNs) has recently received much attention as they offer an advantage of monitoring various kinds of environment by sensing physical phenomenon. Many WSN protocols and applications assume the knowledge of geographic location of nodes to report data that is geographically meaningful and services. Locations of nodes can be determined by a number of localization algorithms that may be introducing various types of errors in their estimations. Requirement of applications need feasible localization algorithm with higher accuracy and lower cost. Localization algorithms mostly work on 2-dimensional plane or 3-dimensional plane; in this paper we proposed two localization algorithms in both two and three dimensional planes and compare between them. Where in a 2D plane, the process of localization is less complex and requires less time and energy and provides good accuracy is on terrains and is difficult to localize in harsh terrains, it determines accurat...
A Review on Localization Algorithms in Wireless Sensor Networks
2014
In wireless sensor networks (WSNs), nodes are deployed in sensor fields for monitoring and controlling the physical environments. Node localization is fundamental challenge in wireless sensor networks as without knowing the location of nodes sensed information will have no value. Therefore, it is vital that nodes must know their location. This paper provides a review of basic techniques for localization. The localization algorithms are classified into GPS based or GPS free, Anchor based or Anchor free, Centralized or Distributed and Range based or range free. Paper further discusses limitations of each of the algorithms.