Skip to main content
SpringerLink
Log in

On the construction of quality extended virtual backbones in wireless sensor networks using cooperative communication

  • Published:
The Journal of Supercomputing Aims and scope Submit manuscript

Abstract

Frequently, unit disk graphs (UDGs) are used as abstractions of wireless networks. In the paper, we study the problem of finding an extended minimum connected dominating set (E-MCDS) in a wireless network with cooperative communication (CC), which was proposed in Wu et al. (IEEE Trans Parallel Distrib Syst 17(8):851–864, 2006) and is NP-hard. We propose a two-phase centralized algorithm to construct an extended connected dominating set (ECDS) for a given UDG with CC. First, we construct a 2-hop extended dominating set (EDS) in the UDG. Then, we add some new nodes into the 2-hop EDS to make it connected. To obtain the performance ratio of this two-phase centralized algorithm, we first give an upper bound on the size of the 2-hop EDS. Using this upper bound, we prove that the size of the ECDS found by the centralized algorithm is no greater than \(27.192{\text {opt}}-3\) or \(160{\text {ECDS}}_{{\text {opt}}}-3\), where opt and \({\text {ECDS}}_{{\text {opt}}}\) are the sizes of the minimum connected dominating set and the E-MCDS, respectively, in the UDG. Finally, a 160-approximate distributed algorithm based on the two-phase centralized algorithm is proposed, and its message and time complexities are analyzed, both of which are \(O(n^3)\). Simulation results show that our work outperforms competing methods on average.

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

Similar content being viewed by others

Availability of data and materials

All data used to support the findings of this study are included within the article.

