Performance Analysis of A Burst-Frame-Based MAC Protocol for Ultra-Wideband Ad Hoc Networks
|
|
- Elmer Elliott
- 5 years ago
- Views:
Transcription
1 Performance Analysis of A Burs-Frame-Based MAC Proocol for Ulra-Wideband Ad Hoc Neworks Kejie Lu, Dapeng Wu, Yuguang Fang Deparmen of Elecrical and Compuer Engineering Universiy Of Florida Gainesville, FL 32611, USA {lukejie,wu,fang}@ece.ufl.edu. Rober C. Qiu Deparmen of Elecrical and Compuer Engineering Tennessee Technological Universiy Box 5077, Cookeville, TN rqiu@nech.edu. Absrac Ulra-wideband (UWB) communicaion is becoming an imporan echnology for fuure Wireless Personal Area Neworks (WPANs). A criical challenge in high daa rae UWB sysem design is ha a receiver usually needs ens of micro-seconds or even ens of milliseconds o synchronize wih ransmied signals, known as he iming acquisiion problem. Such a long synchronizaion ime will cause significan overhead, since he daa rae of UWB sysems is expeced o be very high. To address he overhead problem, we previously proposed a general framework for MAC proocols in high daa rae UWB neworks. In his framework, a node can aggregae muliple upper-layer packes ino a larger burs frame a he MAC layer. In his paper, we analyze he unsauraed hroughpu performance of a bursframe-based MAC proocol wihin he framework. Numerical resuls from he analyical mehod give excellen agreemen wih he simulaion resuls, indicaing he accuracy of our analyical mehod. I. INTRODUCTION In he pas few years, UWB communicaion has received considerable aenion in boh academia and indusry. Compared o radiional narrow band sysems, UWB can provide high daa rae (> 100 Mb/s) wih very low-power emission (less han 41 dbm/mhz) in a shor range. These feaures make UWB paricularly suiable for wireless personal area nework (WPAN) applicaions. Currenly, IEEE working group is sudying he use of UWB as an alernaive physical layer echnique 1]. To successfully implemen a UWB sysem, a number of challenges mus be addressed 2]. One of he criical issues is iming acquisiion, which is a process of synchronizing he receiver s clock wih he ransmier s clock so ha he receiver can deermine he boundary beween wo ransmied symbols. Depending on he receiver design, he acquisiion ime varies from ens of micro-seconds o ens of milliseconds. Evidenly, for high daa rae applicaions, he overhead of preambles will significanly reduce he efficiency of UWB neworks 2]. Exising works ha consider he iming synchronizaion issue in UWB MAC layer design include 3], 4]. In 3], he auhors assumed ha he UWB nework can provide muliple channels hrough differen ime-hopping (TH) codes. To reduce he iming synchronizaion overhead, 3] proposed a link mainenance scheme in which he daa channel is mainained by ransmiing low-rae conrol packes when here is no daa packe o ransmi. Alhough he link mainenance scheme achieves good performance in he simulaion, here are sill some criical issues unclear in 3]. For insance, i is no clear how a node selecs a TH code for is daa channel in a disribued manner so as o avoid using he same TH code as ha used by anoher node. Anoher poenial problem is ha he link mainenance scheme will increase he ransmission ime of he ransmier, hereby reducing he baery life and inroducing exra inerference. In 4], he auhors sudied he impac of long synchronizaion ime on he performance of CSMA/CA and TDMA schemes used in UWB neworks. However, he paper did no provide soluions o miigae he iming acquisiion problem. To address he overhead problem, we proposed a general framework for MAC proocols in high daa rae UWB neworks 5]. In his framework, he MAC proocol is based on he well-known IEEE CSMA/CA proocol. The main idea of he scheme is o assemble muliple upper-layer packes ino one burs frame a he MAC layer. In conras o he radiional approach, under which each upper-layer packe is delivered individually, ransmiing muliple upper-layer packes in one frame will significanly reduce he synchronizaion overhead. Since performance analysis is imporan for MAC proocol design, his paper focuses on unsauraed performance analysis for he burs-frame-based MAC proocol, which has no been addressed previously. Performance of CSMA/CA proocols, paricularly IEEE , has been sudied exensively in he lieraure 6] 8]. However, unil recenly, mos heoreical sudies are focusing on sauraion performance 6], 7], where a node in he nework always has packes ready o be ransmied. Recenly, an unsauraed analysis for IEEE is provided in 8], where he sysem under sudy is decomposed ino a queueing subsysem and a service ime subsysem. In his model, he MAC layer queue is modelled as M/G/1/K; he service ime is characerized by a ransfer funcion. However, his model is no direcly applicable o he unsauraed performance analysis of our burs-frame-based MAC proocol due o he complicaed queueing behavior caused by burs frames. In his work, we ake he same ransfer-funcion approach used in 8] o analyze he unsauraed performance of our burs-frame-based MAC proocol. The major conribuion of our work is ha our analyical mehod can no only handle complicaed queueing behavior bu also provide accurae resuls, which have no been achieved previously. Our numerical resuls from he analyical mehod give good agreemen wih he simulaion resuls, validaing he accuracy of our analyical /05/$20.00 (C) 2005 IEEE 2937
2 mehod. The res of he paper is organized as follows. In Secion II, we briefly describe our MAC proocol for UWB neworks. In Secion III, we analyze he unsauraed performance of he MAC proocol. Simulaion and numerical resuls will be shown in Secion IV. Finally, Secion V concludes he paper. II. A BURST-FRAME-BASED MAC PROTOCOL FOR UWB NETWORKS In his secion, we briefly describe a burs-frame-based MAC proocol which is a special case wihin he framework proposed in 5]. In his proocol, we consider only one qualiyof-service (QoS) class of raffic for each desinaion, i.e., all packes for he same desinaion have he same QoS requiremens. Incoming packes are firs classified based on is desinaion, and hen pu ino a corresponding packe queue. Suppose here are N nodes in a UWB nework; hen we can implemen N packe queues in each node, among which N 1 queues are used for buffering packes desined o oher N 1 nodes, and one queue is used for buffering broadcas packes. For each queue, we use ail-dropping when here is a buffer overflow. A burs frame will be generaed if he oal number of packes in he queue exceeds a hreshold B min and he server is idle (i.e., here is no oher burs waiing for ransmission). In addiion, we assume ha he oal number of packes in a burs mus be smaller han or equal o a prese value B max.in his proocol, we require ha all he packes in a burs frame have he same desinaion so ha mos exising funcions of IEEE can be re-used. To achieve he fairness among desinaions, a simple round-robin scheme will be employed. When a burs assembly is finished, he burs frame will be sored in a buffer and waiing for ransmission. If a burs frame is correcly received, he receiver will send one ACK frame o he ransmier. III. UNSATURATED PERFORMANCE ANALYSIS In his secion, we presen an analyical model for evaluaing our burs-frame-based MAC proocol under differen incoming raffic load. Similar o 8], we also decompose he sysem ino a queueing subsysem and a service ime subsysem. For he queueing subsysem, we exend he model for general bulk service queues 9]. Paricularly, we consider ha a burs can be assembled only when he oal number of packes in he queueing subsysem is greaer han or equal o B min ;wealso consider he fac ha he service ime depends on he number of packes in he burs, which is no considered in 9]. For he service ime subsysem, we analyze he impac of burs assembly on he probabiliy ha a server is idle, and on he service ime disribuion. To faciliae our discussion, we make he following assumpions: There are N idenical nodes in he nework, and any wo nodes in he nework can direcly communicae wih each oher. A each node, packe arrivals are Poisson wih rae λ (packes/sec), and he packes have a common desinaion. The size of all packes are fixed a P (bis). The burs service ime is an ineger muliple of a prese ime uni τ (sec). Here he burs service ime is defined as he ime inerval from he ime epoch ha a burs is assembled o he ime epoch ha he burs is removed from he ransmission buffer. 1 A ransmission buffer is locaed in he service ime subsysem. Packes being sored in a ransmission buffer means ha he packes are in service. There is no ransmission failure due o bi errors. The probabiliy ha a burs ransmission aemp fails, denoed as p, does no depend on he backoff sage of he node. The propagaion delay in UWB neworks is negligible. A. The Bulk Service Queueing Sysem Based on he assumpions above, we can model he queueing sysem in any node as an M/G Bmin,Bmax] /1/K queue, where K is he capaciy of he queue and he superscripion B min,b max ] means ha he oal number of packes in a burs is an ineger in he range of B min,b max ]. Noe ha here K is he oal number of packes ha can be sored in he queue, which does no include packes in he ransmission buffer. To analyze his queueing sysem, we firs define he sae space of he queueing sysem according o he saus of server and he number of packes in he queue. Paricularly, sae I k means ha he server is idle and here are k cusomers waiing in he queue; while sae A k means ha he server is busy and here are k cusomers waiing in he queue. Wih he packe assembly policy described in he previous secion, we noe ha if he server is idle, hen he maximum number of packes in he queue mus be smaller han B min. Therefore, he sae space is S = {I 0,I 1,,I Bmin 1,A 0,A 1,,A K }. Le ξ() ( 0) be he sae of he queueing sysem a ime ; leδ n be he epoch of he n-h burs deparure. We now consider he embedded Markov process ξ n, where ξ n is he sae of he queueing sysem jus before δ n, which is ξ n = ξ(δ n ). An embedded Markov chain can hen be formulaed, where he sae space is {A 0,A 1,,A K }.Lep d k (0 k K) be he seady-sae probabiliy ha ξ n = A k ;lep ij be he seady-sae ransiion probabiliy from sae A i o sae A j for all i, j, where 0 i K and 0 j K: p ij = n Prξ n+1 = A j ξ n = A i ]. Consequenly, p d k can be obained by solving he embedded Markov chain wih all p ij. To calculae p ij, we define α(k, b) as he probabiliy ha k packes arrive during one burs service ime, given ha he 1 A burs will be removed from he ransmission buffer if he burs is successfully received by he desinaion, or if he number of burs ransmission failures exceeds a pre-defined rery i. 2938
3 burs conains b packes. Le B() be he number of packes in he firs burs afer. Define B k = B(δ n ) given ha ξ n = k. Here we noe ha B k depends only on he assembly policy, B min 0 k B min B k = k B min <k B max (1) B max B max k K. Since B k packes will be assembled ino he firs burs afer δ n if ξ n = k, we can see ha he number of packes remaining in he queue immediaely afer he burs is creaed, denoed by K k,is K k = max(0,k B k ). (2) Therefore, we can calculae all p ij hrough 0 0 j<k i α(j K i,b i ) K i j<k p ij = K 1. (3) 1 α(k K i,b i ) j = K k=k i Le q bi be he seady sae probabiliy ha he burs service ime is iτ, given ha here are b packes in he burs. Since he packe arrival is a Poisson process wih rae λ, α(k, b) can be calculaed by α(k, b) = i q bi (λiτ)k e λiτ k! In summary, we noe ha p d k can be calculaed if all q bi are known. B. Exponenial Backoff Scheme Using he Markov modelling echnique inroduced in 6], we can analyze he exponenial backoff scheme for he MAC proocol. Specifically, we can pariion he coninuous ime axis ino slos, where wo consecuive slos are deied by he even of a value change in he backoff couner. We can hen formulae a wo-dimensional discree ime embedded Markov chain as in 7], where he maximum number of reries for a packe is aken ino consideraion. By solving he Markov chain, a closed-form soluion for he probabiliy ha a node will ransmi a burs given ha he node is busy, denoed as p, can be achieved if he burs ransmission probabiliy p is known 2. Since a successful packe delivery means ha here is no collision, we can calculae p hrough (4) p =1 1 (1 p I )p ] N 1 (5) where p I denoes he probabiliy ha a node is idle (no burs pending for ransmission) in a slo. Wih 0 < p < 1 and 0 <p < 1, we can calculae p and p numerically. To calculae p I,weled k () (0 k K) be he oal number of burs deparures in ime (0,) such ha he number of packes in he queue is k jus before he deparure; le D() = k d k() be he oal number of burs deparures in (0,). Noe ha if here are k (k < B min ) packes in he queue jus before a deparure, hen he average ime from he 2 Please refer o 7] for deail discussion. deparure of he old burs o he epoch ha a new burs if formed is (B min k) 1 λ, since packe arrivals are Poisson wih rae λ. We can hen esimae p I as he fracion of ime ha he server is idle, which is Bmin 1 1 p I = ( d k () (B min k) 1 ) ] λ = 1 B min 1 λ Similar o 9], d k () d k () D() D() = p d k d k () (B min k) can be calculaed by ]. (6) ] 1. (7) D() Since D() is he oal number of served burss in, is he average burs deparure inerval. Therefore, D() we have B min 1 D() = T s + p d k (B min k) 1 ] (8) λ where T s denoes he average burs service ime, which is ] K T s = q Bk i (iτ). (9) p d k Finally, p I can be calculaed hrough p I = λt s + B min 1 i B min 1. (10) To summarize his subsecion, we noe ha p and p can be calculaed if all p d k are known. C. Service Time Disribuion Le Q b (z) be he probabiliy-generaing funcion (PGF) of q bi, which is Q b (z) = z i q bi. (11) i Due o he simpliciy of calculaion in he z-ransform domain and he one-o-one correspondence beween q bi and Q b (z), we compue Q b (z) insead of q bi. This approach is known as he ransfer-funcion approach 8]. To calculae Q b (z), we le X n be he lengh of slo n and le X n be he lengh of a period (wihin slo n), during which he server is busy. Noe ha for sauraed condiion, X n X n. However, for unsauraed cases, X n X n. We can hen apply he echnique used in 8]. In his model, he packe ransmission process is characerized by a linear sysem, where H(z) is he PGF of X n given ha he curren node is acive bu no ransmiing; C b (z) is he PGF of X n given ha a collision occurs and he curren node has ransmied a burs ha has b packes; and S b (z) is he PGF of X n given ha 2939
4 he curren node has successfully ransmied a burs wih b packes. Consequenly, he ransfer funcion of he linear sysem is equal o Q b (z). To simplify he noaion, we define H m (z) as follows H m (z) = 1 1+H(z)+H 2 (z)+ + H Wm 1 (z) ]. W m (12) Then Q b (z) can hen be calculaed hrough M m ] Q b (z) = (1 p)s b (z) (pc b (z)) m H i (z) m=0 M +(pc b (z)) M+1 H i (z) i=0 i=0 (13) We now consider he calculaion of S b (z), C b (z), and H(z). Due o ied space, here we only discuss he calculaion for he RTS/CTS access scheme. Since he packe size is fixed, S b (z) and C b (z) can be direcly derived as S b (z) = z (Tso+ bp R ) 1 τ C b (z) = z Tco τ (14) where R is he daa rae, T so is he ime overhead for a successful ransmission, and T co is he ime overhead for collision. According o IEEE proocol, we have T so = 4T sync +3T SIFS + T DIFS + 1 R (4L PH + L RT S + L CTS + L ACK + L MH ) T co = 2T sync + T SIFS + T DIFS + 1 R (2L PH + L RT S + L CTS ) (15) where T sync denoes he synchronizaion ime, T SIFS denoes he ime duraion of SIFS, T DIFS denoes he ime duraion of DIFS, L PH denoes he lengh of physical frame header in bis (excluding he synchronizaion preamble), L MH denoes he lengh of MAC frame header in bis, L RT S denoes he lengh of ACK frame in bis, L CTS denoes he lengh of ACK frame in bis, and L ACK denoes he lengh of ACK frame in bis. To calculae H(z), we define he following parameers: q denoes he probabiliy ha here is a leas one packe ransmission in N 1 nodes in a slo, which is q =1 1 (1 p I )p ] N 1 (16) q s denoes he probabiliy ha here is only one packe ransmission in N 1 nodes in a slo, which is q s =(N 1)(1 p I )p 1 (1 p I )p ] N 2 (17) σ denoes he lengh of a prese fixed ime duraion for backoff. When here is no packe ransmission, we have X n = σ. In b direc sequence spread specrum mode, σ =20µs. Wih hese parameers, we have H(z) =(1 q )z σ τ + q s S(z)+(q q s )C(z) (18) where C(z) =C b (z) and TABLE I SETTING OF THE MAC PROTOCOL. Minimum conenion window size 8 Maximum conenion window size 256 σ 2 µs SIFS 1 µs DIFS 5 µs Rery i 4 Queue size 50 B max S(z) = p b S b (z) (19) b=b min where p b = k:b k =b pd k is he probabiliy mass funcion of he number of packes in a burs. To summarize his subsecion, we noe ha he service ime disribuion q bi can be calculaed if p, p, and all p d k are known. D. Throughpu Analysis Le S() be he oal number of successfully ransmied packes in 0,]. Then we have S() = K d k () B k ( 1 p M+1) + B(0) B(). (20) Now define hroughpu S as he oal amoun of daa (in bis) of MAC payload successfully received in a given ime (in sec). Based on Eqs. (20), (7), and (8), we have S() S = P = P EB] (1 p M+1 ) T s + 1 B min 1 λ (21) where EB] is he average number of packes in a burs EB] = B max b=b min b p b ]. E. Summary of he Algorihm In his analyical model, he performance is obained hrough a recursive algorihm. The algorihm can be summarized as follows 1) Iniialize p I and p b o sauraed condiion, i.e., le p I = 0, p Bmax =1, and p b =0for b B max. 2) Calculae p and p as shown in Secion III-B. 3) Calculae service ime disribuion q bi, using he ransferfuncion approach. 4) Calculae p d k by using he bulk service queueing model. 5) Calculae p I hrough Eq. (10). 6) Calculae S hrough Eq. (21) and sop if he resul converges, i.e., he difference beween he resuls of wo consecuive ieraions is less han a prese value; oherwise go o Sep 2. Alhough he convergence of he recursive algorihm has no been proved, he algorihm always achieves convergence in our numerical calculaions. 2940
5 Throughpu (Mb/s) Analysis Simulaion Throughpu (Mb/s) Bmin=1, Bmax=1] (Ana) Bmin=1, Bmax=1] (Sim) Bmin=1, Bmax=10] (Ana) Bmin=1, Bmax=10] (Sim) Bmin=10, Bmax=10] (Ana) Bmin=10, Bmax=10] (Sim) Ieraion Incoming raffic daa rae (Mb/s) Fig. 1. Analyical resuls vs. number of ieraions (B min =1,B max = 10,R i =90Mb/s). Fig. 2. Throughpu performance versus incoming raffic daa rae wih differen burs assembly policies. IV. SIMULATION AND NUMERICAL RESULTS In his secion, we evaluae he performance of he bursframe-based MAC proocol and compare he numerical resuls of he proposed analyical mehod in Secion III, o he simulaion resuls. Table I liss he values of he conrol parameers used in he simulaions and numerical analysis. Due o he space i, we only presen resuls under he following seing: N =10nodes are locaed in a4m 4 m area. All messages are ransmied wih channel daa rae R, which is 100 Mbis/s. The size of each packe is fixed a 1000 Byes. Packe arrivals o any node i are modelled by a Poisson process wih he same rae λ (packes/s). Consequenly, he incoming raffic daa rae is R i = NPλ (bis/s). We assume ha T sync = 10µs, which is a ypical assumpionin1]. We assume ha no packe ransmission failure occurs due o bi errors. We assume ha he RTS/CTS scheme is used. For he analyical model, we le ime uni τ = σ, le he maximum service ime be ime unis, and run he algorihm for 20 ieraions. Figure 1 shows he analyical resuls versus he number of ieraions, where we le B min =1, B max =10, and R i =90 Mb/s. We can observe ha, if he number of ieraions is larger han 15, he analyical resul converges, and is very close o he simulaion resul. Figure 2 compares he hroughpu performance versus incoming raffic rae for hree burs assembly policies: 1) B min = B max = 1 (benchmark), 2) B min = 1,B max = 10, 3) B min = B max = 10. We can see ha, compared o he bench mark case, he proposed MAC proocol can significanly improve he hroughpu performance. Paricularly, if R i = R, he bench mark hroughpu is only abou 52 Mb/s; while policy (2) and (3) can achieve as high as 88 Mb/s and 92 Mb/s, respecively. From Fig. 2 we can also observe ha our analyical model is highly accurae under differen incoming daa raes. Such accuracy has no been achieved by he previous analysis; hence our analysis represens a major conribuion. V. CONCLUSIONS In his paper, we developed an analyical model o evaluae he performance of a burs-frame-based MAC proocol, in which a node can aggregae muliple upper-layer packes ino a larger burs frame a he MAC layer. The proposed heoreical model can analyze he unsauraed hroughpu performance of he burs-frame-based MAC proocol, which has no been addressed previously. In addiion, he proposed mehod is general and hence applicable o unsauraed performance analysis for oher CSMA/CA based proocols. Numerical resuls from he analyical mehod give excellen agreemen wih he simulaion resuls, validaing he accuracy of our analyical model. REFERENCES 1] IEEE P /0137r1, DS-UWB physical layer submission o Task Group 3a, Mar. 2004, Projec: IEEE P Working Group for Wireless Personal Area Neworks (WPANs). 2] S. Roy, J. R. Foerser, V. S. Somayazulu, and D. G. Leeper, Ulrawideband radio design: The promise of high-speed, shor-range wireless conneciviy, Proc. IEEE, vol. 92, no. 2, pp , Feb ] S. S. Kolenchery, J. K. Townsend, and J. A. Freebersyser, A novel impulse radio nework for acical miliary wireless communicaions, in Proc. IEEE MILCOM 1998, 1998, pp ] J. Ding, L. Zhao, S. Medidi, and K. Sivalingam, MAC proocols for ulra wideband (UWB) wireless neworks: Impac of channel acquisiion ime, in Proc. SPIE ITCOM 2002, July ] K. Lu, D. Wu, and Y. Fang, A novel framework for medium access conrol in ulra-wideband ad hoc neworks, Dynamics of Coninuous, Discree and Impulsive Sysems (Series B) Special Issue on Ulra-Wideband (UWB) Wireless Communicaions for Shor Range Communicaions, (o appear), Online]. Available: hp:// camera.pdf 6] G. Bianchi, Performance analysis of he ieee disribued coordinaion funcion, IEEE J. Selec. Areas Commun., vol. 18, no. 3, pp , Mar ] H. Wu, Y. Peng, K. Long, S. Cheng, and J. Ma, Performance of reliable ranspor proocol over IEEE wireless LAN: analysis and enhancemen, in Proc. IEEE INFOCOM, June 2002, pp ] H. Zhai, Y. Kwon, and Y. Fang, Performance analysis of IEEE MAC proocol in wireless LAN, Wiley Journal of Wireless Communicaions and Moble Compuing (WCMC), pp , Dec ] G. Hebuerne and C. Rosenberg, Arrival and deparure sae disribuions in he general bulk-service queue, Naval Research Logisics, vol. 46, pp ,
Examination Mobile & Wireless Networking ( ) April 12,
Page 1 of 5 Examinaion Mobile & Wireless Neworking (192620010) April 12, 2017 13.45 16.45 Noes: Only he overhead shees used in he course, 2 double-sided shees of noes (any fon size/densiy!), and a dicionary
More informationB-MAC Tunable MAC protocol for wireless networks
B-MAC Tunable MAC proocol for wireless neworks Summary of paper Versaile Low Power Media Access for Wireless Sensor Neworks Presened by Kyle Heah Ouline Inroducion o B-MAC Design of B-MAC B-MAC componens
More informationReceiver-Initiated vs. Short-Preamble Burst MAC Approaches for Multi-channel Wireless Sensor Networks
Receiver-Iniiaed vs. Shor-Preamble Burs MAC Approaches for Muli-channel Wireless Sensor Neworks Crisina Cano, Boris Bellala, and Miquel Oliver Universia Pompeu Fabra, C/ Tànger 122-140, 08018 Barcelona,
More informationWill my next WLAN work at 1 Gbps?
Will my nex WLAN work a 1 Gbps? Boris Bellala boris.bellala@upf.edu hp://www.dic.upf.edu/ bbellal/ Deparmen of Informaion and Communicaion Technologies (DTIC) Universia Pompeu Fabra (UPF) 2013 Ouline Moivaion
More informationMobile Communications Chapter 3 : Media Access
Moivaion Can we apply media access mehods from fixed neworks? Mobile Communicaions Chaper 3 : Media Access Moivaion SDMA, FDMA, TDMA Aloha Reservaion schemes Collision avoidance, MACA Polling CDMA SAMA
More informationStarvation Mitigation Through Multi-Channel Coordination in CSMA Multi-hop Wireless Networks
Sarvaion Miigaion Through Muli-Channel Coordinaion in CSMA Muli-hop Wireless Neworks Jingpu Shi, Theodoros Salonidis, and Edward W. Knighly Deparmen of Elecrical and Compuer Engineering Rice Universiy,
More informationA WIDEBAND RADIO CHANNEL MODEL FOR SIMULATION OF CHAOTIC COMMUNICATION SYSTEMS
A WIDEBAND RADIO CHANNEL MODEL FOR SIMULATION OF CHAOTIC COMMUNICATION SYSTEMS Kalle Rui, Mauri Honanen, Michael Hall, Timo Korhonen, Veio Porra Insiue of Radio Communicaions, Helsini Universiy of Technology
More informationPerformance Evaluation of a MAC Protocol for Radio over Fiber Wireless LAN operating in the 60-GHz band
Performance Evaluaion of a Proocol for Radio over Fiber Wireless LAN operaing in he -GHz band Hong Bong Kim, Adam Wolisz Telecommunicaion Neworks Group Deparmen of Elecrical and Compuer Engineering Technical
More informationECMA st Edition / June Near Field Communication Wired Interface (NFC-WI)
ECMA-373 1 s Ediion / June 2006 Near Field Communicaion Wired Inerface (NFC-WI) Sandard ECMA-373 1 s Ediion / June 2006 Near Field Communicaion Wired Inerface (NFC-WI) Ecma Inernaional Rue du Rhône 114
More informationTELE4652 Mobile and Satellite Communications
TELE465 Mobile and Saellie Communicaions Assignmen (Due: 4pm, Monday 7 h Ocober) To be submied o he lecurer before he beginning of he final lecure o be held a his ime.. This quesion considers Minimum Shif
More informationInvestigation and Simulation Model Results of High Density Wireless Power Harvesting and Transfer Method
Invesigaion and Simulaion Model Resuls of High Densiy Wireless Power Harvesing and Transfer Mehod Jaber A. Abu Qahouq, Senior Member, IEEE, and Zhigang Dang The Universiy of Alabama Deparmen of Elecrical
More informationMultiuser Interference in TH-UWB
Ouline Roman Merz, Cyril Boeron, Pierre-André Farine Insiue of Microechnology Universiy of Neuchâel 2000 Neuchâel Workshop on UWB for Sensor Neworks, 2005 Ouline Ouline 1 Inroducion Moivaions and Goals
More informationTR-MAC: An Energy-E cient MAC Protocol for Wireless Sensor Networks exploiting Noise-based Transmitted Reference Modulation
TR-MAC: An Energy-E cien MAC Proocol for Wireless Sensor Neworks exploiing Noise-based Transmied Reference Modulaion Sarwar Morshed and Geer Heijenk Universiy of Twene, The Neherlands {s.morshed, geer.heijenk}@uwene.nl
More informationTraffic. analysis. The general setting. Example: buffer. Arrival Curves. Cumulative #bits: R(t), R*(t) Instantaneous speeds: r(t), r*(t)
The general seing Traffic Cumulaive #bis: R(), R*() Insananeous speeds: r(), r*() analysis R(): arrivals sysem R*(): deparures Lecure 7 2 Lecure 7 3 Example: buffer R() R*() bi rae c R() = #bis ha arrived
More informationVoIP over a wired link
VoIP over a wired link 1 1 Wireless Communicaions Phil Fleming Nework Advanced Technology Group Moorola, Inc. 1 3 3 3 Wireless Communicaions For he personal use of he paricipans in he IMA summer program
More informationAn off-line multiprocessor real-time scheduling algorithm to reduce static energy consumption
An off-line muliprocessor real-ime scheduling algorihm o reduce saic energy consumpion Firs Workshop on Highly-Reliable Power-Efficien Embedded Designs Shenzhen, China Vincen Legou, Mahieu Jan, Lauren
More informationTransmit Beamforming with Reduced Feedback Information in OFDM Based Wireless Systems
Transmi Beamforming wih educed Feedback Informaion in OFDM Based Wireless Sysems Seung-Hyeon Yang, Jae-Yun Ko, and Yong-Hwan Lee School of Elecrical Engineering and INMC, Seoul Naional Universiy Kwanak
More informationOn Eliminating the Exposed Terminal Problem Using Signature Detection
1 On Eliminaing he Exposed Terminal Problem Using Signaure Deecion Junmei Yao, Tao Xiong, Jin Zhang and Wei Lou Deparmen of Compuing, The Hong Kong Polyechnic Universiy, Hong Kong {csjyao, csxiong, csjzhang,
More informationA Flexible Contention Resolution Scheme for QoS Provisioning in Optical Burst Switching Networks
A Flexible Conenion Resoluion Scheme for QoS Provisioning in Opical Burs Swiching Neworks Ashok K. Turuk a, Rajeev Kumar b,,1 a Deparmen of Compuer Science and Engineering, Naional Insiue of Technology,
More informationPulse Train Controlled PCCM Buck-Boost Converter Ming Qina, Fangfang Lib
5h Inernaional Conference on Environmen, Maerials, Chemisry and Power Elecronics (EMCPE 016 Pulse Train Conrolled PCCM Buck-Boos Converer Ming Qina, Fangfang ib School of Elecrical Engineering, Zhengzhou
More informationNetwork Performance Metrics
Fundamenals of Compuer Neworks ECE 478/578 Lecure #3 Insrucor: Loukas Lazos Dep of Elecrical and Compuer Engineering Universiy of rizona Nework Performance Merics andwidh moun of daa ransmied per uni of
More informationEnergy Efficient Data Fragmentation for Ubiquitous Computing
The Compuer Journal Advance Access published Sepember 1, 2013 The Briish Compuer Sociey 2013. All righs reserved. For Permissions, please email: journals.permissions@oup.com doi:10.1093/comjnl/bx080 Energy
More informationMotion-blurred star image acquisition and restoration method based on the separable kernel Honglin Yuana, Fan Lib and Tao Yuc
5h Inernaional Conference on Advanced Maerials and Compuer Science (ICAMCS 206) Moion-blurred sar image acquisiion and resoraion mehod based on he separable kernel Honglin Yuana, Fan Lib and Tao Yuc Beihang
More informationEMF: Embedding Multiple Flows of Information in Existing Traffic for Concurrent Communication among Heterogeneous IoT Devices
EMF: Embedding Muliple Flows of Informaion in Exising Traffic for Concurren Communicaion among Heerogeneous IoT Devices Zicheng Chi, Zhichuan Huang, Yao Yao, Tianian Xie, Hongyu Sun, and Ting Zhu Deparmen
More informationOn the Scalability of Ad Hoc Routing Protocols
On he Scalabiliy of Ad Hoc Rouing Proocols César A. Saniváñez Bruce McDonald Ioannis Savrakakis Ram Ramanahan Inerne. Research Dep. Elec. & Comp. Eng. Dep. Dep. of Informaics Inerne. Research Dep. BBN
More informationECE-517 Reinforcement Learning in Artificial Intelligence
ECE-517 Reinforcemen Learning in Arificial Inelligence Lecure 11: Temporal Difference Learning (con.), Eligibiliy Traces Ocober 8, 2015 Dr. Iamar Arel College of Engineering Deparmen of Elecrical Engineering
More informationDS CDMA Scheme for WATM with Errors and Erasures Decoding
DS CDMA Scheme for WATM wih Errors and Erasures Decoding Beaa J. Wysocki*, Hans-Jürgen Zepernick*, and Tadeusz A. Wysocki** * Ausralian Telecommunicaions Research Insiue Curin Universiy of Technology GPO
More information4.5 Biasing in BJT Amplifier Circuits
4/5/011 secion 4_5 Biasing in MOS Amplifier Circuis 1/ 4.5 Biasing in BJT Amplifier Circuis eading Assignmen: 8086 Now le s examine how we C bias MOSFETs amplifiers! f we don bias properly, disorion can
More informationGeographic Random Forwarding (GeRaF) for ad hoc and sensor networks: energy and latency performance
Geographic Random Forwarding (GeRaF) for ad hoc and sensor neworks: energy and laency performance Michele Zorzi, Senior Member, IEEE, and Ramesh R. Rao, Senior Member, IEEE o appear in he IEEE Transacions
More informationMemorandum on Impulse Winding Tester
Memorandum on Impulse Winding Teser. Esimaion of Inducance by Impulse Response When he volage response is observed afer connecing an elecric charge sored up in he capaciy C o he coil L (including he inside
More informationLecture 11. Digital Transmission Fundamentals
CS4/MSc Compuer Neworking Lecure 11 Digial Transmission Fundamenals Compuer Neworking, Copyrigh Universiy of Edinburgh 2005 Digial Transmission Fundamenals Neworks consruced ou of Links or ransmission
More informationGaN-HEMT Dynamic ON-state Resistance characterisation and Modelling
GaN-HEMT Dynamic ON-sae Resisance characerisaion and Modelling Ke Li, Paul Evans, Mark Johnson Power Elecronics, Machine and Conrol group Universiy of Noingham, UK Email: ke.li@noingham.ac.uk, paul.evans@noingham.ac.uk,
More informationChapter 14: Bandpass Digital Transmission. A. Bruce Carlson Paul B. Crilly 2010 The McGraw-Hill Companies
Communicaion Sysems, 5e Chaper 4: Bandpass Digial Transmission A. Bruce Carlson Paul B. Crilly The McGraw-Hill Companies Chaper 4: Bandpass Digial Transmission Digial CW modulaion Coheren binary sysems
More informationPointwise Image Operations
Poinwise Image Operaions Binary Image Analysis Jana Kosecka hp://cs.gmu.edu/~kosecka/cs482.hml - Lookup able mach image inensiy o he displayed brighness values Manipulaion of he lookup able differen Visual
More informationModeling the Reliability of Packet Group Transmission in Wireless Network
Modeling he Reliabiliy of Packe Group Transmission in Wireless ework Hao Wen, Chuang Lin, Hongkun Yang, Fengyuan Ren, Yao Yue Tsinghua Universiy, Beijing China Cornell Universiy, USA {wenhao, clin, yanghk,
More informationNotes on the Fourier Transform
Noes on he Fourier Transform The Fourier ransform is a mahemaical mehod for describing a coninuous funcion as a series of sine and cosine funcions. The Fourier Transform is produced by applying a series
More informationCollaborative communication protocols for wireless sensor networks
Collaboraive communicaion proocols for wireless sensor neworks Sefan Dulman, Lodewijk v. Hoesel, Tim Nieberg, Paul Havinga Faculy of Elecrical Engineering, Mahemaics and Compuer Science Universiy of Twene
More informationModelling the Performance of a Cross-Layer TCP NewReno-HARQ System
In. J. Communicaions, Nework and Sysem Sciences, 00, 3, 9-3 doi:0.436/ijcns.00.300 Published Online January 00 (hp://www.scirp.org/journal/ijcns/). 4 Modelling he Performance of a Cross-Layer TCP NewReno-HARQ
More informationArchitectures for Resource Reservation Modules for Optical Burst Switching Core Nodes *
4. ITG-Fachagung Phoonic Neworks, May 5. - 6., 2003, Leipzig, Germany Archiecures for Resource Reservaion Modules for Opical Burs Swiching Core Nodes * Sascha Junghans, Chrisoph M. Gauger Universiy of
More informationA New MAC Protocol with Control Channel Auto-Discovery for Self-Deployed Cognitive Radio Networks
1 A New MAC Proocol wih Conrol Channel Auo-Discovery for Self-Deployed Cogniive Radio Neworks Ahanassios V. Adamis, Member, IEEE, Konsaninos N. Maliasos, Member, IEEE, and Prof. Philip Consaninou, Senior
More informationECMA-373. Near Field Communication Wired Interface (NFC-WI) 2 nd Edition / June Reference number ECMA-123:2009
ECMA-373 2 nd Ediion / June 2012 Near Field Communicaion Wired Inerface (NFC-WI) Reference number ECMA-123:2009 Ecma Inernaional 2009 COPYRIGHT PROTECTED DOCUMENT Ecma Inernaional 2012 Conens Page 1 Scope...
More informationDevelopment of Temporary Ground Wire Detection Device
Inernaional Journal of Smar Grid and Clean Energy Developmen of Temporary Ground Wire Deecion Device Jing Jiang* and Tao Yu a Elecric Power College, Souh China Universiy of Technology, Guangzhou 5164,
More informationEfficient burst assembly algorithm with traffic prediction
Efficien burs assembly algorihm wih raffic predicion Mmoloki Mangwala, Boyce B. Sigweni and Bakhe M. Nleya Deparmen of compuer science Norh Wes Universiy, Privae Bag X2046, Mmabaho, 2735 Tel: +27 8 3892,
More informationPerformance Analysis of High-Rate Full-Diversity Space Time Frequency/Space Frequency Codes for Multiuser MIMO-OFDM
Performance Analysis of High-Rae Full-Diversiy Space Time Frequency/Space Frequency Codes for Muliuser MIMO-OFDM R. SHELIM, M.A. MATIN AND A.U.ALAM Deparmen of Elecrical Engineering and Compuer Science
More informationCollision Detection Method Using Self Interference Cancelation for Random Access Multiuser MIMO
elecronics Aricle Collision Deecion Mehod Using Self Inerference Cancelaion for Random Access Muliuser MIMO Kazuma Ando 1, Kenaro Nishimori 1, * ID, Ryochi Kaaoka 1, Takefumi Hiraguri 2, Yoshiaki Morino
More informationKey Issue. 3. Media Access. Hidden and Exposed Terminals. Near and Far Terminals. FDD/FDMA General Scheme, Example GSM. Access Methods SDMA/FDMA/TDMA
Key Issue Can we apply media access mehods from fixed neworks? 3. Media Access SDMA, FDMA, TDMA Aloha and Reservaion Schemes Avoidance and Polling MACA, CDMA, SAMA Example CSMA/CD: Carrier Sense Muliple
More informationSignaling Cost Analysis for Handoff Decision Algorithms in Femtocell Networks
Signaling Cos Analysis for Hoff Decision Algorihms in Femocell Neworks Wahida Nasrin Jiang Xie The Universiy of Norh Carolina a Charloe Charloe, NC 28223-1 Email: {wnasrin, Linda.Xie}uncc.edu Absrac Femocells
More informationTable of Contents. 3.0 SMPS Topologies. For Further Research. 3.1 Basic Components. 3.2 Buck (Step Down) 3.3 Boost (Step Up) 3.4 Inverter (Buck/Boost)
Table of Conens 3.0 SMPS Topologies 3.1 Basic Componens 3.2 Buck (Sep Down) 3.3 Boos (Sep Up) 3.4 nverer (Buck/Boos) 3.5 Flyback Converer 3.6 Curren Boosed Boos 3.7 Curren Boosed Buck 3.8 Forward Converer
More informationDelay improved Media Access Control for Passive Optical Networks
Copyrigh Noice c 2015 IEEE. Personal use of his maerial is permied. However, permission o reprin/republish his maerial for adverising or promoional purposes or for creaing new collecive works for resale
More informationAnti-Jamming Schedules for Wireless Data Broadcast Systems
Ani-Jamming Schedules for Wireless Daa Broadcas Sysems Paolo Codenoi 1, Alexander Sprinson, and Jehoshua Bruck Absrac Modern sociey is heavily dependen on wireless neworks for providing voice and daa communicaions.
More informationProcess-Stacking Multiplexing Access for 60 GHz Millimeter-Wave WPANs
Process-Sacking Muliplexing Access for 6 GHz Millimeer-Wave WPANs Claudio Esevez, David Fuenealba, Aravind Kailas Deparmen of Elecrical Engineering, Universidad de Chile, Saniago, Chile {cesevez, dfuenea}@ing.uchile.cl
More informationMultiple Load-Source Integration in a Multilevel Modular Capacitor Clamped DC-DC Converter Featuring Fault Tolerant Capability
Muliple Load-Source Inegraion in a Mulilevel Modular Capacior Clamped DC-DC Converer Feauring Faul Toleran Capabiliy Faisal H. Khan, Leon M. Tolber The Universiy of Tennessee Elecrical and Compuer Engineering
More informationDouble Tangent Sampling Method for Sinusoidal Pulse Width Modulation
Compuaional and Applied Mahemaics Journal 2018; 4(1): 8-14 hp://www.aasci.org/journal/camj ISS: 2381-1218 (Prin); ISS: 2381-1226 (Online) Double Tangen Sampling Mehod for Sinusoidal Pulse Widh Modulaion
More informationCoexistence of Ultra-Wideband Systems with IEEE a Wireless LANs
Coexisence of Ulra-Wideband Sysems wih IEEE-8.11a Wireless LANs J. Bellorado 1, S.S. Ghassemzadeh, L. J. Greensein 3, T. Sveinsson 1, V. Tarokh 1 Absrac In his sudy we provide a physical layer based analysis
More information(This lesson plan assumes the students are using an air-powered rocket as described in the Materials section.)
The Mah Projecs Journal Page 1 PROJECT MISSION o MArs inroducion Many sae mah sandards and mos curricula involving quadraic equaions require sudens o solve "falling objec" or "projecile" problems, which
More informationChapter 2 Introduction: From Phase-Locked Loop to Costas Loop
Chaper 2 Inroducion: From Phase-Locked Loop o Cosas Loop The Cosas loop can be considered an exended version of he phase-locked loop (PLL). The PLL has been invened in 932 by French engineer Henri de Belleszice
More informationSocial-aware Dynamic Router Node Placement in Wireless Mesh Networks
Social-aware Dynamic Rouer Node Placemen in Wireless Mesh Neworks Chun-Cheng Lin Pei-Tsung Tseng Ting-Yu Wu Der-Jiunn Deng ** Absrac The problem of dynamic rouer node placemen (dynrnp) in wireless mesh
More informationReview Wireless Communications
EEC173B/ECS152C, Winer 2006 Review of las week s maerial Wireless Channel Access Challenges: Hidden/Exposed Terminals Access Mehods: SDMA, FDMA, TDMA, CDMA Random Access: Aloha, CSMA/CD, Reservaion Chuah,
More informationTo Relay or Not to Relay: Learning Device-to-Device Relaying Strategies in Cellular Networks
To Relay or No o Relay: Learning Device-o-Device Relaying Sraegies in Cellular Neworks Nicholas Masronarde, Viral Pael, Jie Xu, Lingia Liu, and Mihaela van der Schaar Absrac- We consider a cellular nework
More informationEE201 Circuit Theory I Fall
EE1 Circui Theory I 17 Fall 1. Basic Conceps Chaper 1 of Nilsson - 3 Hrs. Inroducion, Curren and Volage, Power and Energy. Basic Laws Chaper &3 of Nilsson - 6 Hrs. Volage and Curren Sources, Ohm s Law,
More informationAnalysis of Low Density Codes and Improved Designs Using Irregular Graphs
Analysis of Low Densiy Codes and Improved Designs Using Irregular Graphs Michael G. Luby Michael Mizenmacher M. Amin Shokrollahi Daniel A. Spielman Absrac In [6], Gallager inroduces a family of codes based
More informationA Novel Routing Algorithm for Power Line Communication over a Low-voltage Distribution Network in a Smart Grid
Energies 0, 6, 4-48; doi:0.90/en604 Aricle OPEN ACCESS energies ISSN 996-07 www.mdpi.com/journal/energies A Novel Rouing Algorihm for Power Line Communicaion over a Low-volage Disribuion Nework in a Smar
More informationTransmit Power Minimization and Base Station Planning for High-Speed Trains with Multiple Moving Relays in OFDMA Systems
Transmi Power Minimizaion and Base Saion Planning for High-Speed Trains wih Muliple Moving Relays in OFDMA Sysems Hakim Ghazzai, Member, IEEE, Taha Bouchoucha, Suden Member, IEEE, Ahmad Alsharoa, Suden
More informationEXPERIMENT #9 FIBER OPTIC COMMUNICATIONS LINK
EXPERIMENT #9 FIBER OPTIC COMMUNICATIONS LINK INTRODUCTION: Much of daa communicaions is concerned wih sending digial informaion hrough sysems ha normally only pass analog signals. A elephone line is such
More informationForward-link Throughput Optimization for Wireless Cellular Packet Data Networks
JCS& Vol. 11 No. Ocober 11 Forward-link hroughpu Opimizaion for Wireless Cellular Packe Daa Neworks Moses E. Ekpenyong Deparmen of Compuer Science Universiy of Uyo, PMB. 117, 3, Uyo, NIGERIA (ekpenyong_moses@yahoo.com,
More informationIntegrated Scheduling of Multimedia and Hard Real-Time Tasks
Inegraed Scheduling of Mulimedia and Hard Real-Time Tasks Hiroyuki Kaneko, John A. Sankovic, Subhabraa Sen and Krihi Ramamriham Compuer Science Deparmen Universiy of Massachuses LGRC, Box 346 Amhers MA
More informationUniversity of Maryland, College Park, MD 20742, USA. San Diego, CA 92121, USA.
On Specrum Sharing in Cooperaive Muliple Access Neworks Amr El-Sherif, Ahmed K. Sadek 2,andK.J.RayLiu Deparmen of Elecrical and Compuer Engineering, 2 Corporae R&D Qualcomm Inc., Universiy of Maryland,
More informationForeign Fiber Image Segmentation Based on Maximum Entropy and Genetic Algorithm
Journal of Compuer and Communicaions, 215, 3, 1-7 Published Online November 215 in SciRes. hp://www.scirp.org/journal/jcc hp://dx.doi.org/1.4236/jcc.215.3111 Foreign Fiber Image Segmenaion Based on Maximum
More informationLecture #7: Discrete-time Signals and Sampling
EEL335: Discree-Time Signals and Sysems Lecure #7: Discree-ime Signals and Sampling. Inroducion Lecure #7: Discree-ime Signals and Sampling Unlike coninuous-ime signals, discree-ime signals have defined
More informationThe Design and Evaluation of a Wireless Sensor Network for Mine Safety Monitoring
The Design and Evaluaion of a Wireless Sensor Nework for Mine Safey Monioring Xiaoguang Niu 1 (Member IEEE, Xi Huang 1, Ze Zhao 1, Yuhe Zhang 1, Changcheng Huang 1 (Senior Member IEEE, Li Cui 1* (Member
More informationNetwork Design and Optimization for Quality of Services in Wireless Local Area Networks using Multi-Objective Approach
Chuima Prommak and Naruemon Waanapongsakorn Nework Design and Opimizaion for Qualiy of Services in Wireless Local Area Neworks using Muli-Objecive Approach CHUTIMA PROMMAK, NARUEMON WATTANAPONGSAKORN *
More informationAutomatic Power Factor Control Using Pic Microcontroller
IDL - Inernaional Digial Library Of Available a:www.dbpublicaions.org 8 h Naional Conference on Advanced Techniques in Elecrical and Elecronics Engineering Inernaional e-journal For Technology And Research-2017
More informationIncreasing Measurement Accuracy via Corrective Filtering in Digital Signal Processing
ISSN(Online): 39-8753 ISSN (Prin): 347-67 Engineering and echnology (An ISO 397: 7 Cerified Organizaion) Vol. 6, Issue 5, ay 7 Increasing easuremen Accuracy via Correcive Filering in Digial Signal Processing
More informationEvaluation of Instantaneous Reliability Measures for a Gradual Deteriorating System
General Leers in Mahemaic, Vol. 3, No.3, Dec 27, pp. 77-85 e-issn 259-9277, p-issn 259-9269 Available online a hp:\\ www.refaad.com Evaluaion of Insananeous Reliabiliy Measures for a Gradual Deerioraing
More informationCommunication Systems. Communication Systems
Communicaion Sysems Analog communicaion Transmi and receive analog waveforms Ampliude Modulaion (AM Phase Modulaion (PM Freq. Modulaion (FM Quadraure Ampliude Modulaion (QAM Pulse Ampliude Modulaion (PAM
More informationComparison of ATP Simulation and Microprocessor
Elecrical Engineering Research (EER), Volume 3, 15 Comparison of ATP Simulaion and Microprocessor Based Faul ocaion Using DFT H Nouri *1, F Jalili, T Boxshall 3 Power Sysems, Elecronics and Conrol Research
More informationAvoid link Breakage in On-Demand Ad-hoc Network Using Packet's Received Time Prediction
Avoid link Breakage in On-Demand Ad-hoc Nework Using acke's Received Time redicion Naif Alsharabi, Ya ping Lin, Waleed Rajeh College of Compuer & Communicaion Hunan Universiy ChangSha 182 Sharabi28@homail.com,
More informationA NEW DUAL-POLARIZED HORN ANTENNA EXCITED BY A GAP-FED SQUARE PATCH
Progress In Elecromagneics Research Leers, Vol. 21, 129 137, 2011 A NEW DUAL-POLARIZED HORN ANTENNA EXCITED BY A GAP-FED SQUARE PATCH S. Ononchimeg, G. Ogonbaaar, J.-H. Bang, and B.-C. Ahn Applied Elecromagneics
More informationA Perspective on Radio Resource Management in B3G
A Perspecive on Radio Resource Managemen in B3G Oriol Sallen Universia Poliècnica de Caalunya (UPC) E-mail: sallen@sc.upc.edu Absrac.- Beyond 3G usually refers o heerogeneous scenarios where differen Radio
More informationEE 330 Lecture 24. Amplification with Transistor Circuits Small Signal Modelling
EE 330 Lecure 24 Amplificaion wih Transisor Circuis Small Signal Modelling Review from las ime Area Comparison beween BJT and MOSFET BJT Area = 3600 l 2 n-channel MOSFET Area = 168 l 2 Area Raio = 21:1
More informationNegative frequency communication
Negaive frequency communicaion Fanping DU Email: dufanping@homail.com Qing Huo Liu arxiv:2.43v5 [cs.it] 26 Sep 2 Deparmen of Elecrical and Compuer Engineering Duke Universiy Email: Qing.Liu@duke.edu Absrac
More informationDAGSTUHL SEMINAR EPIDEMIC ALGORITHMS AND PROCESSES: FROM THEORY TO APPLICATIONS
DAGSTUHL SEMINAR 342 EPIDEMIC ALGORITHMS AND PROCESSES: FROM THEORY TO APPLICATIONS A Sysems Perspecive Pascal Felber Pascal.Felber@unine.ch hp://iiun.unine.ch/! Gossip proocols Inroducion! Decenralized
More informationUltrawideband Normalized Radar Cross Sections of Distributed Clutter
Ulrawideband Normalized Radar Cross Secions o Disribued Cluer Ram M. Narayanan Deparmen o Elecrical Engineering The Pennsylvania Sae Universiy Universiy Park, PA 68, USA ram@engr.psu.edu Absrac Theoreical
More informationQuantifying Application Communication Reliability of Wireless Sensor Networks
Inernaional Journal of Performabiliy ngineering Vol. 4, No., January 008, pp. 43-56. RAMS Consulans Prined in India Quanifying Applicaion Communicaion Reliabiliy of Wireless Sensor Neworks AKHILSH SHRSTHA
More informationThe Influence of Propagation Environment in a Live GSM Network
The Influence of Propagaion Environmen in a ive GSM Nework Yu-Huei Tseng, Wen-Shyang Hwang, *Ce-Kuen Shieh Deparmen of Elecrical Engineering, Naional Kaohsiung Universiy of Applied Sciences, Kaohsiung,
More informationJitter Analysis of Current-Mode Logic Frequency Dividers
Universiy of California a Davis, Deparmen of Elecrical and Compuer Engineering Marko Aleksic Jier Analysis of Curren-Mode Logic Frequency Dividers Ph.D. Research Proposal able of Conens Secion : Inroducion
More informationLocation Tracking in Mobile Ad Hoc Networks using Particle Filter
Locaion Tracking in Mobile Ad Hoc Neworks using Paricle Filer Rui Huang and Gergely V. Záruba Compuer Science and Engineering Deparmen The Universiy of Texas a Arlingon 46 Yaes, 3NH, Arlingon, TX 769 email:
More informationPREVENTIVE MAINTENANCE WITH IMPERFECT REPAIRS OF VEHICLES
Journal of KONES Powerrain and Transpor, Vol.14, No. 3 2007 PEVENTIVE MAINTENANCE WITH IMPEFECT EPAIS OF VEHICLES Józef Okulewicz, Tadeusz Salamonowicz Warsaw Universiy of Technology Faculy of Transpor
More informationDURING last decade, many communication technologies
1 TeamPhone: Neworking Smarphones for isaser Recovery Zongqing Lu, Guohong ao, and Thomas La Pora and suppors daa communicaions among rescue workers in infrasrucure-consrained and infrasrucure-less scenarios.
More informationDigital Communications - Overview
EE573 : Advanced Digial Communicaions Digial Communicaions - Overview Lecurer: Assoc. Prof. Dr Noor M Khan Deparmen of Elecronic Engineering, Muhammad Ali Jinnah Universiy, Islamabad Campus, Islamabad,
More informationTHE Cisco visual network index report predicts a drastic
IEEE TRANSACTIONS ON MULTIMEDIA, VOL. 18, NO. 7, JULY 2016 1401 Qualiy of Experience Driven Muli-User Video Sreaming in Cellular Cogniive Radio Neworks Wih Single Channel Access Zhifeng He, Shiwen Mao,
More informationVariation Aware Cross-Talk Aggressor Alignment by Mixed Integer Linear Programming
ariaion Aware Cross-alk Aggressor Alignmen by Mixed Ineger Linear Programming ladimir Zoloov IBM. J. Wason Research Cener, Yorkown Heighs, NY zoloov@us.ibm.com Peer Feldmann D. E. Shaw Research, New York,
More informationDisribued by: www.jameco.com 1-800-831-4242 The conen and copyrighs of he aached maerial are he propery of is owner. 16K-Bi CMOS PARALLEL E 2 PROM FEATURES Fas Read Access Times: 200 ns Low Power CMOS
More informationMarkov Decision Model for Perceptually. Optimized Video Scheduling
Markov Decision Model for Percepually 1 Opimized Video Scheduling Chao Chen, Suden Member, IEEE, Rober W. Heah Jr., Fellow, IEEE, Alan C. Bovik, Fellow, IEEE, and Gusavo de Veciana, Fellow, IEEE, Absrac
More informationQoE Driven Video Streaming in Cognitive Radio Networks: The Case of Single Channel Access
Globecom 2014 - Communicaions Sofware, Services and Mulimedia Symposium QoE Driven Video Sreaming in Cogniive Radio Neworks: The Case of Single Channel Access Zhifeng He, Shiwen Mao Deparmen of Elecrical
More informationDynamic Multiple-Message Broadcast: Bounding Throughput in the Affectance Model
Dynamic Muliple-Message Broadcas: Bounding Throughpu in he Affecance Model Dariusz R. Kowalski Universiy of Liverpool Dep. of Compuer Science Liverpool, UK D.Kowalski@liv.ac.uk Miguel A. Moseiro Kean Universiy
More informationP. Bruschi: Project guidelines PSM Project guidelines.
Projec guidelines. 1. Rules for he execuion of he projecs Projecs are opional. Their aim is o improve he sudens knowledge of he basic full-cusom design flow. The final score of he exam is no affeced by
More informationInstalling remote sites using TCP/IP
v dc Keypad from nework Whie/ 3 Whie/ 4 v dc Keypad from nework Whie/ 3 Whie/ 4 v dc Keypad from nework Whie/ 3 Whie/ 4 +v pu +v pu +v pu v dc Keypad from nework Whie/ 3 Whie/ 4 v dc Keypad from nework
More informationChannel Estimation for Wired MIMO Communication Systems
Channel Esimaion for Wired MIMO Communicaion Sysems Final Repor Mulidimensional DSP Projec, Spring 2005 Daifeng Wang Absrac This repor addresses raining-based channel modeling and esimaion for a wired
More informationMohammed Ali Hussain et al, / (IJCSIT) International Journal of Computer Science and Information Technologies, Vol. 2 (3), 2011,
Energy Conservaion Techniques in Ad hoc Neworks Dr. Mohammed Ali Hussain 1, M.Ravi Sankar 2, Vijaya Kumar Volei 1,Y.Srinivasa Rao 3, Nalla Lovanjaneyulu 4 1 Dep.of Compuer Science & Engineering, Sri Sai
More information