Throughput Capacity of Hybrid Radio-Frequency and Free-Space-Optical (RF/FSO) Multi-Hop Networks

Size: px
Start display at page:

Download "Throughput Capacity of Hybrid Radio-Frequency and Free-Space-Optical (RF/FSO) Multi-Hop Networks"

Transcription

1 Throughput Capacity of Hybrid Radio-Frequecy ad Free-Space-Optical (RF/FSO) Multi-Hop Networks Di Wag ad Alhussei A. Abouzeid Departet of Electrical, Coputer ad Systes Egieerig Resselaer Polytechic Istitute Abstract The per-ode throughput capacity of hybrid radio frequecy ad free space optics (RF/FSO) etworks is studied ad the beefit of usig this hybrid etwork architecture over the pure RF wireless etworks is evaluated. The hybrid RF/FSO etwork cosists of a RF ad hoc etwork of odes, of the (so called super odes) are equipped with a additioal FSO trasceiver. Every RF ad FSO trasceiver is able to trasit at a axiu data rate of ad bits/sec, respectively. All the super ode are coected by the FSO liks ad thus ca for a stad-aloe FSO etwork. With a iiu trasit power objective, a upper boud o the per ode capacity of c + log c2w2 is derived. I order to prove that this upper boud is achievable, we desig a hybrid routig schee i which the data traffic is divided ito two classes ad use differet routig strategies: a portio of data will be forwarded with the (partial) support of super odes i a hierarchical routig fashio, ad the rest will be purely routed through RF liks i a ulti-hop fashio. By properly balacig the load betwee these two classes of traffic, it is show that this upper boud is tight whe the axiu data rate ratio of W FSO ad RF trasceivers, 2, grows slower tha. Uder such circustaces, the capacity iproveet with the support of FSO odes, as copared with the results for RF wireless etworks i [], is evaluated. A sigificat capacity gai will be achieved if = Ω(). The results characterize the uber of super odes ad/or the FSO data rate ecessary i order to cause a o-trivial icrease i the per-ode throughput. I. INTRODUCTION The capacity of Radio Frequecy (RF) wireless etworks is costraied by provable liits ad does ot scale well with the icreasig uber of odes i the syste due to the iterferece betwee cocurret trasissio fro eighborig odes []. While the RF wireless etworks cotiue to develop ad grow i deads, the techology of free space optics (FSO) starts to draw attetio fro both acadeia ad idustry. FSO ca provide high data rate ad highly directioal trasissios usig free-space laser beas, whose bea divergece agle is o the order of illi-radias.this perfect directioality i trasissio akes the FSO couicatios early iue fro iterferece. However, oe of the ajor liitatios of FSO techology is the eed for optical liks to aitai lieof-sight (LOS), ad FSO lik availability ca be further liited by adverse weather coditios like fogs ad heavy sowfalls. The copleetary property of RF ad FSO otivates us to desig hybrid RF/FSO etworks, i which the weakesses of each lik type are expected to be utually itigated. It is quite atural to view this RF/FSO cobiatio as a way to solve the capacity scarcity proble i RF wireless etworks, or at least tur it aroud to soe extet. Several practical desigs of such hybrid etworks have bee proposed ad/or ipleeted [2], [3], [4], [5] ad [6], which ay iprove the etwork perforace by providig higher throughput ad/or better reliability. However, there is still o theoretical work that ay give isight o how uch the perforace ca be obtaied ad how uch these iproveets ca be possibly achieved. Istead of tryig to provide ew practical solutios to these hybrid RF/FSO etworks or to copare the perforaces of differet protocols or algoriths available, this work ais to derive the fudaetal liit of the capacity of hybrid RF/FSO etworks ad show exactly how uch this ay deviate fro the capacity results i the ladark paper by Gupta ad Kuar []. I this paper we cosider a rado etwork sceario, where odes are radoly located, i.e., idepedetly ad uiforly distributed o a uit area. Each ode is equipped with a RF trasceiver. Oly of the, which are called super odes, are equipped with a additioal FSO trasceiver each. Each RF trasceiver ca oi-directioally trasit or receive at bits/sec withi the couicatio rage r. Each FSO trasceiver ca directioally trasit withi a ifiitesially sall agle ad oi-directioally receive, all at bits/sec. The couicatio rage of every FSO trasceiver is s. For each ode, its destiatio is radoly chose ad let λ (i bits/sec) deote the axiu data rate at which each source-destiatio pair is required to trasit ad receive. By followig the siilar defiitio i [], we defie this λ as the throughput capacity of this hybrid RF/FSO etwork. Here we let this rado etwork satisfy two asyptotic coectivity assuptios: a) All the odes are asyptotically coected by RF liks; b) All the super odes are asyptotically coected by FSO liks. This allows us to have two stadaloe etworks cosistig of odes coected oly by RF liks ad odes coected oly by FSO liks, respectively. We eed to otice that weather coditios ay have differet effects o RF ad FSO liks, as FSO liks are highly susceptible to dese fog, soke ad dust particles but relatively less vulerable to rai coditios ad the opposite is true for RF systes. Thus uder these asyptotical coectivity assuptios, the rado hybrid etwork ca accoodate

2 for adverse weather coditios such as heavy rais or heavy fogs [5]. Although i this paper we do ot study the case whe RF or FSO liks are ureliable, the odellig applied here ay reserve possible aveues for the future work. We aalyze the throughput capacity of the hybrid RF/FSO etworks uder the costrait of iiu FSO trasit power cosuptio. We iiize the FSO trasit power cosuptio by choosig the FSO couicatio rage s to be the iiu i aitaiig the asyptotic coectivity aog super odes. Although our aalysis idicates that the larger the FSO couicatio rage is, the higher the throughput ay be achieved, we still have to ote that it is ipossible to realize a couicatio syste with a arbitrarily large couicatio rage. The it is reasoable to add certai kid of FSO trasit power costraits whe tryig to obtai the throughput capacity λ. The costrait of iiu FSO trasit power cosuptio cosidered i this paper is certaily a coservative oe, ad it ay be ore suitable for the case whe eergy savig is give high priority i the etwork desig. Sice our aalysis also show that the RF couicatio rage r is autoatically iiized whe axiizig the throughput capacity λ, the this power costrait ca be rewritte as the costrait of iiu trasit power cosuptio with o abiguity. Our derivatio of the throughput capacity ca be divided ito two parts. First we derive a upper boud o the throughput capacity λ over all routig ad trasissio strategies. The we costruct a hybrid routig schee i which the data traffic is divided ito two classes ad use differet routig strategies: a portio of data will be forwarded with the (partial) support of super odes i a hierarchical routig fashio, ad the rest will be purely routed through RF liks i a ulti-hop fashio. It is show that uder certai coditios, the etwork ca actually achieve at a throughput o the sae order of ad as the upper boud. We copare the results obtaied here with the results o throughput capacity of RF wireless etworks evaluated i [] i order to characterize the capacity iproveet cotributed by those super odes. It is observed that a oticeable capacity iproveet will be achieved whe the uber of super odes ad/or the FSO data rate are high eough. The ai cotributios of this paper are suarized as follows: a) Derive the scalig laws for the throughput capacity of hybrid RF/FSO etworks as a fuctio of the total uber of odes of which are super odes; b) Preset a routig ad trasissio schee that achieves the derived throughput capacity, which ay guide the practical routig protocol desig for the hybrid RF/FSO etworks; c) Copare with the results agaist pure RF wireless etworks, aalyze the capacity iproveet of hybrid etworks, ad characterize the uber of super odes ad/or the FSO data rate ecessary i order to cause a o-trivial icrease i the per ode throughput. The rest of this paper is orgaized as follows. A brief overview of related work is preseted i Sectio II. Sectio III outlies the syste odel that is cosidered throughout the paper. Sectio IV derives a upper boud o throughput capacity of RF/FSO etworks with iiu trasit power cosuptio. A costructive lower boud o throughput capacity of RF/FSO etworks is preseted i sectio V. Sectio VI discusses the capacity results obtaied, ad provides soe practical iplicatios. Sectio VII cocludes the paper. II. RELATED WORK To the best of our kowledge, there is o prior work i the literature o the capacity aalysis of RF/FSO ultihop etworks. However, several attepts have bee ade to provide capacity iproveet by utilizig directioal ateas or itroducig ifrastructure support. The authors i [7] aalyzed the capacity iproveet of RF wireless etworks usig directioal ateas i three 2π α cases. The capacity gai is show to be a) whe usig directioal trasissio with divergece agle α ad oi receptio, b) 2π β whe usig oi trasissio ad 2π directioal receptio with divergece agle β, ad c) αβ whe both trasissio ad receptio are directioal. These capacity gais ca oly be achievable whe the divergece agle is ot too sall. Thus the results derived i [7] are ot applicable to our work sice we deal with FSO liks with ifiitesially sall divergece agle. [8], [9] ad [0] try to iprove the capacity by the itroductio of ifrastructure support (access poits or base statios). Authors i [8] depict the ifrastructure etwork as a cellular etwork, where the base statios are wired by a broadbad etwork ad placed at the ceter of hexagoal cells. They ivestigate how the uber of base statios should scale with the uber of ad hoc odes to achieve sigificat capacity iproveet over the pure RF ad hoc wireless etworks. They apply differet routig strategies i which the ad hoc odes are divided ito two groups depedig o whether they use the cellular etwork to reach the destiatio or ot. The decisio criteria i forig the groups rely o heuristic arguets ad ay ot be the optial routig strategies. They show that the uber of base statios should at least scale with to achieve a oticeable gai. The ifrastructure etwork used i [9] cosists of radoly located access poits which are pre-wired ad allocated ifiite capacity. The authors i [9] odel the ode distributio ad traffic patter i the sae aer as the rado etwork odel used i []. They assue that the uber of ad hoc odes per access poit is bouded above, ad each wireless ode is able to trasit at W bits/sec usig a fixed trasissio rage. Uder this rado etwork sceario, they show that a per ode capacity of Θ( W log ) ca be achieved. To do this, they specify the upper boud of throughput capacity over all routig ad trasissio strategies, ad the desig a specific routig ad trasissio schee to achieve this upper boud. The results i [0] exted the work of [9] by allowig odes to perfor power cotrol ad properly choosig the uber of access poits, ad further show that it is possible to provide a throughput of Θ() to ay fractio f, 0 < f <, of odes. Although overlaps ay exist betwee our work ad the 2

