Energy Conserving Routing in Wireless Adhoc Networks


 Irma Pope
 1 years ago
 Views:
Transcription
1 Energy Conservng Routng n Wreless Adhoc Networks JaeHwan Chang and Leandros Tassulas Department of Electrcal and Computer Engneerng & Insttute for Systems Research Unversty of Maryland at College ark College ark, MD Abstract An adhoc network of wreless statc nodes s consdered as t arses n a rapdly deployed, sensor based, montorng system. Informaton s generated n certan nodes and needs to reach a set of desgnated gateway nodes. Each node may adjust ts power wthn a certan range that determnes the set of possble one hop away neghbors. Traffc forwardng through multple hops s employed when the ntended destnaton s not wthn mmedate reach. The nodes have lmted ntal amounts of energy that s consumed n dfferent rates dependng on the power level and the ntended recever. We propose algorthms to select the routes and the correspondng power levels such that the tme untl the batteres of the nodes dranout s maxmzed. The algorthms are local and amenable to dstrbuted mplementaton. When there s a sngle power level, the problem s reduced to a maxmum flow problem wth node capactes and the algorthms converge to the optmal soluton. When there are multple power levels then the achevable lfetme s close to the optmal (that s computed by lnear programmng) most of the tme. It turns out that n order to maxmze the lfetme, the traffc should be routed such that the energy consumpton s balanced among the nodes n proporton to ther energy reserves, nstead of routng to mnmze the absolute consumed power. Keywords energysenstve routng, wreless adhoc networks, sensor networks montorng nodes gateways g.. A multhop wreless adhoc network s depcted where the nodes are randomly dstrbuted and the nformaton generated at the montorng nodes are to be delvered to the gateway nodes. I. C INTRODUCTION ONSIDER a group of wreless statc nodes randomly dstrbuted n a regon as n g., where each node has a lmted battery energy supply used manly for the transmsson of data. Assume that at each node some type of nformaton s generated as t montors the data such as sound or vbraton n ts vcnty usng the sensor, and the nformaton needs to be delvered to a set of gateway nodes. These wreless nodes are assumed to have the capablty of packet forwardng,.e., relayng an ncomng packet to one of ts neghborng nodes, and the transmtted energy level can be adjusted to a level approprate for the recever to be able to receve the data correctly f the recever s wthn the transmsson range. Upon or before a new arrval of nformaton ether generated at the node tself or forwarded from the other nodes, routng decson has to be made so that the node knows whch of ts neghborng nodes to forward ts data to. Note that the routng decson and the transmsson energy level selecton are ntrnscally connected n ths powercontrolled adhoc network snce the power level wll be adjusted dependng on the locaton of the next hop node. An example scenaro for ths type of wreless adhoc network may nclude a wreless sensor network where the sensors gather repared through collaboratve partcpaton n the Advanced Telecommuncatons/Informaton Dstrbuton Research rogram (ATIR) Consortum sponsored by the U.S. Army Research Laboratory under the ederated Laboratory rogram, Cooperatve Agreement DAAL acoustc, magnetc, or sesmc nformaton and send the nformaton to ts gateway node whch has more processng power for further processng of the nformaton or has larger transmsson range for the delvery of the nformaton to a possbly larger network for retreval by a remote user. Most of the prevous works on routng n wreless adhoc networks deal wth the problem of fndng and mantanng correct routes to the destnaton durng moblty and changng topology [], [6], []. In [], [6], the authors presented a smply mplementable algorthm whch guarantees strong connectvty and assumes lmted node range. Shortest path algorthm s used n ths strongly connected backbone network. However, the route may not be the mnmum energy soluton due to possble omsson of the optmal lnks at the tme of the backbone connecton network calculaton. In [], the authors developed a dynamc routng algorthm for establshng and mantanng connectonorented sessons whch uses the dea of predctve reroutng to cope wth the unpredctable topology changes. Some other routng algorthms n moble wreless networks can be found n [5], [2], [9], [4], whch, as the majorty of routng protocols n moble adhoc networks do, use shortestpath routng where the number of hops s the path length. The problem of mnmum energy routng has been addressed before n [], [6], [6], [0], [8], [8], [7], and [7]. The approach n those works was to mnmze the total consumed en
2 ergy to reach the destnaton, whch mnmzes the energy consumed per unt flow or packet. If all the traffc s routed though through the mnmum energy path to the destnaton the nodes n that path wll be dranout of batteres quckly whle other nodes, whch perhaps wll be more power hungry f traffc s forwarded through them, wll reman ntact. Instead of tryng to mnmze the consumed energy, the performance objectve of maxmzng the lfetme of the system[3], whch s equvalent to maxmzng the tme to network partton[8] has been consdered. In [8], the problem of maxmzng the tme to network partton was reported as Ncomplete. In [3] we dentfed the maxmum lfetme problem as a lnear programmng problem. Therefore, t s solvable n polynomal tme. The work n [3] consdered the sngle destnaton verson of the problem, whle here we extend the problem to the multcommodty case, where each commodty has a ts own set of destnatons. In our study the topology of the network s statc and the routng accounts to fndng the traffc splts that balance optmally the energy consumpton. Hence the results are applcable to networks whch are ether statc, lke the sensor networks we mentoned earler, or whose topology changes slowly enough such that there s enough tme for optmally balancng the traffc n the perods between successve topology changes. Ths paper s organzed as follows: In secton II, the problem s formulated. In secton III, we propose a class of flow augmentaton algorthms that use the shortest cost path. In secton IV, we extend the flow redrecton algorthm to cover the multcommodty case. In secton V, random graphs are generated n order to evaluate the performances of these algorthms. nally n secton VI, some concludng remarks are made. II. ROUTING OR THE MAXIMUM SYSTEM LIETIME The wreless adhoc network n consderaton s modeled as a drected graph G(N A) where N s the set of all nodes and A s the set of all drected lnks ( j) where j 2 N. Let S be the set of all nodes that can be reached by node wth a certan power level n ts dynamc range. We assume that lnk ( j) exsts f and only f j 2 S. Let each node have the ntal battery energy E, and let Q (c) be the rate at whch nformaton s generated at node belongng to commodty c 2 C, where C s the set of all commodtes. Assume that the transmsson energy requred for node to transmt an nformaton unt to ts neghborng node j s e j, and the rate at whch nformaton of commodty c s transmtted from node to node j s called the flow j. urther, let Q and q j be the aggregate flows of all commodtes,.e., and Q = X c2c q j = X c2c Q (c) j : We are gven, for each commodty c, a set of orgn nodes O (c) where the nformaton s generated,.e., O (c) = f j Q (c) > 0 2 N g and a set of destnaton nodes D (c) among whch any node can be reached n order for the nformaton transfer of commodty c be consdered done. The lfetme of node under a gven flow q = fq j g s gven by T (q) = E e j j2s c2c : j Now, let us defne the system lfetme under flow q as the length of tme untl the frst battery dranout among all nodes n N, whch s the same as the mnmum lfetme over all nodes,.e., T sys (q) =mn 2N T (q) =mn 2N E ej j2s c2c : q j (c) Our goal s to fnd the flow that maxmzes the system lfetme under the flow conservaton condton. The problem can be wrtten as follows: Maxmze T sys (q) = mn 2N s.t. E ej j2s c2c j j N 8j 2 S 8c 2 C j + Q (c) = 8 k 2 N ; 8c D(c) 2 C: j: 2Sj k2s (6) g.2 llustrates the flow conservaton condton for commodty c at node, and t should be noted that the condton apples to each commodty separately. In the followng we show that the problem s a lnear programmng problem[3]. The problem of maxmzng the system lfetme, gven the nformaton generaton rates Q (c) at the set of orgn nodes O (c) and the set of destnaton nodes D (c) for each commodty c, s equvalent to the followng lnear programmng problem: s.t. j: 2Sj Maxmze T ^q (c) j N 8j 2 S 8c 2 C e j ^ j E 8 2 N c2c ^ j + TQ (c) = ^ k 8 2 8c N;D(c) 2 C (0) j2s k2s where ^ j = T j s the amount of nformaton of commodty c transmtted from node to node j untl tme T.
3 j j Q (c) q (c) k g. 2. The conservaton of flow condton at node for each commodty c requres that the sum of nformaton generaton rate and the total ncomng flow must equal the total outgong flow. The lnear program gven above can be vewed as a varaton of the conventonal maxmum flow problem wth node capactes[5]. If the transmtted power level at each node s fxed regardless of ts next hop node,.e., f there s no power control, k e j = e 8j 2 S () and the problem s equvalent to the maxmum flow problem wth node capactes gven by X X j2s c2c ^ j E =e 8 2 N: (2) When the capacty of a a node s a fxed quantty as n (2) then the problem can be converted to a lnk capacty verson by replacng the node wth two nodes and a lnk havng the same capacty[4], and the maxflowmncut theorem[5] can be used. However, n our problem, unlke the above, the amount of resource (or energy n ths case) whch a unt flow consumes depends on the energy expendture to the next hop node. Therefore, t s not trval to fnd the mncut nodes, and even f they were found the traffc splt at the nodes must also be dentfed. III. LOW AUGMENTATION ALGORITHMS In ths secton, we propose a class of flow augmentaton (A) algorthms whch use the shortest cost path. The general descrpton of the algorthm s gven n the followng. At each teraton, each orgn node o 2 O (c) of commodty c calculates the shortest cost path to ts destnaton nodes n D (c). Then the flow s augmented by an amount of Q (c) on the shortest cost path, where s the augmentaton step sze. After the flow augmentaton, the shortest cost paths are recalculated and the procedures are repeated untl any node 2 N runs out of ts ntal total energy E. As a result of the algorthm, we obtan the flow whch wll be used at each node to properly splt ncomng traffc. Our objectve s to fnd the best lnk cost functon whch wll lead to the maxmzaton of the system lfetme. There are three parameters to consder n calculatng the lnk cost c j for lnk ( j). One s the energy expendture for unt flow transmsson over the lnk, e j, the second s the ntal energy E, and S the thrd s the resdual energy at the transmttng node whch s denoted by E. A good canddate for the flow augmentng path should consume less energy and should avod nodes wth small resdual energy snce we would lke to maxmze the mnmum lfetme of all nodes. In [8], each of these were separately consdered, whch falls short of optmzng the system lfetme. Obvously, both of these can t be optmzed at the same tme, whch means there s a tradeoff between the two. In the begnnng when all the nodes have plenty of energy, the mnmum total consumed energy path s better off, whereas towards the end avodng the small resdual energy node becomes more mportant. Therefore, the lnk cost functon should be such that when the nodes have plenty of resdual energy, the energy expendture term s emphaszed, whle f the resdual energy of a node becomes small the resdual energy term should be more emphaszed. Wth the above n mnd, the lnk cost c j s proposed to be c j = e x j E;x2 E x3 (3) where x, x 2, and x 3 are nonnegatve weghtng factors for each tem. Note that f fx x 2 x 3 g = f0 0 0g then the shortest cost path s the mnmum hop path, and f t s f 0 0g then the shortest cost path s the mnmum transmtted energy path. If x 2 = x 3 then normalzed resdual energy s used, whle f x 3 = 0 then the absolute resdual energy s used. Let s refer to the algorthm as A(x x 2 x 3 ) n the rest of the paper ndcatng the parameters, and the meanngs of the parameters are summarzed n Table I for reference. The path cost s computed by the summaton of the lnk costs on the path, and the algorthm can be mplemented wth any exstng shortest path algorthms ncludng the dstrbuted Bellmanord algorthm[2], whch wll be used n our smulaton. IV. LOW REDIRECTION ALGORITHM In ths secton, we extend the flow redrecton (R) algorthm[3] to the multcommodty case. Ths algorthm s based on the followng observaton. If we have a sngle orgn and a sngle destnaton or f we have multple orgns and destnatons but wthout any constrants on the nformaton generaton rates, then under the optmal flow, the mnmum lfetme of every path from the orgn to the destnaton wth postve flow s the same. Note that the latter case can be converted to a sngle orgn and a sngle destnaton verson by addng a super orgn and a super destnaton connected to the orgns and the destnatons respectvely wth zero energy expendture lnks. The above fact can be shown as follows. Assume that the flow s optmal,.e., mnmum lfetme over all nodes s maxmzed. If we further assume that the mnmum lfetmes of the paths wth postve flow to the destnaton are not all dentcal then there s a set of path(s) wth postve flow whose mnmum lfetme s the shortest. We can always ncrease the mnmum
4 TABLE I THE MEANINGS O THE ARAMETERS IN THE ALGORITHM A. A(x x 2 x 3 ) A(0 0 0) A( 0 0) A( x x) A( 0) Meanng Mnmum hop path Mnmum transmtted energy path Normalzed resdual energy s used Absolute resdual energy s used lfetme of ths set of path(s), whch s also the system lfetme, by redrectng an arbtrarly small amount of flow to the paths whose lfetme s longer than these paths such that the mnmum lfetme of the latter path after the redrecton s stll longer than the system lfetme before the redrecton. Ths contradcts our assumpton that the flow s optmal. In ths algorthm we redrect a porton of each commodty flow at every node n a way that the mnmum lfetme of every path wth postve flow from the node to the destnaton wll ncrease or at least wll stay the same. In the followng, we descrbe the mplementaton of R. Let s use an magnary super destnaton node d ~ (c) where d ~ (c) 2 S d and e d d ~ (c) = 0 for all d 2 D (c). Let the ntal flow be such that from o 2 O (c) to d ~ (c) the mnmum total transmtted energy path s used wth a flow value of Q (c) o. Note that any path to the destnaton can be used as the ntal flow. Each node 2 N ; D (c) redrects ts outgong flow of commodty c by subtractng (c) from the flow of a certan path to d ~ (c) and by addng the same amount to the flow of another path to d ~ (c). It s possble that the flow can be rerouted to a dfferent destnaton node n D (c). The steps to be taken at each node 2 N ; D (c) for each commodty c are as follows:. (Determne the Two aths) Determne the two paths to the destnaton whch are to be nvolved n the redrecton. 2. (Calculate (c) ) Calculate the amount (c) of redrecton. 3. (Redrect the low) roperly ncrement and decrement the flows of the two paths determned above by an amount of (c). The frst step of the algorthm at each node for commodty c, (Determne the Two aths), s descrbed n more detal. The goal of ths step s to dentfy the ascent drecton. We wll need two dfferent path calculatons for each commodty. Let s frst form a subnetwork G (c) (N A(c) ) of G(N A) where A (c) A conssts only of edges wth postve flow,.e., Let (c) A (c) = f( j)jq(c) j > 0 ( j) 2 Ag: (4) be the set of all paths n G (c) ) from node (N A(c) to any of the destnaton nodes n D (c). or a path p 2 (c), defne ts path length L p (q) under flow q as a vector whose elements are the lfetmes of all the nodes n the path before reachng any of ts destnaton nodes D (c). or example, f path p 2 (c) startng from node traverses nodes j j 2 j m before reachng any node n D (c), then L p (q) = [T (q) T j (q) T j2 (q) T j m (q)]. The length of path p, L p (q), s sad to be shorter (longer) than the length of path p 0, L p 0(q), f the smallest element of L p (q) s smaller (larger) than that of L p 0(q). We compare the smallest element frst snce t s the mnmum lfetme of all nodes n the path. In case they are the same, the next smallest elements are compared, and so on. If there are more than one smallest elements wth the same value then each one s compared separately. Usng ths socalled lexcographcal orderng, the shortest length path from any node to the destnaton s defned. We modfy the dstance comparson part of the Bellmanord algorthm [2] to obtan the shortest length paths dstrbutvely. Let s denote the shortest length path n G (c) (N A(c) ) from node to the destnaton node d ~ (c) by sp (c) (). Note that the shortest path, sp (c) (), passes through the node whch has the mnmum lfetme of all downstream nodes of node. The other path calculaton s to fnd the longest length path n G(N A) usng the same path length vector. If two path lengths are the same, choose the one wth less number of elements n the path length vector. The longest length path s the path whose mnmum lfetme s the longest. Let s denote the longest length path n G(N A) from node to the destnaton node d ~ (c) by lp (c) (). Note that the longest length path s the path whch, n some sense, has the largest capacty snce we wll need to assgn more flows to ths path than any other path n order to make the mnmum lfetme of the path to equal the mnmum lfetme of the other paths. Let g denote the next hop node of node from whch path the flow wll be subtracted, and let t denote the next hop node of node to whch path the flow wll be added, where g 2 S, the gver, and t 2 S, the taker, are to be carefully chosen among the neghbors of node. Note that notatons such as g (c) and t (c) could be used, but we use g and t nstead for smplcty snce there s no ambguty. Dependng on whether or not the lfetme of node, T (q), s the mnmum n the shortest length path sp (c) (), two dfferent measures are taken. If T (q) mn[l sp (c) ()(q)] then the lfetme of node s the mnmum over all nodes n the subnetwork consstng of node and all ts downstream nodes, and hence we would lke to ncrease the lfetme of node. Ths can be acheved f we redrect a flow at node to the drecton where the requred transmsson energy per nformaton unt s smaller. In other words, f we choose a flow passng node g we redrect the flow to node t where e t <e g. Ths can be done n many dfferent ways. One such choce wll be to redrect the flow whose energy expendture to the next hop s the maxmum to the drecton of mnmum energy expendture to the next hop,.e., g = argmax j : j2s j >0 e j
5 and t = argmn j : j2s e j : (6) Another possblty for the taker s to choose the longest length path whose path length s the longest among all the next hop nodes that has smaller energy expendture than e g,.e., t = argmax j : j2s ej <eg L lp (c) (j)(q) where MAX denotes the maxmum n the lexcographcal orderng. The gver doesn t have to be the node wth the maxmum energy expendture. In fact we can choose any node wth nonmnmum energy expendture. In our algorthm, all these possbltes are used alternately. On the other hand, f T (q) > mn[l sp (c) ()(q)] then we would lke to ncrease the lfetme of the mnmum lfetme node n the path sp (c) () by redrectng some of the flow to another path snce the lfetme of that node s the mnmum lfetme over all nodes n the subnetwork consstng of node and ts downstream nodes. The gver g s the next hop node of node n the shortest length path sp (c) (), and the taker can be ether the node whose longest length path s the longest,.e., t = argmax j2s L lp (c) (j)(q) or the node wth the mnmum energy expendture whose longest length path s longer than the shortest length path of node,.e., t = argmn j : j2s mn[l lp (c) (j) (q)]>mn[l sp (c) () (q)] e j : In fact, t suffces to fnd any node whose path length of the longest length path s longer than that of the shortest length path of node. In our algorthm, all these possbltes are used alternately. Gven the two nodes g and t, the flow of the path composed of ( g) and sp (c) (g) wll be rerouted to the path composed of ( t) and lp (c) (t). The second step of the algorthm at each node for commodty c, (Calculate (c) ), s descrbed n more detal. The am of ths step s to determne the amount of redrecton that guarantees monotonc nondecrease of the system lfetme. The constrants that (c) should meet are as follows. rst, t should be less than or equal to the flow n the path of gver node,.e., g and (2) jk for each lnk (j k) n the path sp (c) (g). urthermore, none of the lfetmes should become shorter than the currently mnmum lfetme of the subnetwork consstng of node and all ts downstream nodes snce ths wll lead us to the opposte drecton to that of our objectve. If T (q) mn[l sp (c) ()(q)] then none of the lfetmes n the path lp (c) (t) should become shorter than T (q),.e., e jk (c) T j (q) + E j T (22) (q) for each lnk (j k) n the path lp (c) (t). On the other hand f T (q) > mn[l sp (c) ()(q)] then we need to consder two thngs. rst, none of the lfetmes n the path lp (c) (t) should become shorter than the mnmum lfetme of the path sp (c) (),.e., e jk (c) T j (q) + (23) E j mn[l sp (c) ()(q)] for each lnk (j k) n the path lp (c) (t). Second, f e t >e g then the lfetme of node may decrease due to the redrecton, but t should not become shorter than the mnmum lfetme of the path sp (c) (),.e., (e T (q) + t ; e g ) (c) : (24) E mn[l sp (c) ()(q)] nally, the value of (c) should be chosen among the values that meet all the constrants stated above. We could ether use the maxmum (c) that meets all the constrants or just a fracton of t. To avod possble oscllatons and for faster convergence, we choose the half of the maxmum (c) that meets all the constrants except and (2). The thrd step of the algorthm at each node for commodty c, (Redrect the low), s descrbed n more detal. Subtractng (c) from the path sp (c) (g) s smple. We made sure that (c) s less than or equal to what s avalable n each edge n the path n and (2). Addng (c) to the path lp (c) (t) s also smple, but there s a possblty that one or more loops of postve flow value can be formed. These loops should be removed n order to avod unnecessary energy consumpton and to ensure that the path ndeed leads to the destnaton. After addng (c) to the path lp (c) (t), the formaton of one or possbly more loops s checked and the loop(s) are removed lnk by lnk along the path. or nstance, f lnk (j k) n the path lp (c) (t) s checked by calculatng the shortest hop dstance from node k to node j n the subnetwork G (c) (N A(c) ) of G(N A). If the dstance s fnte then at least one loop exsts. Remove the loop flow and then repeat the procedure untl all loops nvolvng the lnk (j k) s removed and then proceed to the next lnk. In the followng t s shown that R can have arbtrarly poor performance. or the performance comparson, let s denote the maxmum system lfetme obtaned usng algorthm X by Tsys X, and the optmum system lfetme by Tsys, opt and the rato between these two values s denoted by R T sys X X = (25) Tsys opt
6 Q =.000 E =.0 Q =.000 E =.0 e 5 = δ / 2 q 5 =0.328 q 2 =0.33 q 3 =0.338 e 5 = δ / 2 q 5 =0.97 q 2 =0.00 q 3 =0.00 e 2 = δ e 3 = 2 δ e 2 = δ e 3 = 2 δ E 5 =.0 q 4 =0.003 q 52 =0.97 e 52 = + 3 δ E 2 =.0 e 23 = + δ e 24 = + 2 δ E 3 =.0 e = 34 e 4 = / δ q 54 =0.328 q 24 =0.33 q 34 =0.338 T =2.96, =, 2, 3, 5 (a) q 23 =0.980 E 5 =.0 q 4 =0.00 e 52 = + 3 δ E 2 =.0 e 23 = + δ e 24 = + 2 δ E 3 =.0 e = 34 e 4 = / δ T =.0, =, 2, 3, 5 (b) e 54 = + 4 δ e 54 = + 4 δ q 34 =0.990 g. 3. An example showng local optmum convergence of R for arbtrary postve constant. The flow values and lfetmes correspond to the case when =0:0 : (a) global optmum wth Tsys opt 2:95; (b) local optmum wth Tsys R :0. whch wll be used throughout the paper as the performance measure. An example showng the convergence to a local optmum s gven n g.3, where a sngle commodty s orgnated from node and s destned for node 4. s an arbtrary constant whle the values of flows and lfetmes n the fgure are for the case when = 0:0. When = 0:0, the optmum s Tsys opt 2:95, but the maxmum system lfetme obtaned by R s Tsys R =:0. We can verfy that R R can be as small as /3 as approaches zero. In the worst case R R can be shown to be arbtrarly small by expandng the network n a smlar fashon. or example, the rato R R reaches /4 f we expand the network n g.3 by addng node 6 wth e 6 = =3, e 65 =+5, and e 64 =+6. V. ERORMANCE COMARISON THROUGH SIMULATION In ths secton, random graphs are generated n order to evaluate the performances of the proposed algorthms. The performances are compared wth that of mnmum transmtted energy (MTE) routng algorthm n order to see how much we gan n terms of the system lfetme compared to the conventonal mnmum transmtted energy routng algorthm. Comparson s also made wth the maxmum resdual energy path (MRE) routng algorthm proposed n [3], where the path length was a vector whose elements were the lnk costs gven by c j =(E ; e j ) ; : (26) The lexcographcal orderng was used n comparson of the two length vectors. The dea was to augment the flow on the path whose mnmum resdual energy after the flow augmentaton wll be the largest. It has been shown n [3] that MTE can perform arbtrarly bad by an example. In the followng example, t s shown that the mnmum hop (MH) routng can perform arbtrarly bad. g.4 (a) shows the optmal soluton and g.4 (b) shows the mnmum hop soluton. The rato between the system lfetme obtaned by MH and the optmal soluton s R MH =. As>0 approaches zero, R MH approaches zero. Note that the example scenaro s possble snce n a wreless envronment, path loss s proportonal to the square of the dstance n free space and n hgher orders n urban area, whch makes multhop transmsson less energy consumng then a sngle hop counterpart n many cases. Let there be 20 nodes randomly dstrbuted n a square of sze 5 by 5. Assume that the transmsson range of each node s lmted by 2.5,.e., j 2 S f and only f d j 2:5, where d j s the dstance between node and node j. The energy expendture per unt nformaton transmsson from node to j s assumed to be gven by e j = :0 0 ;8 f d j 0:025 ( dj (27) f 0:025 <d 2:5 )4 j 2:5: Note that there may be cases where no path s avalable between the orgns and the destnatons, although t s very rare n our settng. We smply dscard these cases to assume the connectvty. Two dfferent scenaros are smulated: ) sngle commodty case where nformaton generated at 5 orgn nodes need to reach any one of two destnaton nodes; ) multcommodty case where each of the 5 orgn nodes has ts own sngle desgnated destnaton node. rst of all, A(x x 2 x 3 ) s smulated to fnd the best parameters x, x 2, and x 3. Let node have ntal energy of E = f s even and E = 2 f s odd. In the sngle commodty case, the orgn nodes are gven by O = f g and assume the nformaton generaton rates are Q = Q 2 = Q 3 = 2 and
7 = /δ E 2 = q e 2 = δ e 23 = δ 2 = q 23 = T = /δ Q = e = 3 E = (a) E = 2 average R A x 0.9 A(,x,0) A(,x,x) A(0,x,0) A(0,x,x) A(x,x,0) A(x,x,x) g. 5. The average performances of A(x x 2 x 3 ). e 2 = δ e 23 = δ T = Q = E = e 3 = q 3 = worst case R A A(,x,0) A(,x,x) A(0,x,0) A(0,x,x) A(x,x,0) A(x,x,x) (b) g. 4. An example showng that MH can have arbtrarly poor performance where >0 s a postve constant : (a) optmum system lfetme Tsysx opt = =; (b) system lfetme obtaned by MH, T MH sys =: x g. 6. The worst case performances of A(x x 2 x 3 ). Q 4 = Q 5 =. The destnaton nodes are D = f9 20g. In the multcommodty case O () = fg and D () = f +5g for = wth Q () =2for = 2 3 and Q () =for =4 5. gs.5 and 6 show the results for sngle commodty case when = 0:0. Multcommodty case results are not shown here snce they were smlar to the sngle commodty case. In all cases, A( x x) was the best n terms of both average and worst case performance. It should be noted that even wth x =, R A( x x) was always over 0.8 of the optmal and about 0.98 of the optmal on the average. A(0 x 0) and A(0 x x) was the worst wth average performance of about 0.2, whch means that by consderng only the resdual energy wthout takng the energy expendture nto account the system lfetme can t be mproved much. It s better than the MH soluton but consderably worse than all the others whch consders the energy expendture term. The results also suggest that we use the normalzed resdual energy nstead of the absolute resdual energy, whch can be more clearly seen n g.6 by comparng A( x x) wth A( x 0). gs. 7 and 8 plot the average and the worst case performance of the best A( x x) for varous values of. We could observe that as got smaller, the performance was better. Note that the worst case of A( 50 50) when =0:00 was The curves weren t monotoncally ncreasng, but we can see that for smaller t s so up to a larger x than the curves of larger. Ths phenomenon can be best explaned as follows. Whle the shortest cost path may ndeed be the optmal drecton for the flow augmentaton, t s only so for a certan amount of flow. As soon as gets larger than ths amount, monotoncty of the convergence breaks. A somewhat smlar behavor, though not exactly dentcal, can be found n many optmzaton methods usng descent drecton [3], where a procedure called lne search s done to guarantee monotonc convergence. Let s compare the performances of the other algorthms. In both sngle commodty and multcommodty case, let each node have ntal energy E = and assume that the nformaton generaton rate at each orgn node o 2 O (c) s Q (c) o = for each commodty. The sngle commodty case results are presented frst. Be
8 average R A Average performance of A(,x,x) λ=0.00 λ=0.005 λ=0.0 TABLE II THE ERORMANCE COMARISON O THE ALGORITHMS IN THE SINGLE COMMODITY CASE. Algorthm X avg R X mn R X rfr X > 0:9g MTE % R % MRE % A( ) % A( 50 50) % x g. 7. The average performance of A( x x) for varous values of. : Orgn : Destnaton MTE T =.36 sys R MTE = 0.22 T = () (3) (4) Worst case performance of A(,x,x) worst case R A λ=0.00 λ=0.005 λ=0.0 (6) T = 5.62 (6)(0) T 5 =220.4 =36.66 T = T 5 =35.65 (2) T 4 =.36 g. 9. An example showng the soluton by MTE for sngle commodty case where nodes through 5 are the orgn nodes, and nodes 9 and 20 are the destnaton nodes where any one of the two nodes need to be reached x g. 8. The worst case performance of A( x x) for varous values of. fore gong nto the statstcs, let s compare the algorthms by an example graph, where orgn nodes are gven by O = f g and destnaton nodes are gven by D = f9 20g. gs.9, 0, and show the solutons of MTE, R, and A( 50 50) wth =0:00, respectvely. The true optmum s Tsys opt =6:3. One can observe that the advantage of our algorthms over MTE les n the fact that the traffc s more spread out. The system lfetme obtaned by A( 50 50) and R were more than four tmes as long as that of MTE n ths example, and both were close to the optmal. The performances of the algorthms are presented n Table II, and n g.2 average and worst cases of the algorthms are compared. Note that = 0:00 was used for MRE and A. or each algorthm a total of 200 randomly generated graphs were smulated. R A( 50 50) was always over 0.99 of the optmal,.e., even n the worst case. A( ) s performance was comparable to MRE s. Whle the average of R MTE was about 0.730, the average system lfetme of R, MRE, and A( x x) for x were above 0.95 of the optmal. R R and R MRE were over 0.9 n about 90 % of the case whle that of MTE was so n only 33 % of the case. The worst case of R MTE, R R and R MRE were 0.837, , and 0.80, respectvely. Although t was shown earler that both MTE and R can perform arbtrarly bad n the worst case, smulaton results were n favor of R. The average gan n the system lfetme obtaned by the proposed algorthms were between 49 % and 55 % compared wth MTE. In the multcommodty case, commodty 2 C where C = f g s assumed to be generated at node and ts destnaton node s node +5 among 20 randomly dstrbuted nodes. gs.3, 4, and 5 show examples of multcommodty case solutons by MTE, R, and A( 50 50) wth =0:00 respectvely, where only the aggregate flows are depcted. In ths example, the optmal system lfetme s Tsys opt =7:8, and the system lfetme obtaned by R and A( 50 50) were more than one and a half tmes as long as that of MTE, where both were close to the optmal. In the multcommodty case, the performances of the algorthms gven n Table III and g.6 showed smlar behavor to the sngle commodty case. = 0:00 was used for MRE and A( 50 50). R A( 50 50) was always over 0.99 of the optmal,.e., ncludng the worst case, and agan A( ) s performance was comparable to MRE s. Whle the average R MTE was , those of R R and R MRE were
9 : Orgn : Destnaton R T = 6.00 sys R R = 0.95 (6) T 6 =29.83 T = (6)(0) T = 6.0 T 0 = 6.0 T 3 =34.35 T = T = T = (3) (4) T 5 = 6.0 = 6.0 T = T 7 =34.36 T 8 =34.37 = 6.00 T 5 =34.34 (2) T = T = () T 7 = g. 0. An example showng the soluton by R for sngle commodty case where nodes through 5 are the orgn nodes, and nodes 9 and 20 are the destnaton nodes where any one of the two nodes need to be reached. : Orgn : Destnaton A T sys = 6.29 R =.00 A T = () T 3 =33.98 (3) (4) T = T 8 =37.7 TABLE III THE ERORMANCE COMARISON O THE ALGORITHMS IN THE MULTICOMMODITY CASE. Algorthm X avg R X mn R X rfr X > 0:9g MTE % R % MRE % A( ) % A( 50 50) % (4) T 4 = 4.7 T 5 = 8.25 T 5 = 4.7 : Orgn : Destnaton MTE T sys = 4.7 R MTE = 0.60 T (0) 2 = 23. (2) = T 0 = T () = (6) T 4 = T 6 = 39.0 T 9 = T 8 = 7.48 (3) T 3 = 5.00 T 9 = 9.5 (6) T = T = T = (6)(0) T = (6) T = = 6.29 T 5 =33.25 g. 3. An example showng the soluton by MTE for multcommodty case where nodes through 5 are the orgn nodes and nodes 6 through 20 are the correspondng destnaton nodes, respectvely. T 6 = 9.60 T = 6.30 T = = 6.29 (2) T 4 = 6.29 g.. An example showng the soluton by A( 50 50) when =0:00 for sngle commodty case where nodes through 5 are the orgn nodes, and nodes 9 and 20 are the destnaton nodes where any one of the two nodes need to be reached. R worst case average MTE R MRE A(,,) A(,50,50) Algorthms g. 2. The comparson of average and worst case performances of all three algorthms are made n the sngle commodty case. and , respectvely. R R and R MRE were over 0.9 n 54 % and 69 % of the case respectvely, whle that of MTE was so n only 25 % of the case. The worst cases of R MTE, R R, and R MRE were 0.220, , and respectvely. Whle the performances of MTE, R, and MRE deterorated compared wth sngle commodty case, the performance of A( 50 50) was stll very close to the optmal. The average gan n the system lfetme obtaned by the proposed algorthms were between 40 % and 62 % compared wth MTE. VI. CONCLUSION In powercontrolled wreless adhoc networks, battery energy at network nodes s a very lmted resource that needs to be utlzed effcently. One of the conventonal routng objectves was to mnmze the total consumed energy n reachng the destnaton. However, the conventonal approach may dran out the batteres of certan paths whch may dsable further nformaton delvery even though there are many nodes wth plenty of energy. Therefore, we formulated the routng problem wth the objectve of maxmzng the system lfetme gven the sets of orgn and destnaton nodes and the nformaton generaton rates at the orgn nodes, and proposed a class of flow augmentaton algorthms and a flow redrecton algorthm whch balance the energy consumpton rates among the nodes n proporton to
10 0 = 4.46 (4) T 4 T 5 T 5 : Orgn : Destnaton R T sys R = 0.89 R T 7 = T 7 T (0) 2 = (2) = T 0 = 37.7 T () T 4 = (6) T = T T = (3) T 3 T 9 T 6 (6) T 3 = T T 8 = 37.7 g. 4. An example showng the soluton by R for multcommodty case where nodes through 5 are the orgn nodes and nodes 6 through 20 are the correspondng destnaton nodes, respectvely. T = (4) T 4 T = T 5 : Orgn : Destnaton A T = 7.79 sys R A =.00 T 7 = 49.9 T 7 T (0) 2 = (2) = T 0 = T () T 4 = 44.4 (6) T 6 = T T 8 = (3) T 3 T 9 T 6 (6) T 3 T T 8 = g. 5. An example showng the soluton by A( 50 50) when =0:00 for multcommodty case where nodes through 5 are the orgn nodes and nodes 6 through 20 are the correspondng destnaton nodes, respectvely. R worst case average MTE R MRE A(,,) A(,50,50) Algorthms g. 6. The comparson of average and worst case performances of all three algorthms are made n the multcommodty case. ther energy reserves. The proposed algorthms are local and amenable to dstrbuted mplementaton and showed close to the optmal performance most of the tme, sgnfcantly mprovng the system lfetme, that s, as much as 60 % on the average over the conventonal mnmum transmtted energy routng. REERENCES [] Denns J. Baker and Anthony Ephremdes, The archtectural organzaton of a moble rado network va a dstrbuted algorthm, IEEE Transactons on Communcatons, vol. COM29, no., pp , Jan. 98. [2] Dmtr Bertsekas and Robert Gallager, Data Networks, rentcehall, Inc., 2nd edton, 987. [3] J.H. Chang and L. Tassulas, Routng for maxmum system lfetme n wreless adhoc networks, n roceedngs of 37th Annual Allerton Conference on Communcaton, Control, and Computng, Montcello, IL, Sept [4] WaKa Chen, Theory of Nets: lows n Networks, Wley, 990. [5] T. Cormen, C. Leserson, and R. Rvest, Introducton to Algorthms, McGrawHll and MIT ress, 990. [6] Anthony Ephremdes, Jeffrey E. Weselther, and Denns J. Baker, A desgn concept for relable moble rado networks wth frequency hoppng sgnalng, roceedngs of the IEEE, vol. 75, no., pp , Jan [7] M. Ettus, System capacty, latency, and power consumpton n multhoprouted SSCDMA wreless networks, n roceedngs of IEEE Rado and Wreless Conference (RAWCON) 98, Colorado Sprngs, CO, Aug. 998, pp [8] R.G. Gallager,.A. Humblet, and.m. Spra, A dstrbuted algorthm for mnmum weght spannng trees, Tech. Rep. LIDS906A, Lab. Inform. Decson Syst., Massachusetts Inst. of Technol., Cambrdge, MA, Oct [9] D. Johnson and D. Maltz, Dynamc source routng n ad hoc wreless networks, Moble Computng, 996. [0] Teresa H. Meng and Volkan Rodoplu, Dstrbuted network protocols for wreless communcaton, n roceedngs of the 998 IEEE Internatonal Symposum on Crcuts and Systems, ISCAS 98, Monterey, CA, June 998, vol. 4, pp [] A. Mchal and A. Ephremdes, A dstrbuted routng algorthm for supportng connectonorented servce n wreless networks wth tmevaryng connectvty, n roceedngs Thrd IEEE Symposum on Computers and Communcatons, ISCC 98, Athens, Greece, June 998, pp [2] S. Murthy and J.J. GarcaLunaAceves, An effcent routng protocol for wreless networks, ACM Moble Networks and Applcatons Journal, Specal Issue on Routng n Moble Communcaton Networks, 996. [3] Stephen G. Nash and Arela Sofer, Lnear and Nonlnear rogrammng, McGrawHll, 996. [4] Vncent D. ark and M. Scott Corson, A hghly dstrbuted routng algorthm for moble wreless networks, n roc. IEEE INOCOM 97, Kobe, Japan, 997. [5] C. erkns and. Bhagwat, Hghly dynamc destnatonsequenced dstance vector routng (DSDV) for moble computers, n ACM SIGCOMM, Oct [6] Volkan Rodoplu and Teresa H. Meng, Mnmum energy moble wreless networks, n roceedngs of the 998 IEEE Internatonal Conference on Communcatons, ICC 98, Atlanta, GA, June 998, vol. 3, pp [7] Tmothy Shepard, Decentralzed channel management n scalable multhop spread spectrum packet rado networks, Tech. Rep. MIT/LCS/TR 670, Massachusetts Insttute of Technology Laboratory for Computer Scence, July 995. [8] S. Sngh, M. Woo, and C.S. Raghavendra, oweraware routng n moble ad hoc networks, n roceedngs of ourth Annual ACM/IEEE Internatonal Conference on Moble Computng and Networkng, Dallas, TX, Oct. 998, pp The vews and conclusons contaned n ths document are those of the authors and should not be nterpreted as representng the offcal polces, ether expressed or mpled, of the Army Research Laboratory or the U.S. Government.
The Greedy Method. Introduction. 0/1 Knapsack Problem
The Greedy Method Introducton We have completed data structures. We now are gong to look at algorthm desgn methods. Often we are lookng at optmzaton problems whose performance s exponental. For an optmzaton
More informationPAS: A Packet Accounting System to Limit the Effects of DoS & DDoS. Debish Fesehaye & Klara Naherstedt University of IllinoisUrbana Champaign
PAS: A Packet Accountng System to Lmt the Effects of DoS & DDoS Debsh Fesehaye & Klara Naherstedt Unversty of IllnosUrbana Champagn DoS and DDoS DDoS attacks are ncreasng threats to our dgtal world. Exstng
More informationAn Alternative Way to Measure Private Equity Performance
An Alternatve Way to Measure Prvate Equty Performance Peter Todd Parlux Investment Technology LLC Summary Internal Rate of Return (IRR) s probably the most common way to measure the performance of prvate
More informationThe Development of Web Log Mining Based on ImproveKMeans Clustering Analysis
The Development of Web Log Mnng Based on ImproveKMeans Clusterng Analyss TngZhong Wang * College of Informaton Technology, Luoyang Normal Unversty, Luoyang, 471022, Chna wangtngzhong2@sna.cn Abstract.
More informationEnergy Efficient Routing in Ad Hoc Disaster Recovery Networks
Energy Effcent Routng n Ad Hoc Dsaster Recovery Networks Gl Zussman and Adran Segall Department of Electrcal Engneerng Technon Israel Insttute of Technology Hafa 32000, Israel {glz@tx, segall@ee}.technon.ac.l
More informationJ. Parallel Distrib. Comput.
J. Parallel Dstrb. Comput. 71 (2011) 62 76 Contents lsts avalable at ScenceDrect J. Parallel Dstrb. Comput. journal homepage: www.elsever.com/locate/jpdc Optmzng server placement n dstrbuted systems n
More informationdenote the location of a node, and suppose node X . This transmission causes a successful reception by node X for any other node
Fnal Report of EE359 Class Proect Throughput and Delay n Wreless Ad Hoc Networs Changhua He changhua@stanford.edu Abstract: Networ throughput and pacet delay are the two most mportant parameters to evaluate
More informationCommunication Networks II Contents
8 / 1  Communcaton Networs II (Görg)  www.comnets.unbremen.de Communcaton Networs II Contents 1 Fundamentals of probablty theory 2 Traffc n communcaton networs 3 Stochastc & Marovan Processes (SP
More informationtaposh_kuet20@yahoo.comcsedchan@cityu.edu.hk rajib_csedept@yahoo.co.uk, alam_shihabul@yahoo.com
G. G. Md. Nawaz Al 1,2, Rajb Chakraborty 2, Md. Shhabul Alam 2 and Edward Chan 1 1 Cty Unversty of Hong Kong, Hong Kong, Chna taposh_kuet20@yahoo.comcsedchan@ctyu.edu.hk 2 Khulna Unversty of Engneerng
More informationAvailabilityBased Path Selection and Network Vulnerability Assessment
AvalabltyBased Path Selecton and Network Vulnerablty Assessment Song Yang, Stojan Trajanovsk and Fernando A. Kupers Delft Unversty of Technology, The Netherlands {S.Yang, S.Trajanovsk, F.A.Kupers}@tudelft.nl
More information1 Approximation Algorithms
CME 305: Dscrete Mathematcs and Algorthms 1 Approxmaton Algorthms In lght of the apparent ntractablty of the problems we beleve not to le n P, t makes sense to pursue deas other than complete solutons
More informationLuby s Alg. for Maximal Independent Sets using Pairwise Independence
Lecture Notes for Randomzed Algorthms Luby s Alg. for Maxmal Independent Sets usng Parwse Independence Last Updated by Erc Vgoda on February, 006 8. Maxmal Independent Sets For a graph G = (V, E), an ndependent
More informationAPPLICATION OF PROBE DATA COLLECTED VIA INFRARED BEACONS TO TRAFFIC MANEGEMENT
APPLICATION OF PROBE DATA COLLECTED VIA INFRARED BEACONS TO TRAFFIC MANEGEMENT Toshhko Oda (1), Kochro Iwaoka (2) (1), (2) Infrastructure Systems Busness Unt, Panasonc System Networks Co., Ltd. Saedocho
More informationFault tolerance in cloud technologies presented as a service
Internatonal Scentfc Conference Computer Scence 2015 Pavel Dzhunev, PhD student Fault tolerance n cloud technologes presented as a servce INTRODUCTION Improvements n technques for vrtualzaton and performance
More informationA 2 MAC: An Adaptive, Anycast MAC Protocol for Wireless Sensor Networks
: An Adaptve, Anycast MAC Protocol for Wreless Sensor Networks HweeXan Tan and Mun Choon Chan Department of Computer Scence, School of Computng, Natonal Unversty of Sngapore {hweexan, chanmc}@comp.nus.edu.sg
More informationRecurrence. 1 Definitions and main statements
Recurrence 1 Defntons and man statements Let X n, n = 0, 1, 2,... be a MC wth the state space S = (1, 2,...), transton probabltes p j = P {X n+1 = j X n = }, and the transton matrx P = (p j ),j S def.
More informationHow Sets of Coherent Probabilities May Serve as Models for Degrees of Incoherence
1 st Internatonal Symposum on Imprecse Probabltes and Ther Applcatons, Ghent, Belgum, 29 June 2 July 1999 How Sets of Coherent Probabltes May Serve as Models for Degrees of Incoherence Mar J. Schervsh
More informationEfficient OnDemand Data Service Delivery to HighSpeed Trains in Cellular/Infostation Integrated Networks
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. XX, NO. XX, MONTH 2XX 1 Effcent OnDemand Data Servce Delvery to HghSpeed Trans n Cellular/Infostaton Integrated Networks Hao Lang, Student Member,
More informationPerformance Analysis of Energy Consumption of Smartphone Running Mobile Hotspot Application
Internatonal Journal of mart Grd and lean Energy Performance Analyss of Energy onsumpton of martphone Runnng Moble Hotspot Applcaton Yun on hung a chool of Electronc Engneerng, oongsl Unversty, 511 angdodong,
More informationbenefit is 2, paid if the policyholder dies within the year, and probability of death within the year is ).
REVIEW OF RISK MANAGEMENT CONCEPTS LOSS DISTRIBUTIONS AND INSURANCE Loss and nsurance: When someone s subject to the rsk of ncurrng a fnancal loss, the loss s generally modeled usng a random varable or
More informationLAMOR: LifetimeAware Multipath Optimized Routing Algorithm for Video Transmission over Ad Hoc Networks
LAMOR: LfetmeAware Multpath Optmzed Routng Algorthm for Vdeo ransmsson over Ad Hoc Networks 1 Lansheng an, Lng Xe, Kngm Ko, Mng Le and Moshe Zukerman Abstract Multpath routng s a key technque to support
More informationOn the Optimal Control of a Cascade of HydroElectric Power Stations
On the Optmal Control of a Cascade of HydroElectrc Power Statons M.C.M. Guedes a, A.F. Rbero a, G.V. Smrnov b and S. Vlela c a Department of Mathematcs, School of Scences, Unversty of Porto, Portugal;
More informationA New Paradigm for Load Balancing in Wireless Mesh Networks
A New Paradgm for Load Balancng n Wreless Mesh Networks Abstract: Obtanng maxmum throughput across a network or a mesh through optmal load balancng s known to be an NPhard problem. Desgnng effcent load
More informationTraffic State Estimation in the Traffic Management Center of Berlin
Traffc State Estmaton n the Traffc Management Center of Berln Authors: Peter Vortsch, PTV AG, Stumpfstrasse, D763 Karlsruhe, Germany phone ++49/72/965/35, emal peter.vortsch@ptv.de Peter Möhl, PTV AG,
More informationMinimal Coding Network With Combinatorial Structure For Instantaneous Recovery From Edge Failures
Mnmal Codng Network Wth Combnatoral Structure For Instantaneous Recovery From Edge Falures Ashly Joseph 1, Mr.M.Sadsh Sendl 2, Dr.S.Karthk 3 1 Fnal Year ME CSE Student Department of Computer Scence Engneerng
More informationResearch Article QoS and Energy Aware Cooperative Routing Protocol for Wildfire Monitoring Wireless Sensor Networks
The Scentfc World Journal Volume 3, Artcle ID 43796, pages http://dx.do.org/.55/3/43796 Research Artcle QoS and Energy Aware Cooperatve Routng Protocol for Wldfre Montorng Wreless Sensor Networks Mohamed
More informationModule 2 LOSSLESS IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur
Module LOSSLESS IMAGE COMPRESSION SYSTEMS Lesson 3 Lossless Compresson: Huffman Codng Instructonal Objectves At the end of ths lesson, the students should be able to:. Defne and measure source entropy..
More informationCalculating the high frequency transmission line parameters of power cables
< ' Calculatng the hgh frequency transmsson lne parameters of power cables Authors: Dr. John Dcknson, Laboratory Servces Manager, N 0 RW E B Communcatons Mr. Peter J. Ncholson, Project Assgnment Manager,
More informationOn Multicontroller Placement Optimization in Software Defined Networking  based WANs
On Multcontroller Placement Optmzaton n Software Defned Networkng  based WANs Eugen Borcoc, Radu Badea, Serban Georgca Obreja, Marus Vochn Unversty POLITEHNICA of Bucharest  UPB Bucharest, Romana eugen.borcoc@elcom.pub.ro,
More informationDEFINING %COMPLETE IN MICROSOFT PROJECT
CelersSystems DEFINING %COMPLETE IN MICROSOFT PROJECT PREPARED BY James E Aksel, PMP, PMISP, MVP For Addtonal Informaton about Earned Value Management Systems and reportng, please contact: CelersSystems,
More information"Research Note" APPLICATION OF CHARGE SIMULATION METHOD TO ELECTRIC FIELD CALCULATION IN THE POWER CABLES *
Iranan Journal of Scence & Technology, Transacton B, Engneerng, ol. 30, No. B6, 789794 rnted n The Islamc Republc of Iran, 006 Shraz Unversty "Research Note" ALICATION OF CHARGE SIMULATION METHOD TO ELECTRIC
More informationSelfMotivated Relay Selection for a Generalized Power Line Monitoring Network
SelfMotvated Relay Selecton for a Generalzed Power Lne Montorng Network Jose Cordova and Xn Wang 1, DongLang Xe 2, Le Zuo 3 1 Department of Electrcal and Computer Engneerng, State Unversty of New York
More informationCalculation of Sampling Weights
Perre Foy Statstcs Canada 4 Calculaton of Samplng Weghts 4.1 OVERVIEW The basc sample desgn used n TIMSS Populatons 1 and 2 was a twostage stratfed cluster desgn. 1 The frst stage conssted of a sample
More informationDynamic Fleet Management for Cybercars
Proceedngs of the IEEE ITSC 2006 2006 IEEE Intellgent Transportaton Systems Conference Toronto, Canada, September 1720, 2006 TC7.5 Dynamc Fleet Management for Cybercars Fenghu. Wang, Mng. Yang, Ruqng.
More informationDynamic Resource Allocation and Power Management in Virtualized Data Centers
Dynamc Resource Allocaton and Power Management n Vrtualzed Data Centers Rahul Urgaonkar, Ulas C. Kozat, Ken Igarash, Mchael J. Neely urgaonka@usc.edu, {kozat, garash}@docomolabsusa.com, mjneely@usc.edu
More informationCooperative Load Balancing in IEEE 802.11 Networks with Cell Breathing
Cooperatve Load Balancng n IEEE 82.11 Networks wth Cell Breathng Eduard Garca Rafael Vdal Josep Paradells Wreless Networks Group  Techncal Unversty of Catalona (UPC) {eduardg, rvdal, teljpa}@entel.upc.edu;
More informationA Novel Adaptive Load Balancing Routing Algorithm in Ad hoc Networks
Journal of Convergence Informaton Technology A Novel Adaptve Load Balancng Routng Algorthm n Ad hoc Networks Zhu Bn, Zeng Xaopng, Xong Xansheng, Chen Qan, Fan Wenyan, We Geng College of Communcaton
More informationSangam  Efficient CellularWiFi CDNP2P Group Framework for File Sharing Service
Sangam  Effcent CellularWF CDNP2P Group Framework for Fle Sharng Servce Anjal Srdhar Unversty of Illnos, UrbanaChampagn Urbana, USA srdhar3@llnos.edu Klara Nahrstedt Unversty of Illnos, UrbanaChampagn
More informationNONCONSTANT SUM REDANDBLACK GAMES WITH BETDEPENDENT WIN PROBABILITY FUNCTION LAURA PONTIGGIA, University of the Sciences in Philadelphia
To appear n Journal o Appled Probablty June 2007 OCOSTAT SUM REDADBLACK GAMES WITH BETDEPEDET WI PROBABILITY FUCTIO LAURA POTIGGIA, Unversty o the Scences n Phladelpha Abstract In ths paper we nvestgate
More informationSurvey on Virtual Machine Placement Techniques in Cloud Computing Environment
Survey on Vrtual Machne Placement Technques n Cloud Computng Envronment Rajeev Kumar Gupta and R. K. Paterya Department of Computer Scence & Engneerng, MANIT, Bhopal, Inda ABSTRACT In tradtonal data center
More informationAn InterestOriented Network Evolution Mechanism for Online Communities
An InterestOrented Network Evoluton Mechansm for Onlne Communtes Cahong Sun and Xaopng Yang School of Informaton, Renmn Unversty of Chna, Bejng 100872, P.R. Chna {chsun,yang}@ruc.edu.cn Abstract. Onlne
More informationEfficient Bandwidth Management in Broadband Wireless Access Systems Using CACbased Dynamic Pricing
Effcent Bandwdth Management n Broadband Wreless Access Systems Usng CACbased Dynamc Prcng Bader AlManthar, Ndal Nasser 2, Najah Abu Al 3, Hossam Hassanen Telecommuncatons Research Laboratory School of
More informationChapter 4 ECONOMIC DISPATCH AND UNIT COMMITMENT
Chapter 4 ECOOMIC DISATCH AD UIT COMMITMET ITRODUCTIO A power system has several power plants. Each power plant has several generatng unts. At any pont of tme, the total load n the system s met by the
More informationFormulating & Solving Integer Problems Chapter 11 289
Formulatng & Solvng Integer Problems Chapter 11 289 The Optonal Stop TSP If we drop the requrement that every stop must be vsted, we then get the optonal stop TSP. Ths mght correspond to a ob sequencng
More informationINVESTIGATION OF VEHICULAR USERS FAIRNESS IN CDMAHDR NETWORKS
21 22 September 2007, BULGARIA 119 Proceedngs of the Internatonal Conference on Informaton Technologes (InfoTech2007) 21 st 22 nd September 2007, Bulgara vol. 2 INVESTIGATION OF VEHICULAR USERS FAIRNESS
More informationEnabling P2P Oneview Multiparty Video Conferencing
Enablng P2P Onevew Multparty Vdeo Conferencng Yongxang Zhao, Yong Lu, Changja Chen, and JanYn Zhang Abstract MultParty Vdeo Conferencng (MPVC) facltates realtme group nteracton between users. Whle P2P
More informationRelay Secrecy in Wireless Networks with Eavesdropper
Relay Secrecy n Wreless Networks wth Eavesdropper Parvathnathan Venktasubramanam, Tng He and Lang Tong School of Electrcal and Computer Engneerng Cornell Unversty, Ithaca, NY 14853 Emal : {pv45, th255,
More informationFeature selection for intrusion detection. Slobodan Petrović NISlab, Gjøvik University College
Feature selecton for ntruson detecton Slobodan Petrovć NISlab, Gjøvk Unversty College Contents The feature selecton problem Intruson detecton Traffc features relevant for IDS The CFS measure The mrmr measure
More informationData Broadcast on a MultiSystem Heterogeneous Overlayed Wireless Network *
JOURNAL OF INFORMATION SCIENCE AND ENGINEERING 24, 819840 (2008) Data Broadcast on a MultSystem Heterogeneous Overlayed Wreless Network * Department of Computer Scence Natonal Chao Tung Unversty Hsnchu,
More informationM3S MULTIMEDIA MOBILITY MANAGEMENT AND LOAD BALANCING IN WIRELESS BROADCAST NETWORKS
M3S MULTIMEDIA MOBILITY MANAGEMENT AND LOAD BALANCING IN WIRELESS BROADCAST NETWORKS Bogdan Cubotaru, GabrelMro Muntean Performance Engneerng Laboratory, RINCE School of Electronc Engneerng Dubln Cty
More informationA hybrid global optimization algorithm based on parallel chaos optimization and outlook algorithm
Avalable onlne www.ocpr.com Journal of Chemcal and Pharmaceutcal Research, 2014, 6(7):18841889 Research Artcle ISSN : 09757384 CODEN(USA) : JCPRC5 A hybrd global optmzaton algorthm based on parallel
More informationMaster s Thesis. Configuring robust virtual wireless sensor networks for Internet of Things inspired by brain functional networks
Master s Thess Ttle Confgurng robust vrtual wreless sensor networks for Internet of Thngs nspred by bran functonal networks Supervsor Professor Masayuk Murata Author Shnya Toyonaga February 10th, 2014
More informationA Secure PasswordAuthenticated Key Agreement Using Smart Cards
A Secure PasswordAuthentcated Key Agreement Usng Smart Cards Ka Chan 1, WenChung Kuo 2 and JnChou Cheng 3 1 Department of Computer and Informaton Scence, R.O.C. Mltary Academy, Kaohsung 83059, Tawan,
More informationA role based access in a hierarchical sensor network architecture to provide multilevel security
1 A role based access n a herarchcal sensor network archtecture to provde multlevel securty Bswajt Panja a Sanjay Kumar Madra b and Bharat Bhargava c a Department of Computer Scenc Morehead State Unversty
More informationA GENERIC HANDOVER DECISION MANAGEMENT FRAMEWORK FOR NEXT GENERATION NETWORKS
A GENERIC HANDOVER DECISION MANAGEMENT FRAMEWORK FOR NEXT GENERATION NETWORKS Shanthy Menezes 1 and S. Venkatesan 2 1 Department of Computer Scence, Unversty of Texas at Dallas, Rchardson, TX, USA 1 shanthy.menezes@student.utdallas.edu
More informationAgile Traffic Merging for Data Center Networks. Qing Yi and Suresh Singh Portland State University, Oregon June 10 th, 2014
Agle Traffc Mergng for Data Center Networks Qng Y and Suresh Sngh Portland State Unversty, Oregon June 10 th, 2014 Agenda Background and motvaton Power optmzaton model Smulated greedy algorthm Traffc mergng
More informationIMPACT ANALYSIS OF A CELLULAR PHONE
4 th ASA & μeta Internatonal Conference IMPACT AALYSIS OF A CELLULAR PHOE We Lu, 2 Hongy L Bejng FEAonlne Engneerng Co.,Ltd. Bejng, Chna ABSTRACT Drop test smulaton plays an mportant role n nvestgatng
More informationRobust Design of Public Storage Warehouses. Yeming (Yale) Gong EMLYON Business School
Robust Desgn of Publc Storage Warehouses Yemng (Yale) Gong EMLYON Busness School Rene de Koster Rotterdam school of management, Erasmus Unversty Abstract We apply robust optmzaton and revenue management
More informationNetworkWide Load Balancing Routing With Performance Guarantees
NetworkWde Load Balancng Routng Wth Performance Guarantees Kartk Gopalan Tzcker Chueh YowJan Ln Florda State Unversty Stony Brook Unversty Telcorda Research kartk@cs.fsu.edu chueh@cs.sunysb.edu yjln@research.telcorda.com
More informationAnalysis of EnergyConserving Access Protocols for Wireless Identification Networks
From the Proceedngs of Internatonal Conference on Telecommuncaton Systems (ITC97), March 223, 1997. 1 Analyss of EnergyConservng Access Protocols for Wreless Identfcaton etworks Imrch Chlamtac a, Chara
More informationAbteilung für Stadt und Regionalentwicklung Department of Urban and Regional Development
Abtelung für Stadt und Regonalentwcklung Department of Urban and Regonal Development Gunther Maer, Alexander Kaufmann The Development of Computer Networks Frst Results from a Mcroeconomc Model SREDscusson
More informationAn Adaptive and Distributed Clustering Scheme for Wireless Sensor Networks
2007 Internatonal Conference on Convergence Informaton Technology An Adaptve and Dstrbuted Clusterng Scheme for Wreless Sensor Networs Xnguo Wang, Xnmng Zhang, Guolang Chen, Shuang Tan Department of Computer
More informationOptimization of network mesh topologies and link capacities for congestion relief
Optmzaton of networ mesh topologes and ln capactes for congeston relef D. de Vllers * J.M. Hattngh School of Computer, Statstcal and Mathematcal Scences Potchefstroom Unversty for CHE * Emal: rwddv@pu.ac.za
More informationSupport Vector Machines
Support Vector Machnes Max Wellng Department of Computer Scence Unversty of Toronto 10 Kng s College Road Toronto, M5S 3G5 Canada wellng@cs.toronto.edu Abstract Ths s a note to explan support vector machnes.
More informationHeuristic Static LoadBalancing Algorithm Applied to CESM
Heurstc Statc LoadBalancng Algorthm Appled to CESM 1 Yur Alexeev, 1 Sher Mckelson, 1 Sven Leyffer, 1 Robert Jacob, 2 Anthony Crag 1 Argonne Natonal Laboratory, 9700 S. Cass Avenue, Argonne, IL 60439,
More informationProject Networks With MixedTime Constraints
Project Networs Wth MxedTme Constrants L Caccetta and B Wattananon Western Australan Centre of Excellence n Industral Optmsaton (WACEIO) Curtn Unversty of Technology GPO Box U1987 Perth Western Australa
More informationWhat is Candidate Sampling
What s Canddate Samplng Say we have a multclass or mult label problem where each tranng example ( x, T ) conssts of a context x a small (mult)set of target classes T out of a large unverse L of possble
More informationAn Efficient Recovery Algorithm for Coverage Hole in WSNs
An Effcent Recover Algorthm for Coverage Hole n WSNs Song Ja 1,*, Wang Balng 1, Peng Xuan 1 School of Informaton an Electrcal Engneerng Harbn Insttute of Technolog at Weha, Shanong, Chna Automatc Test
More informationThe OC Curve of Attribute Acceptance Plans
The OC Curve of Attrbute Acceptance Plans The Operatng Characterstc (OC) curve descrbes the probablty of acceptng a lot as a functon of the lot s qualty. Fgure 1 shows a typcal OC Curve. 10 8 6 4 1 3 4
More information1. Fundamentals of probability theory 2. Emergence of communication traffic 3. Stochastic & Markovian Processes (SP & MP)
6.3 /  Communcaton Networks II (Görg) SS20  www.comnets.unbremen.de Communcaton Networks II Contents. Fundamentals of probablty theory 2. Emergence of communcaton traffc 3. Stochastc & Markovan Processes
More informationANALYZING THE RELATIONSHIPS BETWEEN QUALITY, TIME, AND COST IN PROJECT MANAGEMENT DECISION MAKING
ANALYZING THE RELATIONSHIPS BETWEEN QUALITY, TIME, AND COST IN PROJECT MANAGEMENT DECISION MAKING Matthew J. Lberatore, Department of Management and Operatons, Vllanova Unversty, Vllanova, PA 19085, 6105194390,
More informationTo Fill or not to Fill: The Gas Station Problem
To Fll or not to Fll: The Gas Staton Problem Samr Khuller Azarakhsh Malekan Julán Mestre Abstract In ths paper we study several routng problems that generalze shortest paths and the Travelng Salesman Problem.
More informationMultiSource Video Multicast in PeertoPeer Networks
ultsource Vdeo ultcast n PeertoPeer Networks Francsco de Asís LópezFuentes*, Eckehard Stenbach Technsche Unverstät ünchen Insttute of Communcaton Networks, eda Technology Group 80333 ünchen, Germany
More informationPowerofTwo Policies for Single Warehouse MultiRetailer Inventory Systems with Order Frequency Discounts
Powerofwo Polces for Sngle Warehouse MultRetaler Inventory Systems wth Order Frequency Dscounts José A. Ventura Pennsylvana State Unversty (USA) Yale. Herer echnon Israel Insttute of echnology (Israel)
More informationJ. Parallel Distrib. Comput. Environmentconscious scheduling of HPC applications on distributed Cloudoriented data centers
J. Parallel Dstrb. Comput. 71 (2011) 732 749 Contents lsts avalable at ScenceDrect J. Parallel Dstrb. Comput. ournal homepage: www.elsever.com/locate/pdc Envronmentconscous schedulng of HPC applcatons
More informationAN APPROACH TO WIRELESS SCHEDULING CONSIDERING REVENUE AND USERS SATISFACTION
The Medterranean Journal of Computers and Networks, Vol. 2, No. 1, 2006 57 AN APPROACH TO WIRELESS SCHEDULING CONSIDERING REVENUE AND USERS SATISFACTION L. Bada 1,*, M. Zorz 2 1 Department of Engneerng,
More informationA Lyapunov Optimization Approach to Repeated Stochastic Games
PROC. ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING, OCT. 2013 1 A Lyapunov Optmzaton Approach to Repeated Stochastc Games Mchael J. Neely Unversty of Southern Calforna http://wwwbcf.usc.edu/
More informationWireless InterSession Network Coding  An Approach Using Virtual Multicasts
Wreless InterSesson Network Codng  An Approach Usng Vrtual Multcasts Mchael Hendlmaer,DesmondS.Lun,DanalTraskov,andMurelMédard Insttute for Communcatons Engneerng CCIB RLE Technsche Unverstät München
More informationEffective Network Defense Strategies against Malicious Attacks with Various Defense Mechanisms under Quality of Service Constraints
Effectve Network Defense Strateges aganst Malcous Attacks wth Varous Defense Mechansms under Qualty of Servce Constrants Frank YeongSung Ln Department of Informaton Natonal Tawan Unversty Tape, Tawan,
More informationDelayThroughput Enhancement in Wireless Networks with Multipath Routing and Channel Coding
DelayThroughput Enhancement n Wreless Networs wth Multpath Routng and Channel Codng Kevan Ronas, Student Member, IEEE, AmrHamed MohsenanRad, Member, IEEE, Vncent W.S. Wong, Senor Member, IEEE, Sathsh
More informationABSTRACT. Categories and Subject Descriptors. General Terms. Keywords
On Desgnng IncentveCompatble Routng and Forwardng Protocols n Wreless AdHoc Networks An Integrated Approach Usng Game Theoretcal and Cryptographc Technques Sheng Zhong L (Erran) L Yanbn Grace Lu Yang
More informationAn MILP model for planning of batch plants operating in a campaignmode
An MILP model for plannng of batch plants operatng n a campagnmode Yanna Fumero Insttuto de Desarrollo y Dseño CONICET UTN yfumero@santafeconcet.gov.ar Gabrela Corsano Insttuto de Desarrollo y Dseño
More informationOpen Access A Load Balancing Strategy with Bandwidth Constraint in Cloud Computing. Jing Deng 1,*, Ping Guo 2, Qi Li 3, Haizhu Chen 1
Send Orders for Reprnts to reprnts@benthamscence.ae The Open Cybernetcs & Systemcs Journal, 2014, 8, 115121 115 Open Access A Load Balancng Strategy wth Bandwdth Constrant n Cloud Computng Jng Deng 1,*,
More informationVoIP Playout Buffer Adjustment using Adaptive Estimation of Network Delays
VoIP Playout Buffer Adjustment usng Adaptve Estmaton of Network Delays Mroslaw Narbutt and Lam Murphy* Department of Computer Scence Unversty College Dubln, Belfeld, Dubln, IRELAND Abstract The poor qualty
More information+ + +   This circuit than can be reduced to a planar circuit
MeshCurrent Method The meshcurrent s analog of the nodeoltage method. We sole for a new set of arables, mesh currents, that automatcally satsfy KCLs. As such, meshcurrent method reduces crcut soluton to
More informationReinforcement Learning for Quality of Service in Mobile Ad Hoc Network (MANET)
Renforcement Learnng for Qualty of Servce n Moble Ad Hoc Network (MANET) *T.KUMANAN AND **K.DURAISWAMY *Meenaksh College of Engneerng West K.K Nagar, Cheena78 **Dean/academc,K.S.R College of Technology,Truchengode
More informationP2P/ Gridbased Overlay Architecture to Support VoIP Services in Large Scale IP Networks
PP/ Grdbased Overlay Archtecture to Support VoIP Servces n Large Scale IP Networks We Yu *, Srram Chellappan # and Dong Xuan # * Dept. of Computer Scence, Texas A&M Unversty, U.S.A. {weyu}@cs.tamu.edu
More informationLogistic Regression. Lecture 4: More classifiers and classes. Logistic regression. Adaboost. Optimization. Multiple class classification
Lecture 4: More classfers and classes C4B Machne Learnng Hlary 20 A. Zsserman Logstc regresson Loss functons revsted Adaboost Loss functons revsted Optmzaton Multple class classfcaton Logstc Regresson
More informationCloudbased Social Application Deployment using Local Processing and Global Distribution
Cloudbased Socal Applcaton Deployment usng Local Processng and Global Dstrbuton Zh Wang *, Baochun L, Lfeng Sun *, and Shqang Yang * * Bejng Key Laboratory of Networked Multmeda Department of Computer
More informationMAPP. MERIS level 3 cloud and water vapour products. Issue: 1. Revision: 0. Date: 9.12.1998. Function Name Organisation Signature Date
Ttel: Project: Doc. No.: MERIS level 3 cloud and water vapour products MAPP MAPPATBDClWVL3 Issue: 1 Revson: 0 Date: 9.12.1998 Functon Name Organsaton Sgnature Date Author: Bennartz FUB Preusker FUB Schüller
More informationPSYCHOLOGICAL RESEARCH (PYC 304C) Lecture 12
14 The Chsquared dstrbuton PSYCHOLOGICAL RESEARCH (PYC 304C) Lecture 1 If a normal varable X, havng mean µ and varance σ, s standardsed, the new varable Z has a mean 0 and varance 1. When ths standardsed
More informationA Design Method of Highavailability and Lowopticalloss Optical Aggregation Network Architecture
A Desgn Method of Hghavalablty and Lowoptcalloss Optcal Aggregaton Network Archtecture Takehro Sato, Kuntaka Ashzawa, Kazumasa Tokuhash, Dasuke Ish, Satoru Okamoto and Naoak Yamanaka Dept. of Informaton
More informationOn the Interaction between Load Balancing and Speed Scaling
On the Interacton between Load Balancng and Speed Scalng Ljun Chen and Na L Abstract Speed scalng has been wdely adopted n computer and communcaton systems, n partcular, to reduce energy consumpton. An
More information行 政 院 國 家 科 學 委 員 會 補 助 專 題 研 究 計 畫 成 果 報 告 期 中 進 度 報 告
行 政 院 國 家 科 學 委 員 會 補 助 專 題 研 究 計 畫 成 果 報 告 期 中 進 度 報 告 畫 類 別 : 個 別 型 計 畫 半 導 體 產 業 大 型 廠 房 之 設 施 規 劃 計 畫 編 號 :NSC 962628E009026MY3 執 行 期 間 : 2007 年 8 月 1 日 至 2010 年 7 月 31 日 計 畫 主 持 人 : 巫 木 誠 共 同
More informationLecture 7 March 20, 2002
MIT 8.996: Topc n TCS: Internet Research Problems Sprng 2002 Lecture 7 March 20, 2002 Lecturer: Bran Dean Global Load Balancng Scrbe: John Kogel, Ben Leong In today s lecture, we dscuss global load balancng
More informationSimulation and optimization of supply chains: alternative or complementary approaches?
Smulaton and optmzaton of supply chans: alternatve or complementary approaches? Chrstan Almeder Margaretha Preusser Rchard F. Hartl Orgnally publshed n: OR Spectrum (2009) 31:95 119 DOI 10.1007/s002910070118z
More informationEconomicRobust Transmission Opportunity Auction in Multihop Wireless Networks
EconomcRobust Transmsson Opportunty Aucton n Multhop Wreless Networks Mng L, Pan L, Mao Pan, and Jnyuan Sun Department of Electrcal and Computer Engneerng, Msssspp State Unversty, Msssspp State, MS 39762
More informationLoad Balanced Rendezvous Data Collection in Wireless Sensor Networks
2011 Eghth IEEE Internatonal Conference on Moble AdHoc and ensor ystems Load Balanced endezvous Data Collecton n Wreless ensor Networks Luo Ma 1, Longfe hangguan 1, Chao Lang 1, Junzhao Du 1, Hu Lu 1,
More informationConversion between the vector and raster data structures using Fuzzy Geographical Entities
Converson between the vector and raster data structures usng Fuzzy Geographcal Enttes Cdála Fonte Department of Mathematcs Faculty of Scences and Technology Unversty of Combra, Apartado 38, 3 454 Combra,
More information8.5 UNITARY AND HERMITIAN MATRICES. The conjugate transpose of a complex matrix A, denoted by A*, is given by
6 CHAPTER 8 COMPLEX VECTOR SPACES 5. Fnd the kernel of the lnear transformaton gven n Exercse 5. In Exercses 55 and 56, fnd the mage of v, for the ndcated composton, where and are gven by the followng
More information