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

A node localization algorithm based on Voronoi diagram and support vector machine for wireless sensor networks

Author

Listed:
  • Zhanjun Hao
  • Jianwu Dang
  • Yan Yan
  • Xiaojuan Wang

Abstract

For wireless sensor network, the localization algorithm based on Voronoi diagram has been applied. However, the location accuracy node position in wireless sensor network needs to be optimized by the analysis of the literature, a node location algorithm based on Voronoi diagram and support vector machine is proposed in this article. The basic idea of the algorithm is to first divide the region into several parts using Voronoi diagram and anchor node in the localization region. The range of the initial position of the target node is obtained by locating the target node in each region and then the support vector machine is used to optimize the position of the target node accurately. The localization performance of the localization algorithm is analyzed by simulation and real-world experiments. The experimental results show that the localization algorithm proposed in this article is better than the optimal region selection strategy based on Voronoi diagram-based localization scheme and Weighted Voronoi diagram-based localization scheme localization algorithms in terms of localization accuracy. Therefore, the performance of the localization algorithm proposed in this article is verified.

Suggested Citation

  • Zhanjun Hao & Jianwu Dang & Yan Yan & Xiaojuan Wang, 2021. "A node localization algorithm based on Voronoi diagram and support vector machine for wireless sensor networks," International Journal of Distributed Sensor Networks, , vol. 17(2), pages 15501477219, February.
    • Handle: RePEc:sae:intdis:v:17:y:2021:i:2:p:1550147721993410
    DOI: 10.1177/1550147721993410
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1177/1550147721993410
    Download Restriction: no
    File URL: https://libkey.io/10.1177/1550147721993410?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
    ---><---

    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:17:y:2021:i:2:p:1550147721993410. 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.