TITLE

Research on Location Feedback Based DV-Hop Localization Algorithm

AUTHOR(S)
Fei Liu; Guangzeng Feng
PUB. DATE
August 2014
SOURCE
Key Engineering Materials;2014, Vol. 621, p699
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
In wireless sensor networks (WSNs), estimation of the location of the unknown node based on the average hop distance is an important research problem for range free localization algorithm. As one of the range free algorithm, DV-Hop chooses the average hop distance comes from the nearest beacon, can't reflect the real status of WSNs. We observe that the unknown node can achieve the precise location when one feedback channels are built between the unknown node and the beacons which embedded accurate location. Based on this observation, we propose one improved DV-Hop localization algorithm based on feedback mechanism(FDV-Hop). Using DV-Hop, the unknown node achieves the estimated location, and broadcasts its average hop distance to the beacons. The beacons also use DV-Hop to calculate their location based on the average hop distance from the unknown node. Then the beacons calculate the difference between the estimated location and the real location, and send the difference between them to unknown node with weights setting. The unknown node recalculates its location which involving the difference of location and the weights. The simulation shows that FDV-Hop can reduce the average localization error effectively and keep the localization stable.
ACCESSION #
99417193

 

Related Articles

  • Improvements of DV-Hop localization algorithm for wireless sensor networks. Tomic, Stefan; Mezei, Ivan // Telecommunication Systems;Jan2016, Vol. 61 Issue 1, p93 

    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...

  • A Novel Two-Class Localization Algorithm in Wireless Sensor Networks. Linqing Gui; Val, Thierry; Wei, Anne // Network Protocols & Algorithms;Oct2011, Vol. 3 Issue 3, p1 

    For most of the applications in wireless sensor networks, localization is fundamental and essential. The localization systems can be categorized into two types: range-based and range-free. In this paper, we propose a new range-free localization algorithm. The basic principle of this algorithm is...

  • An Enhanced DV-Hop Localization Algorithm using RSSI. Jianmin Zhang; Rui Yang; Jian Li // International Journal of Future Generation Communication & Netwo;Dec2013, Vol. 6 Issue 6, p91 

    Localization has been identified as a key and challenging topic in Wireless Sensor Networks (WSNs), especially for the applications requiring the accurate position of the sensed information. DV-Hop is a typical range-free node localization algorithm in WSNs; the localization cost and hardware...

  • On the Impact of Localization and Density Control Algorithms in Target Tracking Applications for Wireless Sensor Networks. Campos, Andre N.; Souza, Efren L.; Nakamura, Fabiola G.; Nakamura, Eduardo F.; Rodrigues, Joel J. P. C. // Sensors (14248220);2012, Vol. 12 Issue 6, p6930 

    Target tracking is an important application of wireless sensor networks. The networks' ability to locate and track an object is directed linked to the nodes' ability to locate themselves. Consequently, localization systems are essential for target tracking applications. In addition, sensor...

  • A Survey on Localization Algorithms in Wireless Sensor Networks. Lu Gao; Zhongmin Li // Applied Mechanics & Materials;2014, Issue 530-531, p15 

    In the applications based on Wireless Sensor Networks (WSNs), localization is one of the most fundamental and important technologies if the accurate location information can't be determined, these application can't be accomplished. Then main idea in localization algorithms is that every unknown...

  • A distributed range-free correction vector based localization refinement algorithm. Yao, Yingbiao; Zou, Ke; Chen, Xianyun; Xu, Xiaorong // Wireless Networks (10220038);Nov2016, Vol. 22 Issue 8, p2667 

    Localization problem is an important and challenging topic in today's wireless sensor networks. In this paper, a novel localization refinement algorithm for LAEP, which is a range-free localization algorithm by using expected hop progress, has been put forward. The proposed localization...

  • MEMSIC unveils LOTUS Wireless Sensor Network.  // Networks Update;Jun2011, Vol. 23 Issue 6, p1 

    The article announces the release of MEMSIC's LOTUS wireless sensor platform. LOTUS is a high-performance wireless node platform which was created through the low power ARM7 Cortex M3 CPU and also integrates IRIS, TelosB and Imote2 on a single board. LOTUS is wired with a 32bit/100MHz processor,...

  • An Integrated Protocol for Maintaining Connectivity and Coverage under Probabilistic Models for Wireless Sensor Networks. Hefeeda, Mohamed; Ahmadi, Hossein // Adhoc & Sensor Wireless Networks;2009, Vol. 7 Issue 3/4, p295 

    We propose a distributed connectivity maintenance protocol that explicitly accounts for the probabilistic nature of wireless communication links. The proposed protocol is simple to implement and it achieves a given target communication quality between nodes, which is quantified by the minimum...

  • SENTRY SELECTION IN WIRELESS NETWORKS. Balister, Paul; Bollobás, Béla; Sarkar, Amites; Walters, Mark // Advances in Applied Probability;Mar2010, Vol. 42 Issue 1, p1 

    Let P be a Poisson process of intensity one in the infinite plane ℝ2. We surround each point x of P by the open disc of radius r centred at x. Now let Sn be a fixed disc of area n, and let Cr(Sn) be the set of discs which intersect Sn. Write Erk for the event that Cr(Sn) is a k-cover of...

Share

Read the Article

Courtesy of THE LIBRARY OF VIRGINIA

Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics