IDEAS home Printed from https://ideas.repec.org/a/spr/jglopt/v80y2021i3d10.1007_s10898-021-01033-y.html
   My bibliography  Save this article

Approximation algorithm for minimum power partial multi-coverage in wireless sensor networks

Author

Listed:
  • Yingli Ran

    (Zhejiang Normal University)

  • Xiaohui Huang

    (Zhejiang Normal University)

  • Zhao Zhang

    (Zhejiang Normal University)

  • Ding-Zhu Du

    (University of Texas at Dallas)

Abstract

In this paper, we consider the wireless sensor network in which the power of each sensor is adjustable. Given a set of sensors and a set of targets, we study a problem of minimizing the total power such that the coverage of targets meets partial multi-cover requirement, that is, there are at least a given number of targets each covered by a given number of sensors (this number is called the covering requirement for the target). This is called the minimum power partial multi-cover problem (MinPowerPMC) in a wireless sensor network. Under the assumption that the covering requirements for all targets are upper bounded by a constant, we design the first PTAS for the MinPowerPMC problem, that is, for any $$\varepsilon >0$$ ε > 0 , a polynomial-time $$(1+\varepsilon )$$ ( 1 + ε ) -approximation.

Suggested Citation

  • Yingli Ran & Xiaohui Huang & Zhao Zhang & Ding-Zhu Du, 2021. "Approximation algorithm for minimum power partial multi-coverage in wireless sensor networks," Journal of Global Optimization, Springer, vol. 80(3), pages 661-677, July.
    • Handle: RePEc:spr:jglopt:v:80:y:2021:i:3:d:10.1007_s10898-021-01033-y
    DOI: 10.1007/s10898-021-01033-y
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10898-021-01033-y
    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/s10898-021-01033-y?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.

    References listed on IDEAS

    as
    1. Weili Wu & Zhao Zhang & Wonjun Lee & Ding-Zhu Du, 2020. "Optimal Coverage in Wireless Sensor Networks," Springer Optimization and Its Applications, Springer, number 978-3-030-52824-9, September.
    2. Yingli Ran & Yishuo Shi & Changbing Tang & Zhao Zhang, 2020. "A primal-dual algorithm for the minimum partial set multi-cover problem," Journal of Combinatorial Optimization, Springer, vol. 39(3), pages 725-746, April.
    3. Menghong Li & Yingli Ran & Zhao Zhang, 0. "A primal-dual algorithm for the minimum power partial cover problem," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-11.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Han Dai & Bin Deng & Weidong Li & Xiaofei Liu, 2022. "A note on the minimum power partial cover problem on the plane," Journal of Combinatorial Optimization, Springer, vol. 44(2), pages 970-978, September.
    2. Zhao Zhang & Wei Liang & Hongmin W. Du & Siwen Liu, 2022. "Constant Approximation for the Lifetime Scheduling Problem of p -Percent Coverage," INFORMS Journal on Computing, INFORMS, vol. 34(5), pages 2675-2685, September.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Yingli Ran & Zhao Zhang & Shaojie Tang & Ding-Zhu Du, 2021. "Breaking the r max Barrier: Enhanced Approximation Algorithms for Partial Set Multicover Problem," INFORMS Journal on Computing, INFORMS, vol. 33(2), pages 774-784, May.
    2. Man Xiao & Weidong Li & Xiaofei Liu, 2023. "Online Mixed Ring Covering Problem with Two Nodes," SN Operations Research Forum, Springer, vol. 4(1), pages 1-20, March.
    3. Amir Masoud Rahmani & Saqib Ali & Mohammad Sadegh Yousefpoor & Efat Yousefpoor & Rizwan Ali Naqvi & Kamran Siddique & Mehdi Hosseinzadeh, 2021. "An Area Coverage Scheme Based on Fuzzy Logic and Shuffled Frog-Leaping Algorithm (SFLA) in Heterogeneous Wireless Sensor Networks," Mathematics, MDPI, vol. 9(18), pages 1-41, September.
    4. Ran, Yingli & Zhang, Ying & Zhang, Zhao, 2021. "Parallel approximation for partial set cover," Applied Mathematics and Computation, Elsevier, vol. 408(C).
    5. Yaoyao Zhang & Zhao Zhang & Ding-Zhu Du, 2023. "Construction of minimum edge-fault tolerant connected dominating set in a general graph," Journal of Combinatorial Optimization, Springer, vol. 45(2), pages 1-12, March.
    6. Zhao Zhang & Wei Liang & Hongmin W. Du & Siwen Liu, 2022. "Constant Approximation for the Lifetime Scheduling Problem of p -Percent Coverage," INFORMS Journal on Computing, INFORMS, vol. 34(5), pages 2675-2685, September.

    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:jglopt:v:80:y:2021:i:3:d:10.1007_s10898-021-01033-y. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.