Adaptive Network Coding for Wireless Access Networks

Size: px
Start display at page:

Download "Adaptive Network Coding for Wireless Access Networks"

Transcription

1 Adptive Network Coding for Wireless Access Networks Tun Trn School of Electricl Engineering nd Computer Science Oregon Stte University, Corvllis, Oregon 9733 Emil: Thinh Nguyen School of Electricl Engineering nd Computer Science Oregon Stte University, Corvllis, Oregon 9733 Emil: Abstrct We propose frmework for optimizing the qulity of service of multiple simultneous flows in wireless ccess networks vi network coding. Specificlly, we consider the typicl scenrio in which multiple flows originte from multiple sources in the Internet nd terminte t multiple users in wireless network. In the current infrstructure, the wireless bse sttion is responsible for relying the pckets from the Internet to the wireless users without ny modifiction to the pcket content. On the other hnd, in the proposed pproch, the wireless bse sttion is llowed to perform network coding by pproprite liner mixing nd chnnel coding of pckets from different incoming flows before brodcsting single flow of mixed or coded pckets to ll wireless users. Ech user then uses n pproprite decoding method to recover its own pckets from the set of coded pckets tht it receives. We show tht in principle, for the given chnnel conditions nd QoS requirements, pproprite mixing nd chnnel coding of pckets cross different flows cn led to substntil qulity improvement for both rel-time nd non-rel time flows. On the other hnd, blind mixing cn be detrimentl. We formulte this mixing problem s combintoril optimiztion problem, nd propose heuristic lgorithm bsed on simulted-nneling method to pproximte the optiml solution. Simultion results verify the performnce improvement resulting from the proposed pproch over the non-network coding nd the stte-of-the-rt network coding pproches. I. INTRODUCTION In tody communiction networks such s the Internet nd wireless d hoc networks, dt delivery is performed vi the store-nd-forwrd routing, using which, the intermedite routers do not lter the contents of pckets s they trverse hopby-hop from source to destintion. In contrst, Network coding (NC), new routing pproch pioneered by Ahlswede et l. [], llows intermedite routers to generte dt on its output link by mixing dt from multiple of its input links. In this wy, it is theoreticlly possible to chieve the throughput cpcity of multicst/brodcst session, while this is not possible with the store-nd-forwrd routing scheme. Recently, NC technique hs lso been pplied successfully to increse throughput in wireless networks [2] [4]. Hving sid tht, supporting sophisticted functionlities t intermedite routers goes ginst the end-to-end design principle [5] which rgues for simple routers to increse performnce nd sclbility. This principle hs been cited in prt for the huge success of the Internet. In this pper we propose using NC t wireless bse sttion to improve Qulity of Service for ll-type pplictions. Specificlly, we consider the typicl scenrio in which, multiple flows originte from the Internet, trverse wireless bse sttion, nd terminte t multiple users in wireless ccess network. As such, the wireless bse sttion is llowed to perform network coding by pproprite liner mixing nd chnnel coding of pckets from different incoming flows before brodcsting single flow of mixed or coded pckets to ll wireless users. Ech user then uses n pproprite decoding method to recover its own pckets from the set of coded pckets tht it receives. Studying NC in this setup is not entirely new. NC hs been suggested in the context of Wi-Fi nd WiMx networks. Indeed, Nguyen et l. [6] proposed some XOR bsed network coding schemes together with scheduler t Wi-Fi Access Point (AP) to improve throughput where feedbck is redily vilble. Nguyen et l. further extended this work to reduce dely for video trnsmission in [7]. Eryilmz et l. [8] lso proposed to use NC technique tht employs lrge finite field, rther thn XOR-bsed NC techniques, to improve throughput t the BS. In ddition, Trn et l. [9] lso showed tht employing NC jointly with chnnel coding cross the multiple wireless unicst sessions cn significntly increse the overll wireless throughput. Wht new in this pper, however, is frmework for pplying NC coding t the BS, tht optimizes for the qulity of service of both rel-time nd non-rel time trffic. We show tht in principle, for the given chnnel conditions nd QoS requirements, pproprite mixing nd chnnel coding of pckets cross different flows cn led to substntil qulity improvement for both rel-time nd non-rel time pplictions, e.g. video streming nd FTP. On the other hnd, blind mixing of flows my ctully degrde their qulities. Quntifying the performnce of flow mixing, nd finding the optiml mixing with respect to some metric, re the min objectives of this pper. We formulte this mixing problem s combintoril optimiztion problem, nd propose heuristic lgorithm bsed on simulted-nneling method, to pproximte the optiml solution. Simultions confirm the performnce improvement resulting from the proposed controlled mixing pproch over the non-network coding nd the stte-of-the-rt network coding pproches. We first introduce the bckground nd relted work. II. BACKGROUND AND RELATED WORK The notion of NC, i.e., mixing of dt t intermedite nodes to increse the overll multicst cpcity of network, ws first proposed in the seminl pper by Ahlswede et l. []. Ahlswede provided n existence proof of some network codes (method of mixing dt t intermedite nodes) tht chieve multicst cpcity. In recent yers, NC hs been lso pplied successfully to wireless d hoc networks [2],[]. A clssicl exmple first proposed by Wu et l. [] for efficient informtion exchnge in wireless d hoc network is shown in Fig.. Two nodes U nd U 2 wnt to exchnge their pckets through U 3. Pcket sent by U to U 2 is relyed through U 3, nd pcket b sent by U 2 to U is relyed through U 3. As result, U 3 hs both nd b. In n existing wireless d hoc network, U 3 hs to perform two trnsmissions, one trnsmission for sending to U 2, nd nother one for sending b to U. Now using NC, upon //$26. 2 IEEE

2 b= ( b) b b b 4 3 U U 3 U 2 2 () 3 b b b U U b 3 U 2 2 b =b ( b) (b) Fig.. () Informtion exchnge using () the store-nd-forwrd scheme using 4 trnsmissions nd (b) the NC scheme using only 3 trnsmissions. S S 2 Flow 2 Fig. 3. pckets Rel time. Time dptive Number of pckets Stisfction functions of different pplictions versus the number of Flow WLAN AP/WiMAX BS () (b) Fig. 2. () A trnsmission scenrio of unicst flows in WLAN/WiMAX network. (b) Lost pcket ptterns t the receivers; in ech time slot, the first nd second pckets correspond to trnsmitted pckets of the trditionl nd NC techniques. X, O nd - denote lost, successful nd don t cre pckets, respectively. receiving nd b, U 3 brodcsts ( b) to U nd U 2. Since U hs, it cn recover b s b = ( b). Similrly, U 2 cn recover s = b ( b). Following this work, Ktti et l. [2] proposed n opportunistic XOR-bsed scheme for wireless mesh networks nd showed substntil bndwidth improvement over the current store-nd-forwrd pproch. In similr spirit, NC hs been proposed to improve throughput in wireless ccess networks by Nguyen et l. [6] nd Eryilmz et l. [8]. Fig. 2() shows simple exmple of how performing NC t wireless bse sttion cn increse the throughput. Assuming tht, there re two concurrent flows f : S D nd f 2 : S 2 D 2, both shre the sme wireless chnnel from the BS to the receivers. With the existing infrstructure, upon receiving pckets nd b, the BS uses the first nd second time slots to deliver nd b to D nd D 2, respectively. The receivers use ACK or NAK messge, respectively, to signl the BS whether they receive pcket correctly or not. Assuming tht, fter the first two time slots, the BS hs pcket loss pttern s shown in Fig. 2.(b), tht is, pcket is lost t D while pcket b is lost t D 2. If we ssume tht, it tkes one time slot to retrnsmit lost pcket, then the BS needs two more trnsmissions. In ll, 4 time slots re needed to deliver pckets nd b to D nd D 2, respectively. Now consider the rndomized NC (RNC) technique introduced by Koetter et l. in []. Upon receiving two pckets nd b, the BS genertes coded pckets by linerly combining nd b with rndom coefficients. For exmple, coded pcket c i is generted s c i = α i + β i b, () where α i nd β i re coefficients drwn t rndom from lrge finite field. b p 2 p D 2 D The two coded pckets re then brodcsted to both receivers. Assuming tht, fter the first two trnsmissions, the pcket loss pttern t the BS is the sme s before (the first pcket is lost t D, successful t D 2 while the second pcket is successful t D nd lost t D 2 ). In the third time slot, the BS genertes nd brodcsts nother coded pcket. Suppose t this time, both D nd D 2 receive the coded pcket correctly. Then, ech receiver hs received successfully totl of two coded pckets, nd will be ble to recover their own pckets by solving system of liner equtions. We ssume tht the coefficients re included in the pcket heder to enble the receiver to set up the eqution. With sufficiently lrge pcket size, this overhed is negligible [2]. Overll, RNC pproch needs only 3 trnsmissions to deliver two pckets to the intended receivers. However, it is not lwys beneficil to mix pckets from different flows (more results will be shown in the next Sections). In fct, blind mixing cn be detrimentl. This pper dvoctes n informed pcket mixing pproch to mximize the QoS requirements of different flows. III. SYSTEM MODEL AND TRANSMISSION TECHNIQUES To quntify nd compre the performnce of our informed pcket mixing pproch, we consider the following trnsmission techniques. A. Trnsmission Techniques We consider lst mile wireless scenrio consisting of one BS nd M receivers. In prticulr, ssume tht there re M flows from sources S i to destintions D i for i =, 2,...,M, nd these flows shre the wireless chnnel from the BS to the receivers. We ssocite ech destintion D i with demnd S i, the number of pckets tht the receiver D i wnts to receive per time unit. The ith flow hs pcket-level FEC coding scheme denoted s (n i,k i ) where code (n i,k i ) mens tht we use n i k i time slots to trnsmit k i pckets. Without loss of generlity, let us ssume tht BS hs enough memory to store dt for one trnsmission period N = M i= n i. In this pper we consider three techniques: unicst (UNI), Rndomized Network Coding (RNC), nd the proposed Adptive Rndomized Network Coding (ARNC). Before proceeding to the detils of nlysis, let us describe the protocol used in ech technique. Unicst (UNI): This is common trditionl pproch. In ech period, the BS uses pre-specified mximum n i time slots to trnsmit k i dt pckets for receiver D i.this pre-specifiction of FEC level cn be viewed s method to ccommodte vrying QoS levels s specified by different flows. If there re pcket losses, the BS uses n i k i redundnt time slots to retrnsmit the lost pckets. The BS switches to trnsmit dt pckets for the next receiver when it receives n ACK messge from the current receiving user or ll the time slots intended for the current receiver hve been used.

