Medium Access Control for Multi-Channel Parallel Transmission in Cognitive Radio Networks
|
|
- Winfred Harmon
- 5 years ago
- Views:
Transcription
1 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 {tshu, cu, runz}@ece.arzona.edu bstract mult-channel parallel transmsson protocol s proposed for the medum access control n cogntve rado networs CRNs). Ths protocol contans two ey elements: mult-channel assgnment and mult-channel contenton. For an ncomng flow-based connecton request, the mnmum number of parallel channels are assgned to satsfy the rate and nterference mas constrants. For the contenton of the assgned channels, our protocol provdes an extenson of the sngle-channel RTS- CTS-DT-CK handshang of the IEEE scheme. The proposed MC coherently ntegrates optmzaton results nto a practcal mplementaton. Through numercal examples, we verfy that our protocol provdes lower connecton blocng probablty and hgher system throughput for CRNs than ts sngle-channel counterpart. I. INTRODUCTION Over the past few years, we have wtnessed rapd prolferaton of wreless networs n varous envronments home, offce, publc hotspot, and so on). Ths trend wll ultmately lead to ubqutous networng, where not only computers but ordnary electronc devces wll be connected n a wreless way. The large populaton of connected devces mposes a great demand on spectrum resource, whch s now crowded wth most frequency segments beng statcally and exclusvely allocated to specfc types of wreless devces. On the other hand, a recent report from the FCC Spectrum Polcy Tas Force ndcated that at any gven tme and place, less than 10 percent of the allocated spectrum s beng utlzed [1]. To solve ths dlemma and mprove spectrum utlzaton, cogntve rados CRs), have been proposed to mplement opportunstc and dynamc spectrum access [2]. In ths paper, we assume the avalablty of cogntve rado technologes at the physcal layer, and focus our attenton on desgnng a medum access control MC) protocol for multple one-hop pont-to-pont communcatons n a cogntve rado networ CRN). Partcularly, we focus on extendng the contenton-based carrer sensng multple access wth collson avodance CSM/C) scheme defned n the IEEE standard due to ts maturty and wde deployment n practcal networs. basc requrement for CRNs s that the communcaton between CRs should not lead to unacceptable nterference to legacy prmary rados PRs) that share the same channel. The spectrum-sharng nature of CRNs mposes tremendous challenges for MC desgn. Frstly, mult-channel parallel transmssons over a ln are necessary for CRs; to support a prescrbed data rate under a gven nterference mas, a CR needs to use multple parallel channels to reduce ts nterference level by spreadng power over multple bands. The mult-channel assgnment and contenton dffer from the conventonal sngle-channel assgnment and contenton used n current protocols. Secondly, when mult-channel parallel transmssons are adopted, we need to decde the rate and power allocaton across these parallel channels n such a way that certan objectves such as total nterference, rate, or power) are optmzed. Consderng a dedcated control channel for CRNs and N shared data channels between prmary rado networs PRNs) and CRNs, ths paper descrbes and evaluates a novel RTS-CTS-DT-CK based le MC protocol, whch s desgned to support mult-channel parallel transmssons n CRNs. We nvestgate the mnmumpower/rate allocaton across parallel channels under constrants on rate and CR-to-PR nterference. Numercal examples are used to verfy the performance of the proposed protocol n terms of connecton blocng probablty and system throughput. The rest of the paper s organzed as follows. The system model and problem statement are gven n Secton II. Interference-optmal power/rate allocaton over parallel channels s presented n Secton III. Our contenton-based protocol s descrbed n Secton IV. Numercal results are presented n Secton V and conclusons are gven n Secton VI. II. MODEL DESCRIPTION ND PROLEM STTEMENT. System Model We consder a hybrd system consstng of N types of legacy PRNs and one CRN. The N + 1 networs overlap wth each other geographcally. PRs n the same PRN operate over the same frequency band, but the dfferent PRNs are allocated dfferent non-overlappng) bands. lthough n realty a PRN may occupy more than one band, such a networ can be equvalently treated as multple vrtual) PRNs worng over dfferent bands. For the th PRN, we denote ts carrer frequency and bandwdth by f and W, respectvely. The motvaton for usng CRN s to enhance the spectrum utlzaton by allowng CRs to share the same spectrum, W 1... W N, wth the PRNs. Here we consder flowbased traffc for ndvdual CRs. When a CR ntates a flow of rate R 0, t chooses m channels, 1 m N. ccordngly, the data flow s converted nto m parallel sub-flows, whch are transmtted smultaneously over the m selected channels wth approprately assgned powers and rates. Wthout loss of
2 generalty, let the selected set of channels be 1, 2,..., m) and let the transmsson power of CR at channel be denoted as P ), = 1,..., m. To ensure a feasble channel sharng, we have the followng four constrants: 1) Maxmum number of parallel channels: CR can smultaneously use up to M channels from channels 1 to N. Due to the lmtaton of cost, typcally m M N. 2) CR-to-PR nterference spectrum mas: The average transmsson power { of} CR for channel must be constraned by E P ) P ) mas. The vector P mas = P 1) mas,..., P N) mas ) s referred to as the CR-to-PR nterference spectrum mas. Ths mas s needed to ensure that transmssons from a CR wll not cause unacceptable nterference to the co-channel PRs. The determnaton of P mas s certanly an mportant ssue worth nvestgaton, but s out of the scope of ths paper. Here, we smply assume that P mas s gven. 3) Sum-transmsson-power constrant: The total average transmsson power over the m selected channels should { be lmted by a maxmum value P max,.e., m } E P ) P max. Ths constrant s mposed, for example, by the CR s battery. 4) ggregate flow-rate constrant: Let the data rate provded by channel be R.e., the rate of the th subflow). The rate allocaton must satsfy m R = R 0. Here we only consder the case when R 1,..., R m are constants. Ths corresponds to the scenaro where the channel selecton and rate allocaton are decded at the begnnng of the flow, e.g., at the hand-shang phase, and are mantaned throughout the duraton of the flow. To facltate channel sharng, we assume that the th CR node perodcally senses channels and estmates the nstantaneous nterference to the CR at ndvdual channels as a vector I = I 1),..., IN) ). Ths nterference vector s used to drve the channel selecton, rate allocaton, and power control algorthms, as descrbed later. In addton, to coordnate channel access between CRs, we assume that an out-of-band spectrum segment, W N+1, can be assgned to the CRN as a dedcated control channel. CR s capable of ether transmttng or recevng control pacets on ths channel at any tme. It s worth notng that n a pure cogntve rado envronment, a common n-band dedcated control channel may not exst due to the spectrum heterogenety caused by the coexstence of heterogeneous PRNs. The allocaton of an out-of-band control channel greatly smplfes the coordnaton among CRs, but may somehow counter the motvaton of mprovng the spectrum utlzaton through channel sharng. However, because of the short length of control pacets, the bandwdth of the control channel s typcally neglgble compared wth that of the data channels,.e., W N+1 N W. Thus, we argue that the allocaton of a dedcated control channel does not sgnfcantly nfluence the overall spectrum utlzaton of the system.. Problem Statement Wthout loss of generalty, we focus on an arbtrary sourcedestnaton CR par whose flow-rate demand s R 0. The medum access process conssts of two ey elements: channel assgnment and channel contenton. Channel assgnment s executed at the destnaton node, whle channel contenton s conducted n an coordnated way between the source and destnaton CRs. 1) Channel ssgnment: The tas of channel assgnment s to optmally decde the channel selecton and the assocated power/rate allocaton for the selected channels subject to the nterference mas and transmsson power constrants. s mentoned earler, a flow from a source CR s converted nto m parallel sub-flows, whch are transmtted smultaneously over the m selected channels accordng to the assgned rates and powers. To ensure an effcent utlzaton of each channel, the optmal channel assgnment should allocate each flow the mnmum number of channels that satsfy both the rate requrement and nterference constrants. We present the optmal channel assgnment algorthm n Secton III. 2) Channel Contenton: The actual occupyng of the assgned channels s accomplshed by the channel contenton functonalty. In our protocol, the channel contenton mechansm s desgned to ensure non-overlappng local channel occupancy between CRs,.e., a channel whch s occuped by a CR cannot be allocated to other CRs n ts onehop communcaton range. Ths mechansm excludes CR-to- CR nterference although t stll suffers from the co-channel PR-to-CR nterference, thus largely smplfyng the CR-to- PR nterference control process. The ncluson of CR-to-CR nterference by allowng multple CRs to share overlappng channels locally s a more general scenaro for CRNs. However, t demands dstrbuted teratve power adjustment of ndvdual CRs, leadng to potental convergence ssues that can be extremely dffcult to address. Related wor on such a problem has been dscussed n the context of nterference channels, whch s a well-nown open problem [6]. In ths paper, we focus on the smplfed case mentoned above. The detaled contenton protocol s presented n Secton IV. III. OPTIML CHNNEL SSIGNMENT For an ncomng CR access request, we dvde the channel assgnment nto two routnes that are executed teratvely. Frst, for a gven channel assgnment, we compute the optmal power/rate allocaton that leads to the mnmum CR transmsson power under the nterference mas. Second, we change the channel combnaton and repeat the frst procedure. Ths algorthm explores dfferent channel combnatons to see the optmal one that has the mnmum number of channels and requres the mnmum transmsson power whle satsfyng the CR-to-PR nterference mas. Once the optmal channel combnaton s determned, the assocated power/rate allocaton s also determned by routne one.. Optmal Power/Rate llocaton for a Gven Channel Combnaton We consder a one-hop source-destnaton CR par, ) that requres a flow rate of R 0. For an arbtrary channel combnaton, label these channels by 1,..., m. ssumng
3 WGN and treatng nterference as nose, the maxmum errorfree rate of the th channel s gven by the Shannon capacty formula [7]: R = W ln 1 + P ) g) I ) ), = 1,..., m 1) where P ) s the transmsson power of CR on channel, s the dstance-dependent sgnal-power attenuaton over channel, I ) s the nstantaneous nterference-plus-wgn power at CR on channel a random varable n our model), and R s the rate measured n nats/second. To provde a constant rate of R on channel, the transmsson power must satsfy P ) = I) e r 1) 2) def where r = R /W. ccordngly, the expected transmt power s gven by P ) = er 1) Ī) where Ī) = I ) 0 fi) )di) wth fi) ) beng the p.d.f. of the random varable I ). The optmal power/rate control problem can be formulated as optmzng the rate allocaton across channels 1 to m such that the total average transmt power s mnmzed. Mathematcally, ths optmzaton s expressed as mnmze {r1,...,r m} such that m er 1) Ī) g ) m r W = R 0 0 r ln 1 + P ) mas g) Ī ) ) 3) = 1,..., m. 4) The upper bound on r s due to the CR-to-PR nterference mas, whch s gven as e r 1) Ī) P ) mas. n observaton of 4) ndcates that t s a strctly convex optmzaton problem wth upper and lower bounds on ndvdual varables. The optmal soluton r o 1, r o 2,..., r o m) to 4) can be derved by frst removng the upper bounds and then sequentally determnng the varables that exceed ther upper bounds. Specfcally, ths sequental algorthm s descrbed as follows: 1) We frst solve the optmzaton problem where the upper bound on r s not mposed,.e., mnmze {r1,...,r m} such that m er 1) Ī) g ) m r W = R 0 r 0, = 1,..., m. 5) Obvously, 5) s a convex problem and ts Lagrangan s gven by L r, κ, ɛ) = 6) where κ and ɛ = ɛ 1,..., ɛ m ) are the Lagrange multplers, κ s an arbtrary real number, and ɛ s are nonnegatve real numbers. Wthout loss of generalty, we ran the channels such that g1) W1 Ī 1) g m) W m Ī m) closed form: and g2) W2 Ī 2).... The optmal soluton to 5) can be obtaned n κ = exp r o = max R 0 K1 W ) { ln κg) W Ī ) K 1 Ī) W, 0 } ) W K1 W 7) 8) where K 1, 1 K 1 m, s determned n a way such that fk 1 ) > 1 and fk 1 + 1) 1, wth the functon fn) defned as: fn) = gn) W n Ī n) R 0 n exp n W ) Ī) W ) W n W 9) for 1 n m. The unqueness of such a K 1 can be proved n a smlar way as n [4]. Denote the channel set n the desgn space by V, whch ntally ncludes {1,..., m}. 2) Due to the monotoncally-ncreasng property of the objectve functon over r s [5], f any of the r o n 7) volates the upper bound on r n 4), then the correspondng bounded optmal soluton r o the upper bound tself,.e., r o = ln must ) be. 1 + P ) mas g) Ī ) Denote the set of channels whose unbounded optmal solutons exceed ther upper bounds by U, and we set V = V U. 3) Wth the nowledge of r o for U, the objectve functon n 4) s modfed to the followng form mnmze {r V} V e r 1) Ī). 10) ccordngly, we set R 0 = R 0 U ro W, and the rate constrant n 4) s updated as r j W j. 11) V r W = R 0 j U The modfed optmzaton problem, whch conssts of the objectve functon 10), the rate constrant 11), and r 0, V, s a degenerated verson of 4). The un-bounded optmal soluton to ths new optmzaton problem has the same form as n 7) and 8). 4) Steps 2) and 3) are repeated untl all un-bounded solutons r o of the degenerated problem are wthn ther bounds. The mnmzed sum transmsson power of CR can be e r 1) Ī) +κr 0 r W ) ɛ r, derved by substtutng the optmal rate allocaton r1, o..., rm) o nto the objectve functon of 4). Ths value s compared aganst the transmsson power upper bound P max to decde
4 whether the gven channel combnaton s feasble. Dfferent channel combnatons wll be tested usng the above algorthm and the optmal channel assgnment s found among those feasble combnatons, as descrbed n the subsequent secton. In addton, to mantan the assgned rates for ndvdual channels through the flow duraton, CR conducts closedloop power control based on the feedbac of the recever-sde nstantaneous nterference level. The optmal power control polcy n channel s derved by substtutng r o nto 2), whch ) leads to the desred average power P.. Optmal Channel ssgnment The optmal channel selecton s a feasble channel combnaton that contans the mnmum number of channels among all feasble combnatons nvolvng wth no more than M channels. In case that more than one feasble combnatons contan the same mnmum number of channels, the one requrng the mnmum sum transmsson power wll be selected. The search process can be effcently mplemented by sequentally explorng the channel combnatons, startng from those contanng only one channel, wth the goal of fndng the mnmum-sze optmal combnaton. If there s no feasble channel combnaton n current round, the algorthm proceeds to those combnatons contanng two channels, and so on. The search contnues untl an optmal combnaton s found, or all combnatons contanng no more than M channels have been tested. Therefore, n the worst case, a total number of M C N channel combnatons need to be tested by the algorthm, where Cx y x! = y!x y)! for ntegers x, y, y x. IV. PROTOCOL DESCRIPTION ased on the optmal channel assgnment algorthm presented n Secton III, we now descrbe the proposed MC protocol for CRNs. Ths protocol s an extenson of the snglechannel RTS-CTS-DT-CK handshang scheme used n the standard. For brevty, we only focus on the parallelchannel transmsson aspect n our descrpton. To facltate mult-channel contenton, each CR needs to mantan a local free-channel table FCT). Ths table contans the set of channels that are un-occuped by other CRs wthn the node s one-hop communcaton range. Intally, the FCT contans all N data channels and s contnuously updated accordng to the channel access dynamcs. The proposed protocol s specfed as follows. 1) Whenever a CR s dle,.e., nether transmttng nor recevng data, t lstens to the control channel and updates ts FCT as descrbed n STEP 3. When a CR ntends to establsh a flow-based connecton, t transmts a requestto-send RTS) pacet to the destnaton CR over the control channel usng the largest transmsson power and the physcal carrer sensng scheme. Specfcally: a) ll channels n the FCT of the source CR are ndcated n ths RTS pacet. The duraton of the flow DOF), whch s gven by dvdng the flow length n the unts of bts) by the desred flow rate, s also gven n the RTS pacet. Ths nformaton provdes other CRs wth an estmate of the endng tme of the underlyng flow. b) If the FCT at the source CR s empty, the source CR defers ts RTS transmsson, bacs off, and retransmts the RTS pacet at the end of bacoff. Durng the bacoff perod, the source CR contnues to lsten to the control channel and eeps updatng ts FCT as descrbed later n STEP 3. c) Other nodes recevng the RTS on the control channel defer ther control-pacet transmsson untl the appearance of the ECTS pacet descrbed later n STEP 3) or the tmeout of a predefned perod. The tmeout value should be set reasonably larger than the typcal nterval between the RTS and the ECTS to avod nterruptng normal hand-shang. 2) Upon successful recepton of the RTS pacet but before transmttng the clear-to-send CTS) pacet, the destnaton CR conducts the logc and operaton between ts FCT and the source CR s FCT. Those channels that appear n both FCTs are tagged as avalable channels for the data communcaton. ased on ths set of avalable channels, the followng actons are taen: a) The channel assgnment algorthm descrbed n Secton III s executed to test varous combnatons of the avalable channels. b) If a partcular combnaton of m channels s selected, the denttes of these channels and the assocated power/rate allocaton nformaton are ndcated n the CTS pacet. In addton, the destnaton CR also copes the DOF nformaton from the RTS pacet to the CTS pacet. If the set of avalable channels s empty or f no feasble channel combnaton s found by the channel assgnment algorthm, an empty flag wll be ndcated n the CTS. 3) When the source CR receves the CTS pacet, t transmts an Echo-CTS ECTS) pacet over the control channel, ncludng n ths pacet the channel assgnment and DOF nformaton provded n the CTS. fter that, the source and destnaton CRs begn the parallel dataflow communcaton on the assgned channels usng the assgned powers and rates. ll other CRs that overhear the CTS and ECTS pacets wll remove the assgned channels from ther local FCTs for a DOF amount of tme. When the DOF-equvalent tme expres, these channels wll be appended bac nto ther local FCTs. If an empty flag s ndcated n the CTS and ECTS, the source CR enters bacoff and retres afterwards. 4) Durng the flow transmsson, both the source and the destnaton CRs eep lstenng to the control channel for CTS and ECTS pacets from other CRs, and updatng ther FCTs accordngly as descrbed n STEP 3. In addton, to mantan the assgned rates for ndvdual subflows through the flow duraton, the source CR conducts closed-loop power control based on the feedbac of the recever-sde nstantaneous nterference level. The rule for ths power control has been gven by 2).
5 V. PERFORMNCE EVLUTION To evaluate the effectveness of the proposed MC protocol, we conducted numercal experments usng MTL and also smulated a hybrd system that conssts of 2 PRNs and 1 CRN. Nodes n these networs are unformly dstrbuted over a 100- meter-radus crcular area. The frst PRN operates n the 900 MHz band, occupyng fve non-overlappng 1-MHz channels that are labelled as channels 1 to 5 n the smulaton. The numbers of PRs n each channel are 100, 200, 300, 400, and 500, respectvely. The second PRN operates n the 2.4 GHz band, also occupyng fve non-overlappng 1-MHz channels that are labelled as channels 6 to 10 n the smulaton. The numbers of PRs n each channel of PRN 2 are 100, 200, 300, 400, and 500, respectvely. The sgnal strength s attenuated by d 4 wth d the propagaton dstance [7]. We dvde the tme nto slots, each of length 10 ms. t any gven slot, each PR n the frst and the second PRNs attempts to transmt wth a probablty of 0.1 and 0.4, respectvely. The transmsson power of each PR s 1 W when t s on. We smulated 10 pars of one-hop source-destnaton CRs. To smplfy our smulaton, we assume that the dstance between each par s equal, and we tae the path loss to be - 30 d. We assume that all CRs are wthn the transmsson range of each other, so that any control pacet sent from a CR can be heard by all other CRs. The nstantaneous nterference sensed by a CR n a certan channel s the sum of the nterference from all actve co-channel PRs. The flow generaton at each source CR follows a Posson process wth parameter λ flows/second. Each flow has an exponentally dstrbuted duraton wth mean 1/µ second. The flow from the th source CR requres a constant data rate of 0.5 MegNats/second. We assume that a CR can use up to two data channels smultaneously. We set the CR-to-PR nterference spectrum mas to P 1) mas =... = P 10) mas = 20 mw, and the transmsson-power upper bound to P max = 20 mw. We compare the performance of the mult-channel parallel transmsson MC protocol wth the mult-channel RCS MC protocol proposed n [3]. In contrast to our proposed mult-channel parallel transmsson strategy, the mult-channel RCS protocol only selects the best avalable channel for data transmsson.e., a node uses only one channel at a tme). lthough t s not orgnally desgned for a CRN, we adapt t to the CRN applcaton by modfyng the channel selecton condton: f the average transmsson power assocated wth the best avalable channel satsfes the CR-to-PR nterference mas, then t wll be selected; otherwse no channel wll be assgned and the ncomng access request wll bac off. The performance crtera to compare nclude the connecton blocng rate plotted n Fgure 2) and the system throughput plotted n Fgure 3). The connecton blocng rate s defned as the rato between the number of requests that end n bacoff to the total number of connecton requests. The system throughput s defned as the average volume of CR traffc transmtted by the system n one second. The smulaton results verfy that sgnfcant reducton n the connecton blocng probablty and consderable ncrease n throughput are acheved by the proposed MC protocol. Connecton blocng probablty percentage) Networ throughput Mnats/second) mult-channel RCS mult-channel parallel Fg traffc rate λ/µ) Connecton blocng rate vs. traffc load Fg. 2. mult-channel RCS mult-channel parallel traffc rate λ/µ) System throughput vs. traffc load. VI. CONCLUSIONS mult-channel parallel transmsson protocol was proposed for medum access control n cogntve rado networs. Ths protocol contans two ey elements: mult-channel assgnment and mult-channel contenton. The proposed MC coherently ntegrates the optmzaton results n mult-channel assgnment nto a practcal mplementaton of the multchannel contenton. Compared wth a reference protocol, the proposed one provdes better spectrum utlzaton n terms of smaller connecton blocng probablty and larger system throughput. REFERENCES [1] Federal Communcatons Commsson, Spectrum Polcy Tas Force, Rep. ET Docet no , Nov [2] S. Hayn, Cogntve rado: ran-empowered wreless communcatons, IEEE Journal on Selected reas n Communcatons, vol. 23, no. 2, pp , Feb [3] N. Jan, S. R. Das, and. Naspur, multchannel CSM MC protocol wth recever-based channel selecton for multhop wreless networs, Proc. IEEE ICCCN, [4] J. Xao, S. Cu, Z. Q. Luo, and. J. Goldsmth, Power schedulng of unversal decentralzed estmaton n sensor networs, IEEE Transactons on Sgnal Processng, vol. 54, no. 2, pp , Feb [5] S. Cu, J. Xao,. J. Goldsmth, Z. Q. Luo, and H. V. Poor, Estmaton dversty wth multple heterogeneous sensors, to appear at Proc. IEEE ICC, June [6] W. Yu, W. Rhee, S. oyd, and J. Coff, Iteratve water-fllng for Gaussan vector multple access channels, IEEE Transactons on Informaton Theory, vol. 50, no. 1, pp , Jan [7] T. S. Rappaport, Wreless Communcaton Prncples and Practce, Prentce Hall, 1996.
Dynamic 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 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 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 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 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 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 informationPrevention of Sequential Message Loss in CAN Systems
Preventon of Sequental Message Loss n CAN Systems Shengbng Jang Electrcal & Controls Integraton Lab GM R&D Center, MC: 480-106-390 30500 Mound Road, Warren, MI 48090 shengbng.jang@gm.com Ratnesh Kumar
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 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 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 informationTo: Professor Avitabile Date: February 4, 2003 From: Mechanical Student Subject: Experiment #1 Numerical Methods Using Excel
To: Professor Avtable Date: February 4, 3 From: Mechancal Student Subject:.3 Experment # Numercal Methods Usng Excel Introducton Mcrosoft Excel s a spreadsheet program that can be used for data analyss,
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 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 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 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 informationA Novel DSA-Driven MAC Protocol for Cognitive Radio Networks
Wreless Sensor Networ, 29, 2, 6-2 do:.4236/wsn.29.2 7 Publshed Onlne July 29 (http://www.scrp.org/journal/wsn/). A Novel DSA-Drven MAC Protocol for Cogntve Rado Networs Hua SONG, Xaola LIN School of Informaton
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 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 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 informationPriority based Dynamic Multiple Robot Path Planning
2nd Internatonal Conference on Autonomous obots and Agents Prorty based Dynamc Multple obot Path Plannng Abstract Taxong Zheng Department of Automaton Chongqng Unversty of Post and Telecommuncaton, Chna
More informationThe Synthesis of Dependable Communication Networks for Automotive Systems
06AE-258 The Synthess of Dependable Communcaton Networks for Automotve Systems Copyrght 2005 SAE Internatonal Nagarajan Kandasamy Drexel Unversty, Phladelpha, USA Fad Aloul Amercan Unversty of Sharjah,
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 informationMTBF PREDICTION REPORT
MTBF PREDICTION REPORT PRODUCT NAME: BLE112-A-V2 Issued date: 01-23-2015 Rev:1.0 Copyrght@2015 Bluegga Technologes. All rghts reserved. 1 MTBF PREDICTION REPORT... 1 PRODUCT NAME: BLE112-A-V2... 1 1.0
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 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 informationQueuing-Based Dynamic Channel Selection for Heterogeneous Multimedia Applications over Cognitive Radio Networks
1 Queung-Based Dynamc Channel Selecton for Heterogeneous ultmeda Applcatons over Cogntve Rado Networks Hsen-Po Shang and haela van der Schaar Department of Electrcal Engneerng (EE), Unversty of Calforna
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 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 informationA Fuzzy-based Routing Strategy for Multihop Cognitive Radio Networks
74 Internatonal Journal of Communcaton Networks and Informaton Securty (IJCNIS) Vol. 3, No., Aprl 0 A Fuzzy-based Routng Strategy for Multhop Cogntve Rado Networks Al El Masr, Naceur Malouch and Hcham
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 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 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 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 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 informationHigh Speed, Low Power And Area Efficient Carry-Select Adder
Internatonal Journal of Scence, Engneerng and Technology Research (IJSETR), Volume 5, Issue 3, March 2016 Hgh Speed, Low Power And Area Effcent Carry-Select Adder Nelant Harsh M.tech.VLSI Desgn Electroncs
More informationUncertainty in measurements of power and energy on power networks
Uncertanty n measurements of power and energy on power networks E. Manov, N. Kolev Department of Measurement and Instrumentaton, Techncal Unversty Sofa, bul. Klment Ohrdsk No8, bl., 000 Sofa, Bulgara Tel./fax:
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 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 informationFrequency Assignment for Multi-Cell IEEE Wireless Networks
Frequency Assgnment for Mult-Cell IEEE 8 Wreless Networks Kn K Leung Bell Labs, Lucent Technologes Murray Hll, NJ 7974 kn@bell-labscom Byoung-Jo J Km AT&T Labs Research Mddletown, NJ 7748 macsbug@researchattcom
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 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 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 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 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 informationA Predictive QoS Control Strategy for Wireless Sensor Networks
The 1st Worshop on Resource Provsonng and Management n Sensor Networs (RPMSN '5) n conjuncton wth the 2nd IEEE MASS, Washngton, DC, Nov. 25 A Predctve QoS Control Strategy for Wreless Sensor Networs Byu
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 informationFuzzy Logic Power Control in Cognitive Radio
Fuzzy Logc ower Control n Cogntve Rado Zeljko Tabakovc Croatan ost and Electronc Communcatons Agency Jursceva 3 Zagreb, Croata zeljkotabakovc@telekomhr Sonja Grgc, Mslav Grgc Unversty of Zagreb, Faculty
More informationAchieving Transparent Coexistence in a Multi-hop Secondary Network Through Distributed Computation
Achevng Transparent Coexstence n a Mult-hop econdary Network Through Dstrbuted Computaton Xu Yuan Y h Y. Thomas Hou Wenng Lou cott F. Mdkff astry Kompella Vrgna olytechnc Insttute and tate Unversty, UA
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 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 informationOptimal Sizing and Allocation of Residential Photovoltaic Panels in a Distribution Network for Ancillary Services Application
Optmal Szng and Allocaton of Resdental Photovoltac Panels n a Dstrbuton Networ for Ancllary Servces Applcaton Reza Ahmad Kordhel, Student Member, IEEE, S. Al Pourmousav, Student Member, IEEE, Jayarshnan
More informationKing s Research Portal
Kng s Research Portal DOI: 10.1109/TWC.2015.2460254 Document Verson Peer revewed verson Lnk to publcaton record n Kng's Research Portal Ctaton for publshed verson (APA): Shrvanmoghaddam, M., L, Y., Dohler,
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 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 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 informationDynamic Lightpath Protection in WDM Mesh Networks under Wavelength Continuity Constraint
Dynamc Lghtpath Protecton n WDM Mesh etworks under Wavelength Contnuty Constrant Shengl Yuan* and Jason P. Jue *Department of Computer and Mathematcal Scences, Unversty of Houston Downtown One Man Street,
More informationProcedia Computer Science
Proceda Computer Scence 3 (211) 714 72 Proceda Computer Scence (21) Proceda Computer Scence www.elsever.com/locate/proceda www.elsever.com/locate/proceda WCIT-21 Performance evaluaton of data delvery approaches
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 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 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 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 informationJoint Channel Assignment and Opportunistic Routing for Maximizing Throughput in Cognitive Radio Networks
Jont Channel Assgnment and Opportunstc Routng for Maxmzng Throughput n Cogntve Rado Networs Yang Qn*, Xaoxong Zhong*, Yuanyuan Yang +,Yanln L* and L L* *Key Laboratory of Networ Orented Intellgent Computaton,
More informationSecure Transmission of Sensitive data using multiple channels
Secure Transmsson of Senstve data usng multple channels Ahmed A. Belal, Ph.D. Department of computer scence and automatc control Faculty of Engneerng Unversty of Alexandra Alexandra, Egypt. aabelal@hotmal.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 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 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 informationOptimal Multicast in Multi-Channel Multi-Radio Wireless Networks
Optmal Multcast n Mult-Channel Mult-Rado Wreless Networks Aay Gopnathan, Zongpeng L, Carey Wllamson Department of Computer Scence, Unversty of Calgary {agopnat,zongpeng,carey}@cpsc.ucalgary.ca Abstract
More informationHigh Speed ADC Sampling Transients
Hgh Speed ADC Samplng Transents Doug Stuetzle Hgh speed analog to dgtal converters (ADCs) are, at the analog sgnal nterface, track and hold devces. As such, they nclude samplng capactors and samplng swtches.
More informationDistributed Adaptive Channel Allocation in Multi-Radio Wireless Sensor Networks
Journal of Communcatons Vol., No., November 26 Dstrbuted Adaptve Channel Allocaton n Mult-Rado Wreless Sensor Networks We Peng, Dongyan Chen, Wenhu Sun, and Guqng Zhang2,3 School of Control Scence and
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 informationAsynchronous TDMA ad hoc networks: Scheduling and Performance
Asynchronous TDMA ad hoc networks: Schedulng and Performance Theodoros Salonds and Leandros Tassulas, Department of Electrcal and Computer Engneerng and Insttute of Systems Research Unversty of Maryland,
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 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 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 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 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 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 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 informationNETWORK 2001 Transportation Planning Under Multiple Objectives
NETWORK 200 Transportaton Plannng Under Multple Objectves Woodam Chung Graduate Research Assstant, Department of Forest Engneerng, Oregon State Unversty, Corvalls, OR9733, Tel: (54) 737-4952, Fax: (54)
More informationAsynchronous TDMA ad hoc networks: Scheduling and Performance
Communcaton Networks Asynchronous TDMA ad hoc networks: Schedulng and Performance THEODOROS SALONIDIS AND LEANDROS TASSIULAS, Department of Electrcal and Computer Engneerng, Unversty of Maryland at College
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 informationTest 2. ECON3161, Game Theory. Tuesday, November 6 th
Test 2 ECON36, Game Theory Tuesday, November 6 th Drectons: Answer each queston completely. If you cannot determne the answer, explanng how you would arrve at the answer may earn you some ponts.. (20 ponts)
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 informationA Spreading Sequence Allocation Procedure for MC-CDMA Transmission Systems
A Spreadng Sequence Allocaton Procedure for MC-CDMA Transmsson Systems Davd Motter, Damen Castelan Mtsubsh Electrc ITE 80, Avenue des Buttes de Coësmes, 35700 Rennes FRAE e-mal: {motter,castelan}@tcl.te.mee.com
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 informationA Unified Cross-Layer Framework for Resource Allocation in Cooperative Networks
3000 IEEE TRNSCTIONS ON WIRELESS COMMUNICTIONS, VOL. 7, NO. 8, UGUST 2008 Unfed Cross-Layer Framework for Resource llocaton n Cooperatve Networks We Chen, Member, IEEE, Ln Da, Member, IEEE, Khaled Ben
More informationAn Optimal Model and Solution of Deployment of Airships for High Altitude Platforms
An Optmal Model and Soluton of Deployment of Arshps for Hgh Alttude Platforms Xuyu Wang, Xnbo Gao, Ru Zong, Peng Cheng. VIPS Lab, School of Electronc Engneerng, Xdan Unversty, X an 77, Chna. Department
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 informationAn Energy Efficient Hierarchical Clustering Algorithm for Wireless Sensor Networks
An Energy Effcent Herarchcal Clusterng Algorthm for Wreless Sensor Networks Seema Bandyopadhyay and Edward J. Coyle School of Electrcal and Computer Engneerng Purdue Unversty West Lafayette, IN, USA {seema,
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 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 informationDistributed Topology Control of Dynamic Networks
Dstrbuted Topology Control of Dynamc Networks Mchael M. Zavlanos, Alreza Tahbaz-Saleh, Al Jadbabae and George J. Pappas Abstract In ths paper, we present a dstrbuted control framework for controllng the
More informationA Preliminary Study on Targets Association Algorithm of Radar and AIS Using BP Neural Network
Avalable onlne at www.scencedrect.com Proceda Engneerng 5 (2 44 445 A Prelmnary Study on Targets Assocaton Algorthm of Radar and AIS Usng BP Neural Networ Hu Xaoru a, Ln Changchuan a a Navgaton Insttute
More informationQoS Provisioning in Wireless Data Networks under Non-Continuously Backlogged Users
os Provsonng n Wreless Data Networks under Non-Contnuously Backlogged Users Tmotheos Kastrnoganns, and Symeon Papavasslou, Member, IEEE School of Electrcal and Computer Engneerng Natonal Techncal Unversty
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 informationRedes de Comunicação em Ambientes Industriais Aula 8
Redes de Comuncação em Ambentes Industras Aula 8 Luís Almeda lda@det.ua.pt Electronc Systems Lab-IEETA / DET Unversdade de Avero Avero, Portugal RCAI 2005/2006 1 In the prevous epsode... Cooperaton models:
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 information760 IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 30, NO. 4, MAY 2012
760 IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 30, NO. 4, MAY 2012 Cooperatve Communcaton Aware Lnk Schedulng for Cogntve Vehcular Networks Mao Pan, Student Member, IEEE, PanL,Member, IEEE
More informationFair Scheduling for Real-Time Multimedia Support in IEEE Wireless Access Networks
Far Schedulng for Real-Tme Multmeda Support n IEEE 802.16 Wreless Access Networs Yaser P. Fallah Inst. of Transportaton Studes (Depts EECS & CEE), Unversty of Calforna at Bereley, USA e-mal: yaserpf@eecs.bereley.edu
More informationCOMPARISON OF DIFFERENT BROADCAST SCHEMES FOR MULTI-HOP WIRELESS SENSOR NETWORKS 1
Internatonal Journal of Computer Networks & Communcatons (IJCNC), Vol., No.4, July 1 COMARISON OF DIFFERENT BROADCAST SCHEMES FOR MULTI-HO WIRELESS SENSOR NETWORKS 1 S. Mehta and K.S. Kwak UWB Wreless
More information