Low Latency Random Access with TTI Bundling in LTE/LTE-A
|
|
- Aileen Potter
- 6 years ago
- Views:
Transcription
1 Low Latecy Radom Access with TTI Budlig i LTE/LTE-A Kaijie Zhou, Navid Nikaei Huawei Techologies Co., Ltd. Chia, zhoukaijie@huawei.com Eurecom, Frace, avid.ikaei@eurecom.fr Abstract To reduce the uplik chael access latecy i LTE/LTE-A, we propose a Trasmissio Time Iterval (TTI) budlig scheme for the radom access procedure. With the proposed method, a UE seds multiple preambles i cosecutive subframes i order to icrease the success rate of radom access ad hece to reduce the latecy. We itroduce a Semi-Markov model to accurately model ad aalyze the radom access mechaism with TTI budlig. With this model, we formulate the access latecy as a fuctio of the umber of TTI budles ad select the optimal value which miimizes the chael access latecy. The proposed Semi-Markov model is validated agaist simulatio ad the performace of the TTI budlig method is also evaluated. We fid that chael access latecy ca be sigificatly reduced whe the preamble collisio rate is ot high. Keywords LTE, Radom Access, TTI budlig, Semi-Markov Model. I. INTRODUCTION Low-latecy protocols ad access methods are becomig crucial to improve the spectral efficiecy ad to lower the eergy cosumptio i ed-devices, especially i view of emergig applicatio scearios foud i machie-to-machie commuicatio, olie iteractive gamig, social etworkig ad istat messagig. However, the majority of wireless systems, icludig LTE/LTE-A, are desiged to support a cotiuous flow of iformatio, at least i terms of the timescales eeded to sed several IP packets, such that the iduced sigalig overhead is maageable. While these systems are iteded mostly for dowlik-domiat ad bursty traffic, emergig applicatio scearios are of geerally differet characteristics [], amely: uplik domiat packets, periodic ad evet-drive packets, small ad low duty cycle packets. Such applicatios do ot ecessarily eed a icrease i the maximal data rate though part of the 4G-5G requiremet [2], they rather call for a efficiet support for low-latecy, potetially coordiated, chael access, ad i particular for small to verysmall packets. We argue that i 4G/4G+ system, this represets a opportuity to limit the modificatios i the physical layer ad redesig the access ad trasmissio protocols to obtai the desired features. Curretly, to reduce the sigalig overhead for the uplik schedulig, a UE ca use radom access chael for uplik chael access (see Ref. [3] i case of machie-to-machie commuicatio). More specifically, to apply for uplik trasmissio resources from enb, a UE seds the schedulig request (SR) message through radom access, which provides a chael access latecy of 4 ms i the best case (see Fig. ). However, if the radom access fails, UE has to backoff before startig aother radom access. This sigificatly icreases the chael access latecy, which may ot be desirable for the iteractive ad/or realtime applicatios that require fast reactio time to a evet. A lot of efforts has bee give to improve the performace of radom access, with particular attetio to machie-tomachie commuicatio (small low duty cycle packets). I Referece [4], a self optimizatio method for radom access is proposed, which pre-computes the radom access parameters (offlie approach) to guaratee the chael access latecy. Differet backoff schemes for radom access are aalyzed i [5]. Based o this method, a dyamic widow assigmet method is desiged, ad as a result, the performace of radom access is greatly improved compared to the fixed widow scheme. Referece [6] suggests a fast collisio resolutio method for radom access. This method utilizes the timig advace iformatio of the statioary UEs to idetify UEs ad hadle collisios betwee UEs. To icrease the success rate of the radom access, we propose a TTI budlig scheme for the trasmissio of preambles. I the proposed method, a UE seds multiple preambles i several subsequet TTIs (i.e. subframes), by which a radom access is successful if at least oe of the preambles is correctly received by a enb without a collisio. We use a semi-markov model to aalyze the radom access with the TTI budlig scheme. With this model the access latecy is derived as a fuctio of the umber of TTI budles, ad hece the optimal TTI budlig umber which miimizes the access latecy is foud. The idea of TTI budlig is ot ew ad itroduced i LTE Rel. 8 to improve the uplik coverage for VoIP applicatio [7]. The method allows a UE to sed multiple VoIP packets through a budle of several subsequet TTIs before receivig the HARQ from the servig enb, which elimiates the latecy caused by the packet retrasmissios ad thus improves the QoS for VoIP applicatio [8]. The remider of this paper is orgaized as follows. Sectio II provides a backgroud iformatio o the radom access mechaism i LTE/LTE-A ad presets the basic idea of the proposed TTI budlig scheme. Radom access model with TTI budlig ad the assumptios are explaied i Sectio III. The method ad how the optimal umber of TTI budles is calculated are detailed i Sectio IV. Sectio V presets the model validatio ad simulatio results. Fially, Sectio VI provides the cocludig remarks. II. RANDOM ACCESS IN LTE/LTE-A AND THE TTI BUNDLING SCHEME Fig. depicts the procedure for the cotetio based radom access i LTE/LTE-A [9]. Firstly, a UE seds a radomly
2 selected preamble whe the backoff couter becomes zero. Secodly, if the preamble is correctly received by enb, the enb seds the radom access respose (RAR) iformatio durig the RAR widow. Thirdly, UEs decode the RAR message. If a UE fids its preamble idetifier i the RAR message, it seds a L2/L3 message, for example schedulig request SR (L2 message) or RRC coectio request (L3 message). It has to be oted that multiple UEs sed L2/L3 message o the same resource if they select the same preamble i the first step (preamble collisio), which results i that the L2/L3 message might ot be correctly received by enb. Fially, the enb seds the cotetio resolutio to ackowledge the correctly received L2/L3 message. Assumig that the time used to decode preamble, RAR, ad L2/L3 message is 3ms, the total latecy is aroud 4 ms i the best case (o preamble collisio ad o wireless chael error). However, if the iitial radom access fails, a UE has to backoff for certai time before startig a ew radom access attempt. Time ms 2 ms 3 ms 6 ms 7 ms UE 9 ms 0 ms 4 ms 5 ms enb 2 ms 3 ms 4 ms 5 ms 6 ms 0 ms ms 3 ms 4 ms TTI budlig Corrupt due to wireless chael error Fig.. Time ms 6 ms 9 ms 4 ms UE Cotetio based radom access i LTE enb 2 ms 5 ms 0 ms 3 ms To improve the success rate i radom access, we propose a TTI budlig scheme as show i Fig.2. With the proposed scheme, a UE seds several radomly selected preambles i cosecutive subframes to perform multiple radom access attempts, which is referred to as TTI budlig for radom access. Here we cosider the multiple radom access i cosecutive subframes as a radom access roud. It is obvious that if oe of these preambles i a radom access roud is correctly received by enb ad without collisio, the radom access roud is successful, which elimiates the time that a UE has to wait for to start aother radom access whe the iitial radom access fails. It seems that icreasig the umber of budlig TTIs yields higher successful probability for a radom access roud ad thus reduces latecy. However, this is ot always true as the preamble collisio rate icreases with the umber of budlig TTIs. This is because each UE has to trigger more trasmissios whe budlig larger umber of TTIs, which i tur could reduce the success rate of a radom access roud ad accordigly icreases the latecy. Therefore, the optimal selectio of TTI budlig umber i o-trivial. The maximum legth of the backoff time is sigaled by the enb ad ca vary from 0 to 960 ms. Fig. 2. III. Cotetio based radom access with TTI budlig RANDOM ACCESS WITH TTI BUNDLING MODEL AND ASSUMPTIONS To fid the optimal umber of TTI budles, a mathematical model is eeded to aalyze the radom access mechaism. The existig radom access models are based o a multichael slotted ALOHA [0]- [], where the delay ad throughput of the radom access procedure ca be derived. However, they caot be used to aalyze the beefits of the TTI budlig scheme as they do ot cosider the backoff procedure after a usuccessful trasmissio ad the waitig state for a radom access respose. We apply the Semi-Markov process to model the radom access i LTE/LTE-A ad to aalyze both the regular radom access as well as the radom access with the TTI budlig. I the proposed model, the followig assumptios are made. Collisio: We assume that each packet collides with a costat ad idepedet probability. The assumptio is feasible whe the backoff widow ad umber of UE are large [2]. Packet Trasmissio: Regardless of the packet size, all the packets i a UE s buffer ca be set by oe uplik trasmissio. This assumptio is reasoable as a UE ca provide a buffer status report for the enb scheduler through the L2/L3 message (see Fig. ). Note that durig the radom access, it is possible that ew packets are geerated. With this assumptio, these ew packets are delivered with precedet packets. Therefore, whe a UE re-starts at the iitial state, there is o packet i its buffer. Moreover, due to the memoryless characteristic, the probability that a packet arrives i oe subframe is ot chaged. Traffic Model: The packet arrival is Poisso distributed. This is a simplifyig assumptio, for aalytical purposes, but ca be relaxed later (ot cosidered i this paper). Radom Access opportuity: The radom access chael is available i every subframe, which is related to radom access resource cofiguratio idex 4 specifed by 3GPP [3]. Fig. 3 shows the proposed Semi-Markov process model for radom access with TTI budlig, where there are three types of state: idle, backoff, ad radom access.
3 Idle Fig. 3. S 0,E Radom access p 0 /W S,R S,0 S, S, -2 S, - S i-,r p i- / S i,r p /W 2 p i /+ p M- /W M S M,R S i-,0 S i-, S i,0 S i, S M,0 S M, Backoff Semi-Markov process model for radom access with TTI budlig Idle state S 0,E meas there is o packet i the UE s buffer. Backoff state S i,j, i [, M], j [0, ], meas that the UE i the ith backoff stage ad the backoff couter is j, where M is the trasmissio limit ad is the maximum backoff couter size for ith backoff stage. Radom access trasmissio state S i,r, i [, M], meas that a UE is performig multiple radom access attempts, i.e., sedig preambles or L2/L3 messages, ad waitig for the respose from enb, such as RAR or cotetio resolutio message. A UE trasfers betwee states as follows. Whe a UE is at state S 0,E, if a packet arrives i oe subframe the UE selects a radom backoff couter j over [0, W ] ad trasfers to state S,j to start the first backoff. Otherwise it remais at state S 0,E. Whe a UE is at state S i,j, i [, M], j [0, ], it trasfers to S i,j after ms. Whe a UE is at state S i,r, i [, M ], it trasfers to state S 0,E if a cotetio resolutio idicatig a successful radom access is received. I cotrast, it trasfers to state S i+,j ( j is radomly selected over [0, + ]) to start aother radom access roud if the, [, N], radom accesses i oe radom access roud all fail, where is the umber of budlig TTIs ad N is the limit of TTI budlig umber. Whe a UE is at state S M,R, whether the radom access attempts i this roud are successful or ot, it trasfers to state S 0,E whe the radom access roud eds. IV. OPTIMAL TTI BUNDLING FOR RANDOM ACCESS Followig the model preseted i the Fig. 3, we deote the probability that a packet arrives durig oe subframe (ms) as p 0, the state trasitio probability from S 0,E to S,j, j [0, W ], is p 0 /W. Similarly, we deote p i, i [, M ], as the usuccessful probability for the ith radom access roud, therefore the state trasitio probability from S i,r, i [, M ] to S i+,j, j [0, + ] is p i /+. Deotig π i,j as the statioary probability for state S i,j (the probability that UE remais at a give state), it ca be calculated as: p 0 π,w = π 0,E W p 0 π,j = π 0,E + π,j+, j [0, W 2]. W π i,w = π,r p, i [2, M] π i,j = π,r p + π i,j+, i [2, M], j [0, 2]. () With the first ad secod equatios i equatio system (), we have: π,j = (W j) p 0 W π 0,E, j [0, W ]. (2) π,r = p 0 π 0,E. (3) By the use of the third ad fourth equatios i equatio system (), we get π i,j = ( j) p π,r, i [2, M], j [0, ]. (4) π i,r = p π,r, i [2, M]. (5) The sum of the all state s statioary probabilities is, which yields: = π 0,E + π i,r + W = π 0,E + p j π 0,E + = π 0,E + p j π 0,E + Therefore, we have π 0,E = π i,j (6) W + 2 j π i,r p j π 0,E. + M p j + M + 2 p. (7) j Now let us calculate the state trasitio probabilities. Assumig the packet arrives followig Poisso distributio with arrival rate λ, the probability that a packet arrives i oe subframe is p 0 = e λ. Oe radom access roud is usuccessful if all the radom access attempts i this roud are usuccessful, therefore p i = p F,i where p F,i is the usuccessful probability for oe radom access i the ith radom access roud. A usuccessful radom access is caused by erroeous trasmissio for the preamble or the usuccessful delivery of the L2/L3 message. More specifically, the usuccessful delivery of the L2/L3 message is also caused by two subcases: () collisio of the preamble, which leads to the failure
4 for the L2/L3 message delivery, ad (2) the L2/L3 is corrupted due to wireless chael error. I the later case, the preamble is correctly received by the enb without ay collisios, however the L2/L3 caot be successfully decoded by the enb due to the wireless chael error. With the above aalysis, we have p F,i = p E,i + ( p E,i )p c + ( p c )( p E,i )p N HARQ ES. (8) I the above equatio p c is the collisio rate for a preamble; p E,i is the error probability caused by wireless chael for a preamble i the ith radom access roud; p ES is the error rate to sed the L2/L3 message which cotais SR ad N HARQ is the maximum umber of HARQ trasmissios. Sice the L2/L3 message cotaiig SR is of very small size, therefore its error rate p ES is very small (less tha 0.) ad hece p N HARQ ES 0 cosiderig that N HARQ is usually larger tha 2. With this result, we have p F,i p c + p E,i p c p E,i. From the perspective of oe UE, collisio happes whe there are other UEs selectig the same preamble, therefore N u ( ) Nu p c = τ i ( τ) Nu i ( ( ) i ). (9) i N p I the above equatio N u is the total amout of UE; τ is the probability that a UE seds a preamble i oe subframe; N p is the umber of available preambles for radom access. Now let us calculate the state holdig time for this Semi- Markov process model. It is obvious that the state holdig time for S 0,E ad S i,j, i [, M], j [0, W ] is ms. For the UE at S i,r, i [, M], the calculatio for state holdig time is less obvious. We deote the duratio that starts at the ed of a preamble trasmissio ad eds at the time istat whe receivig the RAR message for that preamble as T RAR ad the time used to decode the RAR message as T D. Therefore, the SR message is set T RAR + T D ms after the preamble s trasmissio if the RAR message is received (o wireless error for the trasmitted preamble). As stated above, whe the UE is at S i,r, i [, M], the state trasitio happes whe oe radom access is successful or all the radom access i oe radom access roud fail. Hece, we calculate the state holdig time for three cases: ) The jth, j [, ], radom access i the ith, i [, M], radom access roud is successful. The probability for the first case p S i,j is or k= p k p j F,i ( p F,i), i > (0) p j F, ( p F,), i =. () Whe a radom access succeeds, the UE trasfers to the iitial state S 0,E after decodig the cotetio resolutio message. Deotig T CR as the average duratio which starts at time istat whe a UE seds the SR message ad eds at the time istat whe a UE decodes the cotetio resolutio message, the state holdig time for the first case is Ti,j S = j + T RAR + T D + T CR 2) Noe of the radom access i the ith, i [, M], radom access roud is successful, ad the UE receives the RAR message from enb for the last trasmitted preamble. I this case, a UE seds the L2/L3 message. However, as the radom access is usuccessful, it caot receive the cotetio resolutio message. This UE will trasfer to the iitial state S 0,E whe the cotetio resolutio timer expires. Therefore, the state holdig time for the secod case is T R = + T RAR + T D + T timer where T timer is the duratio for cotetio resolutio timer. The probability for this secod case whe i > is p R i = k= p k p F,i P RAR,i. (2) Whe i =, the probability for the secod case is p R = p F, P RAR,. (3) where P RAR,i, i [, M], is the probability that the collisio happes for a radom access i the ith radom access roud ad UE receives the RAR message. The P RAR,i is calculated by equatio (4). I equatio (4) r i,j+ is the detectio rate for the preamble i the ith radom access roud whe j + UEs (oe UE plus j cotedig UEs) sed the same preamble. If r i,j+ for j, i.e., a preamble ca mostly be detected whe it is set by multiple UEs, the P RAR,i p c. 3) Noe of the radom access i the ith, i [, M], radom access roud is successful, ad the UE does ot receive RAR for the last radom access. I this case, after sedig the last preamble the miimum time that a UE will stay at state S i,r is T W, i.e., the miimum state holdig time for state S i,r is T W, where T s the duratio which starts at the time istat whe a UE seds a preamble ad eds at the last subframe of RAR widow. Besides that, if this UE has received the RAR for a radom access i this roud (ot the last radom access i this roud), it caot trasfer to the iitial state S 0,E util the cotetio resolutio timer eds, which may exted the state holdig time. Deotig the time istat whe a UE seds the jth, j [, ], preamble as t j ad assumig the RAR is received by UE for this preamble, its cotetio resolutio timer eds at t j +T RAR +T D +T timer. Therefore, for a preamble trasmissio which ca exted the UE s state holdig time at state S i,r, i [, M], its trasmissio time istat t j should satisfy the followig the coditio t j + T RAR + T D + T timer > t + T W (5) where t is the time istat whe a UE seds the last preamble. Sice t = t j + ( j) where is the idex of the last preamble set i a radom access roud ad j is the idex of the jth preamble set i a radom access roud, the above calculatio is rewritte as j + T RAR + T D + T timer > + T W. (6) We ca fid the miimum preamble idex j satisfyig the above formula, which is deoted as z. Therefore, whe a UE ca trasfer from state S i,r to aother state is determied by the status whether RAR is received for the kth preamble, k [z, ]. Specifically, a UE trasfers from state S i,r to aother state whe the kth preamble s cotetio resolutio timer eds if the followig
5 P RAR,i = N u = ( ) N u τ ( τ) Nu ( ) ( ) j ( ) j r i,j+. (4) j N p N p coditios hold: (a) RAR is received for this preamble; (b) the radom accesses are usuccessful for the preambles set before it; (c) o RAR messages are received for the preambles set after it. Accordigly, the state holdig time is ad its probability p N i,k is or T N i,k = k + T RAR + T D + T timer (7) p j p k F,i P RAR,iP k NRAR,i, i > (8) p k F, P RAR,P k NRAR,, i = (9) where P NRAR,i, i [, M], is the probability that o RAR is received i oe radom access of the ith radom access roud. The RAR is ot set to a UE if the trasmitted preamble set by oe UE (or multiple UEs) is ot correctly detected by enb, therefore we have equatio (20). It is also possible that o RAR is received for all the radom accesses whose idex are larger tha z. The the state holdig time is Ti, N = + T W ad its probability p N i, is or p j p z F,i P z+ NRAR,i, i > (2) p z F,i P z+ NRAR,i, i = (22) If r i,j+ for j, i.e., a preamble ca mostly be detected whe it is set by multiple UEs, we have P NRAR,i ( p c )p E,i. With the above results, the average holdig time T i,r, i [, M], for state S i,r is T i,r = ps i,j T i,j S + pr i T R + T i,j N ps i,j + pr i +. (23) Whe a UE is at state S i,r, i [, M], the average duratio which is used for sedig preambles is T i,t X = ps i,j j + pr i + ps i,j + pr i +. (24) Therefore, the proportio of time that a UE is sedig a preamble, i.e., the probability that a UE seds a preamble i oe subframe, is where T = π 0,E + τ = W π i,r T i,t X T π i,j + (25) π i,r T i,r. (26) is the average holdig time for all the states. It ca be see that equatios (25) ad (9) comprise a equatio system with two ukows p c ad τ, which ca be solved by the use of umerical method. Provided that the i [, M] radom access roud is usuccessful, the the duratio that UE stays at state S i,r is the latecy itroduced by this radom access roud. Deotig the latecy i this case as d i, it is calculated by d i = pr i T R + p R i T N i,j +. (27) If a radom access is successful at the first radom access roud, o latecy is caused by the subsequet radom access rouds. Therefore, we have T = 0. However, if a radom access is successful at the ith radom access roud, the latecy caused by the precedet usuccessful radom access is T i = d j, i [2, M]. (28) Now let us calculate the access latecy for radom access which is defied as the duratio that starts at the time istat whe a UE wats to trigger a radom access ad eds at the time whe that UE receives a cotetio resolutio message idicatig the radom access is successful. Assumig the radom access is succeed i the jth trasmissio of the ith radom access roud, the access latecy icludes () the duratio of i W j 2 which is used for backoff, (2) the duratio of Ti,j S which is the time used for the successful radom access i the curret roud, ad (3) the latecy T i which is used for the precedet usuccessful radom access rouds. With above aalysis, the average chael access latecy caused by radom access is calculated by d = + p (j ) i=2 F, ( p F, ) M p i k= p kp (j ) ( W 2 + T S,j) F,i ( p F,i ) M p i ( i k= W k 2 + T S i,j + T i ). (29) The optimal TTI budlig umber which miimizes the access latecy is arg mi subject to d < N (30) where N is the limit of TTI budlig umber. The L2/L3 message is set T RAR + T D ms after the first preamble s trasmissio if the preamble is correctly received by enb. As a UE caot sed a L2/L3 message as well as a preamble at the same time, the maximum budlig TTI umber N should be o larger tha T RAR + T D. Sice we do ot have a closed form of d i the term of, therefore the above optimizatio problem ca oly be solved by exhaustive search.
6 P NRAR,i = N u =0 ( ) N u τ ( τ) Nu ( ) ( ) j ( ) j ( r i,j+). (20) j N p N p For some power costraied devices, the optimal TTI budlig umber obtaied from the above equatio might be adjusted to achieve a trade-off betwee the power cosumptio ad the latecy costrait. A. Simulatio Parameters V. RESULTS The simulatio parameters are show i Table I. Here the total umber of available preambles is assumed to be 20. While the total umber of available preambles i LTE is 64, this assumptio allows us to study the behaviour of the proposed method uder a high collisio rate regime. I additio, this assumptio is also related to the sceario where the available preambles are divided ito multiple (o- )overlappig sets to cotrol the collisio across multiple applicatios, e.g. oe for huma type commuicatio ad the other for the machie type commuicatio [4]. Two packet arrival rates are cosidered: λ = /00 ad /50 packet/ms, which correspod to the iteractive ad/or realtime applicatio scearios (e.g. realtime machie-to-machie commuicatio ad olie iteractive gamig). I case of o collisio, the preamble detectio rate is assume to be e i similar to [3], where i [, M] idicates the ith preamble trasmissio. Whe a preamble are set by multiple UEs, it ca always be correctly decoded, r i,j+ for j. This assumptio is quite typical i LTE. If a preamble is set by two UEs, two peaks appear at the enb side. The probability that either peak ca be decoded by enb is relatively low. TABLE I. SIMULATION PARAMETERS Parameter Value Descriptio T RAR 5 ms Time elapsed betwee the preamble trasmissio ad the receptio of RAR message T D 3 ms Time used to decode a RAR message T CR 8 ms Time elapsed betwee the trasmissio of a SR ad the receptio of a cotetio resolutio message T W 5 ms Time elapsed betwee the preamble trasmissio ad the last subframe of RAR widow T timer 24 ms Duratio of cotetio resolutio timer M 5 Trasmissio limit for radom access N p 20 Number of available preambles for radom access N 8 Max TTI budlig umber, i [, 5] 30 Backoff Widow Size B. Model Validatio To validate the proposed method, we compare the simulatio results with the aalytical results obtaied usig equatio (29) i Fig. 4. To validate the applicability of the modellig approach for both regular radom access ad radom access with TTI budlig, simulatios are performed with ad 2 TTI budles (i.e. = ad = 2). As show i Fig. 4, the aalytical results match the simulatio results validatig the modellig approach. C. Optimal TTI budles ad The Iduced Latecy Fig. 5 depicts the optimal TTI budlig umber uder differet umbers of UE ad packet arrival rates. It ca be Fig. 4. Latecy (ms) l=/00, =2, aalytical l=/00, =2, simulated l=/50, =2, aalytical l=/50, =2, simulated l=/00, =, aalytical l=/00, =, simulated l=/50, =, aalytical l=/50, =, simulated Number of UE Compariso of simulatio ad aalytical results see that the optimal TTI budlig umber o-icreases as the umber of UE ad the packet arrival rates icrease. The reaso for this pheomeo is that, the preamble collisio rate grows with the umber of UEs ad the packet arrival rate. Therefore, whe the umber of UEs ad/or packet arrival rate become large, a UE should budle smaller (or same) umber of TTI to reduce the collisio rate. Moreover, we also fid that the TTI budlig umber scales with the packet arrival rate i that higher packet arrival rate limits the umber of budles. This is reasoable sice the packet collisio rate icreases with packet arrival rate. Therefore, smaller TTI budlig should be used to cotrol the collisio. Fig. 5. Number of budlig TTI l=/00 l=/ Number of UE Optimal umber of budlig TTI Fig. 6 compares the latecy obtaied usig the results show i Fig. 5 to the latecy without the TTI budlig scheme. It ca be iferred that the latecy is greatly reduced util the average umber of simultaeous chael access is less tha the umber of available preambles, e.g. with λ = /50 ad 000 users, there will be 20 radom chael access attempts per subframe. Thus, the achievable latecy gai is also depedet o the umber of available preambles. From the figures, it ca be see that there are two regimes. I the first
7 regime, the preamble collisio rate is ot very high, ad thus budlig multiple TTIs greatly icreases the successful rate of the radom access procedure. For example whe λ = /00, =, ad N u = 500,the collisio rate is 0.22 ad the first radom access roud successful rate is 0.50 ad the resulted latecy is 6ms. Whe the TTI budlig umber icreases to 8, though the collisio rate icreases to 0.36, the first radom access roud successful approximately equals which reduces the latecy to 33ms as show i Fig.6. I the secod regime, the preamble collisio rate is high, thus budlig multiple TTIs further icreases the preamble collisio rate. As a result, the radom access success rate could ot be improved. For example whe λ = /50, = ad N u = 800, the collisio rate is 0.48; the first radom access roud successful rate is 0.33 ad the latecy is 85ms. Whe the TTI budlig umber icreases to 2, the preamble collisio rate jumps to 0.65 ad the successful rate for the first radom access roud oly icreases to 0.45 which slightly reduces the latecy to 8ms (see Fig.6). Therefore, to reduce the radom access chael access latecy whe the preamble collisio rate is high, the TTI budlig is applicable oly whe more preambles ad/or more PRACH resources ca be (dyamically) allocated to lower the collisio rate. VI. CONCLUSION I this paper, we propose a TTI budlig method to reduce the uplik chael access latecy i LTE/LTE-A. With TTI budlig, a UE seds oe or multiple preamble(s) i oe radom access roud to icrease the radom access success rate. To fid the optimal TTI budlig umber which miimizes the chael access latecy, we apply a Semi-Markov model to formulate the access latecy as a fuctio of TTI budlig umber. The proposed model is validated through simulatios ad performace of the proposed TTI budlig scheme is also evaluated. We fid that the TTI budlig scheme ca sigificatly reduce the uplik latecy whe the preamble collisio rate due to simultaeous chael access is ot high while the latecy improvemet vaishes as the preamble collisio rate icreases. ACKNOWLEDGEMENT The research leadig to these results has received fudig from the Europea Research Coucil uder the Europea Commuity Seveth Framework Programme (FP7/ ) grat agreemet for FLEX project. Fig. 6. Latecy (ms) l=/00,with TTI budlig l=/00,without TTI budlig l=/50,with TTI budlig l=/50,without TTI budlig Number of UE Latecy compariso with ad without TTI budlig Fig.7 shows the chael access latecy uder differet TTI budlig umber whe λ = /00 ad /50, ad N u = 500. It ca be observed that the latecy ca icrease if the umber of budles is ot optimally selected (see the curve for λ = /50). Latecy (ms) l=/00, N u =500 l=/50, N u = TTI budlig umber REFERENCES [] N. Nikaei, M. Laer, K. Zhou, P. Svoboda, D. Drajic, M. Popovic ad S. Krco, "Simple Traffic Modelig Framework for Machie Type Commuicatio," 203. [2] Ericsso, "5G Radio Access: Research ad Visio," White paper, Ericsso, 203. [3] 3GPP TR , "RAN Improvemets for Machie-type Commuicatios," V..0.0., Oct., 20. [4] M. Amirijoo, F. Guarsso, F. Adre, "Radom Access Chael Self-Optimizatio i 3GPP LTE," IEEE Trasactios o Vehicular Techology, No.99, pp., Feb [5] Ju-Bae Seo, Leug, V.C.M, "Back to Results Desig ad Aalysis of Backoff Algorithms for Radom Access Chaels i UMTS-LTE ad IEEE Systems," IEEE Trasactios o Vehicular Techology, vol. 60, No. 8, pp , Oct. 20. [6] K.S. Ko, M.J.Kim, etal., "A Novel Radom Access for Fixed-Locatio Machie-to-Machie Commuicatios i OFDMA Based Systems," IEEE Commu. Lett., vol.6,no.9, pp , Sept [7] 3GPP TDoc R , HARQ operatio i case of UL Power Limitatio, Ericsso, Jue [8] R. Susitaival, M.Meyer, "LTE coverage improvemet by TTI budlig," Proc. IEEE VTC Sprig, April, 2009, pp.-5. [9] 3GPP TS 36.32, Evolved Uiversal Terrestrial Radio Access (E- UTRA); Medium Access Cotrol (MAC)," V.2.0.0, Ja., 204. [0] E.Osipov, L.Riliskis, A. Eldstal-Damli, M.Burakov, M.Nordberg, Mi Wag, "A improved model of LTE radom access chael", Proc. IEEE VTC Sprig, April, 204, pp.-5. [] Michael Burakov, "A LTE Radom Access Chael Model for Wireless Sesor Network Applicatios", MSc Thesis, Lules uiversity of techology, 202. [2] Giuseppe Biachi, "Performace Aalysis of the IEEE 802. Distributed Coordiatio Fuctio", IEEE Joura o Selected Areas i Commuicatios, Vol. 8, No. 3, pp [3] 3GPP TS 36.2, "Evolved Uiversal Terrestrial Radio Access Network (E-UTRAN); Physical Chaels ad Modulatio," V 2.0.0, Dec., 203. [4] 3GPP TS , " Evolved Uiversal Terrestrial Radio Access (E- UTRA) ad Evolved Uiversal Terrestrial Radio Access Network (E- UTRAN)," V , Ju. 20. Fig. 7. Latecy uder differet umber of TTI budles
A SELECTIVE POINTER FORWARDING STRATEGY FOR LOCATION TRACKING IN PERSONAL COMMUNICATION SYSTEMS
A SELETIVE POINTE FOWADING STATEGY FO LOATION TAKING IN PESONAL OUNIATION SYSTES Seo G. hag ad hae Y. Lee Departmet of Idustrial Egieerig, KAIST 373-, Kusug-Dog, Taejo, Korea, 305-70 cylee@heuristic.kaist.ac.kr
More informationPHY-MAC dialogue with Multi-Packet Reception
PHY-AC dialogue with ulti-packet Receptio arc Realp 1 ad Aa I. Pérez-Neira 1 CTTC-Cetre Tecològic de Telecomuicacios de Cataluya Edifici Nexus C/Gra Capità, - 0803-Barceloa (Cataluya-Spai) marc.realp@cttc.es
More informationCHAPTER 5 A NEAR-LOSSLESS RUN-LENGTH CODER
95 CHAPTER 5 A NEAR-LOSSLESS RUN-LENGTH CODER 5.1 GENERAL Ru-legth codig is a lossless image compressio techique, which produces modest compressio ratios. Oe way of icreasig the compressio ratio of a ru-legth
More informationCross-Layer Performance of a Distributed Real-Time MAC Protocol Supporting Variable Bit Rate Multiclass Services in WPANs
Cross-Layer Performace of a Distributed Real-Time MAC Protocol Supportig Variable Bit Rate Multiclass Services i WPANs David Tug Chog Wog, Jo W. Ma, ad ee Chaig Chua 3 Istitute for Ifocomm Research, Heg
More informationApplication of Improved Genetic Algorithm to Two-side Assembly Line Balancing
206 3 rd Iteratioal Coferece o Mechaical, Idustrial, ad Maufacturig Egieerig (MIME 206) ISBN: 978--60595-33-7 Applicatio of Improved Geetic Algorithm to Two-side Assembly Lie Balacig Ximi Zhag, Qia Wag,
More informationA New Space-Repetition Code Based on One Bit Feedback Compared to Alamouti Space-Time Code
Proceedigs of the 4th WSEAS It. Coferece o Electromagetics, Wireless ad Optical Commuicatios, Veice, Italy, November 0-, 006 107 A New Space-Repetitio Code Based o Oe Bit Feedback Compared to Alamouti
More informationThroughput/Delay Analysis of Spectrally Phase- Encoded Optical CDMA over WDM Networks
Throughput/Delay Aalysis of pectrally Phase- Ecoded Optical over etwors K. Putsri *,. ittichivapa * ad H.M.H.halaby ** * Kig Mogut s Istitute of Techology Ladrabag Departmet of Telecommuicatios Egieerig,
More informationBroadcasting in Multichannel Cognitive Radio Ad Hoc Networks
2013 IEEE Wireless Commuicatios ad Networkig Coferece (WCNC): MAC Broadcastig i Multichael Cogitive Radio Ad Hoc Networks Zaw Htike Departmet of Computer Egieerig Kyug Hee Uiversity 1 Seocheo,Giheug, Yogi,
More informationEnhancement of the IEEE MAC Protocol for Scalable Data Collection in Dense Sensor Networks
Ehacemet of the IEEE 8.5. MAC Protocol for Scalable Data Collectio i Dese Sesor Networks Kira Yedavalli Departmet of Electrical Egieerig - Systems Uiversity of Souther Califoria Los Ageles, Califoria,
More informationSelective Periodic Component Carrier Assignment Technique in LTE and LTE-A Systems
Selective Periodic Compoet Carrier Assigmet Techique i LTE ad LTE-A Systems Husu S. Narma ad Mohammed Atiquzzama School of Computer Sciece, Uiversity of Oklahoma, Norma, OK 73019 Email: {husu, atiq}@ou.edu
More informationA study on the efficient compression algorithm of the voice/data integrated multiplexer
A study o the efficiet compressio algorithm of the voice/data itegrated multiplexer Gyou-Yo CHO' ad Dog-Ho CHO' * Dept. of Computer Egieerig. KyiigHee Uiv. Kiheugup Yogiku Kyuggido, KOREA 449-71 PHONE
More informationAnalysis of SDR GNSS Using MATLAB
Iteratioal Joural of Computer Techology ad Electroics Egieerig (IJCTEE) Volume 5, Issue 3, Jue 2015 Aalysis of SDR GNSS Usig MATLAB Abstract This paper explais a software defied radio global avigatio satellite
More informationInternational Power, Electronics and Materials Engineering Conference (IPEMEC 2015)
Iteratioal Power, Electroics ad Materials Egieerig Coferece (IPEMEC 205) etwork Mode based o Multi-commuicatio Mechaism Fa Yibi, Liu Zhifeg, Zhag Sheg, Li Yig Departmet of Military Fiace, Military Ecoomy
More informationA novel adaptive modulation and coding strategy based on partial feedback for enhanced MBMS network
THE JOURNAL OF CHINA UNIVERSITIES OF POSTS AND TELECOMMUNICATIONS Volume 5, Issue, March 2008 SHENG Yu, PENG Mu-ge, WANG We-bo A ovel adaptive modulatio ad codig strategy based o partial feedback for ehaced
More informationThe Fundamental Capacity-Delay Tradeoff in Large Mobile Ad Hoc Networks
The Fudametal Capacity-Delay Tradeoff i Large Mobile Ad Hoc Networks Xiaoju Li ad Ness B. Shroff School of Electrical ad Computer Egieerig, Purdue Uiversity West Lafayette, IN 47907, U.S.A. {lix, shroff}@ec.purdue.edu
More informationSELEX Elsag. 5/18/2012 R. Pucci SDR 12 WinnComm 1
SELEX Elsag 5/18/01 R. Pucci SDR 1 WiComm 1 Military BU - SELEX Elsag Possible update of SDR Platforms to COGNITIVE architectures COGNITIVE MANAGER INTERFACE Geolocatio, Voice, Video, etc Applicatio Policy
More informationON THE FUNDAMENTAL RELATIONSHIP BETWEEN THE ACHIEVABLE CAPACITY AND DELAY IN MOBILE WIRELESS NETWORKS
Chapter ON THE FUNDAMENTAL RELATIONSHIP BETWEEN THE ACHIEVABLE CAPACITY AND DELAY IN MOBILE WIRELESS NETWORKS Xiaoju Li ad Ness B. Shroff School of Electrical ad Computer Egieerig, Purdue Uiversity West
More informationUnit 5: Estimating with Confidence
Uit 5: Estimatig with Cofidece Sectio 8.2 The Practice of Statistics, 4 th editio For AP* STARNES, YATES, MOORE Uit 5 Estimatig with Cofidece 8.1 8.2 8.3 Cofidece Itervals: The Basics Estimatig a Populatio
More informationDesign of FPGA- Based SPWM Single Phase Full-Bridge Inverter
Desig of FPGA- Based SPWM Sigle Phase Full-Bridge Iverter Afarulrazi Abu Bakar 1, *,Md Zarafi Ahmad 1 ad Farrah Salwai Abdullah 1 1 Faculty of Electrical ad Electroic Egieerig, UTHM *Email:afarul@uthm.edu.my
More informationEfficient Feedback-Based Scheduling Policies for Chunked Network Codes over Networks with Loss and Delay
Efficiet Feedback-Based Schedulig Policies for Chuked Network Codes over Networks with Loss ad Delay Aoosheh Heidarzadeh ad Amir H. Baihashemi Departmet of Systems ad Computer Egieerig, Carleto Uiversity,
More informationIs Diversity Gain Worth the Pain: Performance Comparison Between Opportunistic Multi-Channel MAC and Single-Channel MAC
Is Diversity Gai Worth the Pai: Performace Compariso Betwee Opportuistic Multi-Chael MAC ad Sigle-Chael MAC Yag Liu 1, Migya Liu 1 ad Jig Deg 2 1 Departmet of Electrical Egieerig ad Computer Sciece, Uiv.
More informationOn the Capacity of k-mpr Wireless Networks
O the Capacity of -MPR Wireless Networs Mig-Fei Guo, Member, IEEE, Xibig Wag, Member, IEEE, Mi-You Wu, Seior Member, IEEE Abstract The capacity of wireless ad hoc etwors is maily restricted by the umber
More informationSapana P. Dubey. (Department of applied mathematics,piet, Nagpur,India) I. INTRODUCTION
IOSR Joural of Mathematics (IOSR-JM) www.iosrjourals.org COMPETITION IN COMMUNICATION NETWORK: A GAME WITH PENALTY Sapaa P. Dubey (Departmet of applied mathematics,piet, Nagpur,Idia) ABSTRACT : We are
More informationLETTER A Novel Adaptive Channel Estimation Scheme for DS-CDMA
1274 LETTER A Novel Adaptive Chael Estimatio Scheme for DS-CDMA Che HE a), Member ad Xiao-xiag LI, Nomember SUMMARY This paper proposes a adaptive chael estimatio scheme, which uses differet movig average
More informationAPPLICATION NOTE UNDERSTANDING EFFECTIVE BITS
APPLICATION NOTE AN95091 INTRODUCTION UNDERSTANDING EFFECTIVE BITS Toy Girard, Sigatec, Desig ad Applicatios Egieer Oe criteria ofte used to evaluate a Aalog to Digital Coverter (ADC) or data acquisitio
More information4. INTERSYMBOL INTERFERENCE
DATA COMMUNICATIONS 59 4. INTERSYMBOL INTERFERENCE 4.1 OBJECT The effects of restricted badwidth i basebad data trasmissio will be studied. Measuremets relative to itersymbol iterferece, usig the eye patter
More informationx y z HD(x, y) + HD(y, z) HD(x, z)
Massachusetts Istitute of Techology Departmet of Electrical Egieerig ad Computer Sciece 6.02 Solutios to Chapter 5 Updated: February 16, 2012 Please sed iformatio about errors or omissios to hari; questios
More informationMessage Scheduling for the FlexRay Protocol: The Dynamic Segment
IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY 1 Message Schedulig for the FlexRay Protocol: The Dyamic Segmet Ece Gura Schmidt, Member, IEEE, Klaus Schmidt Abstract The FlexRay commuicatio protocol is expected
More informationTime-Space Opportunistic Routing in Wireless Ad Hoc Networks, Algorithms and Performance
Time-Space Opportuistic Routig i Wireless Ad Hoc Networks, Algorithms ad Performace Fraçois Baccelli, Bartlomiej Blaszczyszy, Paul Muhlethaler To cite this versio: Fraçois Baccelli, Bartlomiej Blaszczyszy,
More informationInformation-Theoretic Analysis of an Energy Harvesting Communication System
Iformatio-Theoretic Aalysis of a Eergy Harvestig Commuicatio System Omur Ozel Seur Ulukus Departmet of Electrical ad Computer Egieerig Uiversity of Marylad, College Park, MD 074 omur@umd.edu ulukus@umd.edu
More informationA New Design of Log-Periodic Dipole Array (LPDA) Antenna
Joural of Commuicatio Egieerig, Vol., No., Ja.-Jue 0 67 A New Desig of Log-Periodic Dipole Array (LPDA) Atea Javad Ghalibafa, Seyed Mohammad Hashemi, ad Seyed Hassa Sedighy Departmet of Electrical Egieerig,
More informationMeasurement-Based Opportunistic Feedback and Scheduling for Wireless Systems
Measuremet-Based Opportuistic Feedbac ad Schedulig for Wireless Systems Gustavo de Veciaa ad Shailesh Patil Wireless Networig ad Commuicatios Group Dept. of Electrical ad Computer Egieerig The Uiversity
More informationOn Random Access Channel Performance and M2M Support in Standalone LTE Unlicensed
c 2017 IEEE. Persoal use of this material is permitted. Permissio from IEEE must be obtaied for all other uses, i ay curret or future media, icludig repritig/republishig this material for advertisig or
More informationThe Potential of Dynamic Power and Sub-carrier Assignments in Multi-User OFDM-FDMA Cells
The Potetial of Dyamic Power ad Sub-carrier Assigmets i Multi-User OFDM-FDMA Cells Mathias Bohge, James Gross, Adam Wolisz Telecommuicatio Networks Group, TU Berli Eisteiufer 5, 1587 Berli, Germay {bohge
More informationSIDELOBE SUPPRESSION IN OFDM SYSTEMS
SIDELOBE SUPPRESSION IN OFDM SYSTEMS Iva Cosovic Germa Aerospace Ceter (DLR), Ist. of Commuicatios ad Navigatio Oberpfaffehofe, 82234 Wesslig, Germay iva.cosovic@dlr.de Vijayasarathi Jaardhaam Muich Uiversity
More informationScheduling Algorithm with Delay-limited for VoIP in LTE
Proceedigs of APSIPA Aual Summit ad Coferece 15 16-19 December 15 Schedulig Algorithm with Delay-limited for VoIP i LTE Jua Che #, Weguo Yag #, Suixiag Gao #, Lei Zhou * # School of Mathematical Scieces,
More informationSingle Bit DACs in a Nutshell. Part I DAC Basics
Sigle Bit DACs i a Nutshell Part I DAC Basics By Dave Va Ess, Pricipal Applicatio Egieer, Cypress Semicoductor May embedded applicatios require geeratig aalog outputs uder digital cotrol. It may be a DC
More informationThe Potential of Dynamic Power and Sub-carrier Assignments in Multi-User OFDM-FDMA Cells
The Potetial of Dyamic Power ad Sub-carrier Assigmets i Multi-User OFDM-FDMA Cells Mathias Bohge, James Gross, Adam Wolisz TU Berli Eisteiufer 5, 1587 Berli, Germay {bohge gross wolisz}@tk.tu-berli.de
More informationOptimal Geolocation Updating for Location Aware Service Provisioning in Wireless Networks
Optimal Geolocatio Updatig for Locatio Aware Service Provisioig i Wireless Networks Siri Tekiay Amer Catovic tekiay@adm.jit.edu axc4466@jit.edu New Jersey Istitute of Techology Uiversity Heights, Newark,
More informationCHAPTER 8 JOINT PAPR REDUCTION AND ICI CANCELLATION IN OFDM SYSTEMS
CHAPTER 8 JOIT PAPR REDUCTIO AD ICI CACELLATIO I OFDM SYSTEMS Itercarrier Iterferece (ICI) is aother major issue i implemetig a OFDM system. As discussed i chapter 3, the OFDM subcarriers are arrowbad
More informationGeneral Model :Algorithms in the Real World. Applications. Block Codes
Geeral Model 5-853:Algorithms i the Real World Error Correctig Codes I Overview Hammig Codes Liear Codes 5-853 Page message (m) coder codeword (c) oisy chael decoder codeword (c ) message or error Errors
More informationPermutation Enumeration
RMT 2012 Power Roud Rubric February 18, 2012 Permutatio Eumeratio 1 (a List all permutatios of {1, 2, 3} (b Give a expressio for the umber of permutatios of {1, 2, 3,, } i terms of Compute the umber for
More informationDistributed Resource Management in Multi-hop Cognitive Radio Networks for Delay Sensitive Transmission
1 Distributed Resource Maagemet i Multi-hop Cogitive Radio Networs for Delay Sesitive Trasmissio Hsie-Po Shiag ad Mihaela va der Schaar Departmet of Electrical Egieerig (EE), Uiversity of Califoria Los
More informationCompound Controller for DC Motor Servo System Based on Inner-Loop Extended State Observer
BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 6, No 5 Special Issue o Applicatio of Advaced Computig ad Simulatio i Iformatio Systems Sofia 06 Prit ISSN: 3-970; Olie ISSN:
More informationJoint Resource Allocation Scheme for Device-To-Device Communication under a Cellular Network
BULGARIAN ACAEMY OF SCIENCES CYBERNETICS AN INFORMATION TECHNOLOGIES Volume 15, No 6 Special Issue o Logistics, Iformatics ad Service Sciece Sofia 015 Prit ISSN: 1311-970; Olie ISSN: 1314-4081 OI: 10.1515/cait-015-0070
More informationOn the Capacity of k-mpr Wireless Networks
3878 IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 8, NO. 7, JULY 2009 O the Capacity of -MPR Wireless Networs Mig-Fei Guo, Member, IEEE, Xibig Wag, Member, IEEE, Mi-You Wu, Seior Member, IEEE Abstract
More informationA Radio Resource Allocation Algorithm for QoS Provision in PMP-based Systems
530 OURAL OF COMMUICATIOS, VOL. 5, O. 7, ULY 00 A Radio Resource Allocatio Algorithm for QoS Provisio i PMP-based Systems Pig Wag Broadbad Wireless commuicatios ad Multimedia laboratory, Key Laboratory
More informationBOTTLENECK BRANCH MARKING FOR NOISE CONSOLIDATION
BOTTLENECK BRANCH MARKING FOR NOISE CONSOLIDATION IN MULTICAST NETWORKS Jordi Ros, Wei K. Tsai ad Mahadeve Iyer Departmet of Electrical ad Computer Egieerig Uiversity of Califoria, Irvie, CA 92697 {jros,
More informationCOMPRESSION OF TRANSMULTIPLEXED ACOUSTIC SIGNALS
COMPRESSION OF TRANSMULTIPLEXED ACOUSTIC SIGNALS Mariusz Ziółko, Przemysław Sypka ad Bartosz Ziółko Departmet of Electroics, AGH Uiversity of Sciece ad Techology, al. Mickiewicza 3, 3-59 Kraków, Polad,
More informationJoint Power Allocation and Beamforming for Cooperative Networks
It. J. Commuicatios, etwork ad System Scieces,, 4, 447-45 doi:.436/ijcs..4753 Published Olie July (http://www.scirp.org/joural/ijcs) Joit Power Allocatio ad Beamformig for Cooperative etworks Sodes Maadi,,
More informationLogarithms APPENDIX IV. 265 Appendix
APPENDIX IV Logarithms Sometimes, a umerical expressio may ivolve multiplicatio, divisio or ratioal powers of large umbers. For such calculatios, logarithms are very useful. They help us i makig difficult
More informationOutline. Motivation. Analog Functional Testing in Mixed-Signal Systems. Motivation and Background. Built-In Self-Test Architecture
Aalog Fuctioal Testig i Mixed-Sigal s Jie Qi Dept. of Electrical & Computer Egieerig Aubur Uiversity Co-Advisors: Charles Stroud ad Foster Dai Outlie Motivatio ad Backgroud Built-I Self-Test Architecture
More informationCapacity of Large-scale CSMA Wireless Networks
Capacity of Large-scale CSMA Wireless Networks Chi-Ki Chau, Member, IEEE, Mighua Che, Member, IEEE, ad Soug Ch Liew, Seior Member, IEEE Abstract I the literature, asymptotic studies of multi-hop wireless
More informationJoint Rate Control and Scheduling for Real-Time Wireless Networks
Joit Rate Cotrol ad Schedulig for Real-Time Wireless Networks Shuai Zuo, I-Hog Hou, Tie Liu, Aathram Swami, ad Prithwish Basu Abstract This paper studies wireless etworks with multiple real-time flows
More informationHybrid BIST Optimization for Core-based Systems with Test Pattern Broadcasting
Hybrid BIST Optimizatio for Core-based Systems with Test Patter Broadcastig Raimud Ubar, Masim Jeihhi Departmet of Computer Egieerig Talli Techical Uiversity, Estoia {raiub, masim}@pld.ttu.ee Gert Jerva,
More informationOPTIMIZED LINK ADAPTATION FOR WIRELESS PACKET COMMUNICATIONS BASED ON DISCRETE-RATE MODULATION AND CODING SCHEMES
OPTIMIZED LIK ADAPTATIO FO WIELE PACKET COMMUICATIO BAED O DICETE-ATE MODULATIO AD CODIG CHEME Jalil eifali Harsii, ad Farshad Lahouti Wireless Multimedia Commuicatios Laboratory chool of Electrical ad
More informationPolitecnico di Milano Facoltà di Ingegneria dell Informazione. Wireless Networks. Prof. Antonio Capone
Politecico di Milao Facoltà di Igegeria dell Iformazioe Wireless Networks Prof. Atoio Capoe Politecico di Milao Facoltà di Igegeria dell Iformazioe 1 Itroductio Wireless Networks Prof. Atoio Capoe Teacher
More informationSuper J-MOS Low Power Loss Superjunction MOSFETs
Low Power Loss Superjuctio MOSFETs Takahiro Tamura Mutsumi Sawada Takayuki Shimato ABSTRACT Fuji Electric has developed superjuctio MOSFETs with a optimized surface desig that delivers lower switchig.
More informationLecture 4: Frequency Reuse Concepts
EE 499: Wireless & Mobile Commuicatios (8) Lecture 4: Frequecy euse Cocepts Distace betwee Co-Chael Cell Ceters Kowig the relatio betwee,, ad, we ca easily fid distace betwee the ceter poits of two co
More informationPerformance Analysis of Channel Switching with Various Bandwidths in Cognitive Radio
Performace Aalysis of Chael Switchig with Various Badwidths i Cogitive Radio Po-Hao Chag, Keg-Fu Chag, Yu-Che Che, ad Li-Kai Ye Departmet of Electrical Egieerig, Natioal Dog Hwa Uiversity, 1,Sec.2, Da-Hsueh
More informationOn the Delay Performance of In-network Aggregation in Lossy Wireless Sensor Networks
O the Delay Performace of I-etwork Aggregatio i Lossy Wireless Sesor Networks Chaghee Joo, Member, IEEE, ad Ness B. Shroff, Fellow, IEEE Abstract I this paper, we study the implicatio of wireless broadcast
More informationA Framework for Analysis of Connectivity and Performance Bounds in Ad Hoc Networks and Its Application to a Slotted-ALOHA Scenario
JOURNAL OF COMMUNICATIONS SOFTWARE AND SYSTEMS, VOL., NO., SEPTEMBER 005 35 A Framework for Aalysis of Coectivity ad Performace Bouds i Ad Hoc Networks ad Its Applicatio to a Slotted-ALOHA Sceario Fabrizio
More informationH(X,Y) = H(X) + H(Y X)
Today s Topics Iformatio Theory Mohamed Hamada oftware gieerig ab The Uiversity of Aizu mail: hamada@u-aizu.ac.jp UR: http://www.u-aizu.ac.jp/~hamada tropy review tropy ad Data Compressio Uiquely decodable
More informationDesign of FPGA Based SPWM Single Phase Inverter
Proceedigs of MUCEET2009 Malaysia Techical Uiversities Coferece o Egieerig ad Techology Jue 20-22, 2009, MS Garde,Kuata, Pahag, Malaysia MUCEET2009 Desig of FPGA Based SPWM Sigle Phase Iverter Afarulrazi
More informationOn Parity based Divide and Conquer Recursive Functions
O Parity based Divide ad Coquer Recursive Fuctios Sug-Hyu Cha Abstract The parity based divide ad coquer recursio trees are itroduced where the sizes of the tree do ot grow mootoically as grows. These
More informationEfficient Wireless Link Bandwidth Detection for IEEE Networks
Efficiet Wireless Lik Badwidth Detectio for IEEE 80. Networks Haohua Fu, Lidog Li ad Weijia Jia Dept. of Computer Eg & IT, City Uiverty of Hog Kog 83 Tat Chee Ave, Kowloo, Hog Kog, SAR Chia Email: fu.haohua@studet.cityu.edu.hk;
More informationIntroduction to Wireless Communication Systems ECE 476/ECE 501C/CS 513 Winter 2003
troductio to Wireless Commuicatio ystems ECE 476/ECE 501C/C 513 Witer 2003 eview for Exam #1 March 4, 2003 Exam Details Must follow seatig chart - Posted 30 miutes before exam. Cheatig will be treated
More informationA New Energy Efficient Data Gathering Approach in Wireless Sensor Networks
Commuicatios ad Network, 0, 4, 6-7 http://dx.doi.org/0.436/c.0.4009 Published Olie February 0 (http://www.scirp.org/joural/c) A New Eergy Efficiet Data Gatherig Approach i Wireless Sesor Networks Jafar
More informationECE 333: Introduction to Communication Networks Fall Lecture 4: Physical layer II
ECE 333: Itroductio to Commuicatio Networks Fall 22 Lecture : Physical layer II Impairmets - distortio, oise Fudametal limits Examples Notes: his lecture cotiues the discussio of the physical layer. Recall,
More informationPerformance Limits and Practical Decoding of Interleaved Reed-Solomon Polar Concatenated Codes
Performace Limits ad Practical Decodig of Iterleaved Reed-Solomo Polar Cocateated Codes Hessam Mahdavifar, Mostafa El-Khamy, Jugwo Lee, Iyup Kag 1 arxiv:1308.1144v1 [cs.it] 6 Aug 2013 Abstract A scheme
More informationlecture notes September 2, Sequential Choice
18.310 lecture otes September 2, 2013 Sequetial Choice Lecturer: Michel Goemas 1 A game Cosider the followig game. I have 100 blak cards. I write dow 100 differet umbers o the cards; I ca choose ay umbers
More informationRadar emitter recognition method based on AdaBoost and decision tree Tang Xiaojing1, a, Chen Weigao1 and Zhu Weigang1 1
Advaces i Egieerig Research, volume 8 d Iteratioal Coferece o Automatio, Mechaical Cotrol ad Computatioal Egieerig (AMCCE 7) Radar emitter recogitio method based o AdaBoost ad decisio tree Tag Xiaojig,
More informationImplementation of Fuzzy Multiple Objective Decision Making Algorithm in a Heterogeneous Mobile Environment
Implemetatio of Fuzzy Multiple Objective Decisio Makig Algorithm i a Heterogeeous Mobile Eviromet P.M.L. ha, Y.F. Hu, R.E. Sheriff, Departmet of Electroics ad Telecommuicatios Departmet of yberetics, Iteret
More informationComparison of Frequency Offset Estimation Methods for OFDM Burst Transmission in the Selective Fading Channels
Compariso of Frequecy Offset Estimatio Methods for OFDM Burst Trasmissio i the Selective Fadig Chaels Zbigiew Długaszewski Istitute of Electroics ad Telecommuicatios Pozań Uiversity of Techology 60-965
More informationTest Time Minimization for Hybrid BIST with Test Pattern Broadcasting
Test Time Miimizatio for Hybrid BIST with Test Patter Broadcastig Raimud Ubar, Maksim Jeihhi Departmet of Computer Egieerig Talli Techical Uiversity EE-126 18 Talli, Estoia {raiub, maksim}@pld.ttu.ee Gert
More informationA D2D-based Protocol for Ultra-Reliable Wireless Communications for Industrial Automation
1 A D2D-based Protocol for Ultra-Reliable Wireless Commuicatios for Idustrial Automatio Liag Liu, Member, IEEE ad Wei Yu, Fellow, IEEE arxiv:1710.01265v3 [cs.it] 15 May 2018 Abstract As a idispesable use
More informationMethods to Reduce Arc-Flash Hazards
Methods to Reduce Arc-Flash Hazards Exercise: Implemetig Istataeous Settigs for a Maiteace Mode Scheme Below is a oe-lie diagram of a substatio with a mai ad two feeders. Because there is virtually o differece
More informationMECHANICAL and hydraulic components in vehicles
2160 IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, VOL. 58, NO. 5, JUNE 2009 Message Schedulig for the FlexRay Protocol: The Dyamic Segmet Ece Gura Schmidt ad Klaus Schmidt Abstract The FlexRay commuicatio
More information}, how many different strings of length n 1 exist? }, how many different strings of length n 2 exist that contain at least one a 1
1. [5] Give sets A ad B, each of cardiality 1, how may fuctios map A i a oe-tooe fashio oto B? 2. [5] a. Give the set of r symbols { a 1, a 2,..., a r }, how may differet strigs of legth 1 exist? [5]b.
More informationEMU-Synchronization Enhanced Mobile Underwater Networks for Assisting Time Synchronization Scheme in Sensors
www.ijecs.i Iteratioal Joural Of Egieerig Ad Computer Sciece ISSN:319-74 Volume 4 Issue 3 March 015, Page No. 760-763 EMU-Sychroizatio Ehaced Mobile Uderwater Networks for Assistig ime Sychroizatio Scheme
More informationThe Detection of Abrupt Changes in Fatigue Data by Using Cumulative Sum (CUSUM) Method
Proceedigs of the th WSEAS Iteratioal Coferece o APPLIED ad THEORETICAL MECHANICS (MECHANICS '8) The Detectio of Abrupt Chages i Fatigue Data by Usig Cumulative Sum (CUSUM) Method Z. M. NOPIAH, M.N.BAHARIN,
More informationDelta- Sigma Modulator with Signal Dependant Feedback Gain
Delta- Sigma Modulator with Sigal Depedat Feedback Gai K.Diwakar #1 ad V.Vioth Kumar *2 # Departmet of Electroics ad Commuicatio Egieerig * Departmet of Electroics ad Istrumetatio Egieerig Vel Tech Uiversity,Cheai,
More informationA Reduced Complexity Channel Estimation for OFDM Systems with Precoding and Transmit Diversity in Mobile Wireless Channels Hlaing Minn, Dong In Kim an
A Reduced Complexity Chael Estimatio for OFDM Systems with Precodig ad Trasmit Diversity i Mobile Wireless Chaels Hlaig Mi, Dog I Kim ad Vijay K. Bhargava Departmet of Electrical ad Computer Egieerig,
More informationAnalysis and Optimization Design of Snubber Cricuit for Isolated DC-DC Converters in DC Power Grid
Aalysis ad Optimizatio Desig of Subber Cricuit for Isolated DC-DC Coverters i DC Power Grid Koji Orikawa Nagaoka Uiversity of Techology Nagaoka, Japa orikawa@st.agaokaut.ac.jp Ju-ichi Itoh Nagaoka Uiversity
More informationProblem of calculating time delay between pulse arrivals
America Joural of Egieerig Research (AJER) 5 America Joural of Egieerig Research (AJER) e-issn: 3-847 p-issn : 3-936 Volume-4, Issue-4, pp-3-4 www.ajer.org Research Paper Problem of calculatig time delay
More informationPROJECT #2 GENERIC ROBOT SIMULATOR
Uiversity of Missouri-Columbia Departmet of Electrical ad Computer Egieerig ECE 7330 Itroductio to Mechatroics ad Robotic Visio Fall, 2010 PROJECT #2 GENERIC ROBOT SIMULATOR Luis Alberto Rivera Estrada
More informationEnergy-Optimal Online Algorithms for Broadcasting in Wireless Networks
Eergy-Optimal Olie Algorithms for Broadcastig i Wireless Networks Shay Kutte, Hirotaka Oo, David Peleg, Kuihiko Sadakae, ad Masafumi Yamashita Abstract The paper cosiders the desig of eergy-efficiet olie
More informationCooperative Diversity Based on Code Superposition
1 Cooperative Diversity Based o Code Superpositio Lei Xiao, Thomas E. Fuja, Jörg Kliewer, Daiel J. Costello, Jr. Departmet of Electrical Egieerig, Uiversity of Notre Dame, Notre Dame, IN 46556, USA Email:
More informationOptimization of Fractional Frequency Reuse in Long Term Evolution Networks
2012 IEEE Wireless Commuicatios ad Networkig Coferece: Mobile ad Wireless Networks Optimizatio of Fractioal Frequecy Reuse i Log Term Evolutio Networks Dimitrios Bilios 1,2, Christos Bouras 1,2, Vasileios
More informationDistributed Resource Management in Multi-hop Cognitive Radio Networks for Delay Sensitive Transmission
1 Distributed Resource Maagemet i Multi-hop Cogitive Radio Networs for Delay Sesitive Trasmissio Hsie-Po Shiag ad Mihaela va der Schaar Departmet of Electrical Egieerig (EE), Uiversity of Califoria Los
More informationA New Energy Consumption Algorithm with Active Sensor Selection Using GELS in Target Coverage WSN
IJCSI Iteratioal Joural of Computer Sciece Issues, Vol. 10, Issue 4, No 1, July 2013 ISSN (Prit): 1694-0814 ISSN (Olie): 1694-0784 www.ijcsi.org 11 A New Eergy Cosumptio Algorithm with Active Sesor Selectio
More informationMeasurements of the Communications Environment in Medium Voltage Power Distribution Lines for Wide-Band Power Line Communications
Measuremets of the Commuicatios viromet i Medium Voltage Power Distributio Lies for Wide-Bad Power Lie Commuicatios Jae-Jo Lee *,Seug-Ji Choi *,Hui-Myoug Oh *, Wo-Tae Lee *, Kwa-Ho Kim * ad Dae-Youg Lee
More informationMeasurement of Equivalent Input Distortion AN 20
Measuremet of Equivalet Iput Distortio AN 2 Applicatio Note to the R&D SYSTEM Traditioal measuremets of harmoic distortio performed o loudspeakers reveal ot oly the symptoms of the oliearities but also
More informationResource Allocation in Downlink MIMO-OFDMA with Proportional Fairness
8 JOURAL OF COUICATIOS VOL. 4 O. FERUARY 009 Resource Allocatio i Dowli IO-OFDA with Proportioal Fairess i Da ad Chi Chug o Departmet of Electrical ad Computer Egieerig atioal Uiversity of Sigapore Email:{dabi
More informationData Acquisition System for Electric Vehicle s Driving Motor Test Bench Based on VC++ *
Available olie at www.sciecedirect.com Physics Procedia 33 (0 ) 75 73 0 Iteratioal Coferece o Medical Physics ad Biomedical Egieerig Data Acquisitio System for Electric Vehicle s Drivig Motor Test Bech
More informationSubcarriers and Bits Allocation in Multiuser Orthogonal Frequency Division Multiplexing System
Sesors & Trasducers, Vol. 168, Issue 4, April 014, pp. 10-15 Sesors & Trasducers 014 by IFSA Publishig, S. L. http://www.sesorsportal.com Subcarriers ad Bits Allocatio i Multiuser Orthogoal Frequecy Divisio
More informationVoluntary Spectrum Handoff: A Novel Approach to Spectrum Management in CRNs
Volutary Spectrum Hadoff: A Novel Approach to Spectrum Maagemet i CRNs Suk-U Yoo ad Eylem Ekici Departmet of Electrical ad Computer Egieerig The Ohio State Uiversity, Columbus, OH, USA Email: {yoos,ekici}@ece.osu.edu
More informationACCEPTED FOR PUBLICATION AT THE EURASIP JOURNAL ON WIRELESS COMMUNICATIONS AND NETWORKING 1
ACCEPTED FOR PUBLICATIO AT TE EURASIP JOURAL O WIRELESS COMMUICATIOS AD ETWORKIG 1 A Approach to Optimum Joit Beamformig Desig i a MIMO-OFDM Multiuser System Atoio Pascual-Iserte, Aa I. Pérez-eira, ad
More informationHigh-Order CCII-Based Mixed-Mode Universal Filter
High-Order CCII-Based Mixed-Mode Uiversal Filter Che-Nog Lee Departmet of Computer ad Commuicatio Egieerig, Taipei Chegshih Uiversity of Sciece ad Techology, Taipei, Taiwa, R. O. C. Abstract This paper
More informationManagement of a Shared Spectrum Network in Wireless Communications
Maagemet of a Shared Spectrum Network i Wireless Commuicatios Shiig Wu, Jiheg Zhag, Rachel Q. Zhag Departmet of Logistics ad Maritime Studies The Hog Kog Polytechic Uiversity, Hog Kog Departmet of Idustrial
More information