3 Rndomized Network Coding (RNC): Trnsmissions in RNC re clssified into two phses: the bsis nd the ugmenttion. In the bsic phse, ll M i= k i originl pckets will be trnsmitted first. The receivers cche ll the pckets, including ones tht re not intended for them. Next, the BS mix ll the pckets from ll users, to generte coded pckets nd brodcsts them to ll receivers. Agin, the n i nd k i re pre-specified s in the UNI technique. The receivers which hve lost some of their originl pckets now cn receive the coded pckets to decode their own dt bsed on the method described in Section II. Note tht, becuse pckets re not mixed in the bsis phse, receiver is ble to obtin frction of its pckets, even though it cnnot recover ll the mixed pckets in the ugmenttion phse. Proposed Adptive Rndomized Network Coding (ARNC): The BS now hs the bility to choose wht flows to be mixed together bsed on their chnnel conditions, types of services nd priorities. Note tht ll these prmeters (chnnel conditions, types of services, nd priorities) of different flows hve been considered in UNI nd RNC techniques through their ssigned FEC codes. Assuming tht the M incoming flows re prtitioned into G groups. Then, for ech group, the BS uses RNC to trnsmit dt to the receivers inside tht group only. Assuming n i nd k i re fixed s in the previous two techniques, the objective of the BS is to determine the optiml prtition to mximize the verge user stisfction over ll users. Clerly, mixing pckets from ll incoming flows my result in poor performnce due to mismtch in type of services, priorities, nd chnnel conditions, while mixing pckets of flows with similr chrcteristics might be beneficil. A precise mthemticl formultion of this prtitioning problem will be given in the next section. B. Stisfction Function Before formulting the mixing problem, metric is needed in order to quntify the performnce of different trnsmission protocols. We note tht ny suitble metric cn be used with our proposed optimiztion frmework. In this pper, we simply use stisfction function which estimtes the level of stisfction with the given qulity of service (QoS). Obviously, the function depends on the number of pckets received successfully in specified period of time, nd its type of service (ToS). In our pper, we consider two types of services: time-sensitive pplictions, e.g., video streming, nd time dptive pplictions, e.g., file trnsfer nd emil. For the time-sensitive pplictions, we ssume tht the ppliction dt is seprted into lyers. For exmple, video streming is pcketized into bsic nd enhnced lyers. In order to mintin the miniml QoS, receiver needs to receive t lest N pckets of the bsic lyer per time period. If the number of received pckets is less thn N, the QoS of the receiver decreses significntly. However, if more pckets of the enhnced lyer re received, the QoS of the receiver just increses slightly. One cn think this s more detils of picture re dded into the bsic frme. We dopt the stisfction function proposed in [3]. Tht is, γ i = F(S i ) S i <γ.n γ γ Si γn ( γ )N γ N S i <N = γ +( γ ) Si (2 γ)n ( γ )N N S i < (2 γ )N S i (2 γ )N, (2) where S i denotes the number of pckets received successfully, N denotes the miniml number of pckets to mintin stisfction fctor of γ. For time-dptive pplictions, the chrcteristic of stisfction function is different. In order to obtin stisfction fctor of γ, the receiver needs to receive t lest N pckets per time period. However, when the number of received pckets is less or greter thn N, respectively, the stisfction function decreses or increses slightly. The function is given by { γ. Si N γ i = F(S i )= S i <N (3) ( γ)n S i S i N. The stisfction functions of different types of pplictions versus the number of pckets re shown in Fig. 3. Given the stisfction functions, we cll trnsmission technique is the best technique if it produces the lrgest expected stisfction over ll users. IV. PROBLEM FORMULATION OF ADAPTIVE RANDOMIZED NETWORK CODING Due to pge limit, we only provide formultion for the ARNC pproch. The problem formultion nd nlysis of the UNI nd RNC techniques cn be found in [4]. Let G denote prtition of the incoming flows nd G denote the number of groups in G. LetM i denote the number of flows in group i. Per ech group, we use RNC technique described bove, to trnsmit the dt. Consider the ith group nd let N i = Mi j= n ij nd K i = M i j= k ij denote the totl vilble time slots nd informtion pckets need to be trnsmitted for group i. Here(n ij,k ij ) denotes the FEC code pplied to the flow trnsmitting to receiver j of group i. We hve the probbility tht receiver j of group i, D ij, cn recover its ll dt is K i k ij ( ) Pij s =( p ij ) kij Ni k ij p Ni kij l ij ( p ij ) l l k ij ( kij + s= N i k ij t=k i s ) s ( Ni k ij l= p kij s ij ( p ij ) s t ) p Ni kij t ij ( p ij ) t. (4) We now clculte the probbility tht receiver D ij recovers m out of k ij originl pckets (m <k ij ). K i ( )( ) Ni k ij kij P ij (m) = p Ni l ij ( p ij ) l. (5) l m m l=m Let rndom vrible γ ij denote the stisfction of receiver D ij. Then the verge stisfction over ll users is given by G M i γ = E c ij γ ij, (6) where c ij denotes the weighted fctor (priority) for the jth flow in group i; this fctor is proportionl to the price tht the receiver D i hs to py to the service provider; thus, the higher price, the higher priority, nd E[.] denotes the expected We buse the nottion slightly since this FEC code is some originl FEC code.

4 function. Now, prtition scheme is optiml if it mximizes the verge stisfction over ll users. This optimiztion problem cn be formulted s: Mximize {γ} subject to: G M i k ij = K (7) G M i n ij = N (8) γ ij for i =, 2,..., G,j =, 2,...,M i (9) G Ω () where k ij E[γ ij ]=F(k ij )Pij s + F(m)P ij (m), m= nd Ω denotes the collection of ll the nonempty-subset prtitions of flows {f,f 2,..., f M }, N nd K respectively denote the totl number of time slots nd dt pckets in one trnsmission period. V. HEURISTIC ALGORITHM FOR OPTIMAL MIXING The combintoril optimiztion problem bove is hrd. Thus, in this section, we describe simulted-nneling heuristic lgorithm bsed on the Mrkov Chin Monte Crlo (MCMC) method to pproximte the solution [5]. Simulted-Anneling Bsed Algorithm (SAB): Inthis section, we show how to ppropritely construct trget distribution, nd use MCMC to obtin the solution. Consider scenrio with M concurrent flows trversing through the BS. Let Ω be the set of ll possible prtitions, nd let S(x) be the verge stisfction of prtition x Ω. We represent ech prtition by n M-tuple group index s x =(i,j,...,k) where i indictes tht the first flow belongs to group i, the second flow belongs to the group j, nd so on. The objective is to mximize the verge stisfction over ll users. Tht is, G M i mx S(x) = mx c x Ω x Ω ij γ ij. () We should note tht the number of possible prtitions in Ω is very lrge, tht is [6] M k ( ) k Ω = ( ) i (k i) M. (2) k! i k= i= Hence, using exhustive serch, even for resonbly smll number of flows, is infesible for time-sensitive pplictions. Moreover, every time flow joins, termintes, or its chnnel condition chnges, the AP needs to reprtition gin. Insted, by using MCMC method we will show tht the time to chieve ner optiml solution will be substntilly reduced. We first define the trget distribution to be the Boltzmnn probbility density function (pdf): f(x) =Ce S(x) T B, (3) where C is normlized fctor nd T B is temperture. As seen, if S(x) is lrge, then f(x) is lrge. Thus, with high probbility, we will drw smples corresponding to S(x) which by design, will mximize the verge user stisfction. Next, we need mechnism for moving from one stte to nother in the chin. To do so, we define neighbor of prtition in the smple spce Ω: Definition 5.: A prtition y is clled neighborhood of prtition x if nd only if x nd y differ in only one element. From the bove definition, y cn be generted from x by replcing n element of x with different one drwn t rndom from the index set, 2,..., M. For exmple, M = 5, the prtition x =(,, 3, 2, 3) hs neighbor y =(,,, 2, 3) since x nd y differ in the third element. We now propose Simulted-Anneling bsed lgorithm to generte smples ccording to the trget distribution. We propose trnsition function q(x, y) from stte x to one of its neighbors. Specificlly, n element of x is selected uniformly t rndom, nd then it is replced by one of the possible indexes uniformly. Therefore, it is cler tht q(x, y) =q(y, x) = M(M ). (4) Consequently, the cceptnce probbility, i.e., the probbility tht the chin moves from the current stte x to new stte y, is given by { } f(y)q(y, x) α(x, y) = min, f(x)q(x, y) { if S(y) S(x) = e S(y) S(x) T B if S(y) <S(x) (5) As designed, the Boltzmnn distribution becomes more nd more concentrted round the globl mximizer by grdully decresing the temperture T B. Pseudocode of the Simulted- Anneling bsed lgorithm is described in Algorithm. Algorithm : Simulted-Anneling bsed lgorithm. Input: M, c i, RS(n i,k i ). Output: Optiml Flow Prtition. : STEP : Initilize the strting stte X nd temperture T. Set n =. 2: STEP 2: Generte new stte Y from the proposl q(x n,y). 3: STEP 3: 4: if S(Y ) S(X n ) then 5: X n+ = Y 6: else 7: U U(, ) {Generte uniform rndom vrible.} S(Y ) S(Xn) Tn 8: if U<α(X n,y)=e then 9: X n+ = Y : else : X n+ = X n 2: end if 3: end if 4: STEP 4: Decrese the temperture T n+ = β.t n where β <, increse n by nd repet from STEP 2 until stopping. 5: STEP 5: Return scheme x tht produces the mximl weighted-verge stisfction. Convergence: Gurntee of convergence to the trget distribution using the SAB lgorithm is shown vi the following theorem:

5 Theorem 5.2: Smples drwn from the SAB lgorithm form Mrkov chin whose sttes stisfy the detiled blnce eqution: π(x)p (x, y) =π(y)p (y, x) x, y Ω, (6) where π(x), π(y) re the sttionry distributions of sttes x nd y; P (x, y) nd P (y, x) re respectively the trnsition probbilities from stte x to stte y nd vice vers. Proof: The proof is omitted due to the pge limit. VI. SIMULATIONS AND DISCUSSIONS We consider relistic wireless ccess network hving diversity in pplictions nd chnnel conditions. For exmple, scenrio where different types of users re connecting to bse sttion nd some of them re moving. It is not esy to set up network with lrge number of users stisfying those conditions. Moreover, in the exhustive serch method, we need to scn ll the possible chnnel prtitions, which increses exponentilly with the number of flows, to find the optiml prtition. Therefore, in resonble network settings, we consider single-hop wireless network consisting of 5 incoming flows. In prticulr, we ssume tht there re two types of pplictions: time-sensitive nd time-dptive. The BS decides coding scheme for flow bsed on the cost which the user hd pid to the service provider. Tht is, the higher cost, the higher priority. Note tht the type nd priority of pcket cn be esily elborted in the heder of the trnsmitted pckets. In the UNI technique, the BS uses the priorities of the incoming flows to ssign their redundncies, nd they will be used in ll techniques for fir comprison. We consider the typicl WLAN chnnel with trnsmission rte of 2 Mbps, equivlent to N = 33 time slots or 33.5Kbyte pckets. In ddition, time-dptive ppliction requires 8 dt pckets per second, corresponding to rte of 27 Kbps, while time-sensitive ppliction requires 25 nd 3 dt pckets, corresponding to rtes of 37.5 nd 45 Kbps, for medium nd high QoS, to chieve the stisfction fctor of. These numbers re equivlent with the number of frmes per second in video streming. System recoverbility TABLE I PARAMETERS OF THE TRANSMISSION FLOWS. Flow ID Rx ID (n i, k i ) p i Service type Priority f D (2, 8) Time dptive f2 D 2 (2, 8).5 Time dptive f3 D 3 (22, 8).5 Time dptive 2 f4 D 4 (3, 25).5 Rel time 3 f5 D 5 (38, 3).5 Rel time p =.3 UNI RNC ARNC Prtition index () System recoverbility UNI RNC ARNC Pcket loss rte p Fig. 4. () System recoverbility versus prtition schemes for the cse of 5 flows. The trnsmission prmeters of the flows re summrized in Tble I, nd p = 3%. (b) System recoverbility versus pcket loss rte p, the other prmeters re given in Tble I. (b) If the number of dt pckets received t ech receiver is less thn the required pckets, its stisfction will decrese ccording to the stisfction function s described in Section III-B. The trnsmission prmeters of the incoming flows re given in Tble I. These prmeters re set bsed on the types of pplictions, priorities of the incoming flows, nd the bndwidth vilbility. In ddition, the redundncy used for ech incoming flow depends on its priority, for exmple, in our experiments we set priorities, 2, 3 nd 4 corresponding to redundncies of 5%, 2%, 25% nd 3%. Note tht these prmeters will be pplied to ll techniques. A. System Recoverbility We first show the benefit of informed mixing nd the drwbck of blind mixing by exmining the probbility tht ll the receivers cn decode their pckets. Fig. 4() shows this probbility versus ll different prtitions, i.e., wys of mixing dt when the pcket losses of receivers from D 2 to D 5 re set to 5% while tht of receiver D is 3%. We mp ech prtition to n integer on the x-xis. The number of possible prtitions is n exponentil function of the number of the incoming flows, nd is equl to the sum of the Stirling numbers of the second kind s shown in Eq. (2). We lso plot the recoverbility probbilities for UNI nd RNC techniques on the sme grph for comprison. They re indicted by stright lines since these techniques do not depend on the prtitions. Recll tht UNI does not mix pckets from different flows. RNC sends the originl pckets then the mixed redundnt pckets, so the mount of mixing here is rther miniml. As seen, RNC is clerly better thn UNI. It is interesting to note tht, t lest in this scenrio, blind mixing is generlly better thn UNI but worse thn ARNC (ARNC technique chooses the optiml prtition scheme to encode nd trnsmit pckets). This is indicted by the fct tht some of the prtitions lie bove RNC line. In fct, the proposed ARNC find precisely this best prtition by mixing flows f nd f 4 into one group while the other flows f 2, f 3 nd f 5 into nother. Note tht the objective of our optimiztion in this cse is not the user stisfction but the recoverbility probbility of ll users. Next, we evlute the probbility tht ll receivers cn recover the dt s function of pcket loss rtes. In this scenrio, the pcket loss rtes for receivers D i for i = {2, 3, 4, 5} re shown in Tble I while tht of receiver D is vried from % to 25%. The result is shown in Fig. 4(b). As shown, when p is smll, i.e., less thn 8%, mixing ll the incoming pckets is better thn trnsmitting them seprtely. This is indicted by the grph produced by RNC technique which is higher thn tht of the UNI technique. However, tht is not the cse when the pcket loss rte p is greter thn 9%, UNI technique outperforms RNC. Intuitively, this is becuse when mixing pckets from ll the flows, the receiver D with bd chnnel condition will not be ble to receive enough pckets to decode its own pckets. This lone cn led to substntil reduction on the overll recoverbility. In contrst, with proper mixing, ARNC outperforms ll other techniques in every scenrio. B. User Stisfction Fctor We now evlute the verge user stisfction s function of the chnnels conditions. In prticulr, we set p 3 = p 5 = 5%, while vrying p from % to 2%, p 2 = p +., nd p 4 = p +.2. These settings re pplied to mke the chnnel conditions more relistic in diversity wireless network. The other prmeters of the network re set the sme s before s

6 UNI RNC SAB Exh Pcket loss rte: p =. UNI RNC SAB Exh Pcket loss rte: p =.3 Simultion D D2 D3 D4 D5 UNI RNC SAB Exh Pcket loss rte: p =.9 Fig. 5. Users stisfction fctors. given in Tble I. The stisfction of receiver is evluted bsed on the number of useful pckets received successfully nd the type of ppliction tht user uses. The bsic stisfctions, i.e., γ, of time-sensitive nd time-dptive pplictions re set t.5 nd when the number of useful received pckets is 5% of the intended pckets. This is becuse the time-sensitive pplictions re more vulnerble to pcket loss rtes. In the SAB lgorithm, we set initil temperture T =nd cooling down scle fctor β =.9. Fig. 5 represents the stisfction fctors of the users using different techniques. The left, middle nd right grphs represent the rnges of low, medium nd high pcket loss rtes, respectively. In the low loss rte, we set p =.. As seen, ll the techniques stisfy QoS of ll users. For ll techniques, the receivers with the first nd second highest priorities, i.e., D 4 nd D 5, obtin stisfctions pproximtely while the other receivers obtin stisfction fctor round.9. This is intuitively plusible since in this cse, resource is plenty, no optimiztion is needed, nd ll users get wht they wnt. In the medium loss rnge, i.e., p =.3, ll the techniques still cn mintin the users stisfction fctors t reltively high level. However, UNI technique strts reducing the QoS of the receivers hving high pcket loss rtes with low priorities, i.e., receivers D nd D 2, due to its seprte trnsmission method. Now, in the high pcket loss rnge, we set p =.9. As seen in the rightmost grph, ll the receivers with low pcket loss rtes, D 2 nd D 5, cn be kept with high QoS. However, when using the UNI nd RNC, the stisfction fctors of the other receivers with high pcket loss rtes, D 2 nd D 4,hve been reduced significntly. Notbly, for receiver with timesensitive ppliction, D 4, its stisfction fctor is decresed substntilly when mixing its pckets with ll other flows in the RNC technique. Obviously, ARNC with exhustive serch lwys chieves the best performnce. However, n interesting observtion is tht SAB lgorithm cn pproximte the optiml solution very well with only itertions. In prticulr, the stisfction fctor of receiver D 4 is round.78 nd bout % less thn tht of the exhustive serch, but 3% higher thn tht of UNI, the second best technique. VII. CONCLUSIONS AND FUTURE WORK We hve investigted the problem of how to mix flows or perform network coding t BS in wireless ccess network, in order to improve the QoS of the wireless pplictions. We hve shown tht blind mixing, in the sense tht ll incoming flows re mixed together, then brodcst to the receivers, my ctully reduce the qulity of wireless pplictions. We hve proposed n optimiztion frmework in which we consider the types of pplictions, service priorities nd chnnels conditions to control the mount of flow mixing, in order to mximize the verge qulity over ll flows. A heuristic lgorithm clled SAB is proposed to pproximte optiml solution efficiently. As our future work, there re mny interesting directions tht we wnt to extend from this pper. Mthemticlly finding n upper bound on the runtime of the SAB lgorithm is still theoreticl open question. Other directions included design nd nlysis of more sophisticted Mrkov chin tht llows fster convergence speed re lso worthwhile to pursue. REFERENCES [] R. Ahlswede, N. Ci, R. Li, nd R. W. Yeung, Network informtion flow, IEEE Trns. Inform. Theory, vol. 46, pp , July 2. [2] S Ktti, D Ktbi, W Hu, H Rhul, nd M. Medrd, The importnce of being opportunistic: Prcticl network coding for wireless environments, in Proc. 43rd Annul Allerton Conference on Communiction, 25. [3] Schin Ktti, Hrihrn Rhul, Wenjun Hu, Din Ktbi, Muriel Medrd, nd Jon Crowcroft, Xors in the ir: Prcticl wireless network coding, in ACM SIGCOMM, Sept. 26. [4] T. Trn, T. Nguyen, B. Bose, nd V. Gopl, A hybrid network coding technique for single-hop wireless networks, IEEE Journl of Selected Topics in Advnced Communiction (JSAC) - Specil Issue on Network Coding for Wireless Communiction, Jun. 29. [5] J. Sltzer, D. Reed, nd D. Clrk, End-to-end rguments in system design, ACM Trnsction on Computer System, vol. 2, no. 4, pp , November 984. [6] D. Nguyen, T. Trn, T. Nguyen, nd B. Bose, Wireless brodcst using network coding, IEEE Trnsctions on Vehiculr Technology, Feb. 29. [7] D. Nguyen, T. Nguyen, nd X. Yng, Wireless multimedi trnsmission with network coding, in IEEE Pcket Video Workshop 27, November 27. [8] A. Eryilmz, A. Ozdglr, nd M. Medrd, On dely performnce gins from network coding, in CISS, mrch 26. [9] T. Trn, T. Nguyen, nd B. Bose, A joint network-chnnel coding technique for single-hop wireless networks, in Fourth Workshop on Network Coding, Theory, nd Applictions, Jn. 28. [] Y. Wu, P. A. Chou, nd S.-Y. Kung, Informtion exchnge in wireless networks with network coding nd physicl-lyer brodcst, in Technicl Report MSR-TR-24-78, Microsoft Reserch, Aug. 24. [] R. Koetter nd M. Medrd, Beyond routing: An lgebric pproch to network coding, in Proceedings of the 22 IEEE Infocom, 22. [2] P. A. Chou, Y. Wu, nd K. Jin, Prcticl network coding, in Proc. 4st Allerton Conf. Communiction, Control nd Computing Monticello, 23. [3] Guowng Mio nd Zhisheng Niu, Bndwidth mngement for mixed unicst nd multicst multimedi flows with perception bsed qos differentition, in ICC 26, pp , 26. [4] T. Trn, Throughput Optimiztion for Single-Hop Wireless Networks Using Network Coding, Ph.D. thesis, Oregon Stte University, 2. [5] Mrk Jerrum nd Alistir Sinclir, The mrkov chin monte crlo method: n pproch to pproximte counting nd integrtion, in Approximtion Algorithms for NP-hrd Problems, D.S.Hochbum ed., PWS Publishing, Boston, 996. [6] M. Abrmowitz nd I. A. (Eds.) Stegun, Hndbook of mthemticl functions with formuls, grphs, nd mthemticl tbles, in 9th printing. New York: Dover, pp , 972.

MAXIMUM FLOWS IN FUZZY NETWORKS WITH FUNNEL-SHAPED NODES

MAXIMUM FLOWS IN FUZZY NETWORKS WITH FUNNEL-SHAPED NODES MAXIMUM FLOWS IN FUZZY NETWORKS WITH FUNNEL-SHAPED NODES Romn V. Tyshchuk Informtion Systems Deprtment, AMI corportion, Donetsk, Ukrine E-mil: rt_science@hotmil.com 1 INTRODUCTION During the considertion

More information

METHOD OF LOCATION USING SIGNALS OF UNKNOWN ORIGIN. Inventor: Brian L. Baskin

METHOD OF LOCATION USING SIGNALS OF UNKNOWN ORIGIN. Inventor: Brian L. Baskin METHOD OF LOCATION USING SIGNALS OF UNKNOWN ORIGIN Inventor: Brin L. Bskin 1 ABSTRACT The present invention encompsses method of loction comprising: using plurlity of signl trnsceivers to receive one or

More information

Energy Harvesting Two-Way Channels With Decoding and Processing Costs

Energy Harvesting Two-Way Channels With Decoding and Processing Costs IEEE TRANSACTIONS ON GREEN COMMUNICATIONS AND NETWORKING, VOL., NO., MARCH 07 3 Energy Hrvesting Two-Wy Chnnels With Decoding nd Processing Costs Ahmed Arf, Student Member, IEEE, Abdulrhmn Bknin, Student

More information

A Slot-Asynchronous MAC Protocol Design for Blind Rendezvous in Cognitive Radio Networks

A Slot-Asynchronous MAC Protocol Design for Blind Rendezvous in Cognitive Radio Networks Globecom 04 - Wireless Networking Symposium A Slot-Asynchronous MAC Protocol Design for Blind Rendezvous in Cognitive Rdio Networks Xingy Liu nd Jing Xie Deprtment of Electricl nd Computer Engineering

More information

Synchronous Machine Parameter Measurement

Synchronous Machine Parameter Measurement Synchronous Mchine Prmeter Mesurement 1 Synchronous Mchine Prmeter Mesurement Introduction Wound field synchronous mchines re mostly used for power genertion but lso re well suited for motor pplictions

More information

Example. Check that the Jacobian of the transformation to spherical coordinates is

Example. Check that the Jacobian of the transformation to spherical coordinates is lss, given on Feb 3, 2, for Mth 3, Winter 2 Recll tht the fctor which ppers in chnge of vrible formul when integrting is the Jcobin, which is the determinnt of mtrix of first order prtil derivtives. Exmple.

More information

The Discussion of this exercise covers the following points:

The Discussion of this exercise covers the following points: Exercise 4 Bttery Chrging Methods EXERCISE OBJECTIVE When you hve completed this exercise, you will be fmilir with the different chrging methods nd chrge-control techniques commonly used when chrging Ni-MI

More information

Information-Coupled Turbo Codes for LTE Systems

Information-Coupled Turbo Codes for LTE Systems Informtion-Coupled Turbo Codes for LTE Systems Lei Yng, Yixun Xie, Xiowei Wu, Jinhong Yun, Xingqing Cheng nd Lei Wn rxiv:709.06774v [cs.it] 20 Sep 207 Abstrct We propose new clss of informtion-coupled

More information

Interference Cancellation Method without Feedback Amount for Three Users Interference Channel

Interference Cancellation Method without Feedback Amount for Three Users Interference Channel Open Access Librry Journl 07, Volume, e57 ISSN Online: -97 ISSN Print: -9705 Interference Cncelltion Method without Feedbc Amount for Three Users Interference Chnnel Xini Tin, otin Zhng, Wenie Ji School

More information

ABB STOTZ-KONTAKT. ABB i-bus EIB Current Module SM/S Intelligent Installation Systems. User Manual SM/S In = 16 A AC Un = 230 V AC

ABB STOTZ-KONTAKT. ABB i-bus EIB Current Module SM/S Intelligent Installation Systems. User Manual SM/S In = 16 A AC Un = 230 V AC User Mnul ntelligent nstlltion Systems A B 1 2 3 4 5 6 7 8 30 ma 30 ma n = AC Un = 230 V AC 30 ma 9 10 11 12 C ABB STOTZ-KONTAKT Appliction Softwre Current Vlue Threshold/1 Contents Pge 1 Device Chrcteristics...

More information

Synchronous Machine Parameter Measurement

Synchronous Machine Parameter Measurement Synchronous Mchine Prmeter Mesurement 1 Synchronous Mchine Prmeter Mesurement Introduction Wound field synchronous mchines re mostly used for power genertion but lso re well suited for motor pplictions

More information

Exercise 1-1. The Sine Wave EXERCISE OBJECTIVE DISCUSSION OUTLINE. Relationship between a rotating phasor and a sine wave DISCUSSION

Exercise 1-1. The Sine Wave EXERCISE OBJECTIVE DISCUSSION OUTLINE. Relationship between a rotating phasor and a sine wave DISCUSSION Exercise 1-1 The Sine Wve EXERCISE OBJECTIVE When you hve completed this exercise, you will be fmilir with the notion of sine wve nd how it cn be expressed s phsor rotting round the center of circle. You

More information

Engineer-to-Engineer Note

Engineer-to-Engineer Note Engineer-to-Engineer Note EE-297 Technicl notes on using Anlog Devices DSPs, processors nd development tools Visit our Web resources http://www.nlog.com/ee-notes nd http://www.nlog.com/processors or e-mil

More information

Algorithms for Memory Hierarchies Lecture 14

Algorithms for Memory Hierarchies Lecture 14 Algorithms for emory Hierrchies Lecture 4 Lecturer: Nodri Sitchinv Scribe: ichel Hmnn Prllelism nd Cche Obliviousness The combintion of prllelism nd cche obliviousness is n ongoing topic of reserch, in

More information

CHAPTER 2 LITERATURE STUDY

CHAPTER 2 LITERATURE STUDY CHAPTER LITERATURE STUDY. Introduction Multipliction involves two bsic opertions: the genertion of the prtil products nd their ccumultion. Therefore, there re two possible wys to speed up the multipliction:

More information

A Cluster-based TDMA System for Inter-Vehicle Communications *

A Cluster-based TDMA System for Inter-Vehicle Communications * JOURNAL OF INFORMATION SCIENCE AND ENGINEERING 30, 213-231 (2014) A Cluster-bsed TDMA System for Inter-Vehicle Communictions * Deprtment of Electricl Engineering Ntionl Sun Yt-Sen University Kohsiung,

More information

Experiment 3: Non-Ideal Operational Amplifiers

Experiment 3: Non-Ideal Operational Amplifiers Experiment 3: Non-Idel Opertionl Amplifiers Fll 2009 Equivlent Circuits The bsic ssumptions for n idel opertionl mplifier re n infinite differentil gin ( d ), n infinite input resistnce (R i ), zero output

More information

Y9.ET1.3 Implementation of Secure Energy Management against Cyber/physical Attacks for FREEDM System

Y9.ET1.3 Implementation of Secure Energy Management against Cyber/physical Attacks for FREEDM System Y9.ET1.3 Implementtion of Secure Energy ngement ginst Cyber/physicl Attcks for FREED System Project Leder: Fculty: Students: Dr. Bruce cillin Dr. o-yuen Chow Jie Dun 1. Project Gols Develop resilient cyber-physicl

More information

Multi-beam antennas in a broadband wireless access system

Multi-beam antennas in a broadband wireless access system Multi-em ntenns in rodnd wireless ccess system Ulrik Engström, Mrtin Johnsson, nders Derneryd nd jörn Johnnisson ntenn Reserch Center Ericsson Reserch Ericsson SE-4 84 Mölndl Sweden E-mil: ulrik.engstrom@ericsson.com,

More information

Experiment 3: Non-Ideal Operational Amplifiers

Experiment 3: Non-Ideal Operational Amplifiers Experiment 3: Non-Idel Opertionl Amplifiers 9/11/06 Equivlent Circuits The bsic ssumptions for n idel opertionl mplifier re n infinite differentil gin ( d ), n infinite input resistnce (R i ), zero output

More information

MATH 118 PROBLEM SET 6

MATH 118 PROBLEM SET 6 MATH 118 PROBLEM SET 6 WASEEM LUTFI, GABRIEL MATSON, AND AMY PIRCHER Section 1 #16: Show tht if is qudrtic residue modulo m, nd b 1 (mod m, then b is lso qudrtic residue Then rove tht the roduct of the

More information

Study on SLT calibration method of 2-port waveguide DUT

Study on SLT calibration method of 2-port waveguide DUT Interntionl Conference on Advnced Electronic cience nd Technology (AET 206) tudy on LT clibrtion method of 2-port wveguide DUT Wenqing Luo, Anyong Hu, Ki Liu nd Xi Chen chool of Electronics nd Informtion

More information

Module 9. DC Machines. Version 2 EE IIT, Kharagpur

Module 9. DC Machines. Version 2 EE IIT, Kharagpur Module 9 DC Mchines Version EE IIT, Khrgpur esson 40 osses, Efficiency nd Testing of D.C. Mchines Version EE IIT, Khrgpur Contents 40 osses, efficiency nd testing of D.C. mchines (esson-40) 4 40.1 Gols

More information

Simulation of Transformer Based Z-Source Inverter to Obtain High Voltage Boost Ability

Simulation of Transformer Based Z-Source Inverter to Obtain High Voltage Boost Ability Interntionl Journl of cience, Engineering nd Technology Reserch (IJETR), olume 4, Issue 1, October 15 imultion of Trnsformer Bsed Z-ource Inverter to Obtin High oltge Boost Ability A.hnmugpriy 1, M.Ishwry

More information

DYE SOLUBILITY IN SUPERCRITICAL CARBON DIOXIDE FLUID

DYE SOLUBILITY IN SUPERCRITICAL CARBON DIOXIDE FLUID THERMAL SCIENCE, Yer 2015, Vol. 19, No. 4, pp. 1311-1315 1311 DYE SOLUBILITY IN SUPERCRITICAL CARBON DIOXIDE FLUID by Jun YAN, Li-Jiu ZHENG *, Bing DU, Yong-Fng QIAN, nd Fng YE Lioning Provincil Key Lbortory

More information

Joanna Towler, Roading Engineer, Professional Services, NZTA National Office Dave Bates, Operations Manager, NZTA National Office

Joanna Towler, Roading Engineer, Professional Services, NZTA National Office Dave Bates, Operations Manager, NZTA National Office . TECHNICA MEMOANDM To Cc repred By Endorsed By NZTA Network Mngement Consultnts nd Contrctors NZTA egionl Opertions Mngers nd Are Mngers Dve Btes, Opertions Mnger, NZTA Ntionl Office Jonn Towler, oding

More information

(CATALYST GROUP) B"sic Electric"l Engineering

(CATALYST GROUP) Bsic Electricl Engineering (CATALYST GROUP) B"sic Electric"l Engineering 1. Kirchhoff s current l"w st"tes th"t (") net current flow "t the junction is positive (b) Hebr"ic sum of the currents meeting "t the junction is zero (c)

More information

MEASURE THE CHARACTERISTIC CURVES RELEVANT TO AN NPN TRANSISTOR

MEASURE THE CHARACTERISTIC CURVES RELEVANT TO AN NPN TRANSISTOR Electricity Electronics Bipolr Trnsistors MEASURE THE HARATERISTI URVES RELEVANT TO AN NPN TRANSISTOR Mesure the input chrcteristic, i.e. the bse current IB s function of the bse emitter voltge UBE. Mesure

More information

Solutions to exercise 1 in ETS052 Computer Communication

Solutions to exercise 1 in ETS052 Computer Communication Solutions to exercise in TS52 Computer Communiction 23 Septemer, 23 If it occupies millisecond = 3 seconds, then second is occupied y 3 = 3 its = kps. kps If it occupies 2 microseconds = 2 6 seconds, then

More information

Math Circles Finite Automata Question Sheet 3 (Solutions)

Math Circles Finite Automata Question Sheet 3 (Solutions) Mth Circles Finite Automt Question Sheet 3 (Solutions) Nickols Rollick nrollick@uwterloo.c Novemer 2, 28 Note: These solutions my give you the nswers to ll the prolems, ut they usully won t tell you how

More information

First Round Solutions Grades 4, 5, and 6

First Round Solutions Grades 4, 5, and 6 First Round Solutions Grdes 4, 5, nd 1) There re four bsic rectngles not mde up of smller ones There re three more rectngles mde up of two smller ones ech, two rectngles mde up of three smller ones ech,

