• Àüü
  • ÀüÀÚ/Àü±â
  • Åë½Å
  • ÄÄÇ»ÅÍ
´Ý±â

»çÀÌÆ®¸Ê

Loading..

Please wait....

¿µ¹® ³í¹®Áö

Ȩ Ȩ > ¿¬±¸¹®Çå > ¿µ¹® ³í¹®Áö > TIIS (Çѱ¹ÀÎÅͳÝÁ¤º¸ÇÐȸ)

TIIS (Çѱ¹ÀÎÅͳÝÁ¤º¸ÇÐȸ)

Current Result Document : 8 / 15 ÀÌÀü°Ç ÀÌÀü°Ç   ´ÙÀ½°Ç ´ÙÀ½°Ç

ÇѱÛÁ¦¸ñ(Korean Title) Spectrum allocation strategy for heterogeneous wireless service based on bidding game
¿µ¹®Á¦¸ñ(English Title) Spectrum allocation strategy for heterogeneous wireless service based on bidding game
ÀúÀÚ(Author) Jing Cao   Junsheng Wu   Wenchao Yang  
¿ø¹®¼ö·Ïó(Citation) VOL 11 NO. 03 PP. 1336 ~ 1356 (2017. 03)
Çѱ۳»¿ë
(Korean Abstract)
¿µ¹®³»¿ë
(English Abstract)
The spectrum scarcity crisis has resulted in a shortage of resources for many emerging wireless services, and research on dynamic spectrum management has been used to solve this problem. Game theory can allocate resources to users in an economic way through market competition. In this paper, we propose a bidding game-based spectrum allocation mechanism in cognitive radio network. In our framework, primary networks provide heterogeneous wireless service and different numbers of channels, while secondary users have diverse bandwidth demands for transmission. Considering the features of traffic and QoS demands, we design a weighted interference graph-based grouping algorithm to divide users into several groups and construct the non-interference user-set in the first step. In the second step, we propose the dynamic bidding game-based spectrum allocation strategy; we analyze both buyer¡¯s and seller¡¯s revenue and determine the best allocation strategy. We also prove that our mechanism can achieve balanced pricing schema in competition. Theoretical and simulation results show that our strategy provides a feasible solution to improve spectrum utilization, can maximize overall utility and guarantee users¡¯ individual rationality.
Å°¿öµå(Keyword) cognitive radio network   dynamic game   heterogeneous service   Nash Equilibrium   weighted interference graph  
ÆÄÀÏ÷ºÎ PDF ´Ù¿î·Îµå