IDEAS home Printed from https://ideas.repec.org/a/sae/intdis/v10y2014i7p436891.html
   My bibliography  Save this article

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

Author

Listed:
  • Yunzhou Zhang
  • Shu Xiang
  • Wenyan Fu
  • Dongfei Wei

Abstract

In recent years, collinearity theory is widely used in large-scale sensor network. When the anchor nodes are located at almost a straight line, the collinearity phenomenon will happen and usually cause negative influence on positioning accuracy. From detailed analysis of the relation between DV-Hop localization error and the collinearity, we proposed to select the anchor nodes which can meet the condition of hop count threshold and collinearity to participate in the localization procedure. Since there is uncertain situation that the anchor node's region is hard to be decided for the sensor nodes in one hop area, Voronoi diagram is adopted to divide the sensor network into several regions. Then, we can get the anchor node information in each Voronoi polygon. With this information and the collinearity condition, we can estimate the unknown node's position with relatively higher accuracy. Compared with the traditional DV-Hop and collinearity algorithm, our proposed algorithm can get better positioning accuracy in both homogeneous network and anisotropic network.

Suggested Citation

  • Yunzhou Zhang & Shu Xiang & Wenyan Fu & Dongfei Wei, 2014. "Improved Normalized Collinearity DV-Hop Algorithm for Node Localization in Wireless Sensor Network," International Journal of Distributed Sensor Networks, , vol. 10(7), pages 436891-4368, July.
    • Handle: RePEc:sae:intdis:v:10:y:2014:i:7:p:436891
    DOI: 10.1155/2014/436891
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1155/2014/436891
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2014/436891?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:sae:intdis:v:10:y:2014:i:7:p:436891. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: SAGE Publications (email available below). General contact details of provider: .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.