More information

High-speed Simulation of the GPRS Link Layer

High-speed Simulation of the GPRS Link Layer 989 High-speed Simultion of the GPRS Link Lyer J Gozlvez nd J Dunlop Deprtment of Electronic nd Electricl Engineering, University of Strthclyde 204 George St, Glsgow G-lXW, Scotlnd Tel: +44 4 548 206,

More information

Domination and Independence on Square Chessboard

Domination and Independence on Square Chessboard Engineering nd Technology Journl Vol. 5, Prt, No. 1, 017 A.A. Omrn Deprtment of Mthemtics, College of Eduction for Pure Science, University of bylon, bylon, Irq pure.hmed.omrn@uobby lon.edu.iq Domintion

More information

Analysis of Coding-aware MAC Protocols based on Reverse Direction Protocol for IEEE based Wireless Networks using Network Coding*

Analysis of Coding-aware MAC Protocols based on Reverse Direction Protocol for IEEE based Wireless Networks using Network Coding* Anlysis of oding-wre MA Protocols sed on Reverse irection Protocol for IEEE 8.-sed Wireless Networks using Network oding* Rul Plcios, Htegereil Kssye Hile, Jesus Alonso-Zrte nd Frizio Grnelli {plciostrujillo,

More information

EET 438a Automatic Control Systems Technology Laboratory 5 Control of a Separately Excited DC Machine

EET 438a Automatic Control Systems Technology Laboratory 5 Control of a Separately Excited DC Machine EE 438 Automtic Control Systems echnology bortory 5 Control of Seprtely Excited DC Mchine Objective: Apply proportionl controller to n electromechnicl system nd observe the effects tht feedbck control

More information

Fuzzy Logic Controller for Three Phase PWM AC-DC Converter

Fuzzy Logic Controller for Three Phase PWM AC-DC Converter Journl of Electrotechnology, Electricl Engineering nd Mngement (2017) Vol. 1, Number 1 Clusius Scientific Press, Cnd Fuzzy Logic Controller for Three Phse PWM AC-DC Converter Min Muhmmd Kml1,, Husn Ali2,b

More information

Lecture 20. Intro to line integrals. Dan Nichols MATH 233, Spring 2018 University of Massachusetts.

Lecture 20. Intro to line integrals. Dan Nichols MATH 233, Spring 2018 University of Massachusetts. Lecture 2 Intro to line integrls Dn Nichols nichols@mth.umss.edu MATH 233, Spring 218 University of Msschusetts April 12, 218 (2) onservtive vector fields We wnt to determine if F P (x, y), Q(x, y) is

More information

Network-coded Cooperation for Multi-unicast with Non-Ideal Source-Relay Channels

Network-coded Cooperation for Multi-unicast with Non-Ideal Source-Relay Channels This full text pper ws peer reviewed t the direction of IEEE Communictions Society suject mtter experts for puliction in the IEEE ICC 2010 proceedings Network-coded Coopertion for Multi-unicst with Non-Idel

More information

BP-P2P: Belief Propagation-Based Trust and Reputation Management for P2P Networks

BP-P2P: Belief Propagation-Based Trust and Reputation Management for P2P Networks BP-PP: Belief Propgtion-Bsed Trust nd Reputtion Mngement for PP Networs Ermn Aydy School of Electricl nd Comp. Eng. Georgi Institute of Technology Atlnt, GA 333, USA Emil: eydy@gtech.edu Frmrz Feri School

More information

Redundancy Data Elimination Scheme Based on Stitching Technique in Image Senor Networks

Redundancy Data Elimination Scheme Based on Stitching Technique in Image Senor Networks Sensors & Trnsducers 204 by IFSA Publishing, S. L. http://www.sensorsportl.com Redundncy Dt Elimintion Scheme Bsed on Stitching Technique in Imge Senor Networks hunling Tng hongqing Technology nd Business

More information

CSI-SF: Estimating Wireless Channel State Using CSI Sampling & Fusion

CSI-SF: Estimating Wireless Channel State Using CSI Sampling & Fusion CSI-SF: Estimting Wireless Chnnel Stte Using CSI Smpling & Fusion Riccrdo Crepldi, Jeongkeun Lee, Rul Etkin, Sung-Ju Lee, Robin Krvets University of Illinois t Urbn-Chmpign Hewlett-Pckrd Lbortories Emil:{rcrepl,rhk}@illinoisedu,

More information

Distributed two-hop proportional fair resource allocation in Long Term Evolution Advanced networks

Distributed two-hop proportional fair resource allocation in Long Term Evolution Advanced networks WIRELESS COMMUNICATIONS AND MOBILE COMPUTING Wirel. Commun. Mob. Comput. 2016; 16:264 278 Published online 12 August 2014 in Wiley Online Librry (wileyonlinelibrry.com)..2517 RESEARCH ARTICLE Distributed

More information

Genetic Representations for Evolutionary Minimization of Network Coding Resources

Genetic Representations for Evolutionary Minimization of Network Coding Resources Genetic Representtions for Evolutionry Minimiztion of Network Coding Resources Minkyu Kim 1, Vrun Aggrwl 2, Un-My O Reilly 2, Muriel Médrd 1, nd Wonsik Kim 1 1 Lortory for Informtion nd Decision Systems

More information

Section 16.3 Double Integrals over General Regions

Section 16.3 Double Integrals over General Regions Section 6.3 Double Integrls over Generl egions Not ever region is rectngle In the lst two sections we considered the problem of integrting function of two vribles over rectngle. This sitution however is

More information

A Development of Earthing-Resistance-Estimation Instrument

A Development of Earthing-Resistance-Estimation Instrument A Development of Erthing-Resistnce-Estimtion Instrument HITOSHI KIJIMA Abstrct: - Whenever erth construction work is done, the implnted number nd depth of electrodes hve to be estimted in order to obtin

More information

Prioritized Wireless Transmissions Using Random Linear Codes

Prioritized Wireless Transmissions Using Random Linear Codes Prioritized Wireless Transmissions Using Random Linear Codes Tuan Tran and Thinh Nguyen School of EECS, Oregon State University Corvallis, OR 97331, USA trantu, thinhq}@eecs.oregonstate.edu Abstract We

