Distributed Clustering Algorithm for Cognitive Radio Ad Hoc Networks

Conference paper
Part of the Lecture Notes in Electrical Engineering book series (LNEE, volume 143)

Abstract

Clustering is believed as an efficient method to improve the performance of mobile ad hoc networks (MANETs). It is the same for cognitive radio ad hoc networks (CRAHNs). However, the introduction of cognitive radio technology brings new challenges. We proposed a CogAd-hoc cluster structure in our precious work [2]. This paper designed a distributed clustering algorithm to construct the CogAd-hoc cluster structure. The clustering algorithm is based on Minimal Connected Dominating Set (MCDS) and requires only single-hop neighborhood knowledge. In the best case, its approximation factor is 12 and it has O(nlogn) message complexity and O(n) time complexity. In addition, the algorithm has good load-balancing feature and can avoid the ripple effect of re-clustering.

Keywords

Cognitive radio ad hoc networks minimal connected dominating set distributed clustering algorithm 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Akyildiz, I.F., Lee, W.-Y., Chowdhury, K.R.: CRAHNs: Cognitive Radio Ad Hoc Networks. Ad Hoc Networks 7(5), 810–836 (2009)CrossRefGoogle Scholar
  2. 2.
    Song, L., Li, L., Cheng, Z.: A Novel Cluster-Based Architecture Of Cognitive Wireless Ad-Hoc Networks. In: ICNECS 2011 (2011)Google Scholar
  3. 3.
    Clark, B.N., Colbum, C.J., Johnson, D.S.: Unit disk graphs. Discrete Mathematics 85, 165–177 (1990)CrossRefGoogle Scholar
  4. 4.
    Wu, J., Li, H.: On Calculating Connected Dominating Set for Efficient Routing in Ad Hoc Wireless Networks. Discrete Algorithms and Methods for Mobile Comp. and Commun., 7–14 (1999)Google Scholar
  5. 5.
    Khuller, S., Guha, S.: Approximation algorithms for connected dominating sets. University of Maryland, College Park (1996)Google Scholar
  6. 6.
    Li, B.: QoS-aware adaptive services in mobile ad-hoc networks. In: Wolf, L., Hutchinson, D.A., Steinmetz, R. (eds.) IWQoS 2001. LNCS, vol. 2092, p. 251. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  7. 7.
    Feige, U.: A threshold of ln n for approximating set cover. In: 28th ACM Symposium on Theory of Computing, pp. 314–318 (1996)Google Scholar
  8. 8.
    Chiang, C.-C., et al.: Routing in Clustered Multihop, Mobile Wireless Networks with Fading Channel. In: IEEE SICON 1997 (1997)Google Scholar
  9. 9.
    Dubhashi, D., Mei, A., Panconesi, A., Radhakrishnan, J., Srinivasan, A.: Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons. In: ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 717–724 (2003)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.
    Akyildiz, I., Lee, W., Vuran, M., Mohanty, S.: Next Generation/Dynamic Spectrum Access/Cognitive Radio Wireless Networks: A Survey. Computer Networks 50(3), 2127–2159 (2006)Google Scholar
  12. 12.
    Mokryn, O., Cidon, I.: Propagation and leader election in multihop broadcast environment. In: 12th Int. Symp. Distr. Computing, pp. 104–119 (1998)Google Scholar

Copyright information

© Springer-Verlag GmbH Berlin Heidelberg 2012

Authors and Affiliations

  1. 1.Institute of Command AutomationPLA University of Scientific and TechnologyNanjingChina
  2. 2.Institute of CommunicationsPLA University of Scientific and TechnologyNanjingChina

Personalised recommendations