IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v30y2015i1d10.1007_s10878-013-9637-5.html
   My bibliography  Save this article

Dual power assignment optimization and fault tolerance in WSNs

Author

Listed:
  • Nhat X. Lam

    (University of Texas at Dallas)

  • Trac N. Nguyen

    (University of Texas at Dallas)

  • Min Kyung An

    (University of Texas at Dallas)

  • Dung T. Huynh

    (University of Texas at Dallas)

Abstract

Because of limited battery equipped on each sensor, power consumption is one of the crucial issues in wireless sensor networks (WSNs). It therefore has been the focus of many researchers. An important problem concerning power consumption is to minimize the number of maximum-power nodes while maintaining a desired network topology. As fault tolerance is vitally important in practice, it is desirable that the constructed network topology is $$k$$ k -edge-connected or $$k$$ k -connected. In this paper, we study the dual power assignment problem for $$k$$ k -edge connectivity $$(kEDP)$$ ( k E D P ) and biconnectivity in WSNs. While other studies consider only the special case $$k=2$$ k = 2 , our goal is to address the general problem. In addition to showing the APX-completeness of biconnectivity problem in the metric model, we also prove the NP-completeness of the $$kEDP$$ k E D P problem in the geometric case and provide a 2-approximation algorithm using linear programming techniques. To the best of our knowledge, this approximation ratio is currently the best one. We also introduce a heuristic whose performance is better compared with an approximation algorithm in Wang et al. (J Comb Optim 19:174–183, 2010).

Suggested Citation

  • 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.
    • Handle: RePEc:spr:jcomop:v:30:y:2015:i:1:d:10.1007_s10878-013-9637-5
    DOI: 10.1007/s10878-013-9637-5
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-013-9637-5
    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-013-9637-5?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.
    Full references (including those not matched with items on IDEAS)

    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. 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.
    2. 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.
    3. 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.
    4. 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:30:y:2015:i:1:d:10.1007_s10878-013-9637-5. 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.