More information

CS 135: Computer Architecture I. Boolean Algebra. Basic Logic Gates

CS 135: Computer Architecture I. Boolean Algebra. Basic Logic Gates Bsic Logic Gtes : Computer Architecture I Boolen Algebr Instructor: Prof. Bhgi Nrhri Dept. of Computer Science Course URL: www.ses.gwu.edu/~bhgiweb/cs35/ Digitl Logic Circuits We sw how we cn build the

More information

Dataflow Language Model. DataFlow Models. Applications of Dataflow. Dataflow Languages. Kahn process networks. A Kahn Process (1)

Dataflow Language Model. DataFlow Models. Applications of Dataflow. Dataflow Languages. Kahn process networks. A Kahn Process (1) The slides contin revisited mterils from: Peter Mrwedel, TU Dortmund Lothr Thiele, ETH Zurich Frnk Vhid, University of liforni, Riverside Dtflow Lnguge Model Drsticlly different wy of looking t computtion:

More information

BP-P2P: Belief Propagation-Based Trust and Reputation Management for P2P Networks

BP-P2P: Belief Propagation-Based Trust and Reputation Management for P2P Networks 1 9th Annul IEEE Communictions Society Conference on Sensor, Mesh nd Ad Hoc Communictions nd Networs (SECON) BP-PP: Belief Propgtion-Bsed Trust nd Reputtion Mngement for PP Networs Ermn Aydy School of