3 prior work such as [8], [9] ad [0], there are also ajor differeces that uderlie the cotributio of our work: a) It is ore realistic to deploy the super odes radoly rather tha eployig a hexagoal cell structure, as copared to [8]; b) We do ot ipose strog assuptios such as the uber of odes per super ode should be bouded or properly chose, as copared to [9] ad [0]; c) We let the axiu data rate of each FSO trasceiver,, be soe fiite value, which is ore realistic as copared to the ifiite capacity assuptios used i [9] ad [0]. III. SYSTEM MODEL The syste odel icludes the settigs of ode distributios, traffic patters, ad RF/FSO couicatio odels. A. Node Distributios ad Traffic Patter I a rado sceario, odes each equipped with a RF trasceiver are radoly located, i.e., idepedetly ad uiforly distributed o the surface S 2 of a three-diesioal sphere of area 2. Oly of the, which are called super odes, are equipped with a additioal FSO trasceiver each. Our purpose i studyig S 2 is to separate edge effects fro other pheoea. Each ode has a radoly chose destiatio to which it wishes to sed λ bits/sec. The destiatio for each ode is idepedetly chose as the ode earest to a radoly located poit, i.e., uiforly ad idepedetly distributed. Thus destiatios are o the order of away o average. This odel, except for the FSO capability, is siilar to the odel i []. B. RF Couicatio Model Each RF trasceiver ca oi-directioally trasit or receive at bits/sec. We use the Protocol Model itroduced i [] as the RF iterferece odel here. All odes eploy a coo rage r for all their trasissios. Note that all the distaces are easured o the surface S 2 of the sphere by segets of great circles coectig two poits. Let X i deote the locatio of a ode; we will also use X i to refer to the ode itself. Whe ode X i trasits to a ode X j over the RF chael, the data will be successfully received by X j if ) The distace betwee X i ad X j is o ore tha r, i.e., X i X j r () 2) For every other ode X k siultaeously trasittig over the RF chael X k X j ( + )r (2) The quatity > 0 odels situatios where a guard zoe is specified by the protocol to prevet a eighborig ode fro trasittig o the RF chael at the sae tie. It also allows for iprecisio i the achieved rage of trasissios. C. FSO Couicatio Model Every super ode is equipped with a FSO trasceiver. Each FSO trasceiver ca directioally trasit at bits/sec withi a ifiitesially sall agle ad a coo rage s. Each FSO trasceiver ca receive at bits/sec oidirectioally. We assue that the orietatio of each FSO trasitter ca be steered to ay possible directio withi S 2. The every super ode ca trasit data to ay other super ode withi the distace s. I practice, the bea steerig fuctioality has bee realized i several ways. Miler et.al. [2] ipleeted the bea steerig usig echaical devices, while Kha et.al. [] desiged a 3-diesioal wide-agle o-ovig-parts laser bea steerig ethod. May other desig choices are also available ad ca be foud fro [2], [3], [4] ad [5]. The oi-directioality assuptio for the FSO receiver is also reasoable, as oi-directioal FSO receivers are also ipleeted i [4]. IV. AN UPPER BOUND ON THROUGHPUT CAPACITY OF RF/FSO NETWORKS WITH MINIMUM POWER CONSUMPTION I this sectio, we aalyze the throughput capacity of hybrid RF/FSO etworks with iiu total power cosuptio. I RF wireless etworks, it ay be desirable to reduce the trasit power level, or equivaletly, to reduce the trasissio rage r i order to icrease etwork capacity. Kawadia ad Kuar [6] argue that the area of the iterferece is proportioal to r 2 whereas the relayig burde, i.e., the uber of hops, is iversely proportioal to r. The the area cosued by a packet is thus proportioal to r, iplyig that reducig the trasit power level icreases the capacity. I FSO etworks, however, reducig the trasit power level ad icreasig the capacity are essetially cotradictig with each other. Sice the area of the FSO iterferece is actually egligible, the relayig burde is alleviated by siply icreasig the FSO trasissio rage s, which iplies that icreasig the trasit power level icreases the capacity. Therefore, the objective of iiizig the total power cosuptio i hybrid RF/FSO etworks sees to be cotradictory i achievig a higher capacity. However, the capacity results derived here ay still be valuable, sice reducig the power cosuptio is always cosidered to be iportat whe deployig large-scale etworks where the resource of eergy is liited. Theore 4.: The throughput capacity of hybrid RF/FSO etworks with iiu power cosuptio is bouded fro above by λ c log + c 2 where c ad c 2 are costat. Proof: Each packet i this hybrid etwork ay traverse a uber of RF hops ad a uber of FSO hops. Let d deote the uber of RF hops traversed by a sigle packet averaged over (3) 3

4 all packets i the etwork, ad let d2 deote the uber of FSO hops traversed by a sigle packet, also averaged over all packets i the etwork. Fro Lea 5.4 i [], the uber of siultaeous trasissios o a RF chael is o ore tha c3 r. (All the c 2 i s used above ad throughout are costats.) Sice each source geerates λ bits/sec, there are sources, ad each packet eeds to be relayed o the average by d RF hops, it follows that the total uber of bits per secod served by the RF part of the etire etwork is λ d. To esure that all the required RF traffic is carried, we therefore eed λ d c 3 r 2 (4) O the other had, sice FSO ca operate with egligible iterferece, the uber of siultaeous trasissio o FSO chael is o ore tha. To esure that all the required FSO traffic is carried, we therefore eed λ d 2 (5) Now let L deote the ea legth of a lie coectig two idepedetly ad uiforly distributed poits o S 2. The we have the followig iequality d r + d 2 s L (6) Recall that we ake the assuptio that all the odes are asyptotically coected by RF liks, ad all the super odes are asyptotically coected by FSO liks. To satisfy these two asyptotic coectivity assuptios, [7] suggests that the trasissio rages, r ad s, should satisfy r c 4 log s c 4 The lik equatio of a FSO couicatio syste is give by [3] A P r = P t exp( βs) (9) (sθ) 2 where P t is the laser output power, θ is the bea divergece agle (i radias), A is the receiver area, P r is the received power, ad β is the atospheric atteuatio factor. Copared with the cooly used iverse α th law path loss odels, this lik equatio suggests α > 2. It has bee show i [8] that, sice α > 2, the trasissio rage should be kept to iiu to iiize the total power cosuptio i the etire etwork. Thus we set the FSO trasissio rage s to be s = c 4 (7) (8) (0) Fro (4), (5), (6), (7) ad (0), we have λ L λ d r + λ d s c 3 r 2 = c 3 r c 3 c 4 r + s + s log + c 4 The λ L ( ) c3 c 4 log + c 4 which yields the result. V. A CONSTRUCTIVE LOWER BOUND ON THROUGHPUT CAPACITY OF RF/FSO NETWORKS WITH MINIMUM POWER CONSUMPTION () To obtai a costructive lower boud o the throughput capacity λ, we eed to derive the throughput capacity of rado FSO etworks with iiu power costrait. This result is give by the followig theore. Theore 5.: Cosider a rado FSO etwork with odes radoly ad idetically distributed o S 2. Every ode is equipped with a FSO trasceiver. Each FSO trasceiver ca directioally trasit at bits/sec withi a ifiitesially sall agle ad a coo rage s. Each FSO trasceiver ca receive at bits/sec oi-directioally. The the throughput capacity, λ, of this rado FSO etwork with iiu power cosuptio is give by λ = Θ ( ) (2) Proof: We derive the throughput capacity of rado FSO etworks by providig a upper boud o λ, ad the show by costructio that a throughput of the sae order i ca actually be achieved. To derive the upper boud o λ, we otice that the uber of siultaeous trasissios is o ore tha, thus the total data rate served by the etire FSO etwork is o ore tha. Now let L deote the ea legth of a lie coectig two idepedetly ad uiforly distributed poits o S 2. The the ea legth of the path of packets is at least L o(). Thus the ea uber of hops take by a packet is at least L o() s. The the total uber of bits per secod served by the etire etwork eeds to be at least ( L o())λ s. The we have the followig iequality: ( L o())λ (3) s I order to iiize the total trasit power cosuptio, the FSO couicatio rage s is chose to be s = 4

