IDEAS home Printed from https://ideas.repec.org/a/spr/opsear/v62y2025i4d10.1007_s12597-024-00876-9.html
   My bibliography  Save this article

Efficient energy aware area coverage in WSNs: a 2L-Voronoi guided PSO approach

Author

Listed:
  • Ranadeep Dey

    (National Institute of Technology)

  • Parag Kumar Guha Thakurta

    (National Institute of Technology)

  • Samarjit Kar

    (National Institute of Technology)

Abstract

This work proposes a two-level Voronoi (2L-Voronoi) based method for maximizing the area coverage in WSNs. The distribution of sensor nodes on a region of interest (ROI) is used into two levels. Initially, half of the sensor nodes are placed at random locations of a given ROI and then, the corresponding Voronoi polygon is determined. In the next level, the rest half of the sensor nodes, depending on the current coverage hole, are placed in intended locations to improve the coverage percentage. The PSO algorithm is used to determine the optimal locations of the sensor nodes for obtaining maximum coverage in this ROI. Here, the PSO is guided by a two-level Voronoi polygon and a fitness function is used to obtain faster convergence towards finding the best possible coverage percentage. This in turn can minimize the number of coverage holes. By this proposed approach, a large number of active sensor nodes are obtained for its faster convergence. The lower energy requirements of the sensor nodes can improve the lifetime of the network. Various simulation results are shown to highlight effectiveness of the proposed method over other state-of-the-art methods.

Suggested Citation

  • Ranadeep Dey & Parag Kumar Guha Thakurta & Samarjit Kar, 2025. "Efficient energy aware area coverage in WSNs: a 2L-Voronoi guided PSO approach," OPSEARCH, Springer;Operational Research Society of India, vol. 62(4), pages 1768-1798, December.
    • Handle: RePEc:spr:opsear:v:62:y:2025:i:4:d:10.1007_s12597-024-00876-9
    DOI: 10.1007/s12597-024-00876-9
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s12597-024-00876-9
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s12597-024-00876-9?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
    ---><---

    As the access to this document is restricted, you may want to

    for a different version of it.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;
    ;

    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:spr:opsear:v:62:y:2025:i:4:d:10.1007_s12597-024-00876-9. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.