More information

INSTITUTE OF AERONAUTICAL ENGINEERING (Autonomous) Dundigal, Hyderabad

INSTITUTE OF AERONAUTICAL ENGINEERING (Autonomous) Dundigal, Hyderabad Hll Ticket No Question Pper Code: AEC009 INSTITUTE OF AERONAUTICAL ENGINEERING (Autonomous) Dundigl, Hyderd - 500 043 MODEL QUESTION PAPER Four Yer B.Tech V Semester End Exmintions, Novemer - 2018 Regultions:

More information

DESIGN OF CONTINUOUS LAG COMPENSATORS

DESIGN OF CONTINUOUS LAG COMPENSATORS DESIGN OF CONTINUOUS LAG COMPENSATORS J. Pulusová, L. Körösi, M. Dúbrvská Institute of Robotics nd Cybernetics, Slovk University of Technology, Fculty of Electricl Engineering nd Informtion Technology

More information

9.4. ; 65. A family of curves has polar equations. ; 66. The astronomer Giovanni Cassini ( ) studied the family of curves with polar equations

9.4. ; 65. A family of curves has polar equations. ; 66. The astronomer Giovanni Cassini ( ) studied the family of curves with polar equations 54 CHAPTER 9 PARAMETRIC EQUATINS AND PLAR CRDINATES 49. r, 5. r sin 3, 5 54 Find the points on the given curve where the tngent line is horizontl or verticl. 5. r 3 cos 5. r e 53. r cos 54. r sin 55. Show

