Skip to main content
SpringerLink
Log in

Construction and maintenance of virtual backbone in wireless networks

  • Published:
Wireless Networks Aims and scope Submit manuscript

Abstract

In ad hoc wireless networks, there is no predefined infrastructure and nodes communicate with each other via peer communications. In order to make routing efficient in such networks the connected dominating set (CDS) can act as virtual backbone for the network. A smaller virtual backbone suffers less from the interference problem and incurs less maintenance overhead. Computing minimum CDS backbone is proven to be NP-Hard, it is therefore desirable to use efficient heuristic algorithms to find a virtual backbone of small size. Diameter and average backbone path length (ABPL) are other major criteria for evaluation of the backbone produced by an algorithm. In this paper, after giving a brief survey of classical CDS algorithms, two new centralized algorithms are described for the construction of the virtual backbone and their performance has been compared with five recent algorithms (two centralized and three distributed) along the parameters: size, diameter, and ABPL. The new algorithms perform better on most of the criteria. The re-construction of entire CDS upon movement or failure of a few nodes is very costly in terms of processing power, battery utilization, bandwidth utilization etc., as compared to maintaining the CDS for the affected nodes, since the re-construction of the CDS is to be performed for the whole network while maintenance involves the affected nodes and their neighbours only. A new distributed algorithm is described that maintains the virtual backbone on movement or failure of a single node. The overhead of CDS maintenance with this algorithm compares very favourably against that of re-construction.

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

Similar content being viewed by others

References

  1. Zoul, F., Li, X., Kim, D., & Wu, W. (2008). Construction of minimum connected dominating set in 3-D wireless network, LNCS 5258 (pp. 134–140). New York: Springer.

    Google Scholar 

  2. Tanenbaum, A. (1996). Computer networks. Englewood Cliffs: Prentice Hall.

    Google Scholar 

  3. Ephremides, A., Wieselthier, J., & Baker, D. A. (1987). Design concept for reliable mobile radio networks with frequency hopping signalling. IEEE Proceedings, 75(1), 56–73.

    Article  Google Scholar 

  4. Kim, D., Wu, Y., Li, Y., & Du, D. (2009). Constructing minimum connected dominating sets with bounded diameters in wireless networks. IEEE Transactions on Parallel and Distributed System, 20(2), 147–157.

    Article  Google Scholar 

  5. Garey, M. R., & Johnson, D. S. (1978). Computers and intractability: A guide to the theory of NP-completeness. New York: Freeman.

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  7. Butenko, S., Cheng, X., Oliveira, C. A. S., & Pardalos, P. M. (2005). A new heuristic for the minimum connected dominating set problem on wireless ad-hoc networks). In R. Murphey & P. M. Pardalos (Eds.), Cooperative control & optimization (pp. 61–73). Norwell: Kluwer Academic Press.

  8. Wu, J., Wu, B., & Stojmenovic, I. (2003). Power-aware broadcasting and activity scheduling in ad hoc wireless networks using connected dominating sets. Wireless Communication and Mobile Computing, 3(2), 425–438.

    Article  Google Scholar 

  9. Ruan, L., Du, H., Jia, X., Wu, W., Li, Y., & Ko, K. I. (2004). A greedy approximation for minimum connected dominating sets. Theoretical Computer Science Archive, 329(1–3), 325–330.

    Article  MathSciNet  MATH  Google Scholar 

  10. Sivakumar, R., Das, B., & Bharghavan, V. (1998). An improved spine based infrastructure for routing in ad-hoc networks. Third IEEE Symposium on Computers and Communication, 3, 1597–1604.

    Google Scholar 

  11. Wan, P. J., Alzoubi, K. M., & Frieder, O. (2002). Distributed construction of connected dominating set in wireless ad hoc networks. IEEE Transactions on Parallel and Distributed System, 18(5), 658–671.

    Google Scholar 

  12. Butenko, S., Cheng, X., Du, D. Z., & Pardalos, P. (2003).On the construction of virtual backbone for ad-hoc wireless networks. In 2nd conference on cooperative control and optimization, pp. 68–74.

  13. Blum, J., Andrew, M. D., & Cheng, T. X. (2004). Connected dominating set in sensor networks and MANETs. In D.-Z. Du & P. Pardalos (Eds.), Handbook of combinatorial optimization (pp. 329–369). Dordrecht: Kluwer Academic Publishers.

  14. Wu, J., & Li, H. (1999). On calculating connected dominating set for efficient routing in ad wireless networks. In 3rd international workshop on discrete algorithms and methods for mobile computing and communications ACM, USA, pp. 7–14.

  15. Li, Y., Peng, S., & Chu, W. (2006). An efficient algorithm for finding an almost connected dominating set of small size on wireless ad hoc networks. In Paper presented, IEEE international conference on communications, Japan, pp. 120–131.

  16. Zhou, D., & Wang, F., et al. (2005). A timer based protocol for CDS construction, SAINT 2005, IEEE 0-7695-2262-9

Download references

Author information

Authors and Affiliations

  1. Department of Computer Engineering, IIT-BHU, Varanasi, 221-005, India

    K. K. Shukla & S. Sah

Authors
  1. K. K. Shukla
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. S. Sah
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to K. K. Shukla.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Shukla, K.K., Sah, S. Construction and maintenance of virtual backbone in wireless networks. Wireless Netw 19, 969–984 (2013). https://doi.org/10.1007/s11276-012-0512-6

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11276-012-0512-6

Keywords

Search

Navigation