DV-Hop Localization Algorithm Based on Distance Geometry Constrain
2012 ◽
Vol 433-440
◽
pp. 4009-4013
Keyword(s):
Node localization is one of the key technologies in wireless sensor networks,DV-Hop algorithm is wildly usded .The main DV-Hop localization error is the distance between unknown nodes ande anchor nodes.In this paper, The distance geometry constrain in two-dimensional space has been applied to reduce the error of measurement ,which is the distance between unknown nodes and anchor nodes. Simulation results show that this localization algorithm is effective ,which improves the positioning accuracy.
2013 ◽
Vol 475-476
◽
pp. 579-582
◽
2015 ◽
Vol 738-739
◽
pp. 401-404
2012 ◽
Vol 442
◽
pp. 360-365
◽
2014 ◽
Vol 543-547
◽
pp. 3256-3259
◽
2017 ◽
Vol 13
(10)
◽
pp. 4
◽
2011 ◽
Vol 128-129
◽
pp. 909-913
2012 ◽
Vol 182-183
◽
pp. 2012-2018
2012 ◽
Vol 155-156
◽
pp. 445-449