More information

Spiral Tilings with C-curves

Spiral Tilings with C-curves Spirl Tilings with -curves Using ombintorics to Augment Trdition hris K. Plmer 19 North Albny Avenue hicgo, Illinois, 0 chris@shdowfolds.com www.shdowfolds.com Abstrct Spirl tilings used by rtisns through

More information

Polar Coordinates. July 30, 2014

Polar Coordinates. July 30, 2014 Polr Coordintes July 3, 4 Sometimes it is more helpful to look t point in the xy-plne not in terms of how fr it is horizontlly nd verticlly (this would men looking t the Crtesin, or rectngulr, coordintes

More information

A Novel Back EMF Zero Crossing Detection of Brushless DC Motor Based on PWM

A Novel Back EMF Zero Crossing Detection of Brushless DC Motor Based on PWM A ovel Bck EMF Zero Crossing Detection of Brushless DC Motor Bsed on PWM Zhu Bo-peng Wei Hi-feng School of Electricl nd Informtion, Jingsu niversity of Science nd Technology, Zhenjing 1003 Chin) Abstrct:

More information

Network Sharing and its Energy Benefits: a Study of European Mobile Network Operators

Network Sharing and its Energy Benefits: a Study of European Mobile Network Operators Network Shring nd its Energy Benefits: Study of Europen Mobile Network Opertors Mrco Ajmone Mrsn Electronics nd Telecommunictions Dept Politecnico di Torino, nd Institute IMDEA Networks, mrco.jmone@polito.it

More information

Jamming-Resistant Collaborative Broadcast In Wireless Networks, Part II: Multihop Networks

