IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v346y2025i3d10.1007_s10479-025-06487-x.html
   My bibliography  Save this article

Optimizing wireless sensor networks deployment with coverage and connectivity requirements

Author

Listed:
  • Luigi Di Puglia Pugliese

    (Consiglio Nazionale delle Ricerche)

  • Francesca Guerriero

    (University of Calabria)

  • Nathalie Mitton

    (Inria)

Abstract

The wireless sensor networks are widely studied in the scientific literature due to their practical importance. They are used for monitoring and surveillance of strategic areas, and tracking targets in several fields, such as military, battlefields, health care, agriculture, and industry. Challenges in wireless sensor networks are related to localization, routing, limited storage, and deployment of sensors. In this paper, we focus on deployment issues. While the main aim is to use the smallest number of sensors, a wireless sensor network has to ensure full coverage of the area of interest, collect the proper data, and guarantee that such data are available at a sink node, that plays the role of the central base station. We consider the problem of deploying the minimum number of sensors that are able to fully cover the area of interest, ensuring the connectivity of each sensor with the sink node. We propose a new formulation, based on both the set covering problem and the shortest paths problem from a single source to all destinations. The proposed model has been compared with the state-of-the-art considering instances inspired by the scientific literature. The numerical results highlight the superiority of the proposed formulation in terms of both efficiency and effectiveness.

Suggested Citation

  • Luigi Di Puglia Pugliese & Francesca Guerriero & Nathalie Mitton, 2025. "Optimizing wireless sensor networks deployment with coverage and connectivity requirements," Annals of Operations Research, Springer, vol. 346(3), pages 1997-2008, March.
    • Handle: RePEc:spr:annopr:v:346:y:2025:i:3:d:10.1007_s10479-025-06487-x
    DOI: 10.1007/s10479-025-06487-x
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-025-06487-x
    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/s10479-025-06487-x?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 search for a different version of it.

    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:annopr:v:346:y:2025:i:3:d:10.1007_s10479-025-06487-x. 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.