지원사업
학술연구/단체지원/교육 등 연구자 활동을 지속하도록 DBpia가 지원하고 있어요.
커뮤니티
연구자들이 자신의 연구와 전문성을 널리 알리고, 새로운 협력의 기회를 만들 수 있는 네트워킹 공간이에요.
논문 기본 정보
- 자료유형
- 학술대회자료
- 저자정보
- 발행연도
- 2011.5
- 수록면
- 227 - 230 (4page)
이용수
이 논문의 연구 히스토리 (2)
2011
Optimal Dynamic Spectrum Access in Cognitive Radio Networks under Rayleigh Fading
Hyeon Je Cho
,
Gang Uk Hwang
한국산업응용수학회 학술대회 논문집
2011.11
학술대회자료
Analysis of Optimal Random Access Policies for Cognitive Radio Networks under Rayleigh fading
Hyeon Je Cho
,
Gang Uk Hwang
한국산업응용수학회 학술대회 논문집
2011.05
학술대회자료
- 이 논문의 후속연구가 궁금하신가요?
- 연관 학술논문 또는 학술발표를 통해 보다 발전된 연구결과를 확인하실 수 있습니다.
- 이 논문의 연구 히스토리 확인하기
초록· 키워드
오류제보하기
We consider a time slotted cognitive radio network under Rayleigh fading where multiple secondary users (SUs) contend for spectrum usage over available primary users’ channels. We analyze a channel access policy where each SU stochastically determines whether to access a wireless channel or not based on a givne access probability. We focus on the queueing performance of an arbitrary SU. To improve the queueing performance of SUs, the access probability in our channel access policy is adapted to the information on channels, e.g., the number of available channels and the probability of a deep fade for channels. It is then important to obtain the optimal access probabilities from the queueing performance perspective.
In this paper we consider three scenarios. In the first scenario, all SUs have full information on wireless channel status and fading channel conditions. In the second scenario, all SUs have full information on wireless channel status but do not know their fading channel conditions, and in the last scenario all SUs do not have any information on wireless channel status and conditions. For each scenario we analyze the queueing performance of an arbitrary SU and show how to obtain the optimal access probabilities with the help of the effective bandwidth theory. From our analysis we provide an insight on how to design an optimal channel access policy in each scenario. We also show how the optimal channel access policies in three scenarios are related with each other. Numerical results are provided to validate our analysis. In addition, we investigate the performance behaviors of the optimal channel access policies.
In this paper we consider three scenarios. In the first scenario, all SUs have full information on wireless channel status and fading channel conditions. In the second scenario, all SUs have full information on wireless channel status but do not know their fading channel conditions, and in the last scenario all SUs do not have any information on wireless channel status and conditions. For each scenario we analyze the queueing performance of an arbitrary SU and show how to obtain the optimal access probabilities with the help of the effective bandwidth theory. From our analysis we provide an insight on how to design an optimal channel access policy in each scenario. We also show how the optimal channel access policies in three scenarios are related with each other. Numerical results are provided to validate our analysis. In addition, we investigate the performance behaviors of the optimal channel access policies.
목차
ABSTRACT
THE SYSTEM MODEL
DESCRIPTION OF SCENARIOS
NUMERICAL RESULTS
REFERENCES
참고문헌 (0)
참고문헌 신청이 논문의 저자 정보
최근 본 자료
댓글(0)
0
UCI(KEPA) : I410-ECN-0101-2013-410-000695388