IN case of bursty data sources, multiple access schemes
|
|
- Reynard Green
- 6 years ago
- Views:
Transcription
1 Token Enabled Multple Access (TEMA) for Packet Transmsson n Hgh t Rate Wreless Local Area etworks Saed Akhavan Taher Elecrcal & Computer Eng. Dept., Unversty of ew Mexco Emal: saed@eece.unm.edu Anna Scaglone School of Elecrcal & Computer Eng., Cornell Unversty Emal: anna@ece.cornell.edu Abstract In ths paper we llustrate a novel Wreless Local Area etwork Multple Access Control (WLA MAC) protocol whose allocaton polcy adopts a strategy smlar to the token rng: the moble statons access the channel upon recevng the token and release the channel by passng the token to the next user. The traffc s dvded n two classes: Guaranteed andwdth (G) and est Effort (E). The base staton ndrectly controls the traffc access by allottng the tokens and the bandwdth s shared by the same users wth a decentralzed contenton-less protocol n case of the G users and on a contenton bass for the E users. The MAC protocol proposed the physcal layer adopts a Multcarrer Code Dvson Multple Access multplexng technque, whch mtgates the lnear dstortons of broadband transmsson and allows to dvde the frequency and tme resources n elementary unts that can be assocated to the token. The specfcaton on the average and peak delay and rate are guaranteed by lmtng the number of users passng the token and fxng a deadlne to release the token. At the same tme, smlar to a reservaton based protocol, the token strategy avods collsons and s able to guarantee effcently the ntegrty of the transmtted data. Index Terms Wreless etworks, Multple Access I. ITRODUCTIO I case of bursty data sources, multple access schemes that perform a statc channel assgnment, such as TDMA, FDMA, CDMA, SDMA, are known to be neffcent compared to contenton based multple access protocols. ALOHA-type random access protocols have been proposed to solve the problem of contenton based systems []. However, n hgh traffc condtons ALOHA-type (slotted and un-slotted) random access protocols yeld relatvely low throughput, due to the hgh collson probablty. The carrer Sense Multple Access Protocols (CSMA wth collson detecton, non-persstent, - persstent and p-persstent) offer a more effcent alternatve to ALOHA protocols. In CSMA the staton lstens to the carrer and when the channel s dle, transmts a packet []. In partcular, CSMA wth collson detecton (CD), whch s used as a standard Ethernet protocol, mnmzes the channel downtme. CSMA/CD yelds a hgh throughput when the propagaton delays (τ d ) are relatvely small n comparson to the packet duraton (τ d < T p ) []. An alternatve scheme s the so called Demand Assgned Multple Access (DAMA) where a separate request channel s used by the users to request a specfc rate. The request s processed by a central master staton or a common algorthm runnng n each termnal []. DAMA s a dynamc reservaton-based algorthm and t s effectve when the set of actve transmtters changes rapdly. Schedulng at packet level accordng to the demanded QoS have been consdered n several works: a comprehensve survey on packet schedulng n wreless networks s provded n [3]. In ths paper we propose a dstrbuted multple access control scheme, named Token Assgnment Multple Access (TEMA), desgned to handle effcently heterogenous classes of traffc n heavy traffc load. Our scheme manly s based on the pollng and the token rng concept. Pollng multple access protocols have been consdered for local communcaton networks for wred meda [3], [8], [9]. In these protocols the termnals are nterrogated n a cyclc order, by ether a central controller or, n a dstrbuted fashon, by usng specalzed pollng query/response (token) packets [4]. The statons are organzed nto a rng (they are, n fact, named token-rng networks and physcally they can be organzed n a tree shaped cable) and each staton knows the addresses of the statons at ts left and rght. When the logcal rng s ntalzed, the hghest numbered staton sends the frst frame. Subsequently, the staton passes the permsson to ts mmedate neghbor by sendng to the neghbor a specal control frame called a token. Token rng are one of the most relable LA n the ndustry [7]. However, wred token rng networks have the dsadvantage that a broken secton n the rng cable causes an outage of the whole network. Also, n comparson to the other MAC protocols, the token-passng MAC has control overhead [0]. To analyze the TEMA network performance we extend the prorty-based token rng to the wreless settng and borrow results from [7], [8], whch derve the performance of prorty pollng schemes desgned to provde sochronous and asynchronous type servces for wred meda. For the QoS specfcatons we provde a coarser separaton by dentfyng only two classes of servce, Guaranteed andwdth (G) and est Effort (E) classes. TEMA s ntalzed s wth a random access protocol: Accordng to the demanded QoS the base staton ntalzes the rngs, by allottng a subchannel (token) to a set of users (rng). The demanded contenton free part for hgh QoS users s constructed n a dstrbuted manner, by passng the token from user to user. Usng the rest of the resources through contenton based scheme we do not waste bandwdth. The rest of ths paper s organzed as follows. Secton I s dedcated to the descrpton of the basc TEMA dea and s followed by the descrpton of the specfc MC-CDMA physcal layer that we choose to support the TEMA archtecture. Secton IV shows the performance analyss and comparson between exstng multple access modes. II. TEMA: TOKE EALED MULTIPLE ACCESS Consder users U ordered by, =,..., wshng to communcate wth a base staton through a multpleaccess communcaton channel. Our dea s to logcally organze groups of users n subnetworks (nterconnected wreless /0/$ IEEE 93
2 token rngs), so that wth the pollng dscplne whch s not centralzed each user polls the consecutve user n the carousel (see fgure ). Each of the users n the rng are quered by an algorthm n a dstrbuted fashon. If the answer to ths query s postve, the channel s completely assgned to the user for data transmsson. Upon completon the transmsson or gvng negatve answer to the query, the control polls the next user n order. A staton s served untl ether ) ts buffer s empted, or ) a specfed tme slot to the user s over, whchever occurs frst. Each token corresponds to a physcal MC-CDMA subchannel whch s guaranteed to have a certan average rate and satsfy a probablty of error bound, as descrbed n detal n Secton III. "! $#&%' one rotaton of the hgh-prorty token n the tme left the low-prorty token wll rotate. C. on-homogenous traffc, hgh qualty of servce and bursty traffc. In ths scheme the token passng overhead s avoded for the bursty data by alternatng the users that pass the token wth a contenton based perod where all bursty data sources contend the bandwdth wth a CSMA strategy. Fgure shows the actvty of the channel for these three denote the servce tme for th user n kth recepton of token, be the length of the kth token cycle for user and be the so called walk tme, whch ncludes the token passng overhead. Smlar to [3], we defne Q (K) to be transmsson quota,.e., for each token cycle the th user schemes. Let message duraton s lmted, Q (K). From fg., denotng by Ŵ = we can derve the followng relatons between and for each of the proposed schemes: For scheme shown n Fg. A), = Ŵ + M j= j. () Fg.. Pollng wth cyclc vst orderng for users and one server. For scheme shown n Fg. ), To smplfy the scheme s analyss and havng analogy wth the exstng schemes for fber dstrbuted data nterface (FDDI) [5], only two dfferent classes of QoS are consdered: the guaranteed bandwdth (G) class, for whch the requrement s ether that P r(delay > D) < ɛ or P r(end to end packet loss) < ɛ for a gven ɛ, and the best effort (E) class, for whch there s no requrement. Several prorty-based token schemes for wred networks have been studes [7]. In partcular, one of our schemes (the second one presented below) shares smlartes wth the delayconstraned scheme n [7], where messages are dvded n hgh prorty and low prorty messages. y defnng two types of tokens, hgh level and low level, the system allows all users n the rng to send ther hgh level messages at frst and then low level messages. Ths scheme s not well talored for wreless communcatons, snce the type of load and bandwdth usage and probablty of error are dfferent. We propose three dfferent token-schemes applcable to the wreless meda for: A. Homogenous traffc; n ths scheme all users demandng a sngle type of servce wth hgh qualty (e.g., broadband multmeda). Hence, only one type of token (prorty) s consdered. To satsfy the tght delay requrements, a lmted dwell tme polcy s appled to ths scheme.. on-homogenous traffc; n ths scheme there are non-bursty to moderately-bursty users whch requre hgher and lower QoS respectvely. Ths scheme s appled when the users can have two dfferent type of demanded QoS. In the rng frst all hgh-prorty users are served whle the remanng resources are dedcated to the low prorty packets. In ths scheme, hghprorty and low-prorty tokens are employed. After = Ŵ + j= M Fnally, for scheme 3 shown n Fg. C), = Ŵ + j= F j= T (CSMA) j. () j. (3) Each token s not only assocated to a physcal set of subcar- -M M -M M Q Q Q -M-s -M-s+ Q Q -M-s+ -M M Q Q Q Q Q -M-s -M-s+ -M-s+ -M -M M Q Q -M-s Q A) G traffc. ) G traffc wth two dfferenent prortes -M T C) G and E traffc ----Random Access--- Fg.. Tmng dagram for dfferent token passng approaches; Guaranteed andwdth (G) and est Effort (E) traffc. 94
3 rers but also to a fxed frame duraton, the token cycle. The maxmum number of users supported n a rng and the token cycle depend on the QoS that the rng has to support and on the bandwdth lmtatons of the physcal layer. Wth reference to Fg. A, to guarantee P r(delay < D) < ɛ, we assgn users to be the prmary members of the rng, but ndeed only M of them are usng resources. M s a random varable ndcatng the number of users are slent n the rng. The prmary rng members are guaranteed to receve the token after at most the tme equal to +Q (K) +. In scheme 3, the M vacances goes for the M other members, that have no QoS guarantees, share the remanng tme usng random access. They can experence any delay or packet loss, but ths s complant wth the type of servce that they requre. In practce, all the tme whch s left over by the prmary users, s flled wth the E users data perodcally on a contenton bass. In fact, even f the number of rng prmary users reaches the maxmum number for whch t can be guaranteed that P r(delay < D) < ɛ) the G users wll not frequently use ther entre quota Q (K), unless they are Constant t Rate (CR) sources. As a result, the fracton of total tme of the token cycle n whch the G users are dle,.e.: (K) := (4) can be drectly utlzed by the E users. Due to the dstrbuted nature of the control mechansm, and because of the QoS and buffer lmtatons, t s mpossble to handle all user s demand wthn a sngle rng. The logcal opton s usng a mult-rng system, where several non-conflctng rngs organze the access to the resources. III. THE MC-CDMA PHYSICAL LAYER Although TEMA can be adapted to other physcal layer platforms, we wll see next that MC-CDMA offers greater flexblty n the assgnment of the transmsson resources. Multcarrer communcatons seem to offer a cost effectve soluton for the new generaton of broadband wreless communcatons [4]. MC-CDMA combnes the good propertes of the two emergng multplexng and modulaton technques for wdeband transmsson, namely: CDMA, chosen for 3G cellular communcatons (UMTS and IMT-000) and OFDM, whch adopted n the wreless LA standards IEEE 80. []and HIPERLA [8]. A good comparson between the dfferent multplexng alternatves and the advantages of the MC-CDMA approach can be found []. In III-A we derve the basc MC-CDMA desgn parameters that need to be used to determne the physcal resources assocated to one token. Our approach allows to construct tokens that delver the desred amount of bts/sec. satsfyng the error rate bound, despte the frequency selectve tmevaryng nature of the wreless medum, enhancng the robustness of the proposed strategy. A. The Token-Codes It s convenent to utlze a block transmsson technque and assocate to each token a set of sgnature codes that spread one block of Q data at a tme. To explot fully the flexblty of the Fg. 3. /M Ts PTs Partton of the resources n the MC-CDMA system. MC-CDMA strategy we dstrbute the spread data over the entre grd n Fg. 3. If P s the number of slots n one frame there are P M subcarrers per frame. To elmnate possble nterference between dfferent rngs and thus the need of power control, we partton the entre set of subcarrers T n Fg. 3 mappng each token onto a dstnct subset S,.e. such that: S T and Ths strategy s llustrated by Fg. correspond dfferent codes: Fg. 4. /M T s PTs Dfferent MC-CDMA Token-Codes. S { }. (5) 4, where dfferent colors Let us denote by F the K matrx of MC-CDMA codes and by s [k] the block of nformaton symbols transmtter at tme k over the th token. The superposton of the spread data s: x [k] = F s [k], (6) and the entres x [k] are transmtted on the set S contanng K subcarrers. From our dscusson t follows that, K P M, (7) and the tme necessary to transmt the symbols s at most the frame duraton T f : P (M + L) T f = P T s = (8) where, as mentoned before, s the total avalable bandwdth M s the number of subcarrers and L s the duraton of the cyclc prefx. L has to be greater then the channel delay spread and maxmum asynchronsm between users. Fxng M to be greater than the delay spread of the channel, L = M would sacrfce effcency but render block synchronzaton unnecessary. Assumng the recever carrer s synchronzed, the outputs of the FFT flters correspondng to the token-subcarrers are the entres of the followng K vector: y [k] = H F s [k] + v [k], (9) 95
4 where v s addtve whte gaussan nose (AWG) wth varance 0 and H s a dagonal wth dagonal entres {H } k,k = H (f k ) wth f k S. Assumng that the channel s known only at the recever sde and usng symbols that belong to the same constellaton of sze D, the token bt rate s (servce rate) µ = log (D )/T f bts/sec, (0) and f the target rate s µ µ then: D µ T f /. () The Qos specfcaton n terms of ER can be satsfed assumng that the ISI s approxmately Gaussan and usng the followng bounds on symbol the error probablty, where β s the sgnal to nose rato at the detecton level: P s () QAM < e 3 β (D ). () Thus, usng (), we can enforce the ER constrant by: P s () < P s β 3 ( µ T f / ) log Ps (3) To derve β we can assume that: ) the {F } k,q are..d. ± random varables; ) the channel coeffcent are known at the recever sde and the data are processed through a matched flter; 3) the spreadng factor K ; 4) the symbols are..d.. Under these assumptons, the sgnal to nose rato s: ( K ) P k= H (f k ) β = K 0 k= H (f k ) + P( ) K k= H (f k ), 4 (4) whch depends on the specfc channel parameters. However, modellng the channel as random and assumng that the frequences f k are suffcently spaced so that H (f k ) are approxmately uncorrelated, for K we can use the law of large numbers and have: β PK 0 + P( ) 0 κ H (5) where, wth E[ ] denotng the expectaton, κ H E[ H(f k ) 4 ] E[ H (f k ) ], depends on the fadng statstcal characterstcs only (for example, n Raylegh fadng κ H = ). Fnally, usng (5) n (3) we obtan a constrant that relates wth K that can be used to determne the necessary spreadng and block sze: K + P 0 κ H ( ) ( µ T f / ) log Ps. (6) P 3 0 IV. DELAY AALYSIS The token passng process can be nterpreted as a form of dstrbuted pollng where the token passng scheme s classfed as lmted servce system [6]. The traffc s generated by dentcal users whch are modelled by queues q through q. Each queue has a fnte buffer of sze, and ndependent Posson message arrvals at a rate λ message/second. The servce (transmsson) average rate of the token code µ s normalzed to one. The servce admnstrator serves staton only for a lmted tme Q (t) f there s any demand from staton. k messages out of those found at the poolng nstant are served contnuously at staton. A staton s served untl ether ) the buffer s empted, or ) a specfed number of messages or packets are served, whchever occurs frst. Then, the token n fnte reply nterval w goes to nspect staton +. We denote by x and by x respectvely the mean and the second order moment of the servce tme for the packets n the the queue. The utlzaton for user ρ and the system utlzaton ρ are: ρ λ x and ρ ρ ρ. (7) To obtan the average packet delay, we employ basc queung analyss methodologes, smlar to those used n [9], [] and extend them to the case where there are two classes of servce. Frst we calculate the average number of packets n each user s queue and then apply Lttle s law to fnd the average delay. Our proposed token-based MAC scheme can be modelled as a M/G// queue system wth vacatons (for detals see e.g.[5]) and the lmted number of watng places for each user s queue. To smplfy the analyss we set =. From the user s sde, the servce to the user contnues tll the buffer becomes empty or the quota tme reaches, whchever comes earler, then the server starts a vacaton. The remanng perod or server vacaton tme n the kth cycle s a random varable denoted by V (k) second moment v = C (k) T (k) wth the mean tme v and the. Let us denote by l(k) (t) the number of messages buffered at staton at tme t and defne the system s state at tme t to be L (k) (t) [ (t), l(k) (t),..., l(k) (t)]. For scheme A (see Fg. A)), n a rng where M users are actve wth constant walk tme w, the vacaton tme for staton to staton + can be expressed as: (t) = ( M)w + x = j=+ j (t) + x l (k+) j (t). (8) For scheme (see Fg. )), snce there are two classes of servces, there are two types of vacaton tmes. For the th staton they are respectvely:, (t) = ( M)w + Mw + x M + x j (t) + x l (k+) j=+ j (t) j (t), (9), (t) = ( M)w + x j (t) + Mw + x M j=+ j (t) + x l (k+) j (t). (0) 96
5 Smlarly, for the scheme C the vacaton tme s:, (t) = ( M)w + x j=+ j (t) + x l (k+) j (t) + RAP () where RAP stands for Random Access Part. The necessary condton for the rng stablty s that ρ <,.e. the average load arrvng n a cycle has to be less than the maxmum server attendance tme, thus: ρ(q max + v) < Q max, or ρ ] < Q max, () where Q max s the maxmum quota and C (k) s the cycle tme. Consderng the stablty crteron for the average cycle tme for scheme A we can wrte, ] = Mw + Solvng (3) we obtan: M = λ ] x. (3) ] = Mw ρ. (4) Smlarly for the schemes and C we have respectvely: ]=, ] + (M )w E[C(k), ] = + w,(5) ρ ρ Mw + RAP ]=. (6) ρ The Pollaczek-Knchne (P-K) formula [0] provdes the followng expresson for l o the average number of packets n the queue and at server: lo = λ x + (λ x ) ( ρ). (7) v v + The average remanng vacaton tme for prorty s v. Ths s applcable to all three schemes except for the traffc wth second prorty of the scheme C where there s not queung polcy. y Lttle s law the average number of arrvng packets for a user durng ths vacaton tme s, v lv = λ( + v ). (8) v The average total work ū done by the server for the user s ū = ū l + ū o + ū v, where ū l s the amount of work left behnd when vacaton starts, ū o s the amount of work at arbtrary tme for the M/G/ queue wth no vacaton, and u v s the amount of work durng the vacaton. We can also wrte ū = l x = ( l o + l v ) x. Followng [], ū for the users wth prorty s λ ū = x ( ρ ) + ū p ρ v + ρ ( + v ), (9) v v 97 where u p s the average amount of work at the pollng nstant. The approxmate value of u p can be derved solvng the followng non-lnear equaton []: ū p = ρ [ v + ū p ( e Qmax up )] + ūp e Qmax ūp (30) The average amount of work seen by Posson arrvals s the sum of l q x, ( l q average number of packets over tme n the queue) plus the resdual servce tme for the packet: ū = l q x + ρ x x (3) Snce ū = l x and snce from Lttle s law we have l = λ D the average delay s D = l λ = ū xλ. Hence, from (9), the average packet delay n the th queue wth prorty s s: D s = x ( ρ ) +ūp, v +( v s + v t ), (s, t) = (, ), (, ). ρ v s (3) REFERECES []. Abramson, Multple Access n Wreless Dgtal etworks, Proc. IEEE, vol. 8, pp , sep [] A. aocch, F. Cuomo and S. olognes, IP QoS Delvery n roadband Wrelss Local Loop: MAC Protocol Defnton and Performance Evaluaton, IEEE JSAC, vol. 8, no. 9, Sept [3] Y. Cao and V. K. L, Schedulng Algorthms n road-and Wreless etworks, Proc. of the IEEE, vol. 89, no., 00. [4] J. Chuang, L. J. Cmn, G. Y. L,. Mcar,. Sollemberg, H. Zhao, L. Ln, M. Suzuk, Hgh Speed Wreless Data Access ased on Combng EDGE wth Wdeband OFDM, IEEE Comm. Mag., pp. 9-98, ov [5] M. Andrews, K. Kumaran, K. Ramanan, A. Stolyar, P. Whtng, and R. Vjayakumar, Provdng qualty of servce over a shared wreless lnk, IEEE IEEE Comm. Mag., Feb. 00. [6] C.H. Foh and M. Zukerman, CSMA wth Reservatons by Interruptons (CSMA/RI): A ovel Approach to REduce Collsons n CSMA/CD, IEEE JSAC, vol. 8, no. 9, 000. [7] J. Follows, Token Rng Solutons, IM Internatonal Techncal Support Organzaton, avalable at [8] ETSI, Rado Equpment and Systems, HIgh Performance Rado Local Area etwork (HIPERLA) Type, ETS , Oct [9] L. Klenrock and M. Scholl, Packet Swtchng n Rado Channels: ew Conflct-Free Multple Access Scheme, IEEE Trans. on Comm., vol. Com 8, no.7, Jul [0] L. Klenrock, Performance Evaluaton of Dstrbuted Communcaton Systems, n Queung Theory and ts Applcatons, Eds, O.J. axma and R. Sysk, orth-holland, 988. [] IEEE Protocol 80.. Draft Standard for wreless LA: Medum Access Control (MAC) and Physcal layer (PHY) specfcatons, IEEE July 996. [] K.K. Leung and M. Esenberg, A Sngle Server Queue wth Vacatons and Gated Tme-Lmted Servce, IEEE Trans. on Comm., vol. 38, no. 9, 990. [3] J. W. M. Pang, F. A. Tobag and S. oyd, Generalzed Access Control Strateges for Integrated Servces Token Passng Systems, IEEE Trans. on Comm., vol. 4, no.8, 994. [4] I. Rubn and L.F.M. Demoraes, Message Delay Analyss for Pollng and Token Multple-Access Schemes for Local Communcaton etworks, IEEE JSAC, vol., no. 5, ov [5] I. Rubn and J.C. Wu, Analyss of an M/G// Queue wth Vacatons and Its Iteratve Applcaton on FDDI Tmed-Token Rngs, IEEE/ACM Trans. on etworkng, vol. 3, no. 6, Dec [6] H. Takag, Analyss of Pollng System, The MIT Press, 986. [7] Z. Tsa and I. Rubn, Performance of Token Schemes Supportng Delay- Constraned Prorty Traffc Streams, IEEE Trans. on Comm.vol. 38, no., 990. [8] S. Zhang and A. urns, An optmal synchronous bandwdth allocaton scheme for guaranteeng synchronous message deadlnes wth the tmedtoken MAC protocol, IEEE/ACM Trans. on etworkng, vol. 3, no. 6, 995.
Redes 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 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 informationDefine Y = # of mobiles from M total mobiles that have an adequate link. Measure of average portion of mobiles allocated a link of adequate quality.
Wreless Communcatons Technologes 6::559 (Advanced Topcs n Communcatons) Lecture 5 (Aprl th ) and Lecture 6 (May st ) Instructor: Professor Narayan Mandayam Summarzed by: Steve Leung (leungs@ece.rutgers.edu)
More informationPerformance Analysis of Multi User MIMO System with Block-Diagonalization Precoding Scheme
Performance Analyss of Mult User MIMO System wth Block-Dagonalzaton Precodng Scheme Yoon Hyun m and Jn Young m, wanwoon Unversty, Department of Electroncs Convergence Engneerng, Wolgye-Dong, Nowon-Gu,
More informationRESOURCE CONTROL FOR HYBRID CODE AND TIME DIVISION SCHEDULING
RESOURCE CONTROL FOR HYBRID CODE AND TIME DIVISION SCHEDULING Vaslos A. Srs Insttute of Computer Scence (ICS), FORTH and Department of Computer Scence, Unversty of Crete P.O. Box 385, GR 7 Heraklon, Crete,
More 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 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 informationEnergy Efficiency Analysis of a Multichannel Wireless Access Protocol
Energy Effcency Analyss of a Multchannel Wreless Access Protocol A. Chockalngam y, Wepng u, Mchele Zorz, and Laurence B. Mlsten Department of Electrcal and Computer Engneerng, Unversty of Calforna, San
More 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 information>>> SOLUTIONS <<< 5 pts each sub-problem. 3 pts for correct formulas and set-up for each sub-problem.
Comprehensve Fnal Exam for Computer Networks (CNT 65) Fall >>> SOLUTIONS
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 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 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 informationThe Stability Region of the Two-User Broadcast Channel
The Stablty Regon of the Two-User Broadcast Channel Nkolaos appas *, Maros Kountours, * Department of Scence and Technology, Lnköpng Unversty, Campus Norrköpng, 60 74, Sweden Mathematcal and Algorthmc
More 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 informationThs materal s publshed n the open archve of Md Sweden Unversty DIVA http://mun.dva-portal.org to ensure tmely dssemnaton of scholarly and techncal work. Copyrght and all rghts theren are retaned by authors
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 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 informationAMC-aware QoS proposal for OFDMA-based IEEE WiMAX systems
AMC-aware QoS proposal for OFDMA-based IEEE82.6 WMAX systems Chad Tarhn, Tjan Chahed GET/Insttut Natonal des Télécommuncatons/UMR CNRS 557 9 rue C. Fourer - 9 Evry CEDEX - France {chad.tarhn, tjan.chahed}@nt-evry.fr
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 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 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 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 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 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 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 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 informationExponential Effective SIR Metric for LTE Downlink
Exponental Effectve SIR Metrc for LTE Downlnk Joan Olmos, Albert Serra, Slva Ruz, Maro García-Lozano, Davd Gonzalez Sgnal Theory and Communcatons Department Unverstat Poltècnca de Catalunya (UPC) Barcelona,
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 informationResearch Article Performance Evaluation of Uplink Delay-Tolerant Packet Service in IEEE Based Networks
Hndaw Publshng Corporaton EURASIP Journal on Wreless Communcatons and Networkng Volume 2011, Artcle ID 549492, 12 pages do:10.1155/2011/549492 Research Artcle Performance Evaluaton of Uplnk Delay-Tolerant
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 informationPassive Filters. References: Barbow (pp ), Hayes & Horowitz (pp 32-60), Rizzoni (Chap. 6)
Passve Flters eferences: Barbow (pp 6575), Hayes & Horowtz (pp 360), zzon (Chap. 6) Frequencyselectve or flter crcuts pass to the output only those nput sgnals that are n a desred range of frequences (called
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 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 informationETSI TS V8.4.0 ( )
TS 100 959 V8.4.0 (2001-11) Techncal Specfcaton Dgtal cellular telecommuncatons system (Phase 2+); Modulaton (3GPP TS 05.04 verson 8.4.0 Release 1999) GLOBAL SYSTEM FOR MOBILE COMMUNICATIONS R 1 TS 100
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 informationCELLULAR SYSTEM CAPACITY and PERFORMANCE IMPROVEMENT with SDMA
CELLULAR SYSTEM CAPACITY and PERFORMANCE IMPROVEMENT wth SDMA Flpe Alves, Henrque Rbero, José Fernandes 3 Escola Superor de Tecnologa, Insttuto Poltécnco de Castelo Branco, 6 Castelo Branco, Portugal Phone:+35-7-339355
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 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 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 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 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 informationPerformance and Analysis of CDM-FH-OFDMA for Broadband Wireless Systems
Performance and Analyss of CDM-FH-OFDMA for Broadband Wreless Systems Kan Zheng, Lu Han, Janfeng Wang, and Wenbo Wang Wreless Sgnal Processng Lab, Bejng Unversty of Posts & Telecomms, Bejng, Chna zkan@buptneteducn
More informationAn Efficient Scheduling For Diverse QoS Requirements in WiMAX
An Effcent Schedulng For Dverse QoS Requrements n WMAX by Xaojng Meng A thess presented to the Unversty of Waterloo n fulfllment of the thess requrement for the degree of Master of Appled Scence n Electrcal
More informationHardware Design of Filter Bank-Based Narrowband/Wideband Interference Canceler for Overlaid TDMA/CDMA Systems
Hardware Desgn of Flter anased arrowband/deband Interference Canceler for Overlad TDMA/CDMA Systems Toyoau Ktano Kaunor Hayash Htosh Masutan and Shnsue Hara Graduate School of Engneerng Osaa Unversty YamadaOa
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 informationResource Scheduling in Dependable Integrated Modular Avionics
Resource Schedulng n Dependable Integrated Modular Avoncs Yann-Hang Lee and Daeyoung Km Real Tme Systems Research Laboratory CISE Department, Unversty of Florda {yhlee, dkm}@cse.ufl.edu Mohamed Youns,
More informationPerformance and Analysis of CDM-FH-OFDMA for Broadband Wireless Systems
Performance and Analyss of CDM-FH-OFDMA for Broadband Wreless Systems Kan Zheng, Lu Han, Janfeng Wang, Wenbo Wang Wreless Sgnal Processng Lab Bejng Unversty of Posts & Telecomms,Bejng, Chna Emal: zkan@buptneteducn
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 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 informationOPTIMAL GUARANTEED SERVICES TIMED TOKEN (OGSTT) MEDIA ACCESS CONTROL (MAC) PROTOCOL FOR NETWORKS THAT
OPTIMAL GUARANTEED SERVICES TIMED TOKEN (OGSTT) MEDIA ACCESS CONTROL () PROTOCOL FOR NETWORKS THAT SUPPORT HARD R AND NON R S. Ozuomba 1, C. O. Amaefule 2, J. J. Afolayan 3 1, 3DEPT. OF ELECTRICAL/ELECTRONIC
More informationPerformance of WCDMA Downlink FDD Mode at 10 MHz Bandwidth
Performance of WCDA Downln FDD ode at 0 Hz Bandwdth Suyeb Ahmed han *, Jasvr Sngh **, ahmood an *** * Research Scholar,**Deptt. of Electroncs echnology, GND Unversty, Amrtsar, Inda ***Deptt. of Appled
More informationMASTER TIMING AND TOF MODULE-
MASTER TMNG AND TOF MODULE- G. Mazaher Stanford Lnear Accelerator Center, Stanford Unversty, Stanford, CA 9409 USA SLAC-PUB-66 November 99 (/E) Abstract n conjuncton wth the development of a Beam Sze Montor
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 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 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 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 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 informationFigure.1. Basic model of an impedance source converter JCHPS Special Issue 12: August Page 13
A Hgh Gan DC - DC Converter wth Soft Swtchng and Power actor Correcton for Renewable Energy Applcaton T. Selvakumaran* and. Svachdambaranathan Department of EEE, Sathyabama Unversty, Chenna, Inda. *Correspondng
More informationNOVEL ITERATIVE TECHNIQUES FOR RADAR TARGET DISCRIMINATION
NOVEL ITERATIVE TECHNIQUES FOR RADAR TARGET DISCRIMINATION Phaneendra R.Venkata, Nathan A. Goodman Department of Electrcal and Computer Engneerng, Unversty of Arzona, 30 E. Speedway Blvd, Tucson, Arzona
More informationOn High Spatial Reuse Broadcast Scheduling in STDMA Wireless Ad Hoc Networks
On Hgh Spatal Reuse Broadcast Schedulng n STDMA Wreless Ad Hoc Networks Ashutosh Deepak Gore and Abhay Karandkar Informaton Networks Laboratory Department of Electrcal Engneerng Indan Insttute of Technology
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 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 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 informationOn capacity of OFDMA-based IEEE WiMAX including Adaptive Modulation and Coding (AMC) and inter-cell interference
1 On capacty of OFDMA-based IEEE802.16 WMAX ncludng Adaptve Modulaton and Codng (AMC) and nter-cell nterference Chad Tarhn, Tjan Chahed GET/Insttut Natonal des Télécommuncatons - UMR CNRS 5157 9 rue C.
More informationNext Generation Wireless Networks: Research Challenges and Opportunities
Next Generaton Wreless Networks: Research Challenges and Opportuntes Abhay Karandkar Professor Department of Electrcal Engneerng Indan Insttute of Technology Bombay, Mumba 400076 karand@ee.tb.ac.n Har
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 informationOptimal Placement of PMU and RTU by Hybrid Genetic Algorithm and Simulated Annealing for Multiarea Power System State Estimation
T. Kerdchuen and W. Ongsakul / GMSARN Internatonal Journal (09) - Optmal Placement of and by Hybrd Genetc Algorthm and Smulated Annealng for Multarea Power System State Estmaton Thawatch Kerdchuen and
More informationMINIMUM OVERHEAD BURST SYNCHRONIZATION FOR OFDM BASED BROADBAND TRANSMISSION. Michael Speth, Dirk Daecke, Heinrich Meyr
MINIMUM OVERHEAD BURST SYNCHRONIZATION FOR OFDM BASED BROADBAND TRANSMISSION Mchael Speth, Drk Daecke, Henrch Meyr Integrated Systems for Sgnal Processng (ISS) Aachen Unversty of Technology (RWTH) D-52056
More informationDirect Sequence Spread Spectrum (DSSS)
Drect Sequence Spread Spectrum (DSSS) DS-SS DS-SS uses sequences for spectrum spreadng and phase modulaton Modulaton s bnary SK (BSK) or quaternary SK (QSK) Message BSK - - - - QSK BSK Bt hase Dr. Cesar
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 informationThe Detection Algorithms Performance in BLAST Enhanced IEEE a WLAN Standard on Measured Channels. University of Bristol
The Detecton Algorthms Performance n BLAST Enhanced IEEE 802.11a WLAN Standard on Measured Channels Unversty of Brstol Robert Pechoc, Paul Fletcher, Andy Nx, Nshan Canagarajah and Joe McGeehan The Thrd
More informationPractical Issues with the Timing Analysis of the Controller Area Network
Practcal Issues wth the Tmng Analyss of the Controller Area Network Marco D Natale Scuola Superore Sant Anna, Italy. Emal: marco@sssup.t Habo Zeng McGll Unversty, Canada. Emal: habo.zeng@mcgll.ca Abstract
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 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 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 informationTraffic Modeling and Performance Evaluation in GSM/GPRS Networks
Proceedngs of the 3th WSEAS Internatonal Conference on COMMUNICATIONS Traffc Modelng and Performance Evaluaton n GSM/ Networks Cornel Balnt, Georgeta Budura, Marza Eugen Poltehnca Unversty of Tmsoara Bd..
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 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 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 informationProviding Strict Quality of Service in HSDPA for real time services
Provdng Strct Qualty of Servce n HSDPA for real tme servces Joseph S. Gomes, Mra Yun, Hyeong-Ah Cho, Jae-Hoon Km 2, JungKyo Sohn 3, Hyeong-In Cho 3 Department of Computer Scence, George Washngton Unversty,
More informationExploiting Dynamic Workload Variation in Low Energy Preemptive Task Scheduling
Explotng Dynamc Worload Varaton n Low Energy Preemptve Tas Schedulng Lap-Fa Leung, Ch-Yng Tsu Department of Electrcal and Electronc Engneerng Hong Kong Unversty of Scence and Technology Clear Water Bay,
More informationRECOMMENDATION ITU-R P Multipath propagation and parameterization of its characteristics
Rec. ITU-R P.47-3 RECOMMEDATIO ITU-R P.47-3 Multpath propagaton and parameterzaton of ts characterstcs (Queston ITU-R 3/3) (999-3-5-7) Scope Recommendaton ITU-R P.47 descrbes the nature of multpath propagaton
More information