References

  1. Yetgin H, Cheung KTK, El Hajjar M, Hanzo LH (2017) A survey of network lifetime maximization techniques in wireless sensor networks. IEEE Commun Surv Tutor 19(2):828–854

    Article  Google Scholar 

  2. Dow CR, Lin PJ, Chen SC, Lin JH, Hwang SF (2005) A study of recent research trends and experimental guidelines in mobile ad-hoc network. In: 19th International Conference on Advanced Information Networking and Applications (AINA’05) (AINA Papers), vol 1. IEEE, pp 72–77

  3. Ephremides A, Wieselthier JE, Baker DJ (1987) A design concept for reliable mobile radio networks with frequency hopping signaling. Proc IEEE 75(1):56–73

    Article  Google Scholar 

  4. Gao X, Zhu X, Li J, Wu F, Chen G, Du DZ, Tang S (2017) A novel approximation for multi-hop connected clustering problem in wireless networks. IEEE/ACM Trans Netw 25(4):2223–2234

    Article  Google Scholar 

  5. Zhang Z, Willson J, Lu Z, Wu W, Zhu X, Du DZ (2016) Approximating maximum lifetime k-coverage through minimizing weighted k-cover in homogeneous wireless sensor networks. IEEE/ACM Trans Netw 24(6):3620–3633

    Article  Google Scholar 

  6. Fukunaga T (2020) Adaptive algorithm for finding connected dominating sets in uncertain graphs. IEEE/ACM Trans Netw 28(1):387–398

    Article  Google Scholar 

  7. Fang W, Yi L, Zhu C, Jia G, Zhang W (2022) TML-CDS: trusted multi-layer connected dominating set for secure routing in distributed networks. GLOBECOM 2022–2022:2728–2732

    Google Scholar 

  8. Yu D, Zou Y, Zhang Y, Li F, Yu J, Wu Y, Cheng X, Lau FC (2019) Distributed dominating set and connected dominating set construction under the dynamic SINR model. IPDPS 2019:835–844

    Google Scholar 

  9. Zhang W, Liang J, Liang X (2021) On the computation of virtual backbones with fault tolerance in heterogeneous wireless sensor networks. IEEE Trans Mob Comput 21(8):2922–2938

    Article  Google Scholar 

  10. Clark BN, Colbourn CJ, Johnson DS (1990) Unit disk graphs. Discrete Math 86(1–3):165–177

    Article  MathSciNet  Google Scholar 

  11. Kim D, Wu Y, Li Y, Zou F, Du DZ (2008) Constructing minimum connected dominating sets with bounded diameters in wireless networks. IEEE Trans Parallel Distrib Syst 20(2):147–157

    Google Scholar 

  12. Wang W, Liu B, Kim D, Li D, Wang J, Gao W (2016) A new constant factor approximation to construct highly fault tolerant connected dominating set in unit disk graph. IEEE/ACM Trans Netw 25(1):18–28

    Article  Google Scholar 

  13. Liu B, Wang W, Kim D, Li D, Wang J, Tokuta AO, Jiang Y (2015) On approximating minimum 3-connected m-dominating set problem in unit disk graph. IEEE/ACM Trans Netw 24(5):2690–2701

    Article  Google Scholar 

  14. Shi T, Cheng S, Cai Z, Li Y, Li J (2017) Exploring connected dominating sets in energy harvest networks. IEEE/ACM Trans Netw 25(3):1803–1817

    Article  Google Scholar 

  15. Ding L, Wu W, Willson J, Du H, Lee W (2012) Efficient virtual backbone construction with routing cost constraint in wireless networks using directional antennas. IEEE Trans Mob Comput 11(7):1102–1112

    Article  Google Scholar 

  16. Kumar G, Rai MK (2017) An energy efficient and optimized load balanced localization method using CDS with one-hop neighbourhood and genetic algorithm in WSNS. J Netw Comput Appl 78:73–82

    Article  Google Scholar 

  17. Nosratinia A, Hunter TE, He dayat A (2004) Cooperative communication in wireless networks. IEEE Commun Mag 42(10):74–80

    Article  Google Scholar 

  18. Wu J, Cardei M, Dai F, Yang S (2006) Extended dominating set and its applications in ad hoc networks using cooperative communication. IEEE Trans Parallel Distrib Syst 17(8):851–864

    Article  Google Scholar 

  19. Mohanty JP, Mandal C, Reade C, Das A (2016) Construction of minimum connected dominating set in wireless sensor networks using pseudo dominating set. Ad Hoc Netw 42:61–73

    Article  Google Scholar 

  20. Haynes TW, Hedetniemi S, Slater P (2013) Fundamentals of domination in graphs. CRC Press

    Book  Google Scholar 

  21. Guha S, Khuller S (1998) Approximation algorithms for connected dominating sets. Algorithmica 20(4):374–387

    Article  MathSciNet  Google Scholar 

  22. Du YL, Du HW (2015) A new bound on maximum independent set and minimum connected dominating set in unit disk graphs. J Comb Optim 30(4):1173–1179

    Article  MathSciNet  Google Scholar 

  23. Feeney LM, Nilsson M (2001) Investigating the energy consumption of a wireless network interface in an ad hoc networking environment. In: Proceedings IEEE INFOCOM 2001, vol 3, pp 1548–1557

  24. Chen B, Jamieson K, Balakrishnan H, Morris R (2001) Span: an energy-efficient coordination algorithm for topology maintenance in ad hoc wireless networks. In: Proceedings of the 7th Annual International Conference on Mobile Computing and Networking, pp 85–96

  25. Ma J, Lou W, Wu Y, Li XY, Chen G (2009) Energy efficient TDMA sleep scheduling in wireless sensor networks. In: IEEE INFOCOM 2009. IEEE, pp 630–638

  26. Zhuang Y, Pan J, Cai L (2010) Minimizing energy consumption with probabilistic distance models in wireless sensor networks. In: 2010 Proceedings IEEE INFOCOM, pp 1–9

  27. Zhang W, Liang J, Liang X (2023) Approximation algorithms for computing virtual backbones considering routing costs in wireless networks. IEEE/ACM Trans Netw. https://doi.org/10.1109/TNET.2023.3284051

    Article  Google Scholar 

  28. Shi Y, Zhang Y, Zhang Z, Wu W (2016) A greedy algorithm for the minimum 2-connected m-fold dominating set problem. J Comb Optim 31(1):136–151

    Article  MathSciNet  Google Scholar 

  29. Liu B, Wang W, Kim D, Li Y, Kwon SS, Jiang Y (2017) On practical construction of quality fault-tolerant virtual backbone in homogeneous wireless networks. IEEE/ACM Trans Netw 26(1):412–421

    Article  Google Scholar 

  30. Du H, Ye Q, Wu W, Lee W, Li D, Du D, Howard S (2011) Constant approximation for virtual backbone construction with guaranteed routing cost in wireless sensor networks. In: 2011 Proceedings IEEE INFOCOM, pp 1737–1744

  31. Du H, Wu W, Ye Q, Li D, Lee W, Xu X (2012) CDS-based virtual backbone construction with guaranteed routing cost in wireless sensor networks. IEEE Trans Parallel Distrib Syst 24(4):652–661

    Google Scholar 

  32. Butenko S, Ursulenko O (2007) On minimum connected donimating set problem in unit-ball graphs. Elsevier

    Google Scholar 

  33. Bai S, Che X, Bai X, Wei X (2015) Maximal independent sets in heterogeneous wireless ad hoc networks. IEEE Trans Mob Comput 15(8):2023–2033

    Article  Google Scholar 

  34. Li N, Hou JC, Sha L (2005) Design and analysis of an MST-based topology control algorithm. IEEE Trans Wirel Commun 4(3):1195–1206

    Article  Google Scholar 

Download references

Acknowledgements

The authors thank the anonymous reviewers and the editor for their valuable feedback on the paper, which helped us to improve its quality and presentation.

Funding

This work was supported by the National Natural Science Foundation of China under grant nos. 61862003 and 62261003.

Author information

Authors and Affiliations

  1. School of Computer, Electronics and Information, Guangxi Key Laboratory of Multimedia Communications and Network Technology, Guangxi University, Nanning, 530004, Guangxi, China

    Junhao Wang & Jiarong Liang

  2. Nanning University, Nanning, 530200, Guangxi, China

    Jiarong Liang

  3. College of Information Engineering, Nanning University, Nanning, 530200, Guangxi, China

    Qingnian Li

Authors
  1. Junhao Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jiarong Liang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Qingnian Li
    View author publications

    You can also search for this author in PubMed Google Scholar

Contributions

JW and JL wrote the main manuscript text and prepared all figures. JL and QL performed the experiments on the approximation algorithm and summarized this paper. All authors reviewed the manuscript.

Corresponding author

Correspondence to Jiarong Liang.

Ethics declarations

Conflict of interest

The authors declare that there are no conflicts of interest regarding the publication of this paper.

Ethical approval

This paper does not involve any animal or human studies.

Additional information

Publisher's Note

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

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Wang, J., Liang, J. & Li, Q. On the construction of quality extended virtual backbones in wireless sensor networks using cooperative communication. J Supercomput 80, 9115–9139 (2024). https://doi.org/10.1007/s11227-023-05799-8

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11227-023-05799-8

Keywords

Search

Navigation