Measuring the connectivity of a cognitive radio ad-hoc network

IEEE Communications Letters

Volumn 14, Issue 5, 2010, Pages 417-419

  Abbagnale, Anna ^a   Cuomo, Francesca ^a   Cipollone, Emanuele ^a  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

Cognitive Laplacian matrix and connectivity

Indexed keywords

ACTIVITY FACTOR; ALGEBRAIC CONNECTIVITY; COGNITIVE RADIO; DATA ROUTING; LAPLACIAN MATRICES; NETWORK CONNECTIVITY; NETWORK PLANNING; SECONDARY NETWORKS; SMALLEST EIGENVALUE;

ALGEBRA; EIGENVALUES AND EIGENFUNCTIONS; LAPLACE TRANSFORMS; MATRIX ALGEBRA; RADIO; TELECOMMUNICATION NETWORKS;

AD HOC NETWORKS;

EID: 77951891081     PISSN: 10897798     EISSN: None     Source Type: Journal    
DOI: 10.1109/LCOMM.2010.05.091565     Document Type: Article

References (7)

1. FCC, "Spectrum policy task force, " Techical Report, Nov. 2002.
2. "CRAHNs: cognitive radio ad hoc networks, " Ad Hoc Networks, vol. 7, no. 5, pp. 810-836, 2009.
3. I. F. Akyildiz, W. Lee, M. C. Vuran, and S. Mohanty, "Next generation/dynamic spectrum access/cognitive, " Computer Networks J., vol. 50, pp. 2127-2159, 2006.
4. C. Godsil and G. Royle, Algebraic Graph Theory. Springer Verlang, Apr. 2001.
5. B. Mohar, "The laplacian spectrum of graphs, " in Graph Theory, Combinatorics, and Applications. Wiley, 1991, pp. 871-898.
6. Y. Kim and M. Mesbahi, "On maximizing the second smallest eigenvalue of a state-dependent graph laplacian, " IEEE Trans. Autom. Contr., vol. 51, no. 1, pp. 116-120, Jan. 2006.
7. A. Jamakovic and S. Uhlig, "On the relationship between the algebraic connectivity and graph's robustness to node and link failures, " in Proc. 3rd EuroNGI Conference on Next Generation Internet Networks, May 2007, pp. 96-102.