5 c 4, the we have the followig upper boud o λ : λ c 5 (4) To show that this upper boud is achievable, we desig a routig schee usig siilar techiques as i []. Let ρ () := radius of a disk of area 00 / (5) We ca costruct a Vorooi tessellatio V i relatio to the uber of odes ad the locatios of odes, i which every Vorooi cell cotais a disk of radius ρ () ad is cotaied i a disk of radius 2ρ (). We choose the rage s of each trasissio such that s = 8ρ () (6) This rage allows direct couicatio withi a cell ad betwee adjacet cells. Every ode i a cell is withi this distace s fro every other ode i its ow cell or adjacet cell. The routig strategy is to choose the routes of packets to approxiate the straight-lie which is coectig the source ad destiatio. So the routes actually are the cells that the straight-lie itersects. Siilar to Lea 4.4 ad Lea 4.8 i [], it ca be show that the traffic to be served by each cell is bouded fro above, ad the uber of odes i each cell is bouded fro below. Forally, for ay cell V, there is a δ () 0 such that Prob{ sup V V (traffic eedig to be carried by cell V ) c 6 λ } δ () (7) Ad for every disk D of area 00 / i S 2, there is sequece δ() 0 such that Prob{uber of odes i D 50 } δ() (8) It ca be thus oted that each cell is able to trasit at least (50 ) bits/sec. The with high probability, the rate c 6 λ ca be accoodated by all cell if c 6 λ (50 ) (9) The the per ode achievable throughput is give by λ = c 6 which proves Theore 5.. (20) The lower boud o λ is give by the followig theore. Theore 5.2: The throughput capacity of hybrid RF/FSO etworks with iiu power cosuptio, λ, is bouded fro below by ) Case : λ c 7 log ( ) + c 8 c 9 (2) whe,, ad satisfy ( ) ( ) = o log W 2) Case 2: λ c 0 log whe,, ad satisfy ( ) ( ) = ω log W (22) (23) (24) Proof: I order to show that the lower bouds o λ preseted above are achievable, we desig a hybrid routig schee i which the data traffic is divided ito two classes ad use differet routig strategies: a portio of data will be forwarded with the (partial) support of super odes i a hierarchical routig fashio, ad the rest will be purely routed through RF liks i a ulti-hop fashio. The lower bouds o λ ca thus be derived by properly balacig the load betwee these two classes of traffic. The proof is orgaized as follows: The hybrid routig schee is proposed i Sectio V.A, i which we desig a RF ulti-hop routig strategy ad a hierarchical routig strategy for the two classes of traffic. I Sectio V.B, the axiu throughput achieved by the hybrid routig schee is derived. A. A Hybrid Routig Schee We eploy a hybrid routig schee by dividig the per ode throughput λ ito two classes. Each source-destiatio pair trasits packets with costat data rate λ by purely usig RF liks, ad trasits packets with data rate λ 2 by (fully or partly) usig FSO liks. Hece we have λ = λ + λ 2 (25) The detailed routig strategies for these two classes of traffic are as follows. ) A RF ulti-hop routig strategy for the traffic correspodig to λ : The routig strategy for the traffic correspodig to λ is the sae as the oe i []. Let ρ() := radius of a disk of area 00 log / (26) We ca costruct a Vorooi tessellatio V such that every Vorooi cell cotais a disk of radius ρ() ad is cotaied i a disk of radius 2ρ(). We choose the rage r of each trasissio such that r = 8ρ() (27) This rage allows direct couicatio withi a cell ad betwee adjacet cells. The routig strategy is to choose the routes of packets to approxiate the straight-lie which is coectig the source ad destiatio. So the routes actually are the cells that the straight-lie itersects. Accordig to [], we have the followig leas. 5

6 Lea : Every cell i V has o ore tha c iterferig eighbors. Furtherore, there is a schedule for trasittig packets such that i every ( + c ) slots, each cell i the V gets oe slot i which to trasit, ad such that all trasissios are successfully received withi the trasissio ad receptio coverage. Lea 2: There is a δ () 0 such that Prob{ sup V V (RF traffic correspodig to λ eedig to be carried by cell V ) c 6 λ log } δ () (28) 2) A hierarchical routig strategy for the traffic correspodig to λ 2 : The routig strategy for the packets correspodig to λ 2 is described by the followig steps: Step : The packets origiated by a source ode are routed through RF liks to the super ode earest to the source ode, if eeded; Step 2: Packets are the routed through FSO liks to the super ode earest to the destiatio ode; Step 3: Packets are the routed through RF ode to the destiatio ode, if eeded. Here the RF routig schee used i steps ad 3 is the sae as the oe used i []. The FSO routig schee used i Step 2 is described i the proof of Theore 5.. Note that the routig schee used here for the the traffic correspodig to λ 2 is siilar to hierarchical state routig e.g.[5]. Siilar to Lea 4.8 i [], it ca be proved that every disk D of area 00 / cotais at least oe super ode with high probability. Forally, for every disk D of area 00 / i S 2, there is δ() 0 such that Prob{D cotais a super ode} δ() (29) Sice every disk of area 00 / cotais at least oe super ode with high probability, ad each Vorooi cell i V cotais a disk of area 00 log /, the the ea uber of RF hops traversed by a packet durig its first ad thirdstep i the routig schee described above is at ost c / 2 log /. The the total data rate correspodig to λ 2 served by theetire RF wireless etwork is o ore tha c 2 λ 2 ( ) / log /. Thus the average data rate correspodig to λ 2 served by each Vorooi cell V is o ore tha / c 3 λ 2 ( ) log / log log = c 3 λ 2. (30) The by akig use of the property that the sequece of straight-lie segets {L i } i= is i.i.d, we ca exploit uifor covergece i the law of large ubers usig the sae techique itroduced i ([], Sectio IV.I), ad thus obtai the followig lea: Lea 3: There is a δ () 0 such that Prob{ sup (RF traffic correspodig to λ 2 eedig to be V V log carried by cell V ) c 4 λ 2 } δ () (3) B. Maxiu Throughput Achieved by the Hybrid Routig Schee Fro Lea, Lea 2 ad Lea 3, we ca coclude that the data trasissio utilizig RF liks ca be accoodated by all cells if c 6 λ log + c4 λ 2 log + c (32) Sice the per ode throughput capacity of the stad-aloe FSO etwork is give by Theore 5., the data trasissio (partially) utilizig FSO liks ca be accoodated by the FSO etwork if λ 2 c 6 (33) The we ca derive the axiu throughput achieved by the proposed routig schee by solvig the followig optiizatio proble: subject to axiize λ λ + λ 2 = λ log c 6 λ log + c4 λ 2 + c λ 2 c 6 The optial solutio falls ito the followig two utually exclusive cases: Case : Whe,, ad satisfy ( ) < ( + c )c 6 c 4 log W (34) the axiu throughput λ ad the data rates of the two classes of traffic, λ ad λ 2, are give by λ = ( + c )c 6 log ( ) + c 6 c 4 (35) λ = c 4 ( + c )c 6 log 2 (36) λ 2 = c 6 (37) Case 2: Whe,, ad satisfy ( ) ( + c )c 6 c 4 log W (38) 6

