Skip to main content
SpringerLink
Log in

Construction of node- and link-fault-tolerant virtual backbones in wireless networks

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

    We’re sorry, something doesn't seem to be working properly.

    Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

Abstract

In wireless sensor networks (WSNs), the virtual backbone (VB) consists of a subset of nodes, which are responsible for routing tasks. Fault-tolerant VBs are desirable for overcoming the effects of node or link failure in WSNs. Usually, a homogeneous WSN (VB) is abstracted as a unit disk graph (UDG) (connected dominating set(CDS)). This paper introduces the concept of a fault-tolerant CDS in a UDG called a ((2, 2), m)-CDS, which is different from a traditional fault-tolerant CDS ((k, m)-CDS). A ((2, 2), m)-CDS can still function even if one edge or one node fails, which implies that it possesses fault-tolerant properties for both nodes and edges, in contrast to traditional (k, m)-CDSs, which possess fault tolerance only for nodes. Then, we propose a \(5\alpha\)-approximation algorithm for computing a ((2, 2), m)-CDS, where \(\alpha\) is the performance ratio for computing a (2, m) -CDS, and analyze its time complexity. In simulations, we compare our algorithm with an existing algorithm for fault-tolerant CDS construction based on CDS size. From the simulations, we find that our algorithm outperforms its competitor in constructing a quality VB.

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

Similar content being viewed by others

Data availability

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

