Measuring the Connectivity of a Cognitive Radio Ad-Hoc Network

被引:9
作者
Abbagnale, Anna [1 ]
Cuomo, Francesca [1 ]
Cipollone, Emanuele [1 ]
机构
[1] Univ Roma La Sapienza, INFOCOM Dept, I-00184 Rome, Italy
关键词
Cognitive Laplacian matrix and connectivity;
D O I
10.1109/LCOMM.2010.05.091565
中图分类号
TN [电子技术、通信技术];
学科分类号
0809 ;
摘要
In Cognitive Radio Ad-Hoc Networks (CRAHN) the behavior of the primary users influences the secondary network connectivity and the relevant performance. The methodologies used to evaluate network connectivity have to be worked up to take into account this aspect. In this letter we propose the use of Laplacian matrix and its second smallest eigenvalue to measure the network algebraic connectivity of a CRAHN. We re-elaborate the Laplacian matrix in order to have in its second smallest eigenvalue a function of the primary users behavior expressed as an activity factor. In this way we are able to monitor the algebraic connectivity of CRAHNs. This metric can be a useful instrument for network planning, data routing and network maintenance. Performance results show how this methodology can be efficiently applied in this kind of networks.
引用
收藏
页码:417 / 419
页数:3
相关论文
共 7 条
[1]   NeXt generation/dynamic spectrum access/cognitive radio wireless networks: A survey [J].
Akyildiz, Ian F. ;
Lee, Won-Yeol ;
Vuran, Mehmet C. ;
Mohanty, Shantidev .
COMPUTER NETWORKS, 2006, 50 (13) :2127-2159
[2]  
FCC, 2002, DOCKET 02 155
[3]  
Godsil C., 2001, Algebraic graph theory
[4]   On the relationship between the algebraic connectivity and graph's robustness to node and link failures [J].
Jamakovic, A. ;
Uhlig, S. .
2007 NEXT GENERATION INTERNET NETWORKS, 2007, :96-+
[5]   On maximizing the second smallest eigenvalue of a state-dependent graph Laplacian [J].
Kim, Y ;
Mesbahi, M .
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2006, 51 (01) :116-120
[6]  
Oellermann O. R., 1991, Graph Theory, Combinatorics, and Applications, V2, P871, DOI DOI 10.1016/J.CAMWA.2004.05.005
[7]  
2009, AD HOC NETWORKS, V7, P810