Subcarrier allocation for OFDMA wireless channels using lagrangian relaxation methods
|
|
- Everett Hodge
- 6 years ago
- Views:
Transcription
1 Unversty of Wollongong Research Onlne Faculty of Informatcs - Papers (Archve) Faculty of Engneerng and Informaton Scences 2006 Subcarrer allocaton for OFDMA wreless channels usng lagrangan relaxaton methods Gengfa Fang Chnese Academy of Scences Y Sun Chnese Academy of Scences Jhua Zhou Chnese Academy of Scences Jngln Sh Chnese Academy of Scences Zhongcheng L Chnese Academy of Scences See next page for addtonal authors Publcaton Detals Fang, G., Sun, Y., Zhou, J., Sh, J., L, Z. & Dutkewcz, E. (2006). Subcarrer allocaton for OFDMA wreless channels usng lagrangan relaxaton methods. IEEE Global Telecommuncatons Conference (pp. 1-5). Pscataway, USA: IEEE. Research Onlne s the open access nsttutonal repostory for the Unversty of Wollongong. For further nformaton contact the UOW Lbrary: research-pubs@uow.edu.au
2 Subcarrer allocaton for OFDMA wreless channels usng lagrangan relaxaton methods Abstract In ths paper, we propose a practcally effcent Subcarrer Allocaton scheme based on Lagrangan relaxaton to solve the problem of subcarrer allocaton n OFDMA wreless channels. The problem of subcarrer allocaton s formulated nto an Integer Programmng (IP) problem, whch s relaxed by replacng complcatng constrants wth Lagrange multplers usng Lagrangan Relaxaton. A subgradent method s used to optmze the Lagrangan dual functon and a heurstc s desgned to obtan the feasble soluton. Lagrangan Relaxaton Subcarrer Allocaton (LRSA) s proven to be of polynomal complexty and t provdes bounds on the value of channel effcency. Numercal results show that compared wth other algorthms proposed n the lterature, LRSA can result n a sgnfcant mprovement n channel effcency, whle at the same tme guaranteeng mnmum data rates of users. Dscplnes Physcal Scences and Mathematcs Publcaton Detals Fang, G., Sun, Y., Zhou, J., Sh, J., L, Z. & Dutkewcz, E. (2006). Subcarrer allocaton for OFDMA wreless channels usng lagrangan relaxaton methods. IEEE Global Telecommuncatons Conference (pp. 1-5). Pscataway, USA: IEEE. Authors Gengfa Fang, Y Sun, Jhua Zhou, Jngln Sh, Zhongcheng L, and E. Dutkewcz Ths conference paper s avalable at Research Onlne:
3 Subcarrer Allocaton for OFDMA Wreless Channels Usng Lagrangan Relaxaton Methods Gengfa Fang, Y Sun, Jhua Zhou, Jngln Sh, Zhongcheng L Insttute of Computng Technology Chnese Academy of Scences, Bejng, Chna {gengfa.fang, suny, jhzhou, sjl, zcl}@ct.ac.cn Eryk Dutkewcz Wreless Technologes Laboratory Unversty of Wollongong, Wollongong, Australa eryk@uow.edu.au Abstract In ths paper, we propose a practcally effcent Subcarrer Allocaton scheme based on Lagrangan relaxaton to solve the problem of subcarrer allocaton n OFDMA wreless channels. The problem of subcarrer allocaton s formulated nto an Integer Programmng (IP) problem, whch s relaxed by replacng complcatng constrants wth Lagrange multplers usng Lagrangan Relaxaton. A subgradent method s used to optmze the Lagrangan dual functon and a heurstc s desgned to obtan the feasble soluton. Lagrangan Relaxaton Subcarrer Allocaton (LRSA) s proven to be of polynomal complexty and t provdes bounds on the value of channel effcency. Numercal results show that compared wth other algorthms proposed n the lterature, LRSA can result n a sgnfcant mprovement n channel effcency, whle at the same tme guaranteeng mnmum data rates of users. I. INTRODUCTION Unlke wrelne channels, channels n broadband wreless access (BWA) networks are prone to frequency selectve fadng. Orthogonal Frequency Dvson Multple Access (OFDMA) s a modulaton and multple access method used n IEEE [1] and IEEE a and s consdered for usenemergng4 th generaton wreless networks because of ts hgh mmunty to nter-symbol nterference and frequency selectve fadng. Unlke OFDM systems, where only a sngle user s allowed to use all of the subcarrers at any gven tme, OFDMA allows multple users to share the subcarrers, whch brngs new challenges to the resource allocaton problem n OFDMA wreless channels. OFDMA s based on the Orthogonal Frequency Dvson Multplexng (OFDM) technque where the total avalable bandwdth s dvded nto several narrow subcarrers. OFDMA may result n hgher channel effcency by explotng the frequency dversty among subcarrers under the control of a properly desgned subcarrer allocaton algorthm. The man goal of subcarrer allocaton n OFDMA wreless channels s, on one hand, to mprove the average channel effcency by explotng both the tme dversty n the tme doman and frequency dversty n the frequency doman of the wreless channel. On the other hand, the subcarrer allocaton algorthm should guarantee the prescrbed QoS requrements of users, such as the mnmum data rate consdered n ths paper. The problem of subcarer allocaton n OFDMA systems has been recently studed qute extensvely. In [2], subcarrers are allocated to users based on the current channel condton and current buffer state as well as the measured rato of the arrval rate to throughput for each user. In [3], a delay utlty functon based subcarrer allocaton scheme s presented for real tme servces, where the man goal of the proposed scheme s to maxmze the aggregate utlty. However the above schemes do not take any QoS requrements nto account, thus they provde no guarantee of the mnmum servce qualty for users. In reference [4], Wong et. al. present a new method to solve the subcarrer allocaton problem n OFDMA system by proportonally dstrbutng the subcarrers among users based on ther QoS requrements. Wong s algorthm s conservatve n the sense of channel effcency mprovement although t can guarantee a proportonal farness among users. Other works on ths topc.e. [5] [7], try to combne the subcarrer allocaton wth the power allocaton problem, and offer no better soluton to the subcarrer allocaton problem. In ths paper, we focus on subcarrer allocaton n wreless OFDMA channel where users have QoS requrements n terms of the mnmum data rates. The subcarrer allocaton process s formulated nto an Integer Programmng (IP) problem wth constrants. We solve the problem based on the Lagrangan relaxaton theory and propose an effcent new scheme called Lagrangan Relaxaton Subcarrer Allocaton: LRSA. The propertes and performance of LRSA are verfed through smulatons. The rest of the paper s organzed as follows. In Secton II, the system model of subcarrer allocaton n OFDMA wreless channels s ntroduced and the subcarrer allocaton problem s formulated. In Secton III, we analyze the subcarrer allocaton problem and propose our soluton usng Lagrangan relaxaton methods. Smulaton results are gven n Secton IV, whch s followed by our conclusons n Secton V. II. SYSTEM MODEL In ths paper, we consder the downlnk OFDMA cell system, where there s only one base staton (BS) and multple users. The wreless channel between the BS and users conssts of K subcarrers, whch are shared by M users under the control of the subcarrer allocaton algorthm n BS. The users measure the current Channel State Informaton (CSI) based on the receved sgnals and then send SCI back to BS n a predefned feedback channel. Durng each subcarrer allocaton cycle, the scheduler n BS allocates the subcarrers to users Ths full text paper was peer revewed at the drecton of IEEE Communcatons Socety subject matter experts for publcaton n the IEEE GLOBECOM 2006 proceedngs.
4 based on the SCI and QoS requrements of users. Based on the result of subcarrer allocaton, bts of users data are then modulated nto the subcarrers allocated to them. All the subcarrers belongng to dfferent users are then combned nto a sngle symbol and broadcasted to users. Next, we lst some notatons used n ths paper and then formulate the subcarrer allocaton problem. Index of users n the cell. (1,2,...,M). j Index of subcarrers for the downlnk channel. j (1,2,...,K). c,j The achevable data rate of user at subcarrer j n the current tme slot for a gven BER and transmsson power. x,j Indcaton of subcarrer j allocaton to user. x,j equals to 1 f subcarrer j s allocated to user, R mn r r + ˆr mn otherwse, x,j s equal to 0. Mnmum data rate n bts per second that user should receve n order to guarantee ts servce qualty. Ths s the only QoS parameter consdered n ths paper. The data rate that user has receved before the current subcarrer allocaton cycle. The data rate of user after the current subcarrer allocaton cycle. The mnmum data rate that user should get n the current subcarrer allocaton cycle n order to meet ts QoS requrement. The total bandwdth of the wreless channel s B Hz and f we use f Hz to stand for the bandwdth of each subcarrer, we have f = B/K. The achevable data rate of user at subcarrer j,.e., c,j, can be calculated as follows: c,j = f log 2 (1 + βρ,j ) (1) where ρ,j s the sgnal to nose rate (SNR) ofuser on subcarrer j n current tme slot and β = 1.5ln(5 BER) [2][3]. In ths paper, we assume that power s equally dstrbuted over all the subcarrers so that the maxmum feasble data transmsson rate s only decded by the current channel qualty n SNR and BER. We also assume that the scheduler n the base staton knows exactly the channel state nformaton of the subcarrers at the begnnng of each subcarrer allocaton cycle,.e., c,j, s avalable at the begnnng of each schedulng cycle. Based on the defntons above, we defne the subcarrer allocaton problem n each allocaton cycle as follows: There are K subcarrers to be allocated to M users. Each sucarrer j must be allocated to one and only one user. Each user can occupy multple or no subcarrers durng each allocaton cycle. A data rate of c,j n bts per second wll be acheved when subcarrer j s allocated to user. Durng each allocaton cycle, a data rate of ˆr mn n bts per second must be assgned to user as a result of subcarrer allocaton. We have ˆr mn 0. The man goal of subcarrer allocaton n each cycle s to maxmze the overall data rate (or channel effcency) as a result of subcarrers allocatons subject the constrants above. The subcarrer allocaton problem can be then formulated as follows: (IP) s.t. f(x) =max =1 j=1 K c,j x,j (2a) x,j =1; j =1, 2,..., K (2b) =1 K j=1 c,j x,j ˆr mn ; =1, 2,..., M (2c) x,j (0, 1); =1, 2,..., M; j =1, 2,..., K. (2d) Objectve functon f(x) s the total data rate as a result of the current subcarrer allocaton cycle. Constrants (2b) ensure that each subcarrer can only be allocated to one user. Constrants (2c) are the mnmum data rate constrants of users n the current schedulng cycle. III. LRSA SUBCARRIER ALLOCATION In ths secton, we descrbe n detal how to solve the above subcarrer allocaton problem usng Lagrangan relaxaton. A servce trackng and mnmum data rate requrement estmaton method s also proposed. Followng that we present our LRSA algorthm. A. Lagrangan Relaxaton based Subcarrer Allocaton The goal of subcarrer allocaton s to maxmze the total channel effcency whle at the same tme guaranteeng mnmum data rates of users as defned n the IP problem n the prevous secton. Clearly the IP problem s a 0-1 nteger optmzaton problem. Unfortunately, as proven n many references [8], the IP problem s NP-hard. However, by nspecton, we fnd that f we remove the constrants of (2c) n the IP problem, then we get a smplfed IP problem defned as follows: K (IP ) f(x) =max c,j x,j (3a) =1 j=1 s.t. constrants (2b) and (2d). (3b) The soluton of the IP problem above becomes feasble n polynomal tme, where the optmal soluton s to choose a user wth maxmum c,j for each of the subcarrers n current subcarrer j,.e., = arg max c,j ; j =(1, 2,..., K). Constrants of (2c) are called complcatng constrants, whch make the IP problem polynomal tme unfeasble. Based on the above, t s clear that f we can fnd a method whch can remove constrants of (2c) n a specfc way and at the same tme keep the lnear property of the IP problem then the IP problem becomes polynomal tme feasble. Ths can be acheved usng Lagrange relaxaton. Next, we brefly explan the man dea n Lagrangan relaxaton methodology and construct the Lagrangan dual problem. Ths full text paper was peer revewed at the drecton of IEEE Communcatons Socety subject matter experts for publcaton n the IEEE GLOBECOM 2006 proceedngs.
5 Lagrangan relaxaton s a mathematcal programmng technque for solvng constraned optmzaton problems. The man dea of Lagrange relaxaton s to create a relaxed problem by replacng complcatng constrants wth Lagrange multplers. The relaxed problem then can be decomposed nto subproblems, whch are much easer to solve compared to the orgnal problem and solutons can be effcently obtaned by dynamc programmng. The multplers are then adjusted teratvely based on the degree of constrant volaton whle at the same tme the subproblems are resolved based on the new multplers. In mathematcal terms, a dual functon s maxmzed or mnmzed when the multplers are updated. The value of the dual functon s the lower or upper bound of the orgnal problem. However there are several dffcultes when applyng ths method for solvng dscrete varable problems such as the subcarrer allocaton n the OFDMA channel as defned above. Frstly, the dual functon s not dfferentable everywhere, so specalzed methods for optmzng ths nondfferentable dual functon must be employed, such as the subgradent method used n ths paper. Secondly, even f the optmum of the dual functon s obtaned, the correspondng result at that pont may not be feasble, so adjustments may be needed to make sure that all the constrants are met. Accordng to the defnton of Lagrange relaxaton, we relax the complcatng constrant (2c) n IP usng Lagrange multpler λ ( = 1, 2,..., M) and then get the followng Lagrange Relaxaton problem LR: f LR (λ) =max K c,j (1 + λ )x,j λ ˆr mn =1 j=1 =1 (4a) s.t. constrants (2b) and (2d). (4b) Accordng to constrants (2c), we have: K c,j x,j ˆr mn 0; =(1, 2,..., M). j=1 So we have: λ 0, f LR (λ) f IP (x). (5) Expresson (5) ndcates that LR s an upper bound on the optmal value of the orgnal IP problem and λ >0 can be used to produce the upper bound. In order to get the optmal lowest upper bound, our goal s to make the upper bound as close to the optmal value of the orgnal IP problem as possble. We defne problem LD as the optmal upper bound of IP and we have: (LD) = mn f LD = mn λ 0 f LR(λ) max λ 0 x M (( K c,j (1 + λ )x,j =1 j=1 =1 λ ˆr mn ). Problem LD s also called the Lagrange dual problem of IP, whch s concave and pecewse lnear. Several steps wll be presented n order to get the near optmal soluton. In the next (6) subsectons, we provde the solutons to the subproblems, to the Lagrange dual problem LD and to obtanng a feasble soluton. 1) Solvng Subproblems : Gven Lagrange multpler λ, the Lagrangan dual problem LD leads to the decomposed subproblem for each subcarrer j as follows: (SP) max ( c,j (1 + λ )x,j ) (7) =1 s.t. constrants (2b) and (2d). where the Lagrange multplers can be nterpreted as the gan that user uses subcarrer j. Each subcarrer j tends to be used by user, who has the best channel qualty,.e., large c,j, whle user wll also wn a gan n terms of λ for usng subcarrer j. Through nspecton, we can solve the subproblem as follows: j = arg and let max c,j (1 + λ ); x,j = { 1; f = j 0; otherwse j =(1, 2,..., K). The complexty of solvng all the K subproblems above s o(k) n contrast to the NP-hard complexty of the orgnal problem, whch ndcates that the above algorthm s very effcent. 2) Subgradent Based Soluton of Dual Problem: Snce the subproblems nvolves dscrete varables, the objectve functon f LD defned n Lagrange dual problem LD s concave, pecewse lnear and may not be dfferentable at certan pont n the λ space. The subgradent method s commonly used to solve ths knd of optmzaton problem. A subgradent method fnds the optmal soluton of f LD (λ) by teratve method n whch startng wth some λ 0, a sequence of λ n, whch eventually converges to the optmal soluton, s constructed accordng to: λ n+1 = λ n + Q n S n. (8) where n s the teraton ndex, Q n 0 s a sutable step length and S n s the subgradent vector of f LR (λ) at λ n.wehave: S n = cx n ˆr mn. (9) where x n s a soluton of problem SP defned above gven λ n, ˆr mn =(ˆr 1 mn, ˆr 2 mn,..., ˆr M mn ) and c s the achevable data rate matrx. We have: Q n =, and Q n 0, n. n=1 In order to get the optmal soluton, we may need an nfnte number of teratons, so to obtan a reasonable suboptmal soluton as quckly as possble, we defne Q n as follows: Q n = Q 0 ρ n, 0 <ρ<1. (10) where Q 0 s a ntal value and ρ s a system parameter. Q n decreases n exponental speed when n ncreases, so that the number of teratons s reduced. The updatng process stops Ths full text paper was peer revewed at the drecton of IEEE Communcatons Socety subject matter experts for publcaton n the IEEE GLOBECOM 2006 proceedngs.
6 when the change of λ s small enough,.e., λ<εwhere ε s a predefned system parameter. 3) Obtanng Feasble Soluton: Snce the mnmum data rate constrants have been relaxed, the soluton of the dual problem above may be nfeasble,.e., constrans (2c) may not be met. We present a heurstc to convert the nfeasble subcarrer allocaton result to a feasble one. The man dea of our heurstc s to do the adjustment for each subcarrer, such that t leads to the least decrease n channel effcency. We call the heurstc Least Lose Frst (LLF), whch works as follows: Step 1: Let SC= the set of all subcarrers. Step 2: Pck a subcarrer j randomly from SC, Let be the MS that subcarrer j s allocate to,.e., x,j =1and U be the remanng. Step 3: If there s MS, where U and r + < ˆr mn,we select a MS accordng to: = arg mn(λ ). U Step 4: Assgn subcarrer j to MS and do: x,j =0, and x,j =1; r + = r, and r+ =(1 µ)r + µc,j. where µ s a parameter defned n next subsecton. Step 5: Set SC=SC\j. IfSC = φ, stop, else go to Step 2. The selecton of MS n step 2 comes from the dea that users wth small λ may have relatvely better channel qualty, so that the exchange may result n the least decrease n channel effcency. B. Servce Trackng and Overall Algorthm The above algorthm reles on the avalablty of ˆr mn for users at the begnnng of each subcarrer allocaton cycle. ˆr mn s calculated based on the hstory nformaton of subcarrer allocaton and the QoS requrements of users n terms of R mn. Next we provde a method to calculate ˆr mn based on the commonly used sldng wndow mechansm. We use T to stand for the sze of the sldng wndow n terms of tme slots and we have: r + = T 1 T r + 1 T ˆr. (11) where ˆr s the data rate receved n current subcarrer allocaton cycle. In order to guarantee the mnmum data rate requrements of users, we have: r + R mn. Let µ = 1 T, then we have: (1 µ)r + µˆr R mn ˆr mn tme ˆr mn ˆr mn = ˆr Rmn (1 µ)r µ. (12) equals to the mnmum value of ˆr, whle at the same must be larger than zero, so we have: 0 ; f R mn (1 µ)r < 0 R mn (1 µ)r µ ; otherwse (13) Based on the Lagrangan relaxaton subcarrer allocaton framework above, we present the overall algorthm,.e., LRSA as follows: Step 1: Choose a startng pont λ 0, Q 0, and let n=0; Step 2: Calculate ˆr mn accordng to (13) for all users, and solve the subproblem SP(λ n )by: f LR (λ n )=max { c,j (1 + λ n )x,j λ n ˆr mn }. =1 =1 Let x n be the soluton of ths subproblem. Step 3: Calculate subgradent vector S n at λ n by S n = cx n ˆr mn. Step 4: If S n 0, λ n s the optmal soluton then stop, otherwse go to Step 5. Step 5: If stop condton λ<εs met, then stop, otherwse go to Step 6. Step 6: Let λ n+1 = max {λ n + Q n S n, 0}, Q n = Q 0 ρ n, n=n+1, gotostep2. Step 7: Obtan the feasble soluton followng the LLF algorthm presented earler above. IV. SIMULATION RESULTS In ths secton, we study performance of LRSA by smulatons. Our smulaton s based on the mplementaton of IEEE We consder a sngle cell wth one Base Staton and a varyng number of Moble Statons. We assume that there are 32 subcarrers (subchannels) n the wreless channel between the Base Staton and the Moble Statons. The frequency selectve fadng wreless channels are emulated by a nne-state Markov chan [9]. Dfferent states represent dfferent channel qualtes and data rates by whch users can transmt ther data. In ths paper, we are concerned wth data servces, that have prescrbed mnmum data rates requrements as defned n the IEEE standard. A. Channel Effcency Fgure 1 shows channel effcency as functon of the number of users. We compare the channel effcency of LRSA wth that of Best Channel Frst (BCF), Wong s algorthm [4] and SAMDRA [10]. BCF chooses the best channel qualty user on each subcarrer, so t s the optmal soluton n the sense of channel effcency. As shown n Fgure 1, channel effcency ncreases when the number of users ncreases. Ths s because frequency dversty ncreases when more users enter nto the network, so that each subcarrer can be allocated to relatvely better channel qualty users. Compared to the other algorthms, Wong s algorthm has the lowest channel effcency. Ths s because Wong s algorthm restrcts the maxmum number of sucarrers that can be allocated to a user durng each allocaton cycle n order to guarantee the weghted proportonal farness among the users. We also can see that channel effcency of SAMDRA and LRSA s very hgh and s almost equal to that of the BCF Ths full text paper was peer revewed at the drecton of IEEE Communcatons Socety subject matter experts for publcaton n the IEEE GLOBECOM 2006 proceedngs.
7 Channel Effcency BCF SAMDRA Wong's LRSA-0.1 LRSA User Number Fg. 1: Channel Effcency Improvement vs System Payload optmal soluton when the number of admtted users s less than 25. On the other hand, channel effcency mprovement decreases when the number of user s more than 25, for at ths moment, the system becomes overloaded and the subcarrer allocaton algorthm must guarantee bad channel qualty users the mnmum data rates at the expense of channel effcency. LRSA has a hgher channel effcency compared to SAMDRA especally when the number of users s larger than 30. Fgure 1 also shows the effect of system parameter ε n LRSA, whch reflects the trade-off between channel effcency mprovement and computng complexty. B. Mnmum Data Rate Guarantee Fgure 2 shows the average data rates receved by users where users have dfferent channel qualtes. There are 30 users n total n the system. Channel qualty decreases as the user ndex ncreases from user 1 to user 6. The 24 other users have mddle level channel qualty as that of user 3. We can see that LRSA can allocate more subcarrers to better channel qualty users than the other algorthms, whle guaranteeng ther mnmum data rates. Ths s the reason why LRSA has hgh channel effcency as shown n Fgure 1. In Fgure 3, we assgn user 1, user 2 and user 3 wth dfferent channel qualtes,.e., user 1 wth hgh channel qualty, user 2 wth mddle and user 3 wth low. The three users have ther mnmum data rate requrement set to 30kbps (480 packet per second) 20kbps (320 packet per second) and 10kbps (160 packet per second), respectvely. As ndcated n Fgure 2, when the number of users ncreases, the date rates of user 1 user 2 and 3 decrease to the mnmum data rate prescrbed. When the system payolad s ncreasng, data rates of bad channel qualty users decrease to ther mnmum data rates earler. Ths s because LRSA s more lkely to allocate the subcarrers to users wth better channel qualtes n order to mprove the overall channel effcency. V. CONCLUSION In ths paper, we have consdered the subcarrer allocaton problem n OFDMA wreless channels. A practcally effcent Lagrangan Relaxaton based Subcarrer Allocaton (LRSA) scheme s proposed. LRSA s proven to be of polynomal complexty and provdes bounds on the value of the objectve functon,.e., channel effcency. Numercal results show that, n comparson wth other algorthms, LRSA can result n sgnfcant mprovement n channel effcency whle at the same tme guaranteeng the mnmum data rate of users. Data Rate(pps) LRSA SAMDRA Wong's MDR user ndex Fg. 2: Data Rate n Packets per Second vs Channel Qualty Data Rate (Packet per Second) User Number user 1-30kbps user 2-20kbps user 3-10kbps Fg. 3: Data Rate vs System Payload and channel qualty REFERENCES [1] IEEE Standard for Local and Metropoltan Area Networks Part 16: Ar Interface for Fxed Broadband Wreless Access Systems, IEEE Standard Workng Group. [2] Parmal Parag, Srkrshna Bhashyam and R. Aravnd A Subcarrer Allocaton Algorthm for OFDMA usng Buffer and channel State Informaton, In Proceedngs of IEEE Vehcular Technology Conference, VTC2005-fall, Dallas, [3] Song, G.; L, Y.; Cmn, L.J., Jr.; Zheng, H. Jont channel-aware and queue-aware data schedulng n mult-ple shared wreless channels, In Proc. WCNC 2004, March 2004, pp [4] Wong, I.C.; Zukang Shen; Evans, B.L.; Andrews, J.G. A low complexty algorthm for proportonal resource allocaton n OFDMA systems, In Proc. SIPS 2004, pp 1-6. [5] M. Ergen, S. Coler, and P. Varaya, QoS Aware Adaptve Resource Allocaton Technques for Far Sched-ulng n OFDMA Based Broadband Wreless Access Sys-tems, IEEE Transactons on Broadcastng, Vol. 49, No. 4, pp , December [6] Guocong Song; L, Y. Adaptve subcarrer and power allocaton n OFDM based on maxmzng utlty, In Proc. VTC 2003-Sprng, Aprl 2003, pp vol.2 [7] C. Y. Wong, R. S. Cheng, K. B. Letaef, and R. D. Murch, Multuser OFDM wth adaptve subcarrer, bt, and power allocaton, IEEE J. Select. Areas Commun., vol. 17, pp , October [8] Fsher, M. L., R. Jakumar, L. N. V. Wassenhove. A multpler adjustment method for the generalzed assgnment problem, Management Sc [9] H. S. Wang and N. Moayer. Fnte-state markov channel-a useful model for rado communcaton chan-nels, IEEE Transactons on Vehcular Technology, 4(1): , Feb [10] G. Fang, F. Yang, J. Sh E. Dutkewcz, Subcarrer Allocaton wth Mnmum Data Rate Constrant n OFDMA Wreless Channels, In Proc. AusWreless 2006, March [11] I. Koutsopoulos and L. Tassulas, Channel State-Adaptve Technques for Throughput Enhancement n Wreless Broadband Networks, Proceedngs of IEEE INFOCOM, pp , [12] S. Lu, V. Bharghavan, and R. Srkant, Far schedulng n wreless packet networks, IEEE/ACM Trans. Networkng, vol. 7, no. 4, pp , Aug [13] W. Rhee and J. Coff, Increase n capacty of multuser OFDM system usng dynamc subchannel allocaton, n Proc. Vehcular Technology Conference (VTC), 2000, pp Ths full text paper was peer revewed at the drecton of IEEE Communcatons Socety subject matter experts for publcaton n the IEEE GLOBECOM 2006 proceedngs.
Resource Control for Elastic Traffic in CDMA Networks
Resource Control for Elastc Traffc n CDMA Networks Vaslos A. Srs Insttute of Computer Scence, FORTH Crete, Greece vsrs@cs.forth.gr ACM MobCom 2002 Sep. 23-28, 2002, Atlanta, U.S.A. Funded n part by BTexact
More informationResource Allocation Optimization for Device-to- Device Communication Underlaying Cellular Networks
Resource Allocaton Optmzaton for Devce-to- Devce Communcaton Underlayng Cellular Networks Bn Wang, L Chen, Xaohang Chen, Xn Zhang, and Dacheng Yang Wreless Theores and Technologes (WT&T) Bejng Unversty
More informationPower Minimization Under Constant Throughput Constraint in Wireless Networks with Beamforming
Power Mnmzaton Under Constant Throughput Constrant n Wreless etworks wth Beamformng Zhu Han and K.J. Ray Lu, Electrcal and Computer Engneer Department, Unversty of Maryland, College Park. Abstract In mult-access
More informationDefine Y = # of mobiles from M total mobiles that have an adequate link. Measure of average portion of mobiles allocated a link of adequate quality.
Wreless Communcatons Technologes 6::559 (Advanced Topcs n Communcatons) Lecture 5 (Aprl th ) and Lecture 6 (May st ) Instructor: Professor Narayan Mandayam Summarzed by: Steve Leung (leungs@ece.rutgers.edu)
More informationPerformance Analysis of Multi User MIMO System with Block-Diagonalization Precoding Scheme
Performance Analyss of Mult User MIMO System wth Block-Dagonalzaton Precodng Scheme Yoon Hyun m and Jn Young m, wanwoon Unversty, Department of Electroncs Convergence Engneerng, Wolgye-Dong, Nowon-Gu,
More informationRESOURCE CONTROL FOR HYBRID CODE AND TIME DIVISION SCHEDULING
RESOURCE CONTROL FOR HYBRID CODE AND TIME DIVISION SCHEDULING Vaslos A. Srs Insttute of Computer Scence (ICS), FORTH and Department of Computer Scence, Unversty of Crete P.O. Box 385, GR 7 Heraklon, Crete,
More informationComparative Analysis of Reuse 1 and 3 in Cellular Network Based On SIR Distribution and Rate
Comparatve Analyss of Reuse and 3 n ular Network Based On IR Dstrbuton and Rate Chandra Thapa M.Tech. II, DEC V College of Engneerng & Technology R.V.. Nagar, Chttoor-5727, A.P. Inda Emal: chandra2thapa@gmal.com
More informationJoint Adaptive Modulation and Power Allocation in Cognitive Radio Networks
I. J. Communcatons, etwork and System Scences, 8, 3, 7-83 Publshed Onlne August 8 n ScRes (http://www.scrp.org/journal/jcns/). Jont Adaptve Modulaton and Power Allocaton n Cogntve Rado etworks Dong LI,
More informationThe Spectrum Sharing in Cognitive Radio Networks Based on Competitive Price Game
8 Y. B. LI, R. YAG, Y. LI, F. YE, THE SPECTRUM SHARIG I COGITIVE RADIO ETWORKS BASED O COMPETITIVE The Spectrum Sharng n Cogntve Rado etworks Based on Compettve Prce Game Y-bng LI, Ru YAG., Yun LI, Fang
More informationAN IMPROVED BIT LOADING TECHNIQUE FOR ENHANCED ENERGY EFFICIENCY IN NEXT GENERATION VOICE/VIDEO APPLICATIONS
Journal of Engneerng Scence and Technology Vol., o. 4 (6) 476-495 School of Engneerng, Taylor s Unversty A IMPROVED BIT LOADIG TECHIQUE FOR EHACED EERGY EFFICIECY I EXT GEERATIO VOICE/VIDEO APPLICATIOS
More informationA NSGA-II algorithm to solve a bi-objective optimization of the redundancy allocation problem for series-parallel systems
0 nd Internatonal Conference on Industral Technology and Management (ICITM 0) IPCSIT vol. 49 (0) (0) IACSIT Press, Sngapore DOI: 0.776/IPCSIT.0.V49.8 A NSGA-II algorthm to solve a b-obectve optmzaton of
More informationDistributed Resource Allocation and Scheduling in OFDMA Wireless Networks
Southern Illnos Unversty Carbondale OpenSIUC Conference Proceedngs Department of Electrcal and Computer Engneerng 11-2006 Dstrbuted Resource Allocaton and Schedulng n OFDMA Wreless Networks Xangpng Qn
More informationAdaptive Modulation for Multiple Antenna Channels
Adaptve Modulaton for Multple Antenna Channels June Chul Roh and Bhaskar D. Rao Department of Electrcal and Computer Engneerng Unversty of Calforna, San Dego La Jolla, CA 993-7 E-mal: jroh@ece.ucsd.edu,
More informationA study of turbo codes for multilevel modulations in Gaussian and mobile channels
A study of turbo codes for multlevel modulatons n Gaussan and moble channels Lamne Sylla and Paul Forter (sylla, forter)@gel.ulaval.ca Department of Electrcal and Computer Engneerng Laval Unversty, Ste-Foy,
More informationThroughput Maximization by Adaptive Threshold Adjustment for AMC Systems
APSIPA ASC 2011 X an Throughput Maxmzaton by Adaptve Threshold Adjustment for AMC Systems We-Shun Lao and Hsuan-Jung Su Graduate Insttute of Communcaton Engneerng Department of Electrcal Engneerng Natonal
More informationMIMO-OFDM Systems. Team Telecommunication and Computer Networks, FSSM, University Cadi Ayyad, P.O. Box 2390, Marrakech, Morocco.
IJCSI Internatonal Journal of Computer Scence Issues, Vol. 8, Issue 3, ay 2011 ISSN (Onlne: 1694-0814 A Low-complexty Power and Bt Allocaton Algorthm for ultuser IO-OFD Systems Ayad Habb 1, Khald El Baamran
More informationDynamic Optimization. Assignment 1. Sasanka Nagavalli January 29, 2013 Robotics Institute Carnegie Mellon University
Dynamc Optmzaton Assgnment 1 Sasanka Nagavall snagaval@andrew.cmu.edu 16-745 January 29, 213 Robotcs Insttute Carnege Mellon Unversty Table of Contents 1. Problem and Approach... 1 2. Optmzaton wthout
More informationFull-duplex Relaying for D2D Communication in mmwave based 5G Networks
Full-duplex Relayng for D2D Communcaton n mmwave based 5G Networks Boang Ma Hamed Shah-Mansour Member IEEE and Vncent W.S. Wong Fellow IEEE Abstract Devce-to-devce D2D communcaton whch can offload data
More informationQos-aware resource allocation for mixed multicast and unicast traffic in OFDMA networks
RESEARCH Open Access Qos-aware resource allocaton for mxed multcast and uncast traffc n OFDMA networs Hu Deng 1,2*, Xaomng Tao 1 and Janhua Lu 1 Abstract Ths artcle focuses on the subchannel and power
More informationTraffic balancing over licensed and unlicensed bands in heterogeneous networks
Correspondence letter Traffc balancng over lcensed and unlcensed bands n heterogeneous networks LI Zhen, CUI Qme, CUI Zhyan, ZHENG We Natonal Engneerng Laboratory for Moble Network Securty, Bejng Unversty
More informationEfficient Large Integers Arithmetic by Adopting Squaring and Complement Recoding Techniques
The th Worshop on Combnatoral Mathematcs and Computaton Theory Effcent Large Integers Arthmetc by Adoptng Squarng and Complement Recodng Technques Cha-Long Wu*, Der-Chyuan Lou, and Te-Jen Chang *Department
More informationOpportunistic Beamforming for Finite Horizon Multicast
Opportunstc Beamformng for Fnte Horzon Multcast Gek Hong Sm, Joerg Wdmer, and Balaj Rengarajan allyson.sm@mdea.org, joerg.wdmer@mdea.org, and balaj.rengarajan@gmal.com Insttute IMDEA Networks, Madrd, Span
More informationPerformance Analysis of Scheduling Policies for Delay-Tolerant Applications in Centralized Wireless Networks
Performance Analyss of Schedulng Polces for Delay-Tolerant Applcatons n Centralzed Wreless Networks Mohamed Shaqfeh and Norbert Goertz Insttute for Dgtal Communcatons Jont Research Insttute for Sgnal &
More informationMulticarrier Modulation
Multcarrer Modulaton Wha Sook Jeon Moble Computng & Communcatons Lab Contents Concept of multcarrer modulaton Data transmsson over multple carrers Multcarrer modulaton wth overlappng Chap. subchannels
More informationUplink User Selection Scheme for Multiuser MIMO Systems in a Multicell Environment
Uplnk User Selecton Scheme for Multuser MIMO Systems n a Multcell Envronment Byong Ok Lee School of Electrcal Engneerng and Computer Scence and INMC Seoul Natonal Unversty leebo@moble.snu.ac.kr Oh-Soon
More informationDecomposition Principles and Online Learning in Cross-Layer Optimization for Delay-Sensitive Applications
Techncal Report Decomposton Prncples and Onlne Learnng n Cross-Layer Optmzaton for Delay-Senstve Applcatons Abstract In ths report, we propose a general cross-layer optmzaton framework n whch we explctly
More informationProportional Fair Scheduling Algorithm in OFDMA-Based Wireless Systems with QoS Constraints
30 JOURNAL OF COMMUNICATIONS AND NETWORKS, VOL. 12, NO. 1, FEBRUARY 2010 Proportonal Far Schedulng Algorthm n OFDMA-Based Wreless Systems wth QoS Constrants Tolga Grc, Chenx Zhu, Jonathan R. Agre, and
More informationEnergy Efficient Adaptive Modulation in Wireless Cognitive Radio Ad Hoc Networks
Energy Effcent Adaptve Modulaton n Wreless Cogntve Rado Ad Hoc Networks Song Gao, Ljun Qan*, Dhadesugoor. R. Vaman ARO/ARL Center for Battlefeld Communcatons Research Prare Vew A&M Unversty, Texas A&M
More informationJoint Power Control and Scheduling for Two-Cell Energy Efficient Broadcasting with Network Coding
Communcatons and Network, 2013, 5, 312-318 http://dx.do.org/10.4236/cn.2013.53b2058 Publshed Onlne September 2013 (http://www.scrp.org/journal/cn) Jont Power Control and Schedulng for Two-Cell Energy Effcent
More informationClustering Based Fractional Frequency Reuse and Fair Resource Allocation in Multi-cell Networks
Ths full text paper was peer revewed at the drecton of IEEE Communcatons Socety subject matter experts for publcaton n the IEEE ICC 21 proceedngs Clusterng Based Fractonal Frequency Reuse and Far Resource
More informationEnhancing Throughput in Wireless Multi-Hop Network with Multiple Packet Reception
Enhancng Throughput n Wreless Mult-Hop Network wth Multple Packet Recepton Ja-lang Lu, Paulne Vandenhove, We Shu, Mn-You Wu Dept. of Computer Scence & Engneerng, Shangha JaoTong Unversty, Shangha, Chna
More informationEnergy-efficient Subcarrier Allocation in SC-FDMA Wireless Networks based on Multilateral Model of Bargaining
etworkng 03 569707 Energy-effcent Subcarrer Allocaton n SC-FDMA Wreless etworks based on Multlateral Model of Barganng Ern Elen Tsropoulou Aggelos Kapoukaks and Symeon apavasslou School of Electrcal and
More informationErgodic Capacity of Block-Fading Gaussian Broadcast and Multi-access Channels for Single-User-Selection and Constant-Power
7th European Sgnal Processng Conference EUSIPCO 29 Glasgow, Scotland, August 24-28, 29 Ergodc Capacty of Block-Fadng Gaussan Broadcast and Mult-access Channels for Sngle-User-Selecton and Constant-Power
More informationThe Application of Interpolation Algorithms in OFDM Channel Estimation
The Applcaton of Interpolaton Algorthms n OFDM Estmaton Xjun ZHANG 1,, Zhantng YUAN 1, 1 School of Electrcal and Informaton Engneerng, Lanzhou Unversty of Technology, Lanzhou, Gansu 730050, Chna School
More informationSpace Time Equalization-space time codes System Model for STCM
Space Tme Eualzaton-space tme codes System Model for STCM The system under consderaton conssts of ST encoder, fadng channel model wth AWGN, two transmt antennas, one receve antenna, Vterb eualzer wth deal
More informationDistributed and Optimal Reduced Primal-Dual Algorithm for Uplink OFDM Resource Allocation
Dstrbuted and Optmal Reduced Prmal-Dual Algorthm for Uplnk OFDM Resource Allocaton Xaoxn Zhang, Lang Chen, Janwe Huang, Mnghua Chen, and Yupng Zhao Abstract Orthogonal frequency dvson multplexng OFDM s
More informationEE360: Lecture 7 Outline Cellular System Capacity and ASE Announcements Summary due next week
EE360: Lecture 7 Outlne Cellular System Capacty and ASE Announcements Summary due next week Capacty Area Spectral Effcency Dynamc Resource Allocaton Revew of Cellular Lecture Desgn consderatons: Spectral
More informationJoint Rate-Routing Control for Fair and Efficient Data Gathering in Wireless sensor Networks
Jont Rate-Routng Control for Far and Effcent Data Gatherng n Wreless sensor Networks Yng Chen and Bhaskar Krshnamachar Mng Hseh Department of Electrcal Engneerng Unversty of Southern Calforna Los Angeles,
More informationA NOVEL PREAMBLE DESIGN FOR CHANNEL ESTIMATION IN MIMO- OFDM SYSTEMS RESULTING IN ENHANCED THROUGHPUT
Volume 53, umber 3, 01 ACTA TECHICA APOCESIS Electroncs and Telecommuncatons A OVEL PREAMBLE DESIG FOR CHAEL ESTIMATIO I MIMO- OFDM SYSTEMS RESULTIG I EHACED THROUGHPUT Shakeel Salamat ULLAH atonal Unversty
More informationDIGITAL multi-tone (DMT) modulation, also known as
26 IEEE Nnth Internatonal Symposum on Spread Spectrum Technques and Applcatons Improved Throughput over Wrelnes wth Adaptve MC-DS-CDMA Mattheu CRUSSIÈRE, Jean-Yves BAUDAIS and Jean-Franços HÉLARD Electroncs
More informationarxiv: v1 [cs.it] 30 Sep 2008
A CODED BIT-LOADING LINEAR PRECODED DISCRETE MULTITONE SOLUTION FOR POWER LINE COMMUNICATION Fahad Syed Muhammmad*, Jean-Yves Baudas, Jean-Franços Hélard, and Mattheu Crussère Insttute of Electroncs and
More informationMultiband Jamming Strategies with Minimum Rate Constraints
Multband Jammng Strateges wth Mnmum Rate Constrants Karm Banawan, Sennur Ulukus, Peng Wang, and Bran Henz Department of Electrcal and Computer Engneerng, Unversty of Maryland, College Park, MD 7 US Army
More informationCooperative Multicast Scheduling Scheme for IPTV Service over IEEE Networks
Cooperatve Multcast Schedulng Scheme for IPTV Servce over IEEE 802.16 Networks Fen Hou 1, Ln X. Ca 1, James She 1, Pn-Han Ho 1, Xuemn (Sherman Shen 1, and Junshan Zhang 2 Unversty of Waterloo, Waterloo,
More informationResearch of Dispatching Method in Elevator Group Control System Based on Fuzzy Neural Network. Yufeng Dai a, Yun Du b
2nd Internatonal Conference on Computer Engneerng, Informaton Scence & Applcaton Technology (ICCIA 207) Research of Dspatchng Method n Elevator Group Control System Based on Fuzzy Neural Network Yufeng
More informationStudy of Downlink Radio Resource Allocation Scheme with Interference Coordination in LTE A Network
Internatonal Journal of Future Computer and Communcaton, Vol. 6, o. 3, September 2017 Study of Downln Rado Resource Allocaton Scheme wth Interference Coordnaton n LTE A etwor Yen-Wen Chen and Chen-Ju Chen
More informationJoint Scheduling and Resource Allocation in Uplink OFDM Systems for Broadband Wireless Access Networks
226 IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 27, NO. 2, FEBRUARY 2009 Jont Schedulng and Resource Allocaton n Uplnk OFDM Systems for Broadband Wreless Access Networks Janwe Huang, Vay G.
More informationKeywords LTE, Uplink, Power Control, Fractional Power Control.
Volume 3, Issue 6, June 2013 ISSN: 2277 128X Internatonal Journal of Advanced Research n Computer Scence and Software Engneerng Research Paper Avalable onlne at: www.jarcsse.com Uplnk Power Control Schemes
More informationNOMA for 5G Wireless Communication Systems
SCHOOL OF ELECTRICAL ENGINEERING AND TELECOMMUNICATIONS NOMA for 5G Wreless Communcaton Systems by Stella Ho Thess submtted as a requrement for the degree Bachelor of Engneerng (Electrcal Engneerng) Submtted:
More informationENERGY-EFFICIENT DOWNLINK TRANSMISSION WITH BASE STATION CLOSING IN SMALL CELL NETWORKS. Liyan Su, Chenyang Yang, Zhikun Xu and Andreas F.
ENERGY-EFFICIENT DOWNLINK TRANSMISSION WITH BASE STATION CLOSING IN SMALL CELL NETWORKS Lyan Su, Chenyang Yang, Zhkun Xu and Andreas F. Molsch Behang Unversty, Bejng, Chna Unversty of Southern Calforna,
More informationHUAWEI TECHNOLOGIES CO., LTD. Huawei Proprietary Page 1
Project Ttle Date Submtted IEEE 802.16 Broadband Wreless Access Workng Group Double-Stage DL MU-MIMO Scheme 2008-05-05 Source(s) Yang Tang, Young Hoon Kwon, Yajun Kou, Shahab Sanaye,
More informationResource Allocation for Throughput Enhancement in Cellular Shared Relay Networks
Resource Allocaton for Throughput Enhancement n Cellular Shared Relay Networs Mohamed Fadel, Ahmed Hndy, Amr El-Key, Mohammed Nafe, O. Ozan Koyluoglu, Antona M. Tulno Wreless Intellgent Networs Center
More informationPower Allocation in Wireless Relay Networks: A Geometric Programming-Based Approach
ower Allocaton n Wreless Relay Networks: A Geometrc rogrammng-based Approach Khoa T. han, Tho Le-Ngoc, Sergy A. Vorobyov, and Chntha Telambura Department of Electrcal and Computer Engneerng, Unversty of
More informationThe Stability Region of the Two-User Broadcast Channel
The Stablty Regon of the Two-User Broadcast Channel Nkolaos appas *, Maros Kountours, * Department of Scence and Technology, Lnköpng Unversty, Campus Norrköpng, 60 74, Sweden Mathematcal and Algorthmc
More informationA MODIFIED DIFFERENTIAL EVOLUTION ALGORITHM IN SPARSE LINEAR ANTENNA ARRAY SYNTHESIS
A MODIFIED DIFFERENTIAL EVOLUTION ALORITHM IN SPARSE LINEAR ANTENNA ARRAY SYNTHESIS Kaml Dmller Department of Electrcal-Electroncs Engneerng rne Amercan Unversty North Cyprus, Mersn TURKEY kdmller@gau.edu.tr
More informationDistributed Uplink Scheduling in EV-DO Rev. A Networks
Dstrbuted Uplnk Schedulng n EV-DO ev. A Networks Ashwn Srdharan (Sprnt Nextel) amesh Subbaraman, och Guérn (ESE, Unversty of Pennsylvana) Overvew of Problem Most modern wreless systems Delver hgh performance
More informationA MODIFIED DIRECTIONAL FREQUENCY REUSE PLAN BASED ON CHANNEL ALTERNATION AND ROTATION
A MODIFIED DIRECTIONAL FREQUENCY REUSE PLAN BASED ON CHANNEL ALTERNATION AND ROTATION Vncent A. Nguyen Peng-Jun Wan Ophr Freder Computer Scence Department Illnos Insttute of Technology Chcago, Illnos vnguyen@t.edu,
More informationOptimal Transmission Scheduling of Cooperative Communications with A Full-duplex Relay
1 Optmal Transmsson Schedulng of Cooperatve Communcatons wth A Full-duplex Relay Peng L Member IEEE Song Guo Senor Member IEEE Wehua Zhuang Fellow IEEE Abstract Most exstng research studes n cooperatve
More informationResearch Article Heterogeneous Resource Allocation Algorithm for Ad Hoc Networks with Utility Fairness
Internatonal Journal of Dstrbuted Sensor Networks Volume 205, Artcle ID 68689, 3 pages http://dx.do.org/0.55/205/68689 Research Artcle Heterogeneous Resource Allocaton Algorthm for Ad Hoc Networks wth
More informationAN EFFICIENT ITERATIVE DFT-BASED CHANNEL ESTIMATION FOR MIMO-OFDM SYSTEMS ON MULTIPATH CHANNELS
AN FFICINT ITRATIV DFT-BASD CHANNL STIMATION FOR MIMO-OFDM SYSTMS ON MULTIPATH CHANNLS Jan Hafang Graduate Unversty of the Chnese Academy of Scences Insttute of Semconductors, CAS Beng, Chna hf@sem.ac.cn
More informationResearch Article A Utility-Based Rate Allocation of M2M Service in Heterogeneous Wireless Environments
Internatonal Dstrbuted Sensor etworks Volume 3, Artcle ID 3847, 7 pages http://dx.do.org/.55/3/3847 Research Artcle A Utlty-Based Rate Allocaton of MM Servce n Heterogeneous Wreless Envronments Yao Huang,
More informationRejection of PSK Interference in DS-SS/PSK System Using Adaptive Transversal Filter with Conditional Response Recalculation
SERBIAN JOURNAL OF ELECTRICAL ENGINEERING Vol., No., November 23, 3-9 Rejecton of PSK Interference n DS-SS/PSK System Usng Adaptve Transversal Flter wth Condtonal Response Recalculaton Zorca Nkolć, Bojan
More informationA Benchmark for D2D in Cellular Networks: The Importance of Information
A Benchmark for D2D n Cellular Networks: The Importance of Informaton Yğt Özcan, Catherne Rosenberg Unversty of Waterloo {yozcan,cath}@uwaterloo.ca Fabrce Gullemn Orange Labs, France fabrce.gullemn@orange.com
More informationDistributed Channel Allocation Algorithm with Power Control
Dstrbuted Channel Allocaton Algorthm wth Power Control Shaoj N Helsnk Unversty of Technology, Insttute of Rado Communcatons, Communcatons Laboratory, Otakaar 5, 0150 Espoo, Fnland. E-mal: n@tltu.hut.f
More informationOn Space-Frequency Water-Filling Precoding for Multi-User MIMO Communications
Proceedngs of the World ongress on Engneerng 05 Vol I WE 05, July - 3, 05, London, U.. On Space-Frequency Water-Fllng Precodng for Mult-User MIMO ommuncatons Yu-uan hang, Ye-Shun Shen, Fang-Bau Ueng and
More informationChannel Alternation and Rotation in Narrow Beam Trisector Cellular Systems
Channel Alternaton and Rotaton n Narrow Beam Trsector Cellular Systems Vncent A. Nguyen, Peng-Jun Wan, Ophr Freder Illnos Insttute of Technology-Communcaton Laboratory Research Computer Scence Department-Chcago,
More informationTopology Control for C-RAN Architecture Based on Complex Network
Topology Control for C-RAN Archtecture Based on Complex Network Zhanun Lu, Yung He, Yunpeng L, Zhaoy L, Ka Dng Chongqng key laboratory of moble communcatons technology Chongqng unversty of post and telecommuncaton
More informationTODAY S wireless networks are characterized as a static
IEEE TRANSACTIONS ON MOBILE COMPUTING, VOL. 10, NO. 2, FEBRUARY 2011 161 A Spectrum Decson Framework for Cogntve Rado Networks Won-Yeol Lee, Student Member, IEEE, and Ian F. Akyldz, Fellow, IEEE Abstract
More informationChannel aware scheduling for broadcast MIMO systems with orthogonal linear precoding and fairness constraints
Channel aware schedulng for broadcast MIMO systems wth orthogonal lnear precodng and farness constrants G Prmolevo, O Smeone and U Spagnoln Dp d Elettronca e Informazone, Poltecnco d Mlano Pzza L da Vnc,
More informationThe Impact of Spectrum Sensing Frequency and Packet- Loading Scheme on Multimedia Transmission over Cognitive Radio Networks
Ths artcle has been accepted for publcaton n a future ssue of ths journal, but has not been fully edted. Content may change pror to fnal publcaton. The Impact of Spectrum Sensng Frequency and Pacet- Loadng
More informationAn Attack-Defense Game Theoretic Analysis of Multi-Band Wireless Covert Timing Networks
Ths full text paper was peer revewed at the drecton of IEEE Communcatons Socety subect matter experts for publcaton n the IEEE INFOCOM 2010 proceedngs Ths paper was presented as part of the man Techncal
More informationAn Application-Aware Spectrum Sharing Approach for Commercial Use of 3.5 GHz Spectrum
An Applcaton-Aware Spectrum Sharng Approach for Commercal Use of 3.5 GHz Spectrum Haya Shajaah, Ahmed Abdelhad and Charles Clancy Bradley Department of Electrcal and Computer Engneerng Hume Center, Vrgna
More informationDistributed user selection scheme for uplink multiuser MIMO systems in a multicell environment
Lee et al. EURASIP Journal on Wreless Communcatons and Networkng 212, 212:22 http://s.euraspournals.com/content/212/1/22 RESEARCH Dstrbuted user selecton scheme for uplnk multuser MIMO systems n a multcell
More informationApproximating User Distributions in WCDMA Networks Using 2-D Gaussian
CCCT 05: INTERNATIONAL CONFERENCE ON COMPUTING, COMMUNICATIONS, AND CONTROL TECHNOLOGIES 1 Approxmatng User Dstrbutons n CDMA Networks Usng 2-D Gaussan Son NGUYEN and Robert AKL Department of Computer
More informationAdaptive Technique for CI/MC-CDMA System using Combined Strategy of Genetic Algorithms and Neural Network
etwork Protocols and Algorthms Adaptve Technque for CI/MC-CDMA System usng Combned Strategy of Genetc Algorthms and eural etwork Sant P. Maty Department of Informaton Technology, Bengal Engneerng and Scence
More informationRelevance of Energy Efficiency Gain in Massive MIMO Wireless Network
Relevance of Energy Effcency Gan n Massve MIMO Wreless Network Ahmed Alzahran, Vjey Thayananthan, Muhammad Shuab Quresh Computer Scence Department, Faculty of Computng and Informaton Technology Kng Abdulazz
More informationA New Ranging Method for OFDMA Systems
where C (m) (l) = C(m) k,d (l) =1, and {A, A k,d > } are ampltude factors. Denote the -pont untary nverse fast Fourer transform (IFFT) of (m) and (m) k,d by x(m) and, respectvely. After cyclc prefx (CP)
More informationPlanning of Relay Station Locations in IEEE (WiMAX) Networks
Ths full text paper was peer revewed at the drecton of IEEE Communcatons Socety subject matter experts for publcaton n the WCNC 010 proceedngs. Plannng of Relay Staton Locatons n IEEE 0.16 (WMAX) Networks
More informationIMPACT OF LIMITED FEEDBACK ON MIMO- OFDM SYSTEMS USING JOINT BEAMFORMING
IMPACT OF LIMITED FEEDBACK ON MIMO- OFDM SYSTEMS USING JOINT BEAMFORMING NAJOUA ACHOURA 1 AND RIDHA BOUALLEGUE 1 Department Natonal Engneerng School of Tuns, Tunsa najouaachoura@gmalcom SUP COM, 6 Tel
More informationPerformance Study of OFDMA vs. OFDM/SDMA
Performance Study of OFDA vs. OFD/SDA Zhua Guo and Wenwu Zhu crosoft Research, Asa 3F, Beng Sgma Center, No. 49, Zhchun Road adan Dstrct, Beng 00080, P. R. Chna {zhguo, wwzhu}@mcrosoft.com Abstract: In
More informationIEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 13, NO. 12, DECEMBER
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 3, NO. 2, DECEMBER 204 695 On Spatal Capacty of Wreless Ad Hoc Networks wth Threshold Based Schedulng Yue Lng Che, Student Member, IEEE, Ru Zhang, Member,
More informationOn Channel Estimation of OFDM-BPSK and -QPSK over Generalized Alpha-Mu Fading Distribution
Int. J. Communcatons, Network and System Scences, 010, 3, 380-384 do:10.436/jcns.010.34048 Publshed Onlne Aprl 010 (http://www.scrp.org/journal/jcns/) On Channel Estmaton of OFDM-BPSK and -QPSK over Generalzed
More informationDecision aid methodologies in transportation
Decson ad methodologes n transportaton Lecture 7: More Applcatons Prem Kumar prem.vswanathan@epfl.ch Transport and Moblty Laboratory Summary We learnt about the dfferent schedulng models We also learnt
More informationCharacterization and Analysis of Multi-Hop Wireless MIMO Network Throughput
Characterzaton and Analyss of Mult-Hop Wreless MIMO Network Throughput Bechr Hamdaou EECS Dept., Unversty of Mchgan 226 Hayward Ave, Ann Arbor, Mchgan, USA hamdaou@eecs.umch.edu Kang G. Shn EECS Dept.,
More informationA Novel Optimization of the Distance Source Routing (DSR) Protocol for the Mobile Ad Hoc Networks (MANET)
A Novel Optmzaton of the Dstance Source Routng (DSR) Protocol for the Moble Ad Hoc Networs (MANET) Syed S. Rzv 1, Majd A. Jafr, and Khaled Ellethy Computer Scence and Engneerng Department Unversty of Brdgeport
More informationEnhanced Uplink Scheduling for Continuous Connectivity in High Speed Packet Access Systems
Int. J. Communcatons, Network and System Scences, 212, 5, 446-453 http://dx.do.org/1.4236/jcns.212.5855 Publshed Onlne August 212 (http://www.scrp.org/journal/jcns) Enhanced Uplnk Schedulng for Contnuous
More informationParameter Free Iterative Decoding Metrics for Non-Coherent Orthogonal Modulation
1 Parameter Free Iteratve Decodng Metrcs for Non-Coherent Orthogonal Modulaton Albert Gullén Fàbregas and Alex Grant Abstract We study decoder metrcs suted for teratve decodng of non-coherently detected
More informationantenna antenna (4.139)
.6.6 The Lmts of Usable Input Levels for LNAs The sgnal voltage level delvered to the nput of an LNA from the antenna may vary n a very wde nterval, from very weak sgnals comparable to the nose level,
More informationNOVEL ITERATIVE TECHNIQUES FOR RADAR TARGET DISCRIMINATION
NOVEL ITERATIVE TECHNIQUES FOR RADAR TARGET DISCRIMINATION Phaneendra R.Venkata, Nathan A. Goodman Department of Electrcal and Computer Engneerng, Unversty of Arzona, 30 E. Speedway Blvd, Tucson, Arzona
More informationWalsh Function Based Synthesis Method of PWM Pattern for Full-Bridge Inverter
Walsh Functon Based Synthess Method of PWM Pattern for Full-Brdge Inverter Sej Kondo and Krt Choesa Nagaoka Unversty of Technology 63-, Kamtomoka-cho, Nagaoka 9-, JAPAN Fax: +8-58-7-95, Phone: +8-58-7-957
More informationPerformance Evaluation of QoS Parameters in Dynamic Spectrum Sharing for Heterogeneous Wireless Communication Networks
IJCSI Internatonal Journal of Computer Scence Issues, Vol. 9, Issue 1, No 2, January 2012 ISSN (Onlne): 1694-0814 www.ijcsi.org 81 Performance Evaluaton of QoS Parameters n Dynamc Spectrum Sharng for Heterogeneous
More informationAutonomous Dynamic Spectrum Management for Coexistence of Multiple Cognitive Tactical Radio Networks
Autonomous Dynamc Spectrum Management for Coexstence of Multple Cogntve Tactcal Rado Networks Vncent Le Nr, Bart Scheers Abstract In ths paper, dynamc spectrum management s studed for multple cogntve tactcal
More informationIterative Water-filling for Load-balancing in
Iteratve Water-fllng for Load-balancng n Wreless LAN or Mcrocellular Networks Jeremy K. Chen Theodore S. Rappaport Gustavo de Vecana Wreless Networkng and Communcatons Group (WNCG), The Unversty of Texas
More informationWeighted Penalty Model for Content Balancing in CATS
Weghted Penalty Model for Content Balancng n CATS Chngwe Davd Shn Yuehme Chen Walter Denny Way Len Swanson Aprl 2009 Usng assessment and research to promote learnng WPM for CAT Content Balancng 2 Abstract
More informationOptimization of Scheduling in Wireless Ad-Hoc Networks. Using Matrix Games
Optmzaton of Schedulng n Wreless Ad-Hoc Networs Usng Matrx Games Ebrahm Karam and Savo Glsc, Senor Member IEEE Centre for Wreless Communcatons (CWC), Unversty of Oulu, P.O. Box 4500, FIN-90014, Oulu, Fnland
More information4492 IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 65, NO. 10, OCTOBER 2017
4492 IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 65, NO. 10, OCTOBER 2017 OFDM-Based Interference Algnment n Sngle-Antenna Cellular Wreless Networks Huacheng Zeng, Member, IEEE, YSh,Senor Member, IEEE, Y.
More informationIEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, VOL. X, NO. X, XXXX
IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, VOL. X, NO. X, XXXX 21 1 Cross-layer Routng and Dynamc Spectrum Allocaton n Cogntve Rado Ad Hoc Networks Le Dng, Tommaso Meloda, Stella N. Batalama, John D. Matyjas,
More informationCROSS-LAYER OPTIMIZATION PERFORMANCE OF SINGLE CELL MILLIMETER WAVE OFDM WIRELESS NETWORK UNDER RAIN FADING
Semnar Nasonal Aplkas Teknolog Informas 009 (SNATI 009) Yogyakarta, 0 Jun 009 CROSS-LAYER OTIMIZATION ERFORMANCE OF SINGLE CELL MILLIMETER WAVE OFDM WIRELESS NETWORK UNDER RAIN FADING E. Endroyono 1, G.
More informationUtility Maximization for Uplink MU-MIMO: Combining Spectral-Energy Efficiency and Fairness
EuCNC-MngtTech 79 7 8 9 7 8 9 7 8 9 7 8 9 7 8 9 7 Utlty Maxmzaton for Uplnk MU-MIMO: Combnng Spectral-Energy Effcency and Farness Le Deng, Wenje Zhang, Yun Ru, Yeo Cha Kat Department of Informaton Engneerng,
More informationAn Efficient Scheduling For Diverse QoS Requirements in WiMAX
An Effcent Schedulng For Dverse QoS Requrements n WMAX by Xaojng Meng A thess presented to the Unversty of Waterloo n fulfllment of the thess requrement for the degree of Master of Appled Scence n Electrcal
More informationEnergy Efficiency Analysis of a Multichannel Wireless Access Protocol
Energy Effcency Analyss of a Multchannel Wreless Access Protocol A. Chockalngam y, Wepng u, Mchele Zorz, and Laurence B. Mlsten Department of Electrcal and Computer Engneerng, Unversty of Calforna, San
More information