A wireless sensor network DV-Hop localization algorithm

Yang, Huami; Wang, Qi; Liu, Zhuang

doi:10.2991/isca-13.2013.48

Cited by 7 publications

(3 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…At last, particle swarm optimization (PSO) is implemented for more accurate results for the position estimation. Yang et al analyzes the shortcomings of the basic DV‐hop algorithm and developed new improved DV‐hop localization algorithm. Here, the anchor nodes broadcast the packets with information like the coordinate position, hop value along with priority information.…”

Section: Related Workmentioning

confidence: 99%

Design and analysis of distance error correction–based localization algorithm for wireless sensor networks

Prashar

Jyoti

Kumar

2018

Trans Emerging Tel Tech

View full text Add to dashboard Cite

Localization error is the main criteria to decide the efficiency on any localization approach. In case of range‐free hop‐based localization approaches, position coordinates estimation is done through the common steps like the calculation of the minimum hop count, hop size, and then later on applying the multilateration or least square approach. There are many improvements that have been made in the form of various algorithms through some changes in the common steps for the reduction of localization error. It has been observed that the existing algorithms are still having the highest value of localization error. To overcome the deficiencies in the existing algorithms, a novel distance error correction metric–based approach has been introduced. This paper presents a distance error correction–based algorithm (DEC‐hop) for the hop‐based localization approach for a wireless sensor network. Distance‐based error correction factor that is introduced in this paper further reduces the localization error value to some extent. For measuring the effectiveness and the preciseness of the given approach, it is inspected with other improved algorithms based on DV‐hop. Simulation results have confirmed that the proposed error correction–based algorithm outperforms the other variety of improved hop‐based algorithms. Results are analyzed in terms of various factors like the localization error, accuracy, and error variance against the parameters of interest taken as node amount, anchor ratio, and communication range of the node.

show abstract

Section: Related Workmentioning

confidence: 99%

Design and analysis of distance error correction–based localization algorithm for wireless sensor networks

Prashar

Jyoti

Kumar

2018

Trans Emerging Tel Tech

View full text Add to dashboard Cite

show abstract

“…DV-HOP (distance vector-hop), propose to have anchors to localize the unknown node by exchanging hopcount values between anchors and unknown nodes and find the distance based on the computed average size of a hop (hop-distance) [11,12], as shown in figure 4. In order to localize unknown node in DV-HOP must the network must be fully connected in which all nodes can reach each other via a direct link and all unknown nodes are 1-hop away from all anchors.…”

Section: Localize the Unknown Nodementioning

confidence: 99%

The Impact of Signal Strength over Routing Protocols in Wireless Networks

Ismail

2018

IJEMR

View full text Add to dashboard Cite

In ad hoc routing protocols the source node may need an intermediate nodes to transmit the packets into the destination if the destination is not within transmission range of the source. This paper studies the impact of signal strength of nodes over ad hoc routing protocols and explains an important effect of signal strength on ad hoc routing protocols in four different directions including the routes and the nodes. As a result the study give an important improvement in ad hoc routing protocols when using signal strength compared to other ad hoc routing protocols without considering signal strength.

show abstract

“…In ad hoc routing protocol the connectivity of the network will depend on available received signal strength (RSS) measurements and a predefined RSS threshold to find the location of the node. DV-HOP (distance vector-hop), propose to have anchors to localize the unknown node by exchanging hopcount values between anchors and unknown nodes and find the distance based on the computed average size of a hop (hop-distance) [11,12], as shown in figure 4. In order to localize unknown node in DV-HOP must the network must be fully connected in which all nodes can reach each other via a direct link and all unknown nodes are 1-hop away from all anchors.…”

Section: Localize the Unknown Nodementioning

confidence: 99%