7 the axiu throughput λ ad the data rates of the two classes of traffic, λ ad λ 2, are give by λ = (39) ( + c )c 4 log λ = 0 (40) λ 2 = (4) ( + c )c 4 log Hece we have proved Theore 5.2. VI. DISCUSSIONS A. The Tightess of the Bouds o λ ad The Routig Schee Selectio Criteria We evaluate the tightess of the capacity bouds o λ by coparig the upper boud results i Theore 4. with the lower boud results uder two differet cases derived i Sectio V. It is clear that the lower boud result for Case i (35) will asyptotically becoe the for of the upper boud o λ i Theore 4., as grows. Thus i Case, Theore 4. ad Theore 5.2 provide a tight boud o λ whe ( ) < c 5 log W (42) For Case 2, which requires,, ad satisfyig ( ) c 5 log W, (43) the lower boud result i (39) does ot atch the for of the upper boud result i Theore 4.. Although we caot get a geeral result like i Case, we ca evaluate the tightess by cosiderig the extree case whe. Uder these circustaces, the upper boud result becoes ifiity, which is certaily ot tight. The lower boud result atches the results provided by [9], where the support of a ifiite capacity ifrastructure etwork is cosidered. This iplies that the lower boud is tighter tha the upper boud uder such circustaces. We ca ote that for Case the proposed routig schee works as a cobiatio of two idepedet schees, while uder Case 2 it copletely degeerates to the hierarchical routig schee as described i Sectio V.2. I order to guide the practical routig protocol desig, we eed to derive clear coditios o,, ad for Case ad 2. Although there is geerally o closed for solutios whe (42) or (43) hold with equality, we are still able to exploit soe practical iplicatios by presetig the followig protocol desig priciples: ) Whe W2 = o( 2 ), the coditio for Case is satisfied. The it is better to eploy the hybrid routig schee to achieve a higher per ode throughput. 2) Whe W2 = Ω( 3 2 ), the coditio for Case 2 holds. Thus it is better to use the hierarchical routig schee to achieve a higher per ode throughput. 3) Whe W2 = Θ( k ), where 0.5 k <.5, there exists two critical ubers M (k) ad M 2 (k), M (k) < M 2 (k) <, satisfyig f() := ( ) = c 5 log W, for = M, M 2. (44) Sice f() is strictly cocave over [, ], hece ( ) < c 5 log W, for < M (k) or > M 2 (k) (45) ( ) > c 5 log W, for M (k) < < M 2 (k) (46) Thus the hybrid routig schee is ore desirable to achieve a higher per ode throughput whe < M (k) or > M 2 (k). O the other had, the hierarchical routig schee is preferred whe M (k) < < M 2 (k). B. Capacity Iproveet We defie the capacity gai G, as the capacity ratio betwee hybrid RF/FSO etworks ad RF wireless etworks. We further defie the capacity iproveet ratio, R, as R = G. First we take Case ito cosideratio. By coparig with the capacity results i [], we ca show that R ay diiish to zero as grows whe = o() (47) O the other had, we ca possibly achieve a o-egligible capacity iproveet by addig FSO trasceivers to odes if ad oly if = Ω() (48) For Case 2, (39) iplies that the capacity iproveet ratio R will ever diiish to zero. Thus a sigificat capacity iproveet ca be achieved with high probability uder Case 2. Thus we ca geeralize the results for Case ad 2 by claiig that we ca achieve a o-egligible capacity iproveet with high probability if = Ω() (49) This result characterizes the uber of super odes ad/or the FSO data rate eeded i order to guaratee a sigificat capacity iproveet as copared to the case of pure RF wireless etworks. 7

8 VII. CONCLUSION AND FUTURE WORK I this paper, we have studied the per ode throughput capacity of hybrid RF/FSO etworks. A hybrid RF/FSO etwork cosists of a RF wireless etwork with rado deployet ad coected by RF liks, ad oly a portio of odes (so called super odes) are equipped with a additioal FSO trasceiver. All the super ode are coected by the FSO liks ad thus for a stad-aloe FSO etwork. The objective of this paper is to derive the asyptotic capacity of such hybrid etworks, ad evaluate the beefit of usig this hybrid RF/FSO etwork architecture over the pure RF wireless etworks. We cosider a hybrid RF/FSO etwork with a total uber of odes, ad of the are super odes. Every RF ad FSO trasceiver is able to trasit at a axiu data rate of ad bits/sec, respectively. We show that the throughput capacity of hybrid RF/FSO etworks with the costrait of iiu power cosuptio, λ, is bouded fro above by λ c log + c 2. I order to evaluate the tightess of this upper boud, we desig a hybrid routig schee as we divide the data traffic ito two classes ad use differet routig strategies: a portio of data will be forwarded with the (partial) support of super odes i a hierarchical routig fashio, ad the rest will be purely routed through RF liks i a ulti-hop fashio. Uder such routig strategies, we have show that the upper boud is a tight oe whe the W axiu data rate ratio of FSO ad RF trasceivers, 2, grows slower tha. The aalysis regardig our proposed routig strategy also yields soe practical iplicatios which ay guide the routig protocol desig for the hybrid RF/FSO etworks. Our aalysis have show that if W2 grows slower tha, high per ode throughput ca be achieved by properly balacig the load betwee the two classes of traffic. If W2 grows o slower tha 3, the a pure hierarchical routig strategy will suffice to achieve high per ode throughput, i.e., all the data traffic will be forwarded with the (partial) support of super odes. Furtherore, we have also evaluated the capacity iproveet with the support of FSO odes, as copared with the results for RF wireless etworks i []. We have show that a sigificat capacity gai will be achieved if W2 = Ω(). Possible aveues for future research still exist, as we have ot derived a tight boud o throughput capacity for the case whe W2 grows o slower tha. I additio, we are also iterested i extedig the capacity results to the case whe RF ad FSO trasceivers ay becoe ureliable (e.g., uder adverse weather coditios). [2] S.D. Miler, C.C. Davis, Hybrid free space optical/rf etworks for tactical operatios, Military Couicatios Coferece(MILCOM), [3] S. Bloo, W. S. Hartley, The last ile solutio: Hybrid FSO Radio, Airfiber, May [4] J. Akella, Chag. Liu, D. Partyka, M. Yuksel, S. Kalyaaraa, P. Dutta, Buildig blocks for obile free-space-optical etworks, Secod IFIP Iteratioal Coferece o Wireless ad Optical Couicatios Networks (WOCN), [5] J. Dereick, C. Thore, J. Spletzer, O the deployet of a hybrid freespace optic/radio frequecy (FSO/RF) obile ad-hoc etwork, IEEE/RSJ Iteratioal Coferece o Itelliget Robots ad Systes (IROS), [6] A. Kashyap, M. Shaya, Routig ad traffic egieerig i hybrid RF/FSO etworks, IEEE Iteratioal Coferece o Couicatios (ICC), [7] S. Yi, Y. Pei, ad S. Kalyaaraa, O the capacity iproveet of ad hoc wireless etworks usig directioal ateas, i Proc. of the 4th ACM iteratioal syposiu o Mobile ad hoc etworkig ad coputig(mobihoc), pp. 08-6, [8] B. Liu ad Z. Liu ad D. Towsley, O the capacity of hybrid wireless etworks, I IEEE INFOCOM 03, March [9] U.C.Kozat, L.Tassiulas, Throughput Capacity of Rado Ad Hoc Networks with Ifrastructure Support, Proceedigs of ACM/MOBICOM 2003, [0] Ashish Agarwal ad P. R. Kuar, Capacity Bouds for Ad hoc ad Hybrid Wireless Networks, ACM SIGCOMM Coputer Couicatio Review, Volue 34, Issue 3, July [] Sajjad A. Kha ad Nabeel A. Riza, Deostratio of 3-diesioal wide-agle o-ovig-parts laser bea steerig, Proc. SPIE, Volue 5550, pp , [2] B. W. Matki, Steered agile beas progra support for Ary requireets, Proc. SPIE, , -2, 200. [3] Q. W. Sog, X. M. Wag, R. Bussjager ad J. Osa, Electrooptic bea-steerig device based o a lathau-odified lead zircoate titaate ceraic wafer, Appl. Opt., 35, 7, , 996. [4] R. McRuer, L. R. McAdas ad J. W. Gooda, Ferroelectric liquidcrystal digital scaer, Opt. Lett., 5, 23, 45-47, 990. [5] C. M. Titus, P. J. Bos ad O. D. Lavretovich, Efficiet, accurate liquid crystal digital light deflector, Proc. SPIE, 3633, 244, 999. [6] V. Kawadia ad P. R. Kuar, Priciples ad protocols for power cotrol i wireless ad hoc etworks, IEEE Joural o Selected Areas i Couicatios, 23():76 88, Ja [7] Feg Xue, P. R. Kuar, The uber of eighbors eeded for coectivity of wireless etworks, Wireless Networks, Vol 0, No. 2, pp.69-8, [8] S. Narayaasway, V. Kawadia, R. S. Sreeivas, ad P. R. Kuar, Power cotrol i ad-hoc etworks: Theory, architecture, algorith ad ipleetatio of the COMPOW protocol, i Europea Wireless Coferece, ACKNOWLEDGMENT This work was fuded i part by the Natioal Sciece Foudatio uder grats CNS ad CNS REFERENCES [] P. Gupta ad P. R. Kuar, The Capacity of Wireless Networks, IEEE Tras. o Iforatio Theory, pages , March

