Computer Science ›› 2016, Vol. 43 ›› Issue (Z6): 272-275.doi: 10.11896/j.issn.1002-137X.2016.6A.065

Previous Articles     Next Articles

Distributed Channel Allocation Algorithm for Multi-services Systems

LI Xiang-yang, ZHAO Hang-sheng, ZHAO Xiao-long and ZHANG Yang   

  • Online:2018-11-14 Published:2018-11-14

Abstract: As one of the key issues for cognitive radio,channel allocation has been widely studied in recent years.The centralized decision algorithms are common,but it is uneasy to implement centralized algorithms for distributed cognitive radio systems.Based on the college admission matching theory proposed by D.Gale and L.Shapley and characteristics of distributed systems,the channel association of multi-services systems was formulated as a many-to-one matching game.And a distributed channel allocation algorithm based on utility matrix was proposed.Simulations show that the convergence time of the proposed algorithm is short and the utility of stable matching state approximates the optimal centralized algorithm in Rayleigh fading,far better than that of the random access algorithm.

Key words: Cognitive radio,Many-to-one matching,Channel allocation,Matching algorithm

[1] Roth A,Sotomayor M A O.Two-Sided Matching:A Study inGame-Theoretic Modeling and Analysis[M].Cambridge:Cambridge University Press,1992:125-129
[2] Manlove D F.Algorithmics of Matching Under Preferences[M].Singapore:World Scientific,2013
[3] Irving R W,Leather P,Gusfield D.An efficient algorithm for the optimal stable marriage[J].Journal of the ACM,1987,34(3):532-543
[4] Jorswieck E A.Stable matchings for resource allocation in wireless networks[C]∥Proc.of the 17th International Conference on Digital Signal Processing (DSP).Corfu,Greece,IEEE,2011:1-8
[5] Naparstek O,Leshem A,Jorswieck E A.Distributed mediumaccess control for energy efficient transmission in cognitive radios[DB/OL].(2014-06-01)[2015-11-15].http://arXiv preprint arXiv:1401.1671
[6] Pantisano F,Bennis M,Saad W,et al.Matching with externalities for context-aware user-cell association in small cell networks [C]∥Global Communications Conference (GLOBECOM).Atlanta,GA,Dec.2013:4483-4488
[7] Semiari O,Saad W,Valentin S,et al.Matching theory for priority-based cell association in the downlink of wireless small cell networks[C]∥IEEE International Conference on Acoustics,Speech and Signal Processing (ICASSP).Florence,2014:444-448
[8] El-Hajj A M,Dawy Z,Saad W.A stable matching game for joint uplink/downlink resource allocation in OFDMA wireless networks[C]∥2012 IEEE International Conference on Communications (ICC).IEEE,2012:5354-5359
[9] Semiari O,Saad W,Valentin S,et al.Matching theory for priority-based cell association in the downlink of wireless small cell networks[C]∥IEEE International Conference on Acoustics,Speech and Signal Processing (ICASSP).Florence,2014:444-448
[10] Yaffe Y,Leshem A,Zehavi E.Stable matching for channel access control in cognitive radio systems[C]∥ Cognitive Information Processing(CIP 2010).Elba,2010:470-475
[11] 李湘洋,赵杭生,曹龙.混合共享认知无线网络信道分配算法[J/OL].计算机工程与应用,(2015-11-09) [2015-12-09].http://www.cnki.net/kcms/detail/11.2127.TP.20151109.0905.008.html
[12] Zhao Q,Sadler B.A survey of dynamic spectrum access[J].IEEE Signal Processing Mag.,2007,4(3):79-89
[13] Roth A E,Sotomayor M.The college admissions problem revisited[J].Econometrica,1989,7(3):559-570
[14] Gale D,Shapley L.College admissions and the stability of marriage[J].American Mathematical Monthly,1962,69(1):9-15
[15] 柳毅,佟明安.匈牙利算法在多目标分配中的应用[J].火力与指挥控制,2002,7(4):34-37
[16] Papadimitriou C,Steiglitz K.Combinatorial Optimization:Algorithms and Complexity[M].USA:Dover,1998:133-137

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!