A study on dynamic spectrum allocation using binary integer programming이진 정수 계획법을 이용한 동적 스펙트럼 할당에 관한 연구

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 1165
  • Download : 0
DC FieldValueLanguage
dc.contributor.advisorLee, Hyuck-Jae-
dc.contributor.advisor이혁재-
dc.contributor.authorIm, Soo-Yeol-
dc.contributor.author임수열-
dc.date.accessioned2013-09-11T05:13:29Z-
dc.date.available2013-09-11T05:13:29Z-
dc.date.issued2013-
dc.identifier.urihttp://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=513084&flag=dissertation-
dc.identifier.urihttp://hdl.handle.net/10203/180131-
dc.description학위논문(박사) - 한국과학기술원 : 전기및전자공학과, 2013.2, [ vii, 66 p. ]-
dc.description.abstractThe wireless spectrum has been conventionally regulated by government agencies in the form of allocating to license holders or services on a long-term basis over vast geographical regions. Recently, a spectrum scarcity problem has been surfaced due to the explosive increase in spectrum demands with the rapid emergence of various wireless services. In this context, the paradigm shift of the spectrum management for efficient use of the spectrum resource is at issue, and the dynamic spectrum allocation (DSA) has been come into the spotlight as the upcoming spectrum management paradigm. The DSA can contribute to mitigate the spectrum scarcity problem arising from the current rigid spectrum allocation model. The fundamental of the DSA is to distribute the finite spectrum resource to be responsive to demands varying in time and space. In this dissertation, we examine the implementation of the auction based DSA that a spectrum broker (SB) coordinates the allocation of the DSA enabled band within the DSA region using the real-time spectrum auction. Specifically, we investigate the DSA problem that how to make good use of the DSA enabled band by reflecting the varying demands. To this end, the optimal DSA problem is addressed with various objective functions to maximize the measures of the DSA such the auction revenue of the SB and spectrum utilization inside the DSA region. The optimization problem is formulated using the binary integer programming (BIP) to obtain the optimal DSA solution. To the best of our knowledge, this work is the first to apply the BIP to the DSA. The BIP determines a set of binary decisions (yes-or-no) to optimize the given objective within the given constraints. Thus, the BIP is suitable for the optimal DSA problem that the SB decides whether allocate or not allocate the channels of the DS enabled band to users. The SB based DSA scenarios considered in this dissertation are two folds: DSA between a SB and independent base stations (BSs), and D...eng
dc.languageeng-
dc.publisher한국과학기술원-
dc.subjectDynamic spectrum allocation-
dc.subjectSpectrum broker-
dc.subjectBinary integer programming-
dc.subjectInterference graph-
dc.subject동적 스펙트럼 할당-
dc.subject스펙트럼 브로커-
dc.subject이진 정수 계획법-
dc.subject간섭 그래프-
dc.subject간섭 양자화-
dc.subjectInterference Quantization-
dc.titleA study on dynamic spectrum allocation using binary integer programming-
dc.title.alternative이진 정수 계획법을 이용한 동적 스펙트럼 할당에 관한 연구-
dc.typeThesis(Ph.D)-
dc.identifier.CNRN513084/325007 -
dc.description.department한국과학기술원 : 전기및전자공학과, -
dc.identifier.uid020095246-
dc.contributor.localauthorLee, Hyuck-Jae-
dc.contributor.localauthor이혁재-
Appears in Collection
EE-Theses_Ph.D.(박사논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0