Skip to main content
SpringerLink
Log in

The complexity of symmetric connectivity in directional wireless sensor networks

  • Published:
Journal of Combinatorial Optimization Aims and scope Submit manuscript

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\) directional antennas having beam-width \(\theta \ge 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\)) 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\). 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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16
Fig. 17
Fig. 18

Similar content being viewed by others

References

  • Andersen PJ, Ras CJ (2016) Minimum bottleneck spanning trees with degree bounds. Networks 68(4):302–314

    Article  MathSciNet  MATH  Google Scholar 

  • Arkin EM, Fekete SP, Islam K, Meijer H, Mitchell JSB, Rodríguez YN, Polishchuk V, Rappaport D, Xiao H (2009) Not being (super)thin or solid is hard: a study of grid hamiltonicity. Comput Geom 42(6–7):582–605

    Article  MathSciNet  MATH  Google Scholar 

  • Aschner R, Katz MJ (2014) Bounded-angle spanning tree: modeling networks with angular constraints. In: ICALP, pp 387–398

  • Aschner R, Katz MJ, Morgenstern G (2013) Symmetric connectivity with directional antennas. Comput Geom 46(9):1017–1026

    Article  MathSciNet  MATH  Google Scholar 

  • Bhattacharya BK, Hu Y, Shi Q, Kranakis E, Krizanc D (2009) Sensor network connectivity with multiple directional antennae of a given angular sum. In: IPDPS, pp 1–11

  • Călinescu G, Wan P (2006) Range assignment for biconnectivity and $k$-edge connectivity in wireless ad hoc networks. MONET 11(2):121–128

    Google Scholar 

  • Călinescu G, Kapoor S, Olshevsky A, Zelikovsky A (2003) Network lifetime and power assignment in ad hoc wireless networks. In: ESA, pp 114–126

  • Caragiannis I, Kaklamanis C, Kanellopoulos P (2006) Energy-efficient wireless network design. Theory Comput Syst 39(5):593–617

    Article  MathSciNet  MATH  Google Scholar 

  • Carmi P, Katz MJ, Lotker Z, Rosén A (2011) Connectivity guarantees for wireless networks with directional antennas. Comput Geom 44(9):477–485

    Article  MathSciNet  MATH  Google Scholar 

  • Chan TM (2004) Euclidean bounded-degree spanning tree ratios. Discrete Comput Geom 32(2):177–194

    Article  MathSciNet  MATH  Google Scholar 

  • Dobrev S, Kranakis E, Krizanc D, Opatrny J, Ponce O, Stacho L (2010) Strong connectivity in sensor networks with given number of directional antennae of bounded angle. In: Combinatorial optimization and applications. Springer, Berlin Heidelberg, pp 72–86

  • Khuller S, Raghavachari B, Young N (1996) Low-degree spanning trees of small weight. SIAM J Comput 25(2):355–368

    Article  MathSciNet  MATH  Google Scholar 

  • Kirousis LM, Kranakis E, Krizanc D, Pelc A (1997) Power consumption in packet radio networks. In: STACS, pp 363–374

  • Lam NX, Nguyen TN, An MK, Huynh DT (2011) Dual power assignment optimization for $k$-edge connectivity in WSNs. In: SECON, pp 566–573

  • Li EL, Halpern JY, Bahl P, Wang Y-M, Wattenhofer R (2001) Analysis of a cone-based distributed topology control algorithm for wireless multi-hop networks. In: PODC, pp 264–273

  • Lloyd EL, Liu R, Marathe MV, Ramanathan R, Ravi SS (2005) Algorithmic aspects of topology control problems for ad hoc networks. In: MONET, pp 19–34

  • Lloyd EL, Liu R, Ravi SS (2006) Approximating the minimum number of maximum power users in ad hoc networks. In: MONET, pp 129–142

  • Papadimitriou CH, Vazirani UV (1984) On two geometric problems related to the travelling salesman problem. J Algorithms 5(2):231–246

    Article  MathSciNet  MATH  Google Scholar 

  • Parker R, Rardin RL (1984) Guaranteed performance heuristics for the bottleneck travelling salesman problem. Oper Res Lett 2(6):269–272

    Article  MathSciNet  MATH  Google Scholar 

  • Tran T, Huynh DT (2018) Symmetric connectivity algorithms in multiple directional antennas wireless sensor networks. In: IEEE INFOCOM 2018—IEEE conference on computer communications. IEEE, pp 333–341

  • Tran T, An MK, Huynh D (2015) Symmetric connectivity in wireless sensor networks with directional antennas. In: 2015 IEEE international conference on communications (ICC). IEEE, pp 6400–6405

  • Tran T, An MK, Huynh DT (2016) Antenna orientation and range assignment in wsns with directional antennas. In: IEEE INFOCOM 2016—the 35th annual IEEE international conference on computer communications. IEEE, pp 1–9

  • Wang C, Willson J, Park MA, dobraand Weili Wu AF (2010) On dual power assignment optimization for biconnectivity. J Comb Optim 19(2):174–183

    Article  MathSciNet  MATH  Google Scholar 

  • Wu W, Du H, Jia X, Li Y, Huang SC-H (2006) Minimum connected dominating sets and maximal independent sets in unit disk graphs. Theoret Comput Sci 352(1):1–7

    Article  MathSciNet  MATH  Google Scholar 

  • Ye D, Zhang H (2004) The range assignment problem in static ad-hoc networks on metric spaces. In: SIROCCO, pp 291–302

  • Zhang Z, Zhou J, Mo Y, Du D-Z (2016) Performance-guaranteed approximation algorithm for fault-tolerant connected dominating set in wireless networks. In: IEEE INFOCOM 2016—the 35th annual IEEE international conference on computer communications. IEEE, pp 1–8

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Texas at Dallas, Richardson, TX, 75080, USA

    Tien Tran & Dung T. Huynh

Authors
  1. Tien Tran
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dung T. Huynh
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Dung T. Huynh.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

This paper is a revised and expanded version of a paper entitled “Symmetric Connectivity Algorithms in Multiple Directional Antennas Wireless Sensor Networks” presented at the IEEE International Conference on Computer Communications (INFOCOM 2018), 15–19 April 2018, Honolulu, HI, USA (Tran and Huynh 2018).

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Tran, T., Huynh, D.T. The complexity of symmetric connectivity in directional wireless sensor networks. J Comb Optim 39, 662–686 (2020). https://doi.org/10.1007/s10878-019-00509-8

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10878-019-00509-8

Keywords

Search

Navigation