Jamming-Resistant Collaborative Broadcast In Wireless Networks, Part II: Multihop Networks Jmming-Resistnt ollbortive Brodcst In Wireless Networks, Prt II: Multihop Networks Ling Xio Ximen University, hin 361005 Emil: lxio@xmu.edu.cn Huiyu Di N Stte University, Rleigh, N 27695 Emil: huiyu di@ncsu.edu

More information

Compared to generators DC MOTORS. Back e.m.f. Back e.m.f. Example. Example. The construction of a d.c. motor is the same as a d.c. generator.

Compared to generators DC MOTORS. Back e.m.f. Back e.m.f. Example. Example. The construction of a d.c. motor is the same as a d.c. generator. Compred to genertors DC MOTORS Prepred by Engr. JP Timol Reference: Electricl nd Electronic Principles nd Technology The construction of d.c. motor is the sme s d.c. genertor. the generted e.m.f. is less

More information

A Stochastic Geometry Approach to the Modeling of DSRC for Vehicular Safety Communication

A Stochastic Geometry Approach to the Modeling of DSRC for Vehicular Safety Communication A Stochstic Geometry Approch to the Modeling of DSRC for Vehiculr Sfety Communiction Zhen Tong, Student Member, IEEE, Hongsheng Lu 2, Mrtin Henggi, Fellow, IEEE, nd Christin Poellbuer 2, Senior Member,

More information

Understanding Basic Analog Ideal Op Amps

Understanding Basic Analog Ideal Op Amps Appliction Report SLAA068A - April 2000 Understnding Bsic Anlog Idel Op Amps Ron Mncini Mixed Signl Products ABSTRACT This ppliction report develops the equtions for the idel opertionl mplifier (op mp).

More information

Design and Modeling of Substrate Integrated Waveguide based Antenna to Study the Effect of Different Dielectric Materials

Design and Modeling of Substrate Integrated Waveguide based Antenna to Study the Effect of Different Dielectric Materials Design nd Modeling of Substrte Integrted Wveguide bsed Antenn to Study the Effect of Different Dielectric Mterils Jgmeet Kour 1, Gurpdm Singh 1, Sndeep Ary 2 1Deprtment of Electronics nd Communiction Engineering,

More information

Address for Correspondence

Address for Correspondence Mrndn et l., Interntionl Journl of Advnced Engineering Technology E-ISSN 0976-3945 Reserch Pper A LATTICE REDUCTION-AIDED INFORMATION PRECODER FOR MULTIUSER COMMUNICATION SYSTEM S. Mrndn, N. Venteswrn

More information

Application of Wavelet De-noising in Vibration Torque Measurement

Application of Wavelet De-noising in Vibration Torque Measurement IJCSI Interntionl Journl of Computer Science Issues, Vol. 9, Issue 5, No 3, September 01 www.ijcsi.org 9 Appliction of Wvelet De-noising in Vibrtion orque Mesurement Ho Zho 1 1 Jixing University, Jixing,

More information

CHARACTERISTICS OF THE GPS SIGNAL SCINTILLATIONS DURING IONOSPHERIC IRREGULARITIES AND THEIR EFFECTS OVER THE GPS SYSTEM

CHARACTERISTICS OF THE GPS SIGNAL SCINTILLATIONS DURING IONOSPHERIC IRREGULARITIES AND THEIR EFFECTS OVER THE GPS SYSTEM CHRCTERISTICS OF THE GPS SIGNL SCINTILLTIONS DURING IONOSPHERIC IRREGULRITIES ND THEIR EFFECTS OVER THE GPS SYSTEM Eurico R. de Paula, I.J.Kantor, L.F.C. de Rezende ERONOMY DIVISION NTIONL INSTITUTE FOR

More information

EE Controls Lab #2: Implementing State-Transition Logic on a PLC

EE Controls Lab #2: Implementing State-Transition Logic on a PLC Objective: EE 44 - Controls Lb #2: Implementing Stte-rnsition Logic on PLC ssuming tht speed is not of essence, PLC's cn be used to implement stte trnsition logic. he dvntge of using PLC over using hrdwre

More information

4110 IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, VOL. 66, NO. 5, MAY 2017

4110 IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, VOL. 66, NO. 5, MAY 2017 40 IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, VOL. 66, NO. 5, MAY 07 Trnsmit Power Control for DD-Underlid Cellulr Networs Bsed on Sttisticl Fetures Peng Sun, Kng G. Shin, Life Fellow, IEEE, Hilin Zhng,

More information

Topic 20: Huffman Coding

Topic 20: Huffman Coding Topic 0: Huffmn Coding The uthor should gze t Noh, nd... lern, s they did in the Ark, to crowd gret del of mtter into very smll compss. Sydney Smith, dinburgh Review Agend ncoding Compression Huffmn Coding

More information

Postprint. This is the accepted version of a paper presented at IEEE PES General Meeting.

Postprint.   This is the accepted version of a paper presented at IEEE PES General Meeting. http://www.div-portl.org Postprint This is the ccepted version of pper presented t IEEE PES Generl Meeting. Cittion for the originl published pper: Mhmood, F., Hooshyr, H., Vnfretti, L. (217) Sensitivity

More information

On the Prediction of EPON Traffic Using Polynomial Fitting in Optical Network Units

On the Prediction of EPON Traffic Using Polynomial Fitting in Optical Network Units On the Prediction of EP Trffic Using Polynomil Fitting in Opticl Networ Units I. Mmounis (1),(3), K. Yinnopoulos (2), G. Ppdimitriou (4), E. Vrvrigos (1),(3) (1) Computer Technology Institute nd Press

More information

A Simple Approach to Control the Time-constant of Microwave Integrators

A Simple Approach to Control the Time-constant of Microwave Integrators 5 VOL., NO.3, MA, A Simple Approch to Control the Time-constnt of Microwve Integrtors Dhrmendr K. Updhyy* nd Rkesh K. Singh NSIT, Division of Electronics & Communiction Engineering New Delhi-78, In Tel:

More information

University of North Carolina-Charlotte Department of Electrical and Computer Engineering ECGR 4143/5195 Electrical Machinery Fall 2009

University of North Carolina-Charlotte Department of Electrical and Computer Engineering ECGR 4143/5195 Electrical Machinery Fall 2009 Problem 1: Using DC Mchine University o North Crolin-Chrlotte Deprtment o Electricl nd Computer Engineering ECGR 4143/5195 Electricl Mchinery Fll 2009 Problem Set 4 Due: Thursdy October 8 Suggested Reding:

More information

Soft-decision Viterbi Decoding with Diversity Combining. T.Sakai, K.Kobayashi, S.Kubota, M.Morikura, S.Kato

Soft-decision Viterbi Decoding with Diversity Combining. T.Sakai, K.Kobayashi, S.Kubota, M.Morikura, S.Kato Softdecision Viterbi Decoding with Diversity Combining T.Ski, K.Kobyshi, S.Kubot, M.Morikur, S.Kto NTT Rdio Communiction Systems Lbortories 2356 Tke, Yokosukshi, Kngw, 2383 Jpn ABSTRACT Diversity combining

More information

Lab 8. Speed Control of a D.C. motor. The Motor Drive

Lab 8. Speed Control of a D.C. motor. The Motor Drive Lb 8. Speed Control of D.C. motor The Motor Drive Motor Speed Control Project 1. Generte PWM wveform 2. Amplify the wveform to drive the motor 3. Mesure motor speed 4. Mesure motor prmeters 5. Control

More information

Distance dependent Call Blocking Probability, and Area Erlang Efficiency of Cellular Networks

Distance dependent Call Blocking Probability, and Area Erlang Efficiency of Cellular Networks Distnce dependent Cll Blocking Probbility, nd Are Erlng Efficiency of Cellulr Networks Subhendu Btbyl 1, Suvr Sekhr Ds 1,2 1 G.S.Snyl School of Telecommuniction, Indin Institute of Technology Khrgpur,

More information

LECTURE 9: QUADRATIC RESIDUES AND THE LAW OF QUADRATIC RECIPROCITY

LECTURE 9: QUADRATIC RESIDUES AND THE LAW OF QUADRATIC RECIPROCITY LECTURE 9: QUADRATIC RESIDUES AND THE LAW OF QUADRATIC RECIPROCITY 1. Bsic roerties of qudrtic residues We now investigte residues with secil roerties of lgebric tye. Definition 1.1. (i) When (, m) 1 nd

More information

Eliminating Non-Determinism During Test of High-Speed Source Synchronous Differential Buses

Eliminating Non-Determinism During Test of High-Speed Source Synchronous Differential Buses Eliminting Non-Determinism During of High-Speed Source Synchronous Differentil Buses Abstrct The t-speed functionl testing of deep sub-micron devices equipped with high-speed I/O ports nd the synchronous

More information

Adaptive VoIP Smoothing of Pareto Traffic Based on Optimal E-Model Quality

Adaptive VoIP Smoothing of Pareto Traffic Based on Optimal E-Model Quality Adptive VoIP Smoothing of Preto Trffic Bsed on Optiml E-Model Qulity Shyh-Fng Hung 1, Eric Hsio-Kung Wu 2, nd Po-Chi Chng 3 1 Deprtment of Electricl Engineering, Ntionl Centrl University, Tiwn hsf@vplb.ee.ncu.edu.tw

More information

CS2204 DIGITAL LOGIC & STATE MACHINE DESIGN fall 2008