Minimum Normalized Transmit Rate Based Fair Scheduling Algorithm in Orthogonal Frequency Division Multiplexing (OFDM)

Minimum Normalized Transmit Rate Based Fair Scheduling Algorithm in Orthogonal Frequency Division Multiplexing (OFDM) Iteratioal Joural of Electroic Egieerig Research ISSN 097-640 Volue 1 Nuber 4 (009) pp. 337 344 Research Idia Publicatios http://www.ripublicatio.co/ijeer.ht Miiu Noralized Trasit Rate Based Fair Schedulig

More information

Solution 2 Discussion:

Solution 2 Discussion: Mobile Couicatios Solutio 2 Discussio: 4..2007 Solutio 2.: Multiplexig For ultiplexig, SDMA, TDMA, FDMA, ad CDMA were preseted i the lecture. a.) What liits the uber of siultaeous users i a TDM/FDM syste

More information

Outage Probability of a Multi-Relay Cognitive Network with an Uncertain Number of Forwarding Relays

Outage Probability of a Multi-Relay Cognitive Network with an Uncertain Number of Forwarding Relays Outage Probability of a Multi-Relay Cogitive Network with a Ucertai Nuber of Forwardig Relays Yuli Hu, aes Gross ad Ake Scheik RWTH Aache Uiversity, Geray, Eail: {hu scheik}@uic.rwth-aache.de KTH Royal

More information

On the Capacity of k-mpr Wireless Networks

On 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 information

Roberto s Notes on Infinite Series Chapter 1: Series Section 2. Infinite series

Roberto s Notes on Infinite Series Chapter 1: Series Section 2. Infinite series Roberto s Notes o Ifiite Series Chapter : Series Sectio Ifiite series What you eed to ow already: What sequeces are. Basic termiology ad otatio for sequeces. What you ca lear here: What a ifiite series

More information

x y z HD(x, y) + HD(y, z) HD(x, z)

x 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 information

Adaptive Relay Selection Protocol for the Parallel Hybrid RF/FSO Relay Channel

Adaptive Relay Selection Protocol for the Parallel Hybrid RF/FSO Relay Channel Adaptive Relay Selectio Protocol for the Parallel Hybrid RF/FSO Relay Chael Marzieh Najafi, Vahid Jaali, ad Robert Schober Abstract Hybrid radio frequecy RF)/free space optical FSO) systes are aog the

More information

NOISE IN A SPECTRUM ANALYZER. Carlo F.M. Carobbi and Fabio Ferrini Department of Information Engineering University of Florence, Italy

NOISE IN A SPECTRUM ANALYZER. Carlo F.M. Carobbi and Fabio Ferrini Department of Information Engineering University of Florence, Italy NOISE IN A SPECTRUM ANALYZER by Carlo.M. Carobbi ad abio errii Departet of Iforatio Egieerig Uiversity of lorece, Italy 1. OBJECTIVE The objective is to easure the oise figure of a spectru aalyzer with

More information

On the Capacity of k-mpr Wireless Networks

On 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 information

The Fundamental Capacity-Delay Tradeoff in Large Mobile Ad Hoc Networks

The 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 information

Coded Modulation for Gaussian Channels: Dispersion- and Entropy-Limited Regimes

Coded Modulation for Gaussian Channels: Dispersion- and Entropy-Limited Regimes Coded Modulatio for Gaussia Chaels: Dispersio- ad Etropy-Liited Regies Ebrahi MolaviaJazi Departet of Electrical Egieerig Pesylvaia State Uiversity Uiversity Park, PA 6 Eail: eu@psu.edu J. Nicholas Laea

More information

ON THE FUNDAMENTAL RELATIONSHIP BETWEEN THE ACHIEVABLE CAPACITY AND DELAY IN MOBILE WIRELESS NETWORKS

ON 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 information

Application of Improved Genetic Algorithm to Two-side Assembly Line Balancing

Application 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 information

A New Space-Repetition Code Based on One Bit Feedback Compared to Alamouti Space-Time Code

A 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 information

Lecture 4: Frequency Reuse Concepts

Lecture 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 information

DECISION MAKING ON LOAD CONNECCTION FROM DIFFERENT SUBSTATIONS OF SPECIFIC CAPACITY ON THE BASIS OF MINIMUM TRANSMISSION LOSS

DECISION MAKING ON LOAD CONNECCTION FROM DIFFERENT SUBSTATIONS OF SPECIFIC CAPACITY ON THE BASIS OF MINIMUM TRANSMISSION LOSS Proceedigs of the Iteratioal Coferece o Mechaical Egieerig 27 (ICME27) 29- Deceber 27, Dhaka, Bagladesh ICME7-AM- DECISION MAKING ON LOAD CONNECCTION FROM DIFFENT SUBSTATIONS OF SPECIFIC ON THE BASIS OF

More information

International Journal of Scientific & Engineering Research, Volume 4, Issue 7, July ISSN

International Journal of Scientific & Engineering Research, Volume 4, Issue 7, July ISSN Iteratioal Joural of Scietific & Egieerig Research, Volue 4, Issue 7, July-2013 1971 A of Cell to Switch Assiget i Mobile Couicatio Networks Usig Algorith Ail Goyal, Shiv Krisha Joshi,Surbhi Gupta Abstract--This

More information

Broadcast Throughput Capacity of Wireless Ad Hoc Networks with Multipacket Reception

Broadcast Throughput Capacity of Wireless Ad Hoc Networks with Multipacket Reception Broadcast Throughput Capacity of Wireless Ad Hoc Networks with Multipacket Receptio Zheg Wag, Hamid R. Sadjadpour, J.J. Garcia-Lua-Aceves Departmet of Electrical Egieerig ad Computer Egieerig Uiversity

More information

A SELECTIVE POINTER FORWARDING STRATEGY FOR LOCATION TRACKING IN PERSONAL COMMUNICATION SYSTEMS

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 information

Lab 2: Common Source Amplifier.

Lab 2: Common Source Amplifier. epartet of Electrical ad Coputer Egieerig Fall 1 Lab : Coo Source plifier. 1. OBJECTIVES Study ad characterize Coo Source aplifier: Bias CS ap usig MOSFET curret irror; Measure gai of CS ap with resistive

More information

Sapana P. Dubey. (Department of applied mathematics,piet, Nagpur,India) I. INTRODUCTION

Sapana 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 information

The Throughput and Delay Trade-off of Wireless Ad-hoc Networks

The Throughput and Delay Trade-off of Wireless Ad-hoc Networks The Throughput ad Delay Trade-off of Wireless Ad-hoc Networks. Itroductio I this report, we summarize the papers by Gupta ad Kumar [GK2000], Grossglauser ad Tse [GT2002], Gamal, Mame, Prabhakar, ad hah

More information

A New Design of Log-Periodic Dipole Array (LPDA) Antenna

A 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 information

Broadcast Capacity in Multihop Wireless Networks

Broadcast Capacity in Multihop Wireless Networks Broadcast Capacity i Multihop ireless Networks Alireza Keshavarz- Haddad alireza@rice.edu Viay Ribeiro viay@rice.edu Rudolf Riedi riedi@rice.edu Departmet of Electrical ad Computer Egieerig ad Departmet

More information

The Multicast Capacity of Large Multihop Wireless Networks

