IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v39y2020i3d10.1007_s10878-019-00509-8.html
   My bibliography  Save this article

The complexity of symmetric connectivity in directional wireless sensor networks

Author

Listed:
  • Tien Tran

    (University of Texas at Dallas)

  • Dung T. Huynh

    (University of Texas at Dallas)

Abstract

In this paper, we investigate the Antenna Orientation (AO) and Antenna Orientation and Power Assignment (AOPA) problems concerning symmetric connectivity in Directional Wireless Sensor Networks (DWSNs) where each sensor node is equipped with $$ 2 \le k \le 5$$2≤k≤5 directional antennas having beam-width $$\theta \ge 0$$θ≥0. The AO problem for DWSNs is closely related with the well-known Euclidean Degree-Bounded Minimum Bottleneck Spanning Tree (EBMBST) problem where different cases for the degree bound have been studied. While current works on DWSNs focus on solving each case of k ($$=2,3,4$$=2,3,4) separately, we propose a uniform approach for the AO problem that yields constant-factor approximation algorithms for the AO as well as the EBMBST problem where the degree bound is between 2 and 4. Our method achieves the same constant factors. For the AOPA problem, to the best of our knowledge, our paper provides the first results concerning this problem. We show that the problem is NP-hard when $$2 \le k \le 4$$2≤k≤4. We also establish the first constant-factor approximation algorithms for the problem. Finally, we perform some simulations to understand the practical performance of our algorithms.

Suggested Citation

  • 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.
    • Handle: RePEc:spr:jcomop:v:39:y:2020:i:3:d:10.1007_s10878-019-00509-8
    DOI: 10.1007/s10878-019-00509-8
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-019-00509-8
    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-019-00509-8?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)

    Citations

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


    Cited by:

    1. Alexandre Salles Cunha, 2022. "Improved formulations and branch-and-cut algorithms for the angular constrained minimum spanning tree problem," Journal of Combinatorial Optimization, Springer, vol. 44(1), pages 379-413, August.
    2. 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.

    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. 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.
    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:39:y:2020:i:3:d:10.1007_s10878-019-00509-8. 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.