ENHANCED COMPOSITE APPROACH WITH MOBILE BEACON SHORTEST PATH TO SOLVE LOCALIZATION PROBLEM IN WIRELESS SENSOR NETWORK (original) (raw)

Localization: A Modified DV-Hop Localization Algorithm in Wireless Sensor Network

International Journal of Computer Applications

Today wireless sensor network has become a primal technology for different kinds of resourceful environment. Sensor node localization specifying where a given sensor node is physically or relatively located is extremely crucial for majority of the programmes in wireless sensor networks. Localization has been key out as one of the leading subject in Wireless Sensor Network (WSN). Many localization algorithms have been proposed for wireless sensor network. In the present work we first review and estimate the shortcomings of the self-positioning existing DV-HOP algorithm i.e. its localization error and accuracy. Finally, a more precise positioning modified DV-HOP algorithm has been presented. The work has been simulated in MATLAB.

Improved DV-Hop localization algorithm for wireless sensor networks

2012 IEEE 10th Jubilee International Symposium on Intelligent Systems and Informatics, SISY 2012, 2012

Aiming at the positioning problem of wireless sensor network node location, an improved DV-Hop positioning algorithm is proposed in this paper, together with its basic principle and realization issues. The proposed method can improve location accuracy without increasing hardware cost for sensor node. Simulation results show that it has good positioning accuracy and coverage. The influences of anchor nodes on the DV-hop algorithm are also explored in the paper.

Analysis of DV-Hop Localization Algorithm in Wireless Sensor Networks

Localization that is to be aware of position of the node in the network is an essential issue in wireless sensor network (WSN). Localization algorithm in WSN can be divided into range-based and range-free algorithm. In this paper, we present the analysis of DV-Hop localization algorithm which is one of the range-free algorithms on the basis of various parameters. With this we tried to analyse the efficiency of the DV-Hop localization algorithm by changing various parameters.

Improvements of DV-Hop localization algorithm for wireless sensor networks

Telecommunication Systems, 2015

Based on the improvements of the original DV-Hop localization algorithm, three new localization algorithms (iDV-Hop1, iDV-Hop2, and Quad DV-Hop) are presented in this article. In iDV-Hop1 and iDV-Hop2, all steps of the original DV-Hop are kept, and several steps based on geometry improvements of the localization problem are added in order to obtain better localization accuracy. The third algorithm (Quad DV-Hop) formulated the localization problem as bounded least squares problem, to be solved by quadratic programming. Simulations are carried out on the four different types of network topology by varying nodes communication range, number of anchor nodes and number of nodes. Comparison of our algorithms with the original DV-Hop and Improved DV-Hop algorithms are given. It is shown that iDV-Hop1 algorithm can significantly reduce the localization error (up to three times) in scenarios with irregular topologies compared to DV-Hop and Improved DV-Hop. In scenarios with regular topologies, iDV-Hop2 and Quad DV-Hop showed better performance compared to DV-Hop and Improved DV-Hop (up to 11 % lower localization error).

Improved DV-Hop Localization Algorithm Based on Modifying Hop Distance

Advanced Materials Research, 2014

DV-Hop algorithm is a kind of typical range-free node localization algorithm of wireless sensor network. In order to improve the positioning accuracy of DV-Hop algorithm, in the second stage of DV-Hop localization algorithm, when calculating the average hop distance of unknown nodes, weighting the average hop distance of beacon nodes which is accepted by the unknown nodes, this result is the average hop distance of unknown nodes, the weighted value is determined by the frequency of the unknown nodes received beacon nodes in the first stage. Finally using NS2 simulation tool making a simulation experiment for the improved algorithm and DV-Hop algorithm, the experimental results show that relative to the DV-Hop algorithm, the improved algorithm has a higher positioning accuracy.

An improved DV-Hop localization algorithm for wireless sensor networks

Wireless sensor networks have attracted great interest in the last decade, and have provided solutions in a growing number of applications. The location of sensors is a major issue in these networks. Many localization algorithms have been proposed and can be categorized into two families: range-based and range-free algorithms. In this paper, the localization algorithm DV-Hop is improved in order to minimize the estimation error and thus obtain better localization accuracy of sensor nodes. Simulations have been conducted and results are reported to show the efficiency of the enhanced version of DV-Hop

Survey of Localization Techniques based on Mobile Beacon in Wireless Sensor Network

IJIREEICE

Nowadays, Wireless Sensor Networks (WSNs) are most growing research area because of its low cost, infrastructure less, increased capabilities of nodes, real-time and accurate monitoring. It is employed to gather and forward information to the destination. Location of the event or collected information is very crucial for successive operations. This information may be obtained using the global positioning system, but it is not feasible for energy constraints networks. Location of sensor nodes may be obtained through localization techniques. Localization of nodes in a sensor network is a motivating analysis space, and a lot of works are done to this point. It is highly required to design energy aware, economical and scalable localization techniques for WSNs. In this paper, we have done analyze of various localization techniques, and few possible future research directions.

An Improvement of DV-Hop Algorithm in Wireless Sensor Networks

2006 International Conference on Wireless Communications, Networking and Mobile Computing, 2006

The node localization is an important problem for location-dependent applications of wireless sensor networks. The research has drawn wide attention in recent years. The localization can be categorized as range-free or range-based schemes based on whether the range information is used among the localization process. Because of the hardware limitations of the network devices, solutions in range-free localization are being pursued as a cost-effective alternative to more expensive range-based approaches. DV-Hop is one of the range-free localization algorithms using hop-distance estimate. In this paper, we develop a new estimation model and improve the DV-Hop algorithm by considering the relationships between the communication ranges and the hop-distances. This scheme needs no additional hardware support and can be implemented in a distributed way. Simulation results show the performance of the proposed algorithm is superior to that of the DV-Hop algorithm.