Energy Efficient Adaptive Modulation in Wireless Cognitive Radio Ad Hoc Networks
|
|
- Alfred Waters
- 6 years ago
- Views:
Transcription
1 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 Unversty System Prare Vew, Texas 77446, USA Abstract In ths paper, an energy effcent adaptve modulaton scheme s proposed for a wreless cogntve rado ad hoc network, where each node s equpped wth cogntve rado and the network s an OFDMA system operatng on tme slots. In each slot, the users wth new traffc demand wll sense the spectrum and locate the avalable subcarrer set. Then they choose subcarrers wth favorable channel condton ndvdually whle avod ntroducng harmful nterference to the exstng users. Gven the delay requrement, an adaptve modulaton strategy s proposed for each ndvdual user to mnmze the energy consumpton per bt over the avalable subcarrer set by selectng the optmal constellaton sze. The optmal soluton of energy effcent adaptve modulaton s derved by usng Dnkelbacktype algorthm, and a sub-gradent search algorthm s proposed to locate the optmal constellaton sze. Furthermore, a suboptmal constant bt allocaton strategy s presented to address the delay constrants and a dstrbuted power control s performed to manage the co-channel nterference among new users when needed. Smulaton results demonstrate the effectveness of our approach. I. INTRODUCTION Msson Crtcal Networkng (MCN s under ntensve research recently due to ts wde-spread applcatons such as n mltary operatons, dsaster relef, etc. Usually MCN requres fast deployment as well as wthout nfrastructure support. Ths makes wreless ad hoc network a promsng canddate for MCN. Furthermore, effcent operaton of MCN plays a pvotal role because such networks are typcally resource (such as energy and spectrum constrant. In ths work, dstrbuted resource allocaton problem s consdered through jont desgn of adaptve modulaton and cogntve rado for an energy and spectrum constrant wreless ad hoc network to maxmze energy effcency and spectrum utlzaton. Cogntve Rado (CR [1] provdes the capablty of accessng the spectrum opportunstcally and greatly mproves spectrum utlzaton. Challenges arse wth such dynamc and herarchcal means of accessng the spectrum, especally for the dynamc resource allocaton of CR users by adaptng ther transmsson parameters to the varyng spectrum condton whle adherng to qualty of servce (QoS requrements [3]. In ths paper, an energy constraned wreless CR ad hoc network s consdered, where each node s equpped wth CR and has lmted battery energy. One of the crtcal performance *Correspondng author. Phone: ; Fax: ; E-mal: ljunqan@eee.org measures of such networks s network lfetme. Hence energy effcent resource management schemes are desred. In ths context, the present paper provdes a framework for energy effcent adaptve modulaton technques n wreless CR ad hoc networks that employ orthogonal frequency dvson multple access (OFDMA []. OFDMA s well suted for cogntve rado because t s agle n selectng and allocatng subcarrers dynamcally and facltates decodng at the recevng end of each subcarrer. The CR OFDMA network operates on tme slots. Exstng users transmt a plot sgnal perodcally on occuped subcarrers. By detectng the presence of such a plot sgnal, emergng CR users can determne the avalable subcarrer set n a target spectral range [4], and then tune transmsson parameters to map the nformaton bts effcently over the avalable subcarrer set. Adaptve modulaton, also called bt loadng, has been extensvely explored n prevous works. The basc dea behnd adaptve modulaton algorthm s to ensure that the most effcent mode s always employed over varyng channel condtons. Compared wth non-adaptve methods whch requre a fxed margn to mantan acceptable performance when the channel qualty s poor, adaptve approaches result n better effcency by takng advantage of the favorable channel condtons. In [5], [7], adaptve modulaton technques n MIMO- OFDM systems s presented wth the objectve to mnmze the transmsson power or mprove spectral effcency. The performance gan by combnng adaptve modulaton and power control s studed n [8], where sgnfcant throughput advantage has been demonstrated n the mult-user cellular system. Energy effcent modulaton optmzaton problem n sngle carrer system s nvestgated n [10] for uncoded and coded MQAM and MFSK. In [6], a varable-rate and varable-power MQAM modulaton scheme for hgh speed data transmsson s presented over fadng channels. In ths paper, adaptve modulaton s employed to optmally dstrbute bts to the transmtted symbols, hence determnng the constellaton sze on each of the avalable subcarrers. Adaptng the constellaton sze wll drectly nfluence the power consumpton of each node, and n turn wll affect the lfetme of the network. The optmalty s defned as maxmzng energy effcency subject to a pre-specfed bt error rate (BER and delay constrant. Specfcally, gven
2 requred BER and delay constrants, and assumng QAM s adopted as the modulaton scheme, the optmal modulaton order of QAM on each selected subcarrer that mnmze the energy for delvery of L bts per slot (thus maxmze the network lfetme s derved analytcally and s verfed by smulatons. The remander of ths paper s organzed as follows. In secton II, the system model and the problem formulaton are gven. A fully dstrbuted adaptve modulaton algorthm for each ndvdual user s proposed n secton III. In Secton IV, a dstrbuted power control algorthm s suggested to manage potental co-channel nterference caused by concurrent new users. Secton V contans the smulaton results and dscussons. Secton VI gves concludng remarks. II. SYSTEM MODEL We consder an energy constraned CR OFDMA network of N communcatng user-pars. Both transmtter and recever j s ndexed by N := {1,,..., N}. Ifj =, recever j s sad to be the ntended recever of transmtter. The transmsson system s assumed to be a tme-slotted OFDMA system wth fxed tme slot duraton T S. Slot synchronzaton s assumed to be acheved through a beaconng mechansm. Before each tme slot, a guard nterval s nserted to acheve synchronzaton, perform spectrum detecton as well as resource allocaton (based on the proposed scheme. Inter-carrer nterference (ICI caused by frequency offset from the sde lobes s not consdered n ths work (whch can be mtgated by wndowng the OFDM sgnal n the tme doman or adaptvely deactvatng adjacent subcarrers [11]. A frequency selectve Raylegh fadng channel s assumed at the physcal layer, and the entre spectrum s approprately dvded nto K subcarrers to guarantee each subcarrer experencng flat Raylegh fadng. We label the subcarrer set avalable to the transmtter recever par after spectrum detecton by L {1,,..., K} whch s a common subcarrer set avalable to both transmtter and ntended recever. Let G := { G k,j,,j N,k L } denote the subcarrer fadng coeffcent matrx, where G k,j stands for the sub-channel coeffcent gan from transmtter to recever j over subcarrer k. G k,j = Hk,j (f, where H,j k (f s the transfer functon. It s assumed that G adheres to a block fadng channel model whch remans nvarant over blocks (coherence tme slots of sze T S and uncorrelated across successve blocks. The nose s assumed to be addtve whte Gaussan nose (AWGN and to be ndependent of the symbols, wth varance σ for all recevers over the entre avalable subcarrer set. We defne p k to be the power allocated over subcarrer k for transmtter. The sgnal to nterference plus nose rato (SINR of recever over subcarrer k, γ k, can be expressed as γ k (p k =α k (p k j p k α k (p k G k, j = j,j N Gk j, pk j + (1 σ where α k s the channel state nformaton (CSI. α k can be measured at the recever sde and s assumed to be known by the correspondng transmtter through a recprocal common control channel. We assume the coherent recepton wth perfect carrer-phase estmaton and perfect fadng-value estmaton at the recever and the transmtter, thus the delays nvolved n obtanng the channel estmate at recever and of provdng the nformaton to the correspondng transmtter can be neglected. For MQAM, the number of bts per symbol s denoted as b = log M whch s defned over postve nteger values. A bound on the probablty of bt error rate for MQAM s gven by P b 4 ( 1 1 ( 3 Q b b b 1 εav, ( N 0 where P b s the bt error probablty (BER, ε av s the average energy per symbol, and Q(x = 1 x π exp( u du. Snce Q(x 1 x exp(, by approxmatng the bound as equalty we obtan P b = ( 1 1 ( 3 exp b b ( b 1 γ. (3 Thus, the transmsson power to guarantee a requred BER P,b on each selected subcarrers can be derved as ( ( bk 1 p k = 3 α k ln 1 1/ b k P,b bk. (4 In each tme slot, we assume L bts need to be transmtted by transmtter to acheve QoS requrements. On each subcarrer, the allocated bts s denoted as L k, thus k L L k = L. The number of MQAM symbols requred to send L k bts on subcarrer k s denoted as S k = Lk /bk. If the symbol perod s T ls, then S k = T,on /T,ls, T,on s the transmsson tme per slot and t s dentcal for all subcarrers. Furthermore, L k /b k = T,on /T,ls (5 If square pulses are used, T,ls can be approxmated by 1, B k where B k s the bandwdth of subcarrer k for transmtter. From (5, we obtan T,on = L k /(B k b k (6 In ths paper, wthout loss of generalty, we assume the subcarrers are equally dvded, and B k =1, k. Remark: From (5 and (6, the essental dea behnd the adaptve modulaton algorthm wth equally dvded bandwdth n OFDMA based CR networks s to allocate the same amount of symbols on each selected subcarrer whle wth dfferent constellaton sze accordng to the varyng subcarrer condtons.
3 Hence, the transmsson energy consumpton for transmtter over subcarrer k can be expressed as e k = p k T,on ( = T,on ( bk 1 ln 1 1/ = bk b k P,b ( ln 1 1/ bk b k P Lk (7,b 3α k ( bk 1 3α k In an energy constraned network (e.g. a wreless sensor network, recepton power s not neglgble snce t s generally comparable to the transmsson power [13]. In ths work, we denote the recevng power as p r whch s treated as a constant value for all recevers [1]. Thus, for transmtter and recever par, the total energy consumpton for the delvery of L bts s gven by e = k L e k + p r T,on = ( bk 1 3α k η(b k +p r T,on k L ( η(b k =ln 1 1/ bk b k P (8,b Based on (6 and B k =1, k, T,on can be further expressed as T,on = L k k L = L (B k b k b k k L k L Takng (9 nto (8, the energy consumpton for the delvery of L bts can be re-organzed as e = L ( bk 1 η(b k +p r (10 k L b k k L 3α k From the expresson of e, t s observed that the transmsson energy consumpton s ncreasng wth respect to b k,onthe contrary, the recepton energy s decreasng w.r.t. b k. Therefore, energy effcent bt loadng algorthm needs to locate an optmal trade-off between transmsson and recepton energy. In each tme slot, transmsson s requred to be bounded by the delay constrants,.e., T,on T S, whch leads to L b k (11 T S k L Defne L/T S := b mn. Gven the above system assumptons, we end up wth the followng constraned optmzaton b k (9 problem for transmtter recever par : mn b k Z+ e s.t. k L b k b mn, P b P,b, N (1 III. ENERGY EFFICIENT ADAPTIVE MODULATION SCHEME Snce the desgn varable b k s defned over postve ntegers, (1 s a constraned nteger fractonal programmng problem [9]. Due to the non-convex nature of the problem, hgh computatonal complexty s expected by exhaustve search of the optmal soluton, especally wth the ncrease of the number of avalable subcarrers. In ths paper, we propose an effcent one-dmensonal sub-gradent search algorthm by relaxng b k to postve real numbers R + whch wll provde the (best performance bound of energy effcency. For uncoded MQAM, f we approxmate η(b k by ( ln 1 1/ ( bk b k P 3 ln b b k P (13 b We can smplfy the representaton of total energy consumpton (10 as ( bk 1 e = L k L 3α k ( ln k L b k 3 b k P,b + p r (14 The relatve looseness caused by the bound (13 s less than 7% (see Fg.1 when b s wthn the range [, 10] (whch s a reasonable regon for practcal MQAM n wreless ˆb k networks. After we fnd the optmal soluton for the relaxed optmzaton problem, the optmal nteger result b k can be located by evaluatng the energy effcency at the two neghborng nteger ponts. Note that generally for nteger programmng problems, the optmal soluton may not be one of the neghborng nteger ponts. However, n the studed cases, the smulatons demonstrate the effectveness of the proposed relaxaton algorthm for fndng the true optmal soluton, and the obtaned optmal soluton n real doman can be treated as the performance bound. A. Unconstraned Energy Effcent Allocaton Algorthm In ths paper, we decouple the constraned fractonal programmng problem nto an unconstraned one and a branchand-bound algorthm s appled thereafter to gan nsghts of the optmal adaptve modulaton order. Based on the
4 to teratvely search for λ ( ˆb. From (19, t can be observed that orgnal J dmensonal fractonal programmng problem can be reduced to one dmensonal optmzaton problem f λ ( ˆb s consdered to be a constant value for each subcarrer k. Thus, we propose a one dmensonal effcent sub-gradent search algorthm to locate the optmal λ ( ˆb whch wll determne the optmal modulaton order vector ˆb n reverse. Specfcally, we propose the followng sub-gradent projecton teraton (ndexed by n for locatng λ ( ˆb ( f ( λ (n +1=λ (n+β(n ˆb (n g ( ˆb (n λ (n (0 Fg. 1. Looseness of bound approxmaton (equaton (13 Dnkelback-type algorthm [9], we defne λ ( ˆb := f (ˆb g (ˆb, λ ( ˆb := mn e b k (ˆb R+ f ( ˆb :=L ( k 1 3 3α k ln k L ˆb k P + p r,b g ( ˆb := k L ˆbk (15 whereˆs used to represent the varables n the unconstraned optmzaton doman, ˆb = [ˆb 1, ˆb,...,ˆb k ] denotes the unconstraned optmal modulaton orders over avalable subcarrer set for transmtter recever par. In the practcal regon of MQAM constellaton sze, t can be seen that f ( ˆb,g ( ˆb are postve, contnuous, and convex (the proof s gven n Appendx A. Gven the channel matrx G and nose varance σ, ˆb s defned as the optmal pont by satsfyng λ ( ˆb λ ( ˆb, ˆb R J+ (16 where J s the cardnalty of the avalable subcarrer set. To analyze the propertes of the fractonal programmng optmzaton, we ntroduce the functon ρ (λ, ˆb :R + R J+ R + whch s gven by ρ (λ, ˆb :=f ( ˆb λ ( ˆb g ( ˆb (17 Therefore, the optmal soluton of the unconstraned energy effcency optmzaton problem can by obtaned by dfferentatng ρ (λ, ˆb wth respect to ˆb k ρ (λ, ˆb = f ( ˆb λ ( ˆb (18 ˆb k ˆb k By settng ρ (λ, ˆb / ˆb k =0, we obtan ( (ˆb k ˆb k α k ln ln P,b ˆb = λ ( ˆb (19 k ˆbk Because computng the entre optmal constellaton sze ˆb s too expensve, a more effcent approach s proposed here where β(n s a postve step sze. Each λ encountered durng the search process must be evaluated to determne the constellaton sze assocated wth t whch can be used to update f ( ˆb (n and g ( ˆb (n, respectvely. From (0, the tentatve optmal modulaton order b k (n for the nth teraton can be derved over each subcarrer k L. And the temporary energy consumpton whch we denote as λ (n s updated wth the correspondng b k.theɛ-optmal constellaton sze b k has been reached f the followng condton holds for the subsequent {λ (n}. λ ( ˆb = λ(n = f ( ˆb (n g ( ˆb (n λ (n ɛ (1 where ɛ s an arbtrary small postve number. Smulatons demonstrate that the presented sub-gradent search algorthm provdes fast convergence and easy verfcaton when λ has been reached. The entre algorthm s summarzed as follows. Unconstraned Bt Loadng Algorthm 1 Intalzaton Intalze the unconstraned energy consumpton λ =0, the temporary energy consumpton λ =0, and the tentatve constellaton sze vector b =φ. Sub-Gradent search algorthm of λ Select λ (0 R + and n := 0 Take λ (n nto (19 for tentatve modulaton order allocaton b (n. Dervng the temporary energy consumpton λ (n by the correspondng b (n. Determne f λ (n and λ (n satsfy (1 for convergence If yes, stop and the unconstraned optmal constellaton sze over entre avalable subcarrer set s ˆb = b (n, and the optmal energy consumpton s λ ( ˆb = λ (n. If no, update λ (n based on (0, and go to the begnnng of step. Therefore, the optmal unconstraned constellaton szes set ˆb can be expressed as ˆb = max{ˆb k, 0}, k L, N ( k L
5 B. Constraned Energy Effcent Allocaton Algorthm The last secton provdes an effcent sub-gradent search algorthm for the unconstraned optmal constellaton sze ˆb =[ˆb 1, ˆb,...,ˆb k ], k L. Gven such unconstraned optmal soluton, the ultmate soluton space can be parttoned nto two sub-space based on the delay constrants. Case 1. If k L ˆbk b mn If the unconstraned soluton ˆb satsfes the delay constrants, t s regarded as the constraned optmal soluton by evaluatng the energy effcency at two neghborng nteger ponts when both of them meet the delay constrants. Otherwse, the constellaton sze n real doman wll be rounded up to the least greater nteger 1 to ensure the non-volaton of the delay constrants. arg mn{e ( ˆb k b k L ˆbk = ˆb k, k L, e ( ˆb k }, ˆb k b mn k L ˆb k k L <b mn Case. If k L ˆbk b mn When the unconstraned optmal soluton ˆb cannot satsfy the delay constrants, addtonal bts need to be allocated on the subcarrer set. Constraned optmzaton technques, such as the nteror-pont method [10], can be appled but wth consderable computatonal complexty. In order to acheve tractable complexty and mplementaton smplcty, we present a constant bt allocaton scheme based on the unconstraned optmal soluton whch wll allocate the extra requred bts equally over the entre selected subcarrer set. Due to the optmalty of the unconstraned soluton, mnmal ncreased bt allocaton whch s denoted as b wll result n the best energy effcency snce t has mnmal devaton from the optmal pont. Thus b s gven by b = b mn k L ˆbk b k = b Γ(ˆb, k L (3 where b k s the equally allocated bts on each subcarrer, and Γ(X s defned as the cardnalty of the nonzero elements n vector X. Eventually, the constraned modulaton order allocated on selected subcarrer can be expressed as ˆb = = ˆbk + b k, k L (4 k L b k k L IV. DISTRIBUTED POWER CONTROL ALGORITHM In secton III, an adaptve modulaton algorthm s proposed for each ndvdual user par. Whereas, n mult-user ad hoc networks, smultaneous spectrum access among multple transmtter recever pars n the same tme slot wll cause co-channel nterference and result n degradaton of network 1 A better soluton may be obtaned by searchng all the combnatons of b as long as k L b k b mn. However, the ncurred complexty s hgh. TABLE I CONVERGENCE OF THE PROPOSED SUB-GRADIENT SEARCH ALGORITHM Fg.. Iteraton No. b (n λ (n λ (n 1 [1.4, 1.5] [3.4, 3.5] [.9, 3.1] [.9, 3.1] Optmal soluton for energy per bt n two subcarrer case performance. In order to guarantee the QoS requrements, such as the delay constrants and BER, a dstrbuted power control algorthm s presented n ths secton to manage the potental co-channel nterference. Each emergng new user ntally obtan ther constellaton sze ndvdually wth the algorthm proposed n secton III, and then terates the dstrbuted power control algorthm to mtgate the nterference from peers. The power control algorthm s gven by [14] { } γ p k k (t + 1 = mn γ k(tpk (t,p max (5 where γ k s the ndvdual target SINR of transmtter over each subcarrer k whch can be determned by (3. Durng the power control stage, f the target SINR γ k can not be mantaned when transmtter hts ts power bound, the network s consdered to be unable to accommodate all the current new users. A mult-access control (MAC scheme s then requred to guarantee the farness among the users. p max V. SIMULATION RESULT In ths secton, we consder a wreless sensor network wth cogntve rado capablty. The channel gans are assumed to be sampled from a Raylegh dstrbuton wth mean equals to 0.4d 3, where d s the dstance from the transmtter to the recever. The entre spectrum s equally dvded nto subcarrers wth bandwdth 100 KHz for each subcarrer. The duraton of each tme slot T S s assumed to be 10ms n whch L bts need to be transmtted. The thermal nose power s assumed to be the same over all subcarrers and equal to 10 8 W.
6 TABLE III COMPARISON BETWEEN EXHAUSTIVE SEARCH RESULTS AND PROPOSED SUB-GRADIENT RESULTS No. of Sub. ˆb,r b,z b,opt 1 [3.56] [4] [4] [3.11,.9] [3, 3] [3, 3] 3 [.75,.61,.5] [3,3,] [3,3,] 4 [.5,.43,.3,.1] [3,,,] [3,,,] 5 [.31,.7,.,.1, ] [,,,,] [,,,,] We frst nvestgate the fast convergence and computaton effcency of the proposed algorthm. Wthout loss of generalty, we assume the avalable subcarrer set after spectrum sensng ncludes two subcarrers experencng Ralyegh fadng. By adoptng the step sze β(n =1of (0, the smulaton (Table I shows the convergence occurs n 4 steps. And through Fg., the mnmal energy effcency s acheved at the optmal constellaton sze vector n two-subcarrer case. Even though the subcarrer set s small n ths smulaton, comparable convergence speed s expected wth the expanson of the avalable subcarer set as shown n (Table II for a 10- subcarrer case. In Fg. 3 and Table III, we compared the performance between the optmal soluton obtaned by exhaustve search and the soluton obtaned by the proposed sub-gradent search algorthm. The system wth the avalable subcarrer set rangng from 1 to 5 subcarrers s shown n ths llustraton. We assume b mn =4. The dashed lne marked wth crcle represents the optmal energy effcency acheved when b s relaxed to real doman and t acts as the performance bound for the achevable energy effcency. The sold lne marked wth square s the acheved energy effcency when b s n the nteger doman. It can be observed that wth the ncrease of the number of subcarrers, the energy effcency s mproved from to at the expense of avalable bandwdth. In Table III, b,opt s the optmal soluton obtaned from exhaustve search that serves as a benchmark. It s observed that the optmal soluton derved by relaxaton (b,z sthe same as that n exhaustve search (b,opt, whch demonstrates the effectveness of the proposed algorthm. Furthermore, the performance gap between the performance bound obtaned by ˆb,r and the acheved energy effcency by usng b s very small as shown n Fg. 3. In Table IV, the constraned case (Secton III-B s demonstrated wth the same system settng as the unconstraned case (Table III except for b mn =10. After obtanng the unconstraned optmal soluton followng the proposed subgradent search algorthm, the unfulflled bts s equally loaded on the avalable subcarrer set whch provdes a suboptmal soluton for the bt loadng wth tractable complexty. It can be observed that even the sub-optmal constant bt loadng strategy offers close performance to the optmal soluton acheved through exhaustve search. Another thng to be noted s that wth the ncrease of avalable subcarrers, the constraned problem evolves nto an unconstraned one wth the ncrease of avalable bandwdth. In Table IV, the fst four cases are Fg. 3. Performance bound vs. acheved energy effcency for b TABLE IV COMPARISON BETWEEN CONSTRAINED SUB-GRADIENT RESULTS AND EXHAUSTIVE SEARCH RESULTS No. of Sub. b,r b,z b,opt 1 [10] [10] [10] [4.98, 5.0] [5, 6] [5, 5] 3 [3.3733, , 3.733] [4, 4, 4] [4,3,3] 4 [.595,.575,.505,.35] [3,3,3,3] [3,3,,] 5 [.7,.3,.,.16, 1.99] [,,,,] [,,,,] correspondng to the constraned problem Case, and the last case s n Case 1. In multple user scenaro, n order to nvestgate the dstrbuted power control for managng the co-channel nterference, we consder two emergng new users who share two common subcarrers as shown n Fg.4. After each user conductng the adaptve modulaton algorthm ndependently, dstrbuted power control s performed to guarantee the BER (P,b requrment by ncreasng the transmsson power. It can be observed that the system converges n 3-4 steps. Fg. 4. Convergence of dstrbuted power control
7 TABLE II CONVERGENCE OF THE PROPOSED SUB-GRADIENT SEARCH ALGORITHM Iteraton No. b (n λ (n λ (n 1 [.5,.8.3,.3,.48,.481,.5,.53,.58,.69] [1.87, , 1.93,.08,.09,.14,.15,.18,.3] [1.8, , 1.88,.04,.05,.11,.1,.14,.6] [1.8, , 1.88,.04,.05,.11,.1,.14,.6] VI. CONCLUSION In ths paper, a fully dstrbuted energy effcent adaptve modulaton algorthm s proposed for a wreless OFDMA cogntve rado ad hoc network. A Dnkelback-type algorthm s proposed to solve the unconstraned optmzaton problem such that energy consumpton for data delvery (n terms of energy per bt s mnmzed over the avalable subcarrer set. A sub-gradent search algorthm s proposed to locate the optmal constellaton sze for each ndvdual user. Gven the delay requrement, a sub-optmal constant bt allocaton strategy s presented to resolve the constraned optmzaton problem. In addton, a dstrbuted power control s performed to manage the co-channel nterference among the new users when needed. Although the proposed algorthm provdes a sub-optmal soluton to the constraned optmzaton problem, t has low computatonal complexty and mplementaton smplcty. Furthermore, for the unconstraned cases, the proposed sub-gradent algorthm turns a mult-dmensonal optmzaton problem nto one-dmensonal search problem wth fast convergence speed. When the network s unable to accommodate the traffc load of all new users n the current tme slot, a schedulng algorthm wth farness consderaton s desred, whch wll be one of our future efforts. In addton, large scale smulaton experments wll be carred out as well. ACKNOWLEDGMENT Ths research work s supported n part by the Natonal Scence Foundaton under award and by the U.S. Army Research Offce under Cooperatve Agreement W911NF VII. APPENDIX A The convexty of the functon (over b. From (15, t s apparent g ( ˆb can be regarded as convex functon. For f ( ˆb, whch s expressed as f ( ˆb :=L k L (ˆb k 1 3α k For each subcarrer k, we defne f k (bk as ( 3 ln ˆb k P + p r,b ( f k (b k :=L ( ˆb k 1 3 ln ˆb k P + p r,b 3α k Fg. 5. convexty of functon The second dervatve of f k(bk over practcal regon [, 10] s gven as ( 3α k L f k(bk ( 3 b k = bk ln ln ˆb k P,b bk +1 ln b k + bk 1 ( b k (6 It s shown n Fg.5, that f k (bk > 0 for [, 10]. Therefore, ( b k f k(bk s convex functon whch wll result n the convexty of functon f ( ˆb. REFERENCES [1] J. Mtola et al, Cogntve rado: makng software rados more personal, IEEE Personal Communcatons, Vol. 6, Issue 4, pp , Aug [] L. Ltwn, and M. Pugel, The Prncples of OFDM, RF Sgnal Processng, pp , Jan [3] S. T. Chung and J. M. Coff, Rate and Power Control n a Two- User Multcarrer Channel Wth No Coordnaton: The Optmal Scheme Versus a Suboptmal Method, IEEE Trans. on Communcatons, Vol. 51, No. 11, pp , Nov [4] S. Gao, L. Qan, D. R. Vaman and Q. Qu, Energy Effcent Adaptve Modulaton n Wreless Cogntve Rado Sensor Networks, IEEE Internatonal Conference on Communcaton, pp , June 007. [5] A. Pandharpande, Adaptve modulaton for MIMO-OFDM systems, IEEE Vehcular Technology Conference, Vol., Issue 6-9, pp , 004. [6] A. J. Goldsmth, S. Chua, Varable-Rate Varable-Power MQAM for Fadng Channels, IEEE Transactons on Communcatons, Vol. 45, No. 10, pp , Oct [7] S. Catreux, V. Erceg, D. Gesbert and R. W. Heath Jr., Adaptve modulaton and MIMO codng for broadband wreless data networks, IEEE Communcaton Magazne, pp , June 00.
8 [8] X. Qu, K. Chawla, On the Performance of Adaptve Modulaton n Cellular System, IEEE Transactons on Communcatons, Vol. 47, No. 6, pp , June [9] J. P. Crouzex, and Ferland, J. A., Algorthms for Generalzed Fractonal Programmng, Mathematcal Programmng, Vol.5, pp , [10] S. Cu, A. J. Goldsmth, and A. Baha, Energy-constraned Modulaton Optmzaton, IEEE Transactons on Wreless Communcatons, Vol. 4, Issue. 5, pp , Sept [11] T. Wess, J. Hllenbrand, A. Krohn, and F. K. Jondral Mutual Interference n OFDM-based Spectrum Poolng Systems, IEEE 59th Vehcular Technology Conference, VTC, Vol. 4, pp , May 004. [1] S. Cu, A. J. Goldsmth, and A. Baha, Cross-layer Optmzaton n Energy-constraned Networks, IEEE Transactons on Wreless Communcatons, Vol. 4, No. 5, pp Sept [13] A. Y. Wang, S. Cho, C. G. Sodn, and A. P. Chandrakasan, Energy effcent modulaton and MAC for asymmetrc RF mcrosensor systems, Internatonal Symposum on Low Power Electroncs and Desgn, pp , Aug [14] R. Yates, A Framework for Uplnk Power Control n Cellular Rado Systems, IEEE Journal on Selected areas n Communcatons, Vol. 13, No. 7, pp , Sept
Distributed Energy Efficient Spectrum Access in Cognitive Radio Wireless Ad Hoc Networks
Dstrbuted Energy Effcent Spectrum Access n Cogntve Rado Wreless Ad Hoc Networks Song Gao, Ljun Qan, Dhadesugoor. R. Vaman ARO/ARL Center for Battlefeld Communcatons Research Prare Vew A&M Unversty, Texas
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 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 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 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 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 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 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 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 informationCalculation of the received voltage due to the radiation from multiple co-frequency sources
Rec. ITU-R SM.1271-0 1 RECOMMENDATION ITU-R SM.1271-0 * EFFICIENT SPECTRUM UTILIZATION USING PROBABILISTIC METHODS Rec. ITU-R SM.1271 (1997) The ITU Radocommuncaton Assembly, consderng a) that communcatons
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 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 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 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 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 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 informationRevision of Lecture Twenty-One
Revson of Lecture Twenty-One FFT / IFFT most wdely found operatons n communcaton systems Important to know what are gong on nsde a FFT / IFFT algorthm Wth the ad of FFT / IFFT, ths lecture looks nto OFDM
More informationDigital Transmission
Dgtal Transmsson Most modern communcaton systems are dgtal, meanng that the transmtted normaton sgnal carres bts and symbols rather than an analog sgnal. The eect o C/N rato ncrease or decrease on dgtal
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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 informationMultipath Propagation. Outline. What is OFDM? (OFDM) for Broadband Communications and. Orthogonal Frequency Division Multiplexing
Orthogonal Dvson Multplexng (OFDM) for Broadband Communcatons and Dgtal Audo Broadcastng (DAB) Klaus Wtrsal wtrsal@nw.tugraz.at VL: Dgtale Audotechnk, 21. März, 2002 What s OFDM? Modulaton technque Requres
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 informationOn the Feasibility of Receive Collaboration in Wireless Sensor Networks
On the Feasblty of Receve Collaboraton n Wreless Sensor Networs B. Bantaleb, S. Sgg and M. Begl Computer Scence Department Insttute of Operatng System and Computer Networs (IBR) Braunschweg, Germany {behnam,
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 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 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 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 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 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 informationImpact of Interference Model on Capacity in CDMA Cellular Networks. Robert Akl, D.Sc. Asad Parvez University of North Texas
Impact of Interference Model on Capacty n CDMA Cellular Networks Robert Akl, D.Sc. Asad Parvez Unversty of North Texas Outlne Introducton to CDMA networks Average nterference model Actual nterference model
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 informationMarkov Chain Monte Carlo Detection for Underwater Acoustic Channels
Markov Chan Monte Carlo Detecton for Underwater Acoustc Channels Hong Wan, Rong-Rong Chen, Jun Won Cho, Andrew Snger, James Presg, and Behrouz Farhang-Boroujeny Dept. of ECE, Unversty of Utah Dept. of
More informationA NEW TRANSMISSION STRATEGY FOR SCALABLE MULTIMEDIA DATA ON OFDM SYSTEMS
15th European Sgnal Processng Conference (EUSIPCO 27), Poznan, Poland, September 3-7, 27, copyrght by EURASIP A NEW TRANSMISSION STRATEGY FOR SCALABLE MULTIMEDIA DATA ON OFDM SYSTEMS Heykel Houas, Cléo
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 informationSelective Sensing and Transmission for Multi-Channel Cognitive Radio Networks
IEEE INFOCOM 2 Workshop On Cogntve & Cooperatve Networks Selectve Sensng and Transmsson for Mult-Channel Cogntve Rado Networks You Xu, Yunzhou L, Yfe Zhao, Hongxng Zou and Athanasos V. Vaslakos Insttute
More informationNATIONAL RADIO ASTRONOMY OBSERVATORY Green Bank, West Virginia SPECTRAL PROCESSOR MEMO NO. 25. MEMORANDUM February 13, 1985
NATONAL RADO ASTRONOMY OBSERVATORY Green Bank, West Vrgna SPECTRAL PROCESSOR MEMO NO. 25 MEMORANDUM February 13, 1985 To: Spectral Processor Group From: R. Fsher Subj: Some Experments wth an nteger FFT
More informationBit Error Probability of Cooperative Diversity for M-ary QAM OFDM-based system with Best Relay Selection
011 Internatonal Conerence on Inormaton and Electroncs Engneerng IPCSIT vol.6 (011) (011) IACSIT Press, Sngapore Bt Error Proalty o Cooperatve Dversty or M-ary QAM OFDM-ased system wth Best Relay Selecton
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 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 informationSubcarrier allocation for OFDMA wireless channels using lagrangian relaxation methods
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
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 informationThe Performance Improvement of BASK System for Giga-Bit MODEM Using the Fuzzy System
Int. J. Communcatons, Network and System Scences, 10, 3, 1-5 do:10.36/jcns.10.358 Publshed Onlne May 10 (http://www.scrp.org/journal/jcns/) The Performance Improvement of BASK System for Gga-Bt MODEM Usng
More informationPRACTICAL, COMPUTATION EFFICIENT HIGH-ORDER NEURAL NETWORK FOR ROTATION AND SHIFT INVARIANT PATTERN RECOGNITION. Evgeny Artyomov and Orly Yadid-Pecht
68 Internatonal Journal "Informaton Theores & Applcatons" Vol.11 PRACTICAL, COMPUTATION EFFICIENT HIGH-ORDER NEURAL NETWORK FOR ROTATION AND SHIFT INVARIANT PATTERN RECOGNITION Evgeny Artyomov and Orly
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 informationUnderstanding the Spike Algorithm
Understandng the Spke Algorthm Vctor Ejkhout and Robert van de Gejn May, ntroducton The parallel soluton of lnear systems has a long hstory, spannng both drect and teratve methods Whle drect methods exst
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 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 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 informationPower Control for Wireless Data
Power Control for Wreless Data Davd Goodman Narayan Mandayam Electrcal Engneerng WINLAB Polytechnc Unversty Rutgers Unversty 6 Metrotech Center 73 Brett Road Brooklyn, NY, 11201, USA Pscataway, NJ 08854
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 informationWideband Spectrum Sensing by Compressed Measurements
Wdeband Spectrum Sensng by Compressed Measurements Davood Mardan Najafabad Department of Electrcal Engneerng Yazd Unversty Emal: d.mardan@stu.yazdun.ac.r Al A. Tadaon Department of Electrcal Engneerng
More informationJoint Data and Power Transfer Optimization for Energy Harvesting Mobile Wireless Networks
Jont Data and Power Transfer Optmzaton for Energy Harvestng Moble Wreless Networs Bassem Khalf, Bechr Hamdaou, Mahd Ben Ghorbel, Mohsen Guzan, and X Zhang Oregon State Unversty, Qatar Unversty, Texas A&M
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 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 informationJoint Subcarrier and CPU Time Allocation for Mobile Edge Computing
Jont Subcarrer and CPU Tme Allocaton for Moble Edge Computng Ynghao Yu, Jun Zhang, and Khaled B. Letaef, Fellow, IEEE Dept. of ECE, The Hong Kong Unversty of Scence and Technology Hamad Bn Khalfa Unversty,
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 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 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 informationEvaluation of Downlink Performance of a Multiple-Cell, Rake Receiver Assisted CDMA Mobile System
Wreless Sensor Network,,, -6 do:.436/wsn.. Publshed Onlne January (http://www.scrp.org/journal/wsn/). Evaluaton of Downlnk Performance of a Multple-Cell, Rake Recever Asssted CDMA Moble System Ayodej J.
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 informationResearch Article Securing OFDM over Wireless Time-Varying Channels Using Subcarrier Overloading with Joint Signal Constellations
Hndaw Publshng Corporaton EURASIP Journal on Wreless Communcatons and Networkng Volume 2009, Artcle ID 437824, 8 pages do:0.55/2009/437824 Research Artcle Securng OFDM over Wreless Tme-Varyng Channels
More informationA Comparison of Two Equivalent Real Formulations for Complex-Valued Linear Systems Part 2: Results
AMERICAN JOURNAL OF UNDERGRADUATE RESEARCH VOL. 1 NO. () A Comparson of Two Equvalent Real Formulatons for Complex-Valued Lnear Systems Part : Results Abnta Munankarmy and Mchael A. Heroux Department of
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 informationResource 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 informationOn Timing Offset and Frequency Offset Estimation in LTE Uplink *
On mng Offset and Frequency Offset Estmaton n LE Uplnk * Juan Lu, Bn Wu, and Pngan L School of Informaton Engneerng, Wuhan Unversty of echnology, No.22 Luosh Road, Hongshan Dstrct,Wuhan, Hube, Chna, 430070
More informationNetwork Reconfiguration in Distribution Systems Using a Modified TS Algorithm
Network Reconfguraton n Dstrbuton Systems Usng a Modfed TS Algorthm ZHANG DONG,FU ZHENGCAI,ZHANG LIUCHUN,SONG ZHENGQIANG School of Electroncs, Informaton and Electrcal Engneerng Shangha Jaotong Unversty
More information熊本大学学術リポジトリ. Kumamoto University Repositor
熊本大学学術リポジトリ Kumamoto Unversty Repostor Ttle Wreless LAN Based Indoor Poston and Its Smulaton Author(s) Ktasuka, Teruak; Nakansh, Tsune CtatonIEEE Pacfc RIM Conference on Comm Computers, and Sgnal Processng
More informationOn Interference Alignment for Multi-hop MIMO Networks
013 Proceedngs IEEE INFOCOM On Interference Algnment for Mult-hop MIMO Networks Huacheng Zeng Y Sh Y. Thomas Hou Wenng Lou Sastry Kompella Scott F. Mdkff Vrgna Polytechnc Insttute and State Unversty, USA
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 informationAdaptive Modulation and Coding for Utility Enhancement in VMIMO WSN Using Game Theory
Adaptve Modulaton and Codng for Utlty nhancement n VMIMO WSN Usng Game Theory R. Vall and P. Dananjayan mparments. The data transmtted from the sensor nodes s hghly susceptble to error n a wreless envronment
More informationNovel Sampling Clock Offset Estimation for DVB-T OFDM
Novel Samplng Cloc Offset Estmaton for DVB-T OFD Hou-Shn Chen Yumn Lee Graduate Insttute of Communcaton Eng. and Department of Electrcal Eng. Natonal Tawan Unversty Tape 67 Tawan Abstract Samplng cloc
More informationDESIGN OF OPTIMIZED FIXED-POINT WCDMA RECEIVER
7th European Sgnal Processng Conference (EUSIPCO 9) Glasgow, Scotland, August -8, 9 DESIGN OF OPTIMIZED FIXED-POINT WCDMA RECEIVER Ha-Nam Nguyen, Danel Menard, and Olver Senteys IRISA/INRIA, Unversty of
More informationMedium Access Control for Multi-Channel Parallel Transmission in Cognitive Radio Networks
Medum ccess Control for Mult-Channel Parallel Transmsson n Cogntve Rado Networs Tao Shu, Shuguang Cu, and Marwan Krunz Department of Electrcal and Computer Engneerng Unversty of rzona Tucson, Z 85721 {tshu,
More informationApproximate Joint MAP Detection of Co-Channel Signals
Approxmate Jont MAP Detecton of Co-Channel Sgnals Danel J Jaubsn and R Mchael Buehrer Moble and Portable Rado Research Group (MPRG), Wreless@VT, Vrgna Tech, Blacsburg, Vrgna, USA E-mal: {djj,buehrer}@vtedu
More informationLow Complexity Duty Cycle Control with Joint Delay and Energy Efficiency for Beacon-enabled IEEE Wireless Sensor Networks
Low Complexty Duty Cycle Control wth Jont Delay and Energy Effcency for Beacon-enabled IEEE 8254 Wreless Sensor Networks Yun L Kok Keong Cha Yue Chen Jonathan Loo School of Electronc Engneerng and Computer
More informationImproved Detection Performance of Cognitive Radio Networks in AWGN and Rayleigh Fading Environments
Improved Detecton Performance of Cogntve Rado Networks n AWGN and Raylegh Fadng Envronments Yng Loong Lee 1, Wasan Kadhm Saad, Ayman Abd El-Saleh *1,, Mahamod Ismal 1 Faculty of Engneerng Multmeda Unversty
More informationIEE Electronics Letters, vol 34, no 17, August 1998, pp ESTIMATING STARTING POINT OF CONDUCTION OF CMOS GATES
IEE Electroncs Letters, vol 34, no 17, August 1998, pp. 1622-1624. ESTIMATING STARTING POINT OF CONDUCTION OF CMOS GATES A. Chatzgeorgou, S. Nkolads 1 and I. Tsoukalas Computer Scence Department, 1 Department
More informationIEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 62, NO. 8, AUGUST
IEEE TRANSACTIONS ON COMMUNICATIONS, VO. 62, NO. 8, AUGUST 2014 2773 Two Tme-Scale Cross-ayer Schedulng for Cellular/WAN Interworkng Amla Tharaperya Gamage, Student Member, IEEE, Hao ang, Member, IEEE,
More informationPower Allocation in Wireless Multi-User Relay Networks
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL 8, NO 5, MAY 2009 2535 Power Allocaton n Wreless Mult-User Relay Networks Khoa T Phan, Student Member, IEEE, Tho Le-Ngoc, Fellow, IEEE, Sergy A Vorobyov,
More informationDESIGN OF OPTIMIZED FIXED-POINT WCDMA RECEIVER
DESIGN OF OPTIMIZED FIXED-POINT WCDMA RECEIVER Ha-Nam Nguyen, Danel Menard, and Olver Senteys IRISA/INRIA, Unversty of Rennes, rue de Kerampont F-3 Lannon Emal: hanguyen@rsa.fr ABSTRACT To satsfy energy
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 informationA New Opportunistic Interference Alignment Scheme and Performance Comparison of MIMO Interference Alignment with Limited Feedback
A New Opportunstc Interference Algnment Scheme and Performance Comparson of MIMO Interference Algnment wth Lmted Feedback Johann Lethon, Chau Yuen, Hmal A. Suraweera and Hu Gao Sngapore Unversty of Technology
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 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 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 information