IDEAS home Printed from https://ideas.repec.org/a/spr/jglopt/v56y2013i2p559-568.html
   My bibliography  Save this article

Maximum lifetime connected coverage with two active-phase sensors

Author

Listed:
  • Hongwei Du
  • Panos Pardalos
  • Weili Wu
  • Lidong Wu

Abstract

A sensor with two active phrases means that active mode has two phases, the full-active phase and the semi-active phase, which require different energy consumptions. A full-active sensor can sense data packets, transmit, receive, and relay the data packets. A semi-active sensor cannot sense data packets, but it can transmit, receive, and relay data packets. Given a set of targets and a set of sensors with two active phrases, find a sleep/active schedule of sensors to maximize the time period during which active sensors form a connected coverage set. In this paper, this problem is showed to have polynomial-time $${(7.875+\varepsilon)}$$ -approximations for any $${\varepsilon >0 }$$ when all targets and sensors lie in the Euclidean plane and all sensors have the same sensing radius R s and the same communication radius R c with R c ≥ 2R s . Copyright Springer Science+Business Media, LLC. 2013

Suggested Citation

  • Hongwei Du & Panos Pardalos & Weili Wu & Lidong Wu, 2013. "Maximum lifetime connected coverage with two active-phase sensors," Journal of Global Optimization, Springer, vol. 56(2), pages 559-568, June.
    • Handle: RePEc:spr:jglopt:v:56:y:2013:i:2:p:559-568
    DOI: 10.1007/s10898-012-9871-x
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10898-012-9871-x
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10898-012-9871-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.

    References listed on IDEAS

    as
    1. Chen Wang & James Willson & Myung-Ah Park & Andras Farago & Weili Wu, 2010. "On dual power assignment optimization for biconnectivity," Journal of Combinatorial Optimization, Springer, vol. 19(2), pages 174-183, February.
    2. Feng Zou & Xianyue Li & Suogang Gao & Weili Wu, 2009. "Node-weighted Steiner tree approximation in unit disk graphs," Journal of Combinatorial Optimization, Springer, vol. 18(4), pages 342-349, November.
    3. Yaochun Huang & Xiaofeng Gao & Zhao Zhang & Weili Wu, 2009. "A better constant-factor approximation for weighted dominating set in unit disk graph," Journal of Combinatorial Optimization, Springer, vol. 18(2), pages 179-194, August.
    4. Hongjie Du & Weili Wu & Shan Shan & Donghyun Kim & Wonjun Lee, 2012. "Constructing weakly connected dominating set for secure clustering in distributed sensor network," Journal of Combinatorial Optimization, Springer, vol. 23(2), pages 301-307, February.
    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. Yubai Zhang & Yingli Ran & Zhao Zhang, 2017. "A simple approximation algorithm for minimum weight partial connected set cover," Journal of Combinatorial Optimization, Springer, vol. 34(3), pages 956-963, October.
    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. Jiao Zhou & Zhao Zhang & Shaojie Tang & Xiaohui Huang & Ding-Zhu Du, 2018. "Breaking the O (ln n ) Barrier: An Enhanced Approximation Algorithm for Fault-Tolerant Minimum Weight Connected Dominating Set," INFORMS Journal on Computing, INFORMS, vol. 30(2), pages 225-235, May.
    2. Nhat X. Lam & Trac N. Nguyen & Min Kyung An & Dung T. Huynh, 2015. "Dual power assignment optimization and fault tolerance in WSNs," Journal of Combinatorial Optimization, Springer, vol. 30(1), pages 120-138, July.
    3. Tien Tran & Dung T. Huynh, 2020. "The complexity of symmetric connectivity in directional wireless sensor networks," Journal of Combinatorial Optimization, Springer, vol. 39(3), pages 662-686, April.
    4. Tian Liu & Zhao Lu & Ke Xu, 2015. "Tractable connected domination for restricted bipartite graphs," Journal of Combinatorial Optimization, Springer, vol. 29(1), pages 247-256, January.
    5. Feng Zou & Xianyue Li & Suogang Gao & Weili Wu, 2009. "Node-weighted Steiner tree approximation in unit disk graphs," Journal of Combinatorial Optimization, Springer, vol. 18(4), pages 342-349, November.
    6. Yan Zhang & Hongzhi Wang & Hong Gao & Jianzhong Li, 2016. "Efficient accuracy evaluation for multi-modal sensed data," Journal of Combinatorial Optimization, Springer, vol. 32(4), pages 1068-1088, November.
    7. Lidan Fan & Zhao Zhang & Wei Wang, 2011. "PTAS for minimum weighted connected vertex cover problem with c-local condition in unit disk graphs," Journal of Combinatorial Optimization, Springer, vol. 22(4), pages 663-673, November.
    8. Hongyu Liang & Tiancheng Lou & Haisheng Tan & Yuexuan Wang & Dongxiao Yu, 2015. "On the complexity of connectivity in cognitive radio networks through spectrum assignment," Journal of Combinatorial Optimization, Springer, vol. 29(2), pages 472-487, February.
    9. Tien Tran & Min Kyung An & Dung T. Huynh, 2017. "Establishing symmetric connectivity in directional wireless sensor networks equipped with $$2\pi /3$$ 2 π / 3 antennas," Journal of Combinatorial Optimization, Springer, vol. 34(4), pages 1029-1051, November.
    10. Xiao Zhang & Haosheng Fan & Victor C. S. Lee & Minming Li & Yingchao Zhao & Chuang Liu, 2018. "Minimizing the total cost of barrier coverage in a linear domain," Journal of Combinatorial Optimization, Springer, vol. 36(2), pages 434-457, August.
    11. Bang Ye Wu & Chen-Wan Lin, 2015. "On the clustered Steiner tree problem," Journal of Combinatorial Optimization, Springer, vol. 30(2), pages 370-386, August.
    12. Tan D. Lam & Dung T. Huynh, 2023. "Improved algorithms in directional wireless sensor networks," Journal of Combinatorial Optimization, Springer, vol. 45(4), pages 1-25, May.
    13. 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:56:y:2013:i:2:p:559-568. 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.