An Improvement of DV-Hop Algorithm in Wireless Sensor Networks
@article{Ji2006AnIO,
title={An Improvement of DV-Hop Algorithm in Wireless Sensor Networks},
author={Wei-wei Ji and Zhong Liu},
journal={2006 International Conference on Wireless Communications, Networking and Mobile Computing},
year={2006},
pages={1-4}
}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…Â
59 Citations
A Weighted DV-Hop Localization Scheme for Wireless Sensor Networks
- Computer Science2009 International Conference on Scalable Computing and Communications; Eighth International Conference on Embedded Computing
- 2009
The proposed algorithm is derived from DV-Hop algorithm, and uses weight of anchors to improve localization accuracy without needing no additional hardware device.
Scalable DV-Hop Localization Algorithm with Constrained Multilateration for Wireless Sensor Network
- Computer ScienceIEICE Trans. Commun.
- 2009
This work proposes a simple algorithm to reduce the communication cost of the DV-hop algorithm and its performance is verified via computer simulations.
A Long Range DV-Hop Localization Algorithm with Placement Strategy in Wireless Sensor Networks
- Computer Science2008 4th International Conference on Wireless Communications, Networking and Mobile Computing
- 2008
A new long range localization DV-hop algorithm (PLR DV-hops), which needs no additional hardware device, is offered and performs better than original DV- hop algorithm: it consumes less power and can provide more accurate location estimation.
An Improved DV-Hop Algorithm Using Hop-Count Information and Geometric Constraint
- Computer Science2011 7th International Conference on Wireless Communications, Networking and Mobile Computing
- 2011
A new algorithm named Advanced DV-Hop (ADV-Hop), which estimates the node-to-anchor distance with the help of reference anchor, and the reference anchor gives a geometric constraint to narrow down the potential area of the unknown node.
Scalable DV-hop localization for Wireless Sensor Networks
- Computer Science2008 14th Asia-Pacific Conference on Communications
- 2008
A simple algorithm to reduce the communication cost and its performance is verified via computer simulations for range-free localization of wireless sensor networks.
An Empirical Study of DV-Hop Localization Algorithm in Random Sensor Networks
- Computer Science2009 Second International Conference on Intelligent Computation Technology and Automation
- 2009
An improved DV-Hop localization algorithm that recalculates the hop-size and sends different correction along different directions instead of computing a single correction to be broadcasted into the networks.
Evaluation of DV Hop Localization Algorithm in Wireless Sensor Networks
- Computer Science2012 International Conference on Advances in Mobile Network, Communication and Its Applications
- 2012
The performance limit by changing number of parameters like node density and radio range is reviewed and estimate the most unsighted parameter is standard deviation of error which is stable in the Simulation results of DV-HOP algorithm.
Energy-Saving Performance of an Improved DV-Hop Localization Algorithm for Wireless Sensor Networks
- Computer ScienceGLOBECOM 2017 - 2017 IEEE Global Communications Conference
- 2017
An improvement of the famous DV-HOP algorithm is presented and evaluated in order to increase the localization accuracy and reduce energy consumption and execution time.
Performance Evaluation of DV-HOP Localization Algorithm in Wireless Sensor Networks
- Computer Science
- 2018
The existing DV-HOP algorithm which is a range-free localization algorithm has been studied and evaluated in terms of localization error and the localization error has been calculated by varying the number of unknown nodes, communication range, and thenumber of anchor nodes.
Analysis of DV-Hop Localization Algorithm in Wireless Sensor Networks
- Computer Science
- 2011
This paper presents the analysis of DV-Hop localization algorithm which is one of the range-free algorithms on the basis of various parameters and tries to analyse the efficiency of the DV- Hop localization algorithm by changing various parameters.
References
SHOWING 1-10 OF 18 REFERENCES
A partial-range-aware localization algorithm for ad-hoc wireless sensor networks
- Computer Science29th Annual IEEE International Conference on Local Computer Networks
- 2004
The results show that the partial-range-aware algorithm can improve the localization accuracy by reducing position errors up to 50% of the previous range-free localization results.
Robust Positioning Algorithms for Distributed Ad-Hoc Wireless Sensor Networks
- Computer ScienceUSENIX Annual Technical Conference, General Track
- 2002
A distributed algorithm for determining the positions of nodes in an ad-hoc, wireless sensor network is explained in detail and shows that, given an average connectivity of at least 12 nodes and 10% anchors, the algorithm performs well with up to 40% errors in distance measurements.
DV Based Positioning in Ad Hoc Networks
- Computer ScienceTelecommun. Syst.
- 2003
This work is proposing APS – a localized, distributed, hop by hop positioning algorithm, that works as an extension of both distance vector routing and GPS positioning in order to provide approximate position for all nodes in a network where only a limited fraction of nodes have self positioning capability.
Ad hoc positioning system (APS)
- Computer ScienceGLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270)
- 2001
This work is proposing APS - a distributed, hop by hop positioning algorithm, that works as an extension of both distance vector routing and GPS positioning in order to provide approximate location for all nodes in a network where only a limited fraction of nodes have self location capability.
Robust Positioning Algorithms for Distrib uted
- Computer Science
- 2002
A distributed algorithm for determining the positions of nodes in an ad-hoc, wireless sensor network is explained in detail and shows that, given an average connectivity of at least 12 nodes and 10% anchors, the algorithm performs well with up to 40% errors in distance measurements.
Improved MDS-based localization
- Computer ScienceIEEE INFOCOM 2004
- 2004
This paper presents a new variant of the MDS-MAP method, which it is shown that the new algorithm not only preserves the good performance of the original method on relatively uniform layouts, but also performs much better than the original on irregularly-shaped networks.
The bits and flops of the n-hop multilateration primitive for node localization problems
- Computer ScienceWSNA '02
- 2002
The collaborative multilateration presented here, enables ad-hoc deployed sensor nodes to accurately estimate their locations by using known beacon locations that are several hops away and distance measurements to neighboring nodes to prevent error accumulation in the network.
Convex position estimation in wireless sensor networks
- Computer ScienceProceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213)
- 2001
A method for estimating unknown node positions in a sensor network based exclusively on connectivity-induced constraints is described, and a method for placing rectangular bounds around the possible positions for all unknown nodes in the network is given.
Anchor-Free Distributed Localization in Sensor Networks
- Computer Science
- 2003
A fully decentralized algorithm called AFL (Anchor-Free Localization) where nodes start from a random initial coordinate assignment and converge to a consistent solution using only local node interactions, which is superior to previously proposed methods that incrementally compute the coordinates of nodes in the network.
Localization from mere connectivity
- Computer ScienceMobiHoc '03
- 2003
An algorithm that uses connectivity information who is within communications range of whom to derive the locations of the nodes in the network is presented, based on multidimensional scaling, a data analysis technique that takes O(n3) time for a network of n nodes.