The Multicast Capacity of Large Multihop Wireless Networks The Multicast Capacity of Large Multihop Wireless Networks Sriivas Shakkottai Dept. of ECE, ad Coordiated Sciece Laboratory Uiversity of Illiois at Urbaa-Champaig sshakkot@uiuc.edu Xi Liu Dept. of Computer

More information

Schedulability Analysis for Controller Area Network (CAN) with FIFO Queues Priority Queues and Gateways

Schedulability Analysis for Controller Area Network (CAN) with FIFO Queues Priority Queues and Gateways Schedulability Aalysis for Cotroller Area Network (CAN) with FIFO Queues Priority Queues ad Gateways Robert I. Davis Real-Tie Systes Research Group, Departet of Coputer Sciece, Uiversity of York, YO10

More information

4.3 COLLEGE ALGEBRA. Logarithms. Logarithms. Logarithms 11/5/2015. Logarithmic Functions

4.3 COLLEGE ALGEBRA. Logarithms. Logarithms. Logarithms 11/5/2015. Logarithmic Functions 0 TH EDITION COLLEGE ALGEBRA 4. Logarithic Fuctios Logarithic Equatios Logarithic Fuctios Properties of LIAL HORNSBY SCHNEIDER 4. - 4. - The previous sectio dealt with epoetial fuctios of the for y = a

More information

Dynamic Data-bit Memory Built-In Self- Repair

Dynamic Data-bit Memory Built-In Self- Repair Dyaic Data-bit Meory Built-I Self- Repair M. Nicolaidis, N. Achouri, S. Boutobza iroc Techologies 38025 Greoble, Frace Abstract: I oder SoCs, ebedded eories occupy the largest part of the chip area ad

More information

Energy-Efficient and QoS-ware Resource Allocation for Relay-enhanced OFDMA Wireless Cellular Networks

Energy-Efficient and QoS-ware Resource Allocation for Relay-enhanced OFDMA Wireless Cellular Networks WSEAS TRANSACTIONS o COUNICATIONS Xiaoya Huag Supeg Leg Fa Wu Yuig ao Eergy-Efficiet ad QoS-ware Resource Allocatio for Relay-ehaced OFA Wireless Cellular Networs XIAOYAN HUANG SUPENG LENG FAN WU YUING

More information

Analysis of A Measurement Model for Radar Electromagnetic Compatibility Li Yang

Analysis of A Measurement Model for Radar Electromagnetic Compatibility Li Yang 06 ixth Iteratioal Coferece o Istruetatio & easureet Couter Couicatio ad Cotrol Aalysis of A easureet odel for Radar Electroagetic Coatibility i Yag Det. of Iforatio Ad Couicatio Egieerig Harbi Egieerig

More information

Capacity of power constrained ad-hoc networks

Capacity of power constrained ad-hoc networks Capacity of power costraied ad-hoc etworks Rohit Negi, Arjua Rajeswara egi@ece.cmu.edu, arjua@cmu.edu Departmet of Electrical ad Computer Egieerig Caregie Mello Uiversity Abstract hroughput capacity is

More information

Controller Area Network (CAN) Schedulability Analysis for Messages with Arbitrary Deadlines in FIFO and Work-Conserving Queues

Controller Area Network (CAN) Schedulability Analysis for Messages with Arbitrary Deadlines in FIFO and Work-Conserving Queues Cotroller Area Networ CAN) Schedulability Aalysis for Messages with Arbitrary Deadlies i FIFO ad Wor-Coservig Queues Robert Davis 1 ad Nicolas Navet 2 1 Real-Tie Systes Research Group, Uiversity of Yor,

More information

The Multicast Capacity of Large Multihop Wireless Networks

The Multicast Capacity of Large Multihop Wireless Networks The Multicast Capacity of Large Multihop Wireless Networks Sriivas Shakkottai Dept. of ECE, ad Coordiated Sciece Laboratory Uiversity of Illiois at Urbaa-Champaig sshakkot@uiuc.edu Xi Liu Dept. of Computer

More information

Capacity of Interference-limited Three Dimensional CSMA Networks

Capacity of Interference-limited Three Dimensional CSMA Networks Capacity of Iterferece-limited Three Dimesioal CSMA Networks Tao Yag, Guoqiag Mao School of Electrical ad Iformatio Egieerig The Uiversity of Sydey Email: {tao.yag, guoqiag.mao}@sydey.edu.au Wei Zhag School

More information

Logarithms APPENDIX IV. 265 Appendix

Logarithms 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 information

Joint Uplink Resource Allocation Algorithm with Proportional-Fair in Heterogeneous Wireless Networks

Joint Uplink Resource Allocation Algorithm with Proportional-Fair in Heterogeneous Wireless Networks JOUAL OF ETWOKS, VOL. 8, O. 0, OCTOBE 0 47 Joit Upli esource Allocatio Algorith with Proportioal-Fair i Heterogeeous Wireless etwors Jua Fa ad Wuyag Zhou* Wireless Iforatio etwor Lab., Departet of Electroic

More information

Fingerprint Classification Based on Directional Image Constructed Using Wavelet Transform Domains

Fingerprint Classification Based on Directional Image Constructed Using Wavelet Transform Domains 7 Figerprit Classificatio Based o Directioal Image Costructed Usig Wavelet Trasform Domais Musa Mohd Mokji, Syed Abd. Rahma Syed Abu Bakar, Zuwairie Ibrahim 3 Departmet of Microelectroic ad Computer Egieerig

More information

Joint Power Allocation and Beamforming for Cooperative Networks

Joint 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 information

On the Delay Performance of In-network Aggregation in Lossy Wireless Sensor Networks

On 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 information

An Information Theoretic Analysis for Adaptive-Network- Coded-Cooperation (ANCC) in Wireless Relay Networks

An Information Theoretic Analysis for Adaptive-Network- Coded-Cooperation (ANCC) in Wireless Relay Networks ISIT 6, Seattle, US, July 9-4, 6 Iforatio Theoretic alysis for daptive-network- oded-ooperatio N i Wireless Relay Networks Xigkai ao ad Jig Li Tiffay Departet of lectrical ad oputer gieerig, Lehigh Uiversity,

More information

Hierarchical Beamforming for Large One-Dimensional Wireless Networks

Hierarchical Beamforming for Large One-Dimensional Wireless Networks Hierarchical Beamformig for Large Oe-Dimesioal Wireless Networks Alla Merzakreeva, Olivier Lévêque Swiss Federal Istitute of Techology - Lausae, Switzerlad {alla.merzakreeva, olivier.leveque}@epfl.ch Ayfer

More information

Schedulability Analysis for Controller Area Network (CAN) with FIFO Queues Priority Queues and Gateways

Schedulability Analysis for Controller Area Network (CAN) with FIFO Queues Priority Queues and Gateways Schedulability Aalysis for Cotroller Area Networ (CAN) with FIFO Queues Priority Queues ad Gateways Robert I. Davis Real-Tie Systes Research Group, Departet of Coputer Sciece, Uiversity of Yor, YO10 5DD,

More information

Broadcasting in Multichannel Cognitive Radio Ad Hoc Networks

Broadcasting 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 information

Introduction to Wireless Communication Systems ECE 476/ECE 501C/CS 513 Winter 2003

Introduction 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 information

Importance Analysis of Urban Rail Transit Network Station Based on Passenger