CS2204 DIGITAL LOGIC & STATE MACHINE DESIGN fall 2008 CS224 DIGITAL LOGIC & STATE MACHINE DESIGN fll 28 STAND ALONE XILINX PROJECT 2-TO- MULTIPLEXER. Gols : Lern how to develop stnd lone 2-to- multiplexer () Xilinx project during which the following re introduced

More information

& Y Connected resistors, Light emitting diode.

& Y Connected resistors, Light emitting diode. & Y Connected resistors, Light emitting diode. Experiment # 02 Ojectives: To get some hndson experience with the physicl instruments. To investigte the equivlent resistors, nd Y connected resistors, nd

More information

CDMA One. International summer students courses: "Plugged In: Modern Networks and Services in Telecommunication"

CDMA One. International summer students courses: Plugged In: Modern Networks and Services in Telecommunication INTRAROM S.A. ROMANIAN TELECOMMUNICATIONS AND ELECTRONICS INDUSTRY ROMANIA, Buchrest, 17 Fbric de Glucoz St., Sector 2 Cod 72322, Tel:(+40 1) 2040600 Fx:(+40 1) 2040611 http://www.intrrom.ro Interntionl

More information

Exponential-Hyperbolic Model for Actual Operating Conditions of Three Phase Arc Furnaces

Exponential-Hyperbolic Model for Actual Operating Conditions of Three Phase Arc Furnaces Americn Journl of Applied Sciences 6 (8): 1539-1547, 2009 ISSN 1546-9239 2009 Science Publictions Exponentil-Hyperbolic Model for Actul Operting Conditions of Three Phse Arc Furnces 1 Mhdi Bnejd, 2 Rhmt-Allh

More information

10.4 AREAS AND LENGTHS IN POLAR COORDINATES

10.4 AREAS AND LENGTHS IN POLAR COORDINATES 65 CHAPTER PARAMETRIC EQUATINS AND PLAR CRDINATES.4 AREAS AND LENGTHS IN PLAR CRDINATES In this section we develop the formul for the re of region whose oundry is given y polr eqution. We need to use the

More information

Three-Phase Synchronous Machines The synchronous machine can be used to operate as: 1. Synchronous motors 2. Synchronous generators (Alternator)

Three-Phase Synchronous Machines The synchronous machine can be used to operate as: 1. Synchronous motors 2. Synchronous generators (Alternator) Three-Phse Synchronous Mchines The synchronous mchine cn be used to operte s: 1. Synchronous motors 2. Synchronous genertors (Alterntor) Synchronous genertor is lso referred to s lterntor since it genertes

More information

Modeling of Conduction and Switching Losses in Three-Phase Asymmetric Multi-Level Cascaded Inverter

Modeling of Conduction and Switching Losses in Three-Phase Asymmetric Multi-Level Cascaded Inverter Proceedings of the 5th WEA nt. onf. on Power ystems nd Electromgnetic omptibility, orfu, Greece, August 23-25, 2005 (pp176-181) Modeling of onduction nd witching Losses in Three-Phse Asymmetric Multi-Level

More information

A Channel Splitting Technique for Reducing Handoff Delay in Wireless Networks

A Channel Splitting Technique for Reducing Handoff Delay in Wireless Networks Interntionl Journl o Engineering Reserch & Technology (IJERT) A Chnnel Splitting Technique or Reducing Hndo ely in Wireless Networks Jeykumr. J #1, Venktesh. * 2, Vigneswri. G* 3, Nivethith. V *4 # 1 PG

More information

Throughput of Wireless Relay Networks with Interference Processing

Throughput of Wireless Relay Networks with Interference Processing NCC 2009, Jnury 16-18, IIT Guwhti 170 Throughput of Wireless Rely Networks with Interference Processing M. Bm, rikrishn Bhshym nd Andrew Thngrj, eprtment of Electricl Engineering, Indin Institute of Technology,

More information

Kirchhoff s Rules. Kirchhoff s Laws. Kirchhoff s Rules. Kirchhoff s Laws. Practice. Understanding SPH4UW. Kirchhoff s Voltage Rule (KVR):

Kirchhoff s Rules. Kirchhoff s Laws. Kirchhoff s Rules. Kirchhoff s Laws. Practice. Understanding SPH4UW. Kirchhoff s Voltage Rule (KVR): SPH4UW Kirchhoff s ules Kirchhoff s oltge ule (K): Sum of voltge drops round loop is zero. Kirchhoff s Lws Kirchhoff s Current ule (KC): Current going in equls current coming out. Kirchhoff s ules etween

More information

RSS based Localization of Sensor Nodes by Learning Movement Model

RSS based Localization of Sensor Nodes by Learning Movement Model RSS bsed Locliztion of Sensor Nodes by Lerning Movement Model 1 R.ARTHI, 2 P.DEVARAJ, 1 K.MURUGAN 1 Rmnujn Computing Centre, Ann University, Guindy, Chenni, Indi 2 Deprtment of Mthemtics, College of Engineering,

More information

High Speed On-Chip Interconnects: Trade offs in Passive Termination

High Speed On-Chip Interconnects: Trade offs in Passive Termination High Speed On-Chip Interconnects: Trde offs in Pssive Termintion Rj Prihr University of Rochester, NY, USA prihr@ece.rochester.edu Abstrct In this pper, severl pssive termintion schemes for high speed

More information

This is a repository copy of Effect of power state on absorption cross section of personal computer components.

This is a repository copy of Effect of power state on absorption cross section of personal computer components. This is repository copy of Effect of power stte on bsorption cross section of personl computer components. White Rose Reserch Online URL for this pper: http://eprints.whiterose.c.uk/10547/ Version: Accepted

More information

g Lehrstuhl für KommunikationsTechnik, Lehrst

g Lehrstuhl für KommunikationsTechnik,  Lehrst g Lehrstuhl für Kommunitions, www.kommunitions.org Lehrst R&D@KT Kommunitions Univ.-Prof. Dr.-Ing. hbil. Peter Jung Dr.-Ing. Guido H. Bruc Lehrstuhl für Kommunitions Universität Duisburg-Essen, 47048 Duisburg,

More information

Section 17.2: Line Integrals. 1 Objectives. 2 Assignments. 3 Maple Commands. 1. Compute line integrals in IR 2 and IR Read Section 17.

Section 17.2: Line Integrals. 1 Objectives. 2 Assignments. 3 Maple Commands. 1. Compute line integrals in IR 2 and IR Read Section 17. Section 7.: Line Integrls Objectives. ompute line integrls in IR nd IR 3. Assignments. Red Section 7.. Problems:,5,9,,3,7,,4 3. hllenge: 6,3,37 4. Red Section 7.3 3 Mple ommnds Mple cn ctully evlute line

More information

Improving synchronized transfers in public transit networks using real-time tactics

Improving synchronized transfers in public transit networks using real-time tactics Improving synchronized trnsfers in public trnsit networks using rel-time tctics Zhongjun Wu 1,2,3, Grhm Currie 3, Wei Wng 1,2 1 Jingsu Key Lbortory of Urbn ITS, Si Pi Lou 2#, Nnjing, 210096, Chin 2 School

More information

CHAPTER 3 AMPLIFIER DESIGN TECHNIQUES

CHAPTER 3 AMPLIFIER DESIGN TECHNIQUES CHAPTER 3 AMPLIFIER DEIGN TECHNIQUE 3.0 Introduction olid-stte microwve mplifiers ply n importnt role in communiction where it hs different pplictions, including low noise, high gin, nd high power mplifiers.

More information

(1) Non-linear system

(1) Non-linear system Liner vs. non-liner systems in impednce mesurements I INTRODUCTION Electrochemicl Impednce Spectroscopy (EIS) is n interesting tool devoted to the study of liner systems. However, electrochemicl systems

More information

PB-735 HD DP. Industrial Line. Automatic punch and bind machine for books and calendars

PB-735 HD DP. Industrial Line. Automatic punch and bind machine for books and calendars PB-735 HD DP Automtic punch nd bind mchine for books nd clendrs A further step for the utomtion of double loop binding. A clever nd flexible mchine ble to punch nd bind in line up to 9/16. Using the best

More information

Application Note. Differential Amplifier

Application Note. Differential Amplifier Appliction Note AN367 Differentil Amplifier Author: Dve n Ess Associted Project: Yes Associted Prt Fmily: CY8C9x66, CY8C7x43, CY8C4x3A PSoC Designer ersion: 4. SP3 Abstrct For mny sensing pplictions, desirble

More information

Make Your Math Super Powered

Make Your Math Super Powered Mke Your Mth Super Powered: Use Gmes, Chllenges, nd Puzzles Where s the fun? Lern Mth Workshop model by prticipting in one nd explore fun nocost/low-cost gmes nd puzzles tht you cn esily bring into your

More information

Simultaneous Adversarial Multi-Robot Learning

Simultaneous Adversarial Multi-Robot Learning Simultneous Adversril Multi-Robot Lerning Michel Bowling nd Mnuel Veloso Computer Science Deprtment Crnegie Mellon University Pittsburgh PA, 15213-3891 Abstrct Multi-robot lerning fces ll of the chllenges

More information

Vector Calculus. 1 Line Integrals

Vector Calculus. 1 Line Integrals Vector lculus 1 Line Integrls Mss problem. Find the mss M of very thin wire whose liner density function (the mss per unit length) is known. We model the wire by smooth curve between two points P nd Q

More information