IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v13y2025i15p2479-d1715411.html
   My bibliography  Save this article

A Survey of Approximation Algorithms for the Power Cover Problem

Author

Listed:
  • Jiaming Zhang

    (School of Mathematics and Statistics, Yunnan University, Kunming 650504, China)

  • Zhikang Zhang

    (School of Mathematics and Statistics, Yunnan University, Kunming 650504, China)

  • Weidong Li

    (School of Mathematics and Statistics, Yunnan University, Kunming 650504, China)

Abstract

Wireless sensor networks (WSNs) have attracted significant attention due to their widespread applications in various fields such as environmental monitoring, agriculture, intelligent transportation, and healthcare. In these networks, the power cost of a sensor node is closely related to the radius of its coverage area, following a nonlinear relationship where power increases as the coverage radius grows according to an attenuation factor. This means that increasing the coverage radius of a sensor leads to a corresponding increase in its power cost. Consequently, minimizing the total power cost of the network while all clients are served has become a crucial research topic. The power cover problem focuses on adjusting the power levels of sensors to serve all clients while minimizing the total power cost. This survey focuses on the power cover problem and its related variants in WSNs. Specifically, it introduces nonlinear integer programming formulations for the power cover problem and its related variants, all within the specified sensor setting. It also provides a comprehensive overview of the power cover problem and its variants under both specified and unspecified sensor settings, summarizes existing results and approximation algorithms, and outlines potential directions for future research.

Suggested Citation

  • Jiaming Zhang & Zhikang Zhang & Weidong Li, 2025. "A Survey of Approximation Algorithms for the Power Cover Problem," Mathematics, MDPI, vol. 13(15), pages 1-30, August.
    • Handle: RePEc:gam:jmathe:v:13:y:2025:i:15:p:2479-:d:1715411
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/13/15/2479/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/13/15/2479/
    Download Restriction: no
    ---><---

    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:gam:jmathe:v:13:y:2025:i:15:p:2479-:d:1715411. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.