References

  1. Mostafaei H, Montieri A, Persico V (2016) An efficient partial coverage algorithm for wireless sensor networks. In: Proceedings - IEEE Symposium on Computers and Communication, pp 501–506

  2. Chopra A, Aydin H, Rafatirad S (2018) Optimal allocation of computation and communication in an IoT network. ACM Trans Des Autom Electron Syst 23(6):1–22

    Article  Google Scholar 

  3. Narayanaswamy S, Schlueter S, Steinhorst S, Lukasiewycz M, Chakraborty S, Hoster HE (2016) On battery recovery effect in wireless sensor nodes. ACM Trans Des Autom Electron Syst 21(4):1–28

    Article  Google Scholar 

  4. Chowdhury CR, Mandal C, Misra S (2022) Sustainable maintenance of connected dominating set by solar energy harvesting for IoT networks. IEEE Trans Green Commun Netw 6(4):2115–2127

    Article  Google Scholar 

  5. 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 

  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. Wang B, Sun Y, Do-Duy T, Garcia-Palacios E, Duong TQ (2021) Adaptive d-hop connected dominating set in highly dynamic flying Ad-Hoc networks. IEEE Trans Netw Sci Eng 8(3):2651–2664

    Article  MathSciNet  Google Scholar 

  8. Guha S, Khuller S (2007) Approximation algorithms for connected dominating sets. Algorithmica 1(49):79–79

    Article  MATH  Google Scholar 

  9. Li M, Wan PJ, Yao F (2011) Tighter approximation bounds for minimum CDS in unit disk graphs. Algorithmica 61(4):1000–1021

    Article  MathSciNet  MATH  Google Scholar 

  10. Wan PJ, Wang L, Yao F (2008) Two-phased approximation algorithms for minimum CDS in wireless ad hoc networks. In: Proceedings- The 28th International Conference on Distributed Computing Systems, pp 337–344

  11. Alzoubi KM, Wan PJ, Frieder O (2002) New distributed algorithm for connected dominating set in wireless ad hoc networks. In: Proceedings of the 35th Annual Hawaii International Conference on System Sciences, pp 3849–3855

  12. 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  MATH  Google Scholar 

  13. Sivaraj C, Alphonse PJA, Janakiraman TN (2017) Independent neighbour set based clustering algorithm for routing in wireless sensor networks. Wirel Pers Commun 96:6197–6219

    Article  Google Scholar 

  14. Li Y, Thai MT, Wang F, Yi CW, Wan PJ, Du DZ (2005) On greedy construction of connected dominating sets in wireless networks. Wirel Commun Mob Comput 5(8):927–932

    Article  Google Scholar 

  15. Nutov Z (2022) Approximating k-connected m-dominating sets. Algorithmica 84(6):1511–1525

    Article  MathSciNet  MATH  Google Scholar 

  16. Cheng X, Huang X, Li D, Wu W, Du DZ (2003) A polynomial-time approximation scheme for the minimum-connected dominating set in Ad Hoc wireless networks. Networks 42(4):202–208

    Article  MathSciNet  MATH  Google Scholar 

  17. Thai MT, Zhang N, Tiwari R, Xu X (2007) On approximation algorithms of k-connected m-dominating sets in disk graphs. Theor Comput Sci 385(1–3):49–59

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  Google Scholar 

  19. Zhou J, Zhang Z, Shao T, Xiao H et al (2017) Fault-tolerant virtual backbone in heterogeneous wireless sensor network. IEEE/ACM Trans Netw 25(6):3487–3499

    Article  Google Scholar 

  20. Ruan L, Du H, Jia X, Wu W, Li Y, Ko KI (2004) A greedy approximation for minimum connected dominating sets. Theor Comput Sci 329(1–3):325–330

    Article  MathSciNet  MATH  Google Scholar 

  21. Du DZ, Graham RL, Pardalos PM, Wan PJ, Wu W, Zhao W (2008) Analysis of greedy approximations with nonsubmodular potential functions. Proc Annu ACM-SIAM Symp Discret Algorithms 8:167–175

    MathSciNet  MATH  Google Scholar 

  22. 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  MATH  Google Scholar 

  23. Dai F, Wu J (2006) On constructing k-connected k-dominating set in wireless ad hoc and sensor networks. J Parallel Distrib Comput 66(7):947–958

    Article  MATH  Google Scholar 

  24. Shang W, Yao F, Wan P, Hu X (2008) On minimum m-connected k-dominating set problem in unit disc graphs. J Comb Optim 16(2):99–106

    Article  MathSciNet  MATH  Google Scholar 

  25. Zhou J, Zhang Z, Wu W, Xing K (2014) A greedy algorithm for the fault-tolerant connected dominating set in a general graph. J Comb Optim 28(1):310–319

    Article  MathSciNet  MATH  Google Scholar 

  26. Wang W, Liu B, Kim D, Li D, Wang J, Gao W (2017) 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 

  27. Shi Y, Zhang Z, Mo Y, Du DZ (2017) Approximation algorithm for minimum weight fault-tolerant virtual backbone in unit disk graphs. IEEE/ACM Trans Netw 25(2):925–933

    Article  Google Scholar 

  28. Tao K, Sun X, Zhang K, Liu X (2018) Distributed construction of fault-tolerance virtual backbone network for UAV cluster network. Proc EAI Int Conf Adv Hybrid Inf Process Harbin China 2017:226–233

    Google Scholar 

  29. Sun X, Yang Y, Ma M (2019) Minimum connected dominating set algorithms for Ad Hoc sensor networks. Sensors 19(8):1919–1934

    Article  Google Scholar 

  30. Liang X, Liang J, Zhang W (2021) Constructing d-robust connected dominating sets in wireless sensor networks with unstable transmission ranges. IEEE Trans Commun 69(1):398–415

    Article  Google Scholar 

  31. Liang X, Liang J, Zhang W (2021) Construction of quality virtual backbones with link fault tolerance in wireless sensor networks. Wirel Commun Mob Comput. https://doi.org/10.1155/2021/5977781

    Article  Google Scholar 

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

    Article  Google Scholar 

Download references

Acknowledgements

This work was supported in part by the National Natural Science Foundation of China under Grant No. 61862003 and in part by the Natural Science Foundation of the Guangxi Zhuang Autonomous Region of China under Grant No. 2018GXNSFDA281052 and the Interdisciplinary Scientific Research Foundation of Guangxi University under Grant No. 2022JCC015.

Author information

Authors and Affiliations

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

    Jiarong Liang & Weijian Zeng

  2. The College of Information Engineering, Nanning University, Nanning, 530200, Guangxi, China

    Jiarong Liang

  3. Department of Electrical and Computer Engineering, Stevens Institute of Technology, Hoboken, NJ, USA

    Xiaojiang Du

Authors
  1. Jiarong Liang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Weijian Zeng
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Xiaojiang Du
    View author publications

    You can also search for this author in PubMed Google Scholar

Contributions

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

Corresponding author

Correspondence to Weijian Zeng.

Ethics declarations

Conflict of interest

The authors declare that there is no conflict 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

Liang, J., Zeng, W. & Du, X. Construction of node- and link-fault-tolerant virtual backbones in wireless networks. J Supercomput 79, 13050–13074 (2023). https://doi.org/10.1007/s11227-023-05180-9

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11227-023-05180-9

Keywords

Search

Navigation