IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v19y2010i2d10.1007_s10878-008-9173-x.html
   My bibliography  Save this article

On dual power assignment optimization for biconnectivity

Author

Listed:
  • Chen Wang

    (Tsinghua University)

  • James Willson

    (Tsinghua University)

  • Myung-Ah Park

    (Tsinghua University)

  • Andras Farago

    (Tsinghua University)

  • Weili Wu

    (Tsinghua University)

Abstract

Topology control is an important technology of wireless ad hoc networks to achieve energy efficiency and fault tolerance. In this paper, we study the dual power assignment problem for 2-edge connectivity and 2-vertex connectivity in the symmetric graphical model which is a combinatorial optimization problem from topology control technology. The problem is arisen from the following origin. In a wireless ad hoc network where each node can switch its transmission power between high-level and low-level, how can we establish a fault-tolerantly connected network topology in the most energy-efficient way? Specifically, the objective is to minimize the number of nodes assigned with high power and yet achieve 2-edge connectivity or 2-vertex connectivity. We addressed these optimization problems (2-edge connectivity and 2-vertex connectivity version) under the general graph model in (Wang et al. in Theor. Comput. Sci., 2008). In this paper, we propose a novel approximation algorithm, called Candidate Set Filtering algorithm, to compute nearly-optimal solutions. Specifically, our algorithm can achieve 3.67-approximation ratio for both 2-edge connectivity and 2-vertex connectivity, which improves the existing 4-approximation algorithms for these two cases.

Suggested Citation

  • 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.
    • Handle: RePEc:spr:jcomop:v:19:y:2010:i:2:d:10.1007_s10878-008-9173-x
    DOI: 10.1007/s10878-008-9173-x
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-008-9173-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/s10878-008-9173-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.

    Citations

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


    Cited by:

    1. 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.
    2. 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.
    3. 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.
    4. 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.
    5. 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.

    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:jcomop:v:19:y:2010:i:2:d:10.1007_s10878-008-9173-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.