Advertisement

Maximizing Lifetime of Connected-Dominating-Set in Cognitive Radio Networks

  • Zhiyong Lin
  • Hai Liu
  • Xiaowen Chu
  • Yiu-Wing Leung
  • Ivan Stojmenovic
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7290)

Abstract

Connected-dominating-set (CDS) is a representative technique for constructing a virtual backbone of wireless networks. Most of existing works on CDS aim at minimizing the size of the CDS, i.e., constructing the minimum CDS (MCDS), so as to reduce the communication overhead over the CDS. However, MCDS may not work well in cognitive radio networks (CRNs) where communication links are prone to failure due to the unpredictable activities of primary users. A MCDS without consideration of stochastic activities of primary users easily becomes invalid when the primary users reclaim the licensed spectrum. In this work, we assume that the activities of primary users follow the exponential distribution. Our problem is to maximize the lifetime of the CDS while minimizing the size of the CDS, where the lifetime of a CDS is defined as the expected duration that the CDS is maintained valid. We show that the problem is NP-hard and propose a three-phase algorithm. Our basic idea is to apply a pruning-based approach to maximize the lifetime of the CDS. Given a CRN, we prove that our algorithm can compute a CDS such that i) the lifetime of the CDS is maximized (optimal); and ii) the size of the CDS is upper-bounded. To the best of our knowledge, it is the first time in the literature that CDS in CRNs is studied and an effective algorithm is proposed.

Keywords

cognitive radio networks connected-dominating-set lifetime 

References

  1. 1.
    Liu, H., Wan, P., Jia, X.: Maximal Lifetime Scheduling for Sensor Surveillance Systems with K Sensors to 1 Target. IEEE Trans. on Parallel & Distributed Systems 17, 1526–1536 (2006)CrossRefGoogle Scholar
  2. 2.
    Mini, S., Udgata, S.K., Sabat, S.L.: A Heuristic to Maximize Network Lifetime for Target Coverage Problem in Wireless Sensor Networks. Adhoc & Sensor Wireless Networks 13, 251–269 (2011)Google Scholar
  3. 3.
    Hu, X., Shuai, T., Jia, X., Zhang, M.: Multicast Routing and Wavelength Assignment in WDM Networks with Limited Drop-offs. In: Proceedings of IEEE INFOCOM 2004 (2004)Google Scholar
  4. 4.
    Li, J., Zhou, Y., Lamont, L., Deziel, M.: A Novel Framework of Adaptive Routing Design in Cognitive Radio Military Networks. Adhoc & Sensor Wireless Networks 12, 79–101 (2011)Google Scholar
  5. 5.
    Shaikh, J.A., Solano-Gonzalez, J., Stojmenovic, I., Wu, J.: New Metrics for Dominating Set Based Energy Efficient Activity Scheduling in Ad Hoc Networks. In: Proceedings of IEEE Conf. on Local Computer Networks/WLN 2003, pp. 726–735 (2003)Google Scholar
  6. 6.
    Guha, S., Khuller, S.: Approximation Algorithms for Connected Dominating Sets. Algorithmica 20, 374–387 (1998)MathSciNetzbMATHCrossRefGoogle Scholar
  7. 7.
    Kamrul, I., Selim, G.A.: A Local Algorithm to Compute Multiple Connected Dominating Sets in Wireless Sensor Networks. International Journal of Parallel, Emergent and Distributed Systems 26, 369–380 (2011)CrossRefGoogle Scholar
  8. 8.
    Wu, J., Wu, B., Stojmenovic, I.: Power-aware Broadcasting and Activity Scheduling in Ad Hoc Wireless Networks Using Connected Dominating Sets. Wireless Communications and Mobile Computing 3, 425–438 (2003)CrossRefGoogle Scholar
  9. 9.
    Simplot-Ryl, D., Stojmenovic, I., Wu, J.: Energy Efficient Backbone Construction, Broadcasting, and Area Coverage in Sensor Networks. In: Stojmenovic, I. (ed.) Handbook of Sensor Networks: Algorithms and Architectures. Wiley (2005)Google Scholar
  10. 10.
    Alzoubi, K.M., Wan, P.-J., Frieder, O.: Distributed Heuristics for Connected Dominating Sets in Wireless Ad Hoc Networks. Journal of Communications and Networks 4, 1–8 (2002)Google Scholar
  11. 11.
    Wu, Y., Li, Y.: Connected Dominating Sets. In: Liu, H., Leung, Y.W., Chu, X. (eds.) Handbook of Ad Hoc and Sensor Wireless Networks: Architectures, Algorithms and Protocols. Bentham Science (2009)Google Scholar
  12. 12.
    Geirhofer, S., Tong, L., Sadler, B.M.: Dynamic Spectrum Access in the Time Domain: Modeling and Exploiting White Space. IEEE Communications Magazine 45, 66–72 (2007)CrossRefGoogle Scholar
  13. 13.
    Stevenson, C.R., Chouinard, G., Lei, Z., Hu, W., Shellhammer, S.J., Caldwell, W.: IEEE 802.22: The First Cognitive Radio Wireless Regional Area Network Standard. IEEE Communications Magazine 47, 130–138 (2009)CrossRefGoogle Scholar
  14. 14.
    Lin, Z., Liu, H., Chu, X., Leung, Y.-W.: Jump-Stay Based Channel-Hopping Algorithm with Guaranteed Rendezvous for Cognitive Radio Networks. In: Proceedings of IEEE INFOCOM 2011, pp. 2444–2452 (2011)Google Scholar
  15. 15.
    Lin, Z., Liu, H., Chu, X., Leung, Y.W.: Ring-Walk Rendezvous Algorithms for Cognitive Radio Networks. Ad Hoc & Sensor Wireless Networks (2012)Google Scholar
  16. 16.
    Slavík, P.: A Tight Analysis of the Greedy Algorithm for Set Cover. Journal of Algorithms 25, 237–254 (1997)MathSciNetzbMATHCrossRefGoogle Scholar
  17. 17.

Copyright information

© IFIP International Federation for Information Processing 2012

Authors and Affiliations

  • Zhiyong Lin
    • 1
    • 2
  • Hai Liu
    • 2
  • Xiaowen Chu
    • 2
  • Yiu-Wing Leung
    • 2
  • Ivan Stojmenovic
    • 3
    • 4
  1. 1.Dept. of Computer ScienceGuangDong Polytechnic Normal UniversityChina
  2. 2.Dept. of Computer ScienceHong Kong Baptist UniversityHong Kong
  3. 3.SITEUniversity of OttawaCanada
  4. 4.EET, Faculty of Technical SciencesUniversity of Novi SadSerbia

Personalised recommendations