Robust Clustering of Ad-hoc Cognitive Radio Networks under Opportunistic Spectrum Access
2011 (English)In: IEEE International Conference on Communications (ICC), 2011, IEEE conference proceedings, 2011, 1-6 p.Conference paper (Refereed)
The time and space varying nature of channel availability among cognitive radio nodes challenges connectivity and robustness of ad-hoc cognitive radio networks. Clustering of neighbouring cognitive radio nodes is a suitable approach to address this challenge. A cluster utilizes the same channel for payload communication among the nodes. As a consequence, clustering enables cooperative spectrum sensing, supports a coordinated channel switching and simplifies routing in ad-hoc cognitive radio networks. However, the sudden appearance of primary nodes can lead to the loss of connectivity within a cluster or between clusters. This impact can be mitigated to some extent by the way clusters are formed. In this work we discuss a distributed, low-complexity clustering algorithm that emphasizes the robustness of clusters by improving inter- and intra-cluster connectivity. The algorithm is proven to converge fast while numerical evaluation shows a significant improvement of robustness compared to related work.
Place, publisher, year, edition, pages
IEEE conference proceedings, 2011. 1-6 p.
Communication Systems Telecommunications
IdentifiersURN: urn:nbn:se:kth:diva-136825DOI: 10.1109/icc.2011.5963426ScopusID: 2-s2.0-80052152643ISBN: 978-1-61284-231-8OAI: oai:DiVA.org:kth-136825DiVA: diva2:677263
IEEE International Conference on Communications 2011 (ICC 2011),Kyoto, 5-9 June 2011
QC 201312122013-12-092013-12-092013-12-12Bibliographically approved