Importance Analysis of Urban Rail Transit Network Station Based on Passenger Joural of Itelliget Learig Systems ad Applicatios, 201, 5, 22-26 Published Olie November 201 (http://www.scirp.org/joural/jilsa) http://dx.doi.org/10.426/jilsa.201.54027 Importace Aalysis of Urba Rail

More information

Permutation Enumeration

Permutation 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 information

Counting on r-fibonacci Numbers

Counting on r-fibonacci Numbers Claremot Colleges Scholarship @ Claremot All HMC Faculty Publicatios ad Research HMC Faculty Scholarship 5-1-2015 Coutig o r-fiboacci Numbers Arthur Bejami Harvey Mudd College Curtis Heberle Harvey Mudd

More information

On Parity based Divide and Conquer Recursive Functions

On 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 information

Optimizing Route Length in Reactive Protocols for Ad Hoc Networks

Optimizing Route Length in Reactive Protocols for Ad Hoc Networks Optimizig Route Legth i Reactive Protocols for Ad Hoc Networks Thomas Heide Clause *,PhilippeJacquetadLauretVieot INRIA Rocquecourt, Projet Hipercom, Domaie de Voluceau, B.P. 5, 7853 Le Chesay cedex, Frace

More information

Converge-Cast with MIMO

Converge-Cast with MIMO Coverge-Cast with MIMO Luoyi Fu, Yi Qi 2, Xibig Wag 3, Xue Liu 4,2,3 Depart. of Electroic Egieerig, Shaghai Jiaotog Uiversity, Chia 4 Depart. of Computer Sciece & Egieerig, Uiversity of Nebraska Licol,

More information

CHAPTER 5 A NEAR-LOSSLESS RUN-LENGTH CODER

CHAPTER 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 information

ELEG 5693 Wireless Communications Ch. 6 Diversity

ELEG 5693 Wireless Communications Ch. 6 Diversity Departet of Electrical Egieerig Uiversit of Arasas ELEG 5693 Wireless Couicatios C. 6 Diversit Dr. Jigia Wu wuj@uar.edu OUTLIE Itroductio Classificatio Space Diversit Teciques Space Tie Bloc Code ITRODUCTIO

More information

Cross-Layer Performance of a Distributed Real-Time MAC Protocol Supporting Variable Bit Rate Multiclass Services in WPANs

Cross-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 information

Interference Avoidance through Dynamic Downlink OFDMA Subchannel Allocation using Intercell Coordination 1

Interference Avoidance through Dynamic Downlink OFDMA Subchannel Allocation using Intercell Coordination 1 Iterferece Avoidace through Dyaic Dowlik OFDMA Subchael Allocatio usig Itercell Coordiatio 1 Mahudur Raha ad Hali Yaikoeroglu Broadbad Couicatios ad Wireless Systes (BCWS) Ceter Departet of Systes ad Coputer

More information

Acoustic MIMO Communications in a Very Shallow Water Channel

Acoustic MIMO Communications in a Very Shallow Water Channel J. Marie Sci. Appl. (2015) 14: DOI: 10.1007/s11804-015-1323-9 Acoustic MIMO Couicatios i a Very Shallow Water Chael Yuehai Zhou, Xiulig Cao ad Feg Tog * Key Laboratory of Uderwater Acoustic Couicatio ad

More information

Research on Radio Resource Management in the Next Generation of Cellular Network

Research on Radio Resource Management in the Next Generation of Cellular Network Research o Radio Resource Maageet i the Next Geeratio of Cellular Networ Septeber 2016 Jia Yu 1 Cotets Chapter 1 Itroductory chapter... 1 1.1 Research Bacgrouds... 1 1.2 State of the Art Related Wor...

More information

ELEC 350 Electronics I Fall 2014

ELEC 350 Electronics I Fall 2014 ELEC 350 Electroics I Fall 04 Fial Exam Geeral Iformatio Rough breakdow of topic coverage: 0-5% JT fudametals ad regios of operatio 0-40% MOSFET fudametals biasig ad small-sigal modelig 0-5% iodes (p-juctio

More information

H2 Mathematics Pure Mathematics Section A Comprehensive Checklist of Concepts and Skills by Mr Wee Wen Shih. Visit: wenshih.wordpress.

H2 Mathematics Pure Mathematics Section A Comprehensive Checklist of Concepts and Skills by Mr Wee Wen Shih. Visit: wenshih.wordpress. H2 Mathematics Pure Mathematics Sectio A Comprehesive Checklist of Cocepts ad Skills by Mr Wee We Shih Visit: weshih.wordpress.com Updated: Ja 2010 Syllabus topic 1: Fuctios ad graphs 1.1 Checklist o Fuctios

More information

Hadi Alasti. Department of Electrical Engineering, University of North Carolina at Charlotte

Hadi Alasti. Department of Electrical Engineering, University of North Carolina at Charlotte Hadi Alasti Departet of Electrical Egieerig, Uiversity of North Carolia at Charlotte halasti@ucc.edu ABSTRACT A iterferece tolerat OFDMA schee is proposed for ultiuser wireless couicatios with specific

More information

Diversity Performance of Precoded OFDM with MMSE Equalization

Diversity Performance of Precoded OFDM with MMSE Equalization Uiversity of Wollogog Research Olie Faculty of Iforatics - Papers (Archive) Faculty of Egieerig ad Iforatio Scieces 7 Diversity Perforace of Precoded OFDM with MMSE Equalizatio Xiaojig Huag Uiversity of

More information

Tracking of RFID Tags Moving on a Conveyor Belt Using Inverse SAR Approach

Tracking of RFID Tags Moving on a Conveyor Belt Using Inverse SAR Approach Iteratioal Workshop of Advaced Maufacturig ad Autoatio (IWAMA 216) Trackig of RFID Tags Movig o a Coveyor Belt Usig Iverse SAR Approach Haishu Ma ad Kesheg Wag Departet of Productio ad Quality Egieerig

More information

AC : USING ELLIPTIC INTEGRALS AND FUNCTIONS TO STUDY LARGE-AMPLITUDE OSCILLATIONS OF A PENDULUM

AC : USING ELLIPTIC INTEGRALS AND FUNCTIONS TO STUDY LARGE-AMPLITUDE OSCILLATIONS OF A PENDULUM AC 007-7: USING ELLIPTIC INTEGRALS AND FUNCTIONS TO STUDY LARGE-AMPLITUDE OSCILLATIONS OF A PENDULUM Josue Njock-Libii, Idiaa Uiversity-Purdue Uiversity-Fort Waye Josué Njock Libii is Associate Professor

More information

APPLICATION NOTE UNDERSTANDING EFFECTIVE BITS

APPLICATION 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 information

A New Basic Unit for Cascaded Multilevel Inverters with the Capability of Reducing the Number of Switches

A New Basic Unit for Cascaded Multilevel Inverters with the Capability of Reducing the Number of Switches Joural of Power Electroics, ol, o, pp 67-677, July 67 JPE --6 http://dxdoiorg/6/jpe67 I(Prit: 98-9 / I(Olie: 9-78 A ew Basic Uit for Cascaded Multi Iverters with the Capability of Reducig the umber of

More information

Capacity of Large-scale CSMA Wireless Networks

Capacity 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 information

A New Min-Cut Placement Algorithm for Timing Assurance Layout Design Meeting Net Length Constraint

A New Min-Cut Placement Algorithm for Timing Assurance Layout Design Meeting Net Length Constraint A New Mi-Cut Placeet Algorith for Tiig Assurace Layout Desig Meetig Net Legth Costrait Masayuki Terai, Kazuhiro Takahashi ad Koji Sat0 ASIC Desig Egieerig Ceter Mitsubishi Electric Corporatio, Itai, Hyogo

More information

Performance Analysis of Channel Switching with Various Bandwidths in Cognitive Radio

Performance 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 information

Radar emitter recognition method based on AdaBoost and decision tree Tang Xiaojing1, a, Chen Weigao1 and Zhu Weigang1 1

Radar 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 information

3GPP TR V ( )

3GPP TR V ( ) TR 5.996 V.. (-3 Techical Report 3rd Geeratio Partership Project; Techical Specificatio Group Radio Access Network; Spatial chael odel for Multiple Iput Multiple Output (MIMO siulatios (Release The preset

More information

Queuing network models for delay analysis of multihop wireless ad hoc networks q

Queuing network models for delay analysis of multihop wireless ad hoc networks q Available olie at www.sciecedirect.com Ad Hoc Networks 7 (2009) 79 97 www.elsevier.com/locate/adhoc Queuig etwork models for delay aalysis of multihop wireless ad hoc etworks q Nabhedra Bisik, Alhussei

More information

Compound Controller for DC Motor Servo System Based on Inner-Loop Extended State Observer

Compound 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 information

History and Advancement of the Family of Log Periodic Toothed Planer Microstrip Antenna

History and Advancement of the Family of Log Periodic Toothed Planer Microstrip Antenna Joural of Electromagetic Aalysis ad Applicatios, 2011, 3, 242-247 doi:10.4236/jemaa.2011.36039 Published Olie Jue 2011 (http://www.scirp.org/joural/jemaa) History ad Advacemet of the Family of Log Periodic

More information

7. Counting Measure. Definitions and Basic Properties

7. Counting Measure. Definitions and Basic Properties Virtual Laboratories > 0. Foudatios > 1 2 3 4 5 6 7 8 9 7. Coutig Measure Defiitios ad Basic Properties Suppose that S is a fiite set. If A S the the cardiality of A is the umber of elemets i A, ad is

More information

RECOMMENDATION ITU-R P Propagation by diffraction

RECOMMENDATION ITU-R P Propagation by diffraction Rec. ITU-R P.- 1 RECOMMENDATION ITU-R P.- Propagatio by diffractio (Questio ITU-R / The ITU Radiocommuicatio Assembly, (1-1-1-1-1-1-1-1- cosiderig a that there is a eed to provide egieerig iformatio for

More information

Cooperative Diversity Based on Code Superposition

Cooperative 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 information

On the Binomial Coefficients and their Interpolation *

On the Binomial Coefficients and their Interpolation * O the Bioial Coefficiets ad their Iterolatio * Leohard Euler Let us rereset the exasio of the ower + x i the followig aer by eas of aroriate characters: + x + x + x + x 3 + etc 3 such that the characters

More information

On the Binomial Coefficients and their Interpolation *

On the Binomial Coefficients and their Interpolation * O the Bioial Coefficiets ad their Iterolatio * Leohard Euler Let us rereset the exasio of the ower + x i the followig aer by eas of aroriate characters: + x + x + x + x 3 + etc 3 such that the characters

More information

ECE 333: Introduction to Communication Networks Fall Lecture 4: Physical layer II

ECE 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 information

SELEX Elsag. 5/18/2012 R. Pucci SDR 12 WinnComm 1

SELEX 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 information

A D2D-based Protocol for Ultra-Reliable Wireless Communications for Industrial Automation

A 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 information

Name Class. Date Section. Test Form A Chapter Chapter 9 Infinite Series. 1 n 1 2 n 3n 1, n 1, 2, 3, Find the fourth term of the sequence

Name Class. Date Section. Test Form A Chapter Chapter 9 Infinite Series. 1 n 1 2 n 3n 1, n 1, 2, 3, Find the fourth term of the sequence 8 Chapter 9 Ifiite Series Test Form A Chapter 9 Name Class Date Sectio. Fid the fourth term of the sequece,,,,.... 6 (a) (b) 6 (c) 8 6. Determie if the followig sequece coverges or diverges: If the sequece

More information

Unit 5: Estimating with Confidence

Unit 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 information

Decode-forward and Compute-forward Coding Schemes for the Two-Way Relay Channel

Decode-forward and Compute-forward Coding Schemes for the Two-Way Relay Channel Decode-forward ad Compute-forward Codig Schemes for the Two-Way Relay Chael Peg Zhog ad Mai Vu Departmet of Electrical ad Computer Egieerig McGill Uiversity Motreal, QC, Caada H3A A7 Emails: peg.zhog@mail.mcgill.ca,

More information

202 Chapter 9 n Go Bot. Hint

202 Chapter 9 n Go Bot. Hint Chapter 9 Go Bot Now it s time to put everythig you have leared so far i this book to good use. I this chapter you will lear how to create your first robotic project, the Go Bot, a four-wheeled robot.

More information

Ch 9 Sequences, Series, and Probability

Ch 9 Sequences, Series, and Probability Ch 9 Sequeces, Series, ad Probability Have you ever bee to a casio ad played blackjack? It is the oly game i the casio that you ca wi based o the Law of large umbers. I the early 1990s a group of math

More information

The Firing Dispersion of Bullet Test Sample Analysis

The Firing Dispersion of Bullet Test Sample Analysis Iteratioal Joural of Materials, Mechaics ad Maufacturig, Vol., No., Ma 5 The Firig Dispersio of Bullet Test Sample Aalsis Youliag Xu, Jubi Zhag, Li Ma, ad Yoghai Sha Udisputed, this approach does reduce

More information

Intermediate Information Structures

Intermediate Information Structures Modified from Maria s lectures CPSC 335 Itermediate Iformatio Structures LECTURE 11 Compressio ad Huffma Codig Jo Roke Computer Sciece Uiversity of Calgary Caada Lecture Overview Codes ad Optimal Codes

More information

Delta- Sigma Modulator with Signal Dependant Feedback Gain

Delta- 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 information

THE LUCAS TRIANGLE RECOUNTED. Arthur T. Benjamin Dept. of Mathematics, Harvey Mudd College, Claremont, CA Introduction

THE LUCAS TRIANGLE RECOUNTED. Arthur T. Benjamin Dept. of Mathematics, Harvey Mudd College, Claremont, CA Introduction THE LUCAS TRIANLE RECOUNTED Arthur T Bejami Dept of Mathematics, Harvey Mudd College, Claremot, CA 91711 bejami@hmcedu 1 Itroductio I 2], Neville Robbis explores may properties of the Lucas triagle, a

More information

Cooperative Spectrum Sensing in Cognitive Radio Networks

Cooperative Spectrum Sensing in Cognitive Radio Networks Cooperative Spectrum Sesig i Cogitive Radio Networks Ghurumuruha Gaesa ad Ye (Geoffrey) Li School of Electrical ad Computer Egieerig Georgia Istitute of Techology, Atlata, Georgia 30332 0250 Abstract I

More information

Compaction-based concurrent error detection for digital circuits

Compaction-based concurrent error detection for digital circuits Microelectroics Joural 36 (2005) 56 62 www.elsevier.co/locate/ejo Copactio-based cocurret error detectio for digital circuits Sobeeh Aluhaizi a, *, Petros Drieas b, Yiorgos Maris a a Electrical Egieerig

More information

A study on traffic accident measures in municipal roads by using GIS

A study on traffic accident measures in municipal roads by using GIS icccbe 010 Nottigham Uiversity Press Proceedigs of the Iteratioal Coferece o Computig i Civil ad Buildig Egieerig W Tizai (Editor) A study o traffic accidet measures i muicipal roads by usig GIS Satoshi

More information

WSN Node Localization Regularization Algorithm Based on Quasi Optimal Criterion Parameter Selection

WSN Node Localization Regularization Algorithm Based on Quasi Optimal Criterion Parameter Selection Sesors & rasducers Vol. 23 Special Issue July 203 pp. 94-98 Sesors & rasducers 203 by IFSA http://www.sesorsportal.com WSN Node Localizatio Regularizatio Algorithm Based o Quasi Optimal Criterio Parameter

More information

WAVE-BASED TRANSIENT ANALYSIS USING BLOCK NEWTON-JACOBI

WAVE-BASED TRANSIENT ANALYSIS USING BLOCK NEWTON-JACOBI WAVE-BASED TRANSIENT ANALYSIS USING BLOCK NEWTON-JACOBI Muhammad Kabir McGill Uiversity Departmet of Electrical ad Computer Egieerig Motreal, QC H3A 2A7 Email: muhammad.kabir@mail.mcgill.ca Carlos Christofferse

More information

ASample of an XML stream is:

ASample of an XML stream is: 1 Efficiet Multichael i XML Wireless Broadcast Stream Arezoo Khatibi* 1 ad Omid Khatibi 2 1 Faculty of Computer Sciece, Uiversity of Kasha, Kasha, Ira 2 Faculty of Mathematics, Uiversity of Viea,Viea,

More information

Consensus-based Synchronization of Microgrids at Multiple Points of Interconnection

Consensus-based Synchronization of Microgrids at Multiple Points of Interconnection MITSUBISHI EECTRIC RESEARCH ABORATORIES http://www.merl.com Cosesus-based Sychroizatio of Microgrids at Multiple Poits of Itercoectio Shah, S.; Su, H.; Nikovski, D.N.; Zhag, J. TR208-2 August 7, 208 Abstract

More information

Combinatorics. Chapter Permutations. Reading questions. Counting Problems. Counting Technique: The Product Rule

Combinatorics. Chapter Permutations. Reading questions. Counting Problems. Counting Technique: The Product Rule Chapter 3 Combiatorics 3.1 Permutatios Readig questios 1. Defie what a permutatio is i your ow words. 2. What is a fixed poit i a permutatio? 3. What do we assume about mutual disjoitedess whe creatig

More information

Wi-Fi or Femtocell: User Choice and Pricing Strategy of Wireless Service Provider

Wi-Fi or Femtocell: User Choice and Pricing Strategy of Wireless Service Provider Wi-Fi or Femtocell: User Choice ad Pricig Strategy of Wireless Service Provider Yajiao Che, Qia Zhag Departmet of Computer Sciece ad Egieerig Hog Kog Uiversity of Sciece ad Techology Email: {cheyajiao,

More information

The Potential of Dynamic Power and Sub-carrier Assignments in Multi-User OFDM-FDMA Cells

The 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 information

E X P E R I M E N T 13

E X P E R I M E N T 13 E X P E R I M E N T 13 Stadig Waves o a Strig Produced by the Physics Staff at Colli College Copyright Colli College Physics Departmet. All Rights Reserved. Uiversity Physics, Exp 13: Stadig Waves o a

More information