35 4 Vol.35 No. 4 2014 4 Journal on Communcatons Arl 2014 o:10.3969/j.ssn.1000-436x.2014.04.014 ( 130012) SINR QoS SOCP QoS N929 A 1000-436X(2014)04-0124-06 Robust resource allocaton algorm for cogntve rao system XU Yong-jun, ZHAO Xao-hu (College of Communcaton Engneerng, Jln Unversty, Changchun 130012, Chna) Abstract: For e unerlay cogntve rao networs w multuser uner arameter uncertantes, a robust strbute robust ower control algorm was roose. hs algorm was formulate to mnmze total transmt ower of SUs uner e nterference temerature an SINR constrant. Base on euclean ball-shae uncertanty, e robust strbute soluton of e otmzaton roblem was obtane by usng Lagrange ual ecomoston eory. he smulaton results llustrate at, comare w e non-robust algorm an tratonal SOCP algorm, e roose algorm acheves a better erformance an guarantees e QoS requrement for bo SUs an PUs uner e arameter uncertanty. Key wors: cogntve rao; robust ower control; ual ecomoston eory; channel uncertanty; QoS nees 1 cogntve rao [1] [2,3] [4,5] [6] QoS Pareto [7] 2 2013-04-242013-10-10 (61171079) Founaton Item: he Natonal Natural Scence Founaton of Chna (61171079)
4 125 [8~10] [8]SOCP OFD[9] SINR [10] /SDA SINR [11] [12] QoS [13] [12] SINR SINR SINR SINR worst-case QoS 2 N A {1,, } B {1,, N}, j A, B, j 2 unerlay QoS h I (1) h I SINR j g g n j j (2) g g j j j j n SINR (3) (1)(3) mn S s.t. h I S 0, (4a) (4b) (4)
126 35 (4b)(4) [2] [2,3] 3 (4) h h h h (5) h h h [ h1, h2,, h ] h ( 0) h h a a a Gj gj / g G 0 g G, G,, G g g g (6) g 1 2 g g g b b (4) mn S s.t. h I (7a) n / g g ( / ) (7b) h, g (7c) h g (7) 1, 2,, h h g j g (7) (4) j (7) h h a hrh a ( h ) (8) SINR n / ( / ) g g (9) j 1, j j 0, j (8)(9) mn S s.t. ( h ) I (10a) I 1 j j j (10b) (10) I n / g ( G ) [3] (10) L({ },, ) h I I 1 (11),,, 0 1 N,, 0 1 (11) (, ) mn L ({ },, ) (12) S (12) I (, ) (, ) / (13) (, ) I (, ) mn h S (14) (, ) (14) KK [14]
4 127 1 I h (15) ( t 1) ( t) ( t) I h (16) 1 I ( t 1) ( t) ( t) 0, (17) t () t () t [14] 1) t 0 (0) 0, (0) 0 (0) 0, (0) 0 0 (0) 2) I (17) ( t 1) I ( t 1) 3) I ( t 1) h (16) ( t 1) ot ( t 1) mn t 1, ot ( t 1) (15) 4) 2) (16) (1) I h (18) h I (19) (18) h I (19) 1 1, QoS n h 1/ n n n j j j1 j1 /( ) 1 /( ) QoS 0 (amsson control algorm) I _ m1 r 1 h I _ m2 f 1 h (20) (21) r f ( t 1) ( t) ( h ) I r r ( t 1) ( t) ( h ) I f f [15][16] 4 QoS SOCP 2 1 2, N 1
128 35 1 mw g [0,1] gj [0,0.1] n [0,0.1] mw SINR γ 4 B 1 b [ 0.05,0.05] g 2 SINR (3) 2 1 SINR 2 SINR 2 SINR (9) SINR SINR 0 3 SOCP 3 [13] SOCP 2 1 1 5 B 2 6 B
4 129 0.03 mw 3(a) SOCP 3(b) SOCP QoS 4 2 4 10 4 ( 6, N 3 ) 3 ( 2, N 1) QoS [1] HAYKIN S. Cogntve rao: bran-emowere wreless communcaton[j]. IEEE Journal on Selecte Areas n Communcatons, 2005, 23(2):201-220. [2] GASIS N, ARQUES A G, GIANNAKIS G B. Power control for cooeratve ynamc sectrum access networs w verse QoS constrants[j]. IEEE ransactons on Communcatons, 2010, 58(3): 933-944. [3] NGO D, NGOC L. Dstrbute resource allocaton for cogntve rao networs w sectrum-sharng constrants[j]. IEEE ransactons on Vehcular echnology, 2011, 60(7):3436-3449. [4] ZHANG L, LIANG Y C, XIN Y, et al. Robust cogntve beamformng w artal channel state nformaton[j]. IEEE ransactons on Wreless Communcatons, 2009, 8(8):4143-4153. [5] ZHANG G, WONG K K, OERSEN B. Robust cogntve beamformng w boune channel uncertantes[j]. IEEE ransactons on Sgnal Processng, 2009, 57(12):4871-4881. [6] JULIAN D, CHIANG, NELL D O. Robust an QoS constrane otmzaton of ower control n wreless cellular networs[a]. VC 2001[C]. Altantc, NJ, 2001.1932-1936. [7] ANANDKUAR A J G, ANANDKUAR A, LABOHARAN S, et al. Robust rate mzaton game uner boune channel uncertanty[j]. IEEE ransactons on Vehcular echnology, 2011, 60(9): 4471-4486. [8] SUN S Q, NI W, ZHU Y. Robust ower control n cogntve rao networs: a strbute way[a]. ICC 2011[C]. Kyoto, Jaan, 2011.1-6. [9] SEOODEH P, HAYKIN S. Robust transmt ower control for cogntve rao[j]. Proceeng of IEEE, 2009, 97(5):915-939. 4 5 [10] ANESE E D, KI S J, GIANNAKIS G B, et al. Power control for cogntve rao networs uner channel uncertanty[j]. IEEE ransactons on Wreless Communcatons, 2011, 10(10):3541-3551. [11] PHUNCHONGHARN P, HOSSAIN E. Dstrbute robust scheulng an ower control for cogntve satal reuse DA networs[j]. 140
140 35 [19] CHEN X, ZHANG Y. Otmum esgn of PID controller arameters by mrove artcle swarm otmzaton algorm[j]. Comuter Scence an Informaton Engneerng, Lecture Notes n Electrcal Engneerng, 2012, 2(2):79-84. [20] BERGH F V, ENGELBRECH A P. A stuy of artcle swarm otmzaton artcle trajectores[j]. Inf Sc, 2006, 176(8): 937-971. [21],,. [J]., 2006, 34(5):897-901. ZHOU S, PAN W, LUO B, et al. A novel quantum genetc algorm base on artcle swarm otmzaton meo an ts alcaton[j]. Acta Electronca Snca, 2006, 34(5):897-901. [22] WOLPER D H, ACREADY W G. No free lunch eorems for otmzaton[j]. IEEE rans Evol Comut, 1997, 1(1):67-82. 1962-1975- 1984-1974- 123 IEEE Journal on Selecte n Communcatons, 2012, 30(10): 1934-1946. [12] PARSAEEFARD S, SHARAFA A R. Robust worst-case nterference control n unerlay cogntve rao networs[j]. IEEE ransactons on Vehcular echnology, 2012, 61(8):3731-3745. [13] PARSAEEFARD S, SHARAFA A R. Robust strbute ower control n cogntve rao networs[j]. IEEE ransactons on oble Comutng, 2013, 12(4): 609-620. [14] BERSEKAS D P. Nonlnear Programmng 2n e[]. Boston, A: Aena Scentfc, 1999. [15] PERKINS C E, ROYER E. A-hoc on eman stance vector routng[a]. IEEE WCSA 1999[C]. New Orleans, 1999. 90-100. [16] SAVIC V, ZAZO S. Reucng communcaton overhea for cooeratve locaton usng nonarametrc belef roagaton[j]. IEEE Wreless Communcatons Letter, 2012, 1(4):308-311. 1986-1957-