메뉴 건너뛰기




Volumn , Issue , 2008, Pages 354-359

Graph theoretic approach to QoS-guaranteed spectrum allocation in cognitive radio networks

Author keywords

[No Author keywords available]

Indexed keywords

COGNITIVE RADIO NETWORKS; COMMUNICATION LINKS; CRISP LOGIC; CRITICAL PARAMETERS; DYNAMIC CHANNEL ALLOCATIONS; GRAPH-THEORETIC; GRAPH-THEORETIC APPROACHES; MATCHING ALGORITHMS; PACKET DROPPING PROBABILITIES; PARTITE GRAPHS; QUALITY OF SERVICE GUARANTEES; SPECTRUM ALLOCATIONS; TRANSMISSION POWER; USER REQUIREMENTS;

EID: 62849121354     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/PCCC.2008.4745077     Document Type: Conference Paper
Times cited : (14)

References (10)
  • 1
    • 62849083797 scopus 로고    scopus 로고
    • FCC, Spectrum policy task force report, FCC 02-155. Nov. 2002
    • FCC, "Spectrum policy task force report, FCC 02-155." Nov. 2002
  • 3
    • 38549120859 scopus 로고    scopus 로고
    • Maximizing throughput of cognitive radio networks with limited primary users' cooperation
    • 24-28 June
    • A. T. Hoang, Y. C. Liang, and M. H. Islam, "Maximizing throughput of cognitive radio networks with limited primary users' cooperation," IEEE International Conference on Communications, ICC'07, 24-28 June 2007, pp. 5177-5182 2007.
    • (2007) IEEE International Conference on Communications, ICC'07 , pp. 5177-5182
    • Hoang, A.T.1    Liang, Y.C.2    Islam, M.H.3
  • 8
    • 33745648091 scopus 로고    scopus 로고
    • NeXt generation/dynamic spectrum access/cognitive radio wireless networks: A survey
    • I. F. Akyildiz, W. Y. Lee, M. C. Vuran, and S. Mohanty, "NeXt generation/dynamic spectrum access/cognitive radio wireless networks: a survey," Computer Networks, Vol. 50, Issue 13, pp. 2127-2159.
    • Computer Networks , vol.50 , Issue.13 , pp. 2127-2159
    • Akyildiz, I.F.1    Lee, W.Y.2    Vuran, M.C.3    Mohanty, S.4
  • 10
    • 62849128541 scopus 로고    scopus 로고
    • Priority-Optimal B-Matchings and Load Balancing in Client-Server Networks
    • Technical Report, University of Cincinnati, USA
    • K. A. Berman, Priority-Optimal B-Matchings and Load Balancing in Client-Server Networks. Technical Report, University of Cincinnati, USA.
    • Berman, K.A.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.