Improved Normalized Collinearity DV-Hop Algorithm for Node Localization in Wireless Sensor Network

Zhang, Yunzhou; Shu, Xiang; Fu, Wenyan; Wei, Dongfei

doi:10.1155/2014/436891

Cited by 17 publications

(10 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For the collinearity phenomenon of sensor nodes, Zhang et al (2014) proposed to use the Voronoi diagram to divide the sensors network into difference multiple regions, each region containing an anchor node. Then, a weighted method is used to calculate the location of the UN.…”

Section: Related Workmentioning

confidence: 99%

Weight convergence analysis of DV-hop localization algorithm with GA

et al. 2020

View full text Add to dashboard Cite

The distance vector-hop (DV-hop) is a typical localization algorithm. It estimates sensor nodes location through detecting the hop count between nodes. To enhance the positional precision, the weight is used to estimate position, and the conventional wisdom is that the more hop counts are, the smaller value of weight will be. However, there has been no clear mathematical model among positioning error, hop count, and weight. This paper constructs a mathematical model between the weights and hops and analyzes the convergence of this model. Finally, the genetic algorithm is used to solve this mathematical weighted DV-hop (MW-GADV-hop) positioning model, the simulation results illustrate that the model construction is logical, and the positioning error of the model converges to 1/4R. Keywords DV-hop Á Convergence analyses Á Genetic algorithm (GA) Á Positional precision Á Mathematical weight model Communicated by V. Loia.

show abstract

Section: Related Workmentioning

confidence: 99%

Weight convergence analysis of DV-hop localization algorithm with GA

et al. 2020

View full text Add to dashboard Cite

show abstract

“…TOA mechanism has good accuracy in inter-node ranging [12]; however, all nodes in the network should be highly synchronized [13]. In addition, higher power consumption of sensor nodes has also been required [14]; Similar to TOA location with little range error and high precision, TDOA mechanism requires a variety of types of sensors, increasing the production cost of sensor nodes and accordingly the energy consumption [15], and thus restricting the application of ranging mechanisms in inter-node ranging in the network; vulnerable to external influences, AOA ranging technology demands extra angular measurement devices which increases the volume and power consumption of sensor nodes.…”

Section: Advantages and Disadvantages Of Common Node Ranging Mechanismmentioning

confidence: 99%

Research on Pseudo-Node Detection Algorithm in Wireless Sensor Networks

2017

Int. J. Onl. Eng.

View full text Add to dashboard Cite

Abstract-With the wide application of the wireless sensor network, the security of the sensor network is becoming increasingly important. In this paper, based on node ranging, a new intrusion node detection algorithm has been proposed for external pseudo-node detection in wireless sensor networks. The presence of the nodes under copying-attack and the pseudo-nodes in the network can be detected through inter-node ranging with appropriate use of various sensors of nodes themselves and comprehensive analysis of ranging results. Operating in a stand-alone or embedded manner, this method has remedied the defects in the traditional principle of attack detection. The simulation results show that the proposed method has excellent applicability in wireless sensor security detection.

show abstract

“…Secondly, once one anchor node obtains the minimum hop value to other anchor nodes, it can estimate average hop distance in the network. Then, controllable flooding method is adopted for broadcasting the value to the whole network [5]. When unknown node receives average hop distance and hops to other anchor node, they can estimate the distance of all receivable anchor nodes through multiplying average hop distance by the hops [6].…”

Section: Basic Principle Of Dv-hop Location Algorithmmentioning

confidence: 99%

A Design of Wireless Sensor Network Node Location Algorithm

Li¹,

Wu²,

2016

Proceedings of the 2016 International Conference on Computer and Information Technology Applications

View full text Add to dashboard Cite

Wireless sensor network belongs to an emerging concept and a technology for creating new application field. Range-free location algorithm can obtain distance information without any specific hardware, and thereby range-free location algorithm is more economic and effective, which is suitable for large-scale wireless sensor network. DV-hop algorithm is a distributed range-free location algorithm. It has advantages of simplicity and none dependence on the fact of measurement error. However, the algorithm has the disadvantage of low localization accuracy. In the paper, DV-hop location algorithm is improved. An improved DV-hop algorithm is proposed, namely a method of improving average hop distance calculation by introducing weight. It can be more rational. Topology relationship is utilized for selecting anchor node. Finally, weighted centroid algorithm is used for estimating location. The algorithm can reduce the algorithm complexity and location error.

show abstract

Improved Normalized Collinearity DV-Hop Algorithm for Node Localization in Wireless Sensor Network

Cited by 17 publications

References 18 publications

Weight convergence analysis of DV-hop localization algorithm with GA

Weight convergence analysis of DV-hop localization algorithm with GA

Research on Pseudo-Node Detection Algorithm in Wireless Sensor Networks

A Design of Wireless Sensor Network Node Location Algorithm

Contact Info

Product

Resources

About