Distributed Topology Control of Dynamic Networks
|
|
- Angelina Clark
- 5 years ago
- Views:
Transcription
1 Dstrbuted Topology Control of Dynamc Networks Mchael M. Zavlanos, Alreza Tahbaz-Saleh, Al Jadbabae and George J. Pappas Abstract In ths paper, we present a dstrbuted control framework for controllng the topology of dynamc mult-agent networks. Agents are equpped wth local sensng and wreless communcaton capabltes, however, due to power constrants, they are requred to swtch between two modes of operaton, namely actve and sleep. The control objectve nvestgated n ths paper s to determne dstrbuted coordnaton protocols that regulate swtchng between the operaton modes of every agent such that the overall network guarantees mult-hop communcaton lnks among a subset of so called boundary agents. In the proposed framework, coordnaton s based on a vrtual market where every request to swtch off s assocated wth a bd. Combnatons of requests are verfed wth respect to connectvty and the one correspondng to the hghest aggregate bd s fnally served. Other than nearest neghbor nformaton, our approach assumes no knowledge of the network topology, whle verfcaton of connectvty reles on notons of algebrac graph theory as well as gossp algorthms run over the network. Integraton of the ndvdual controllers results n an asynchronous networked control system for whch we show that t satsfes the connectvty specfcaton almost surely. We fnally llustrate effcency of our scalable approach n nontrval computer smulatons. I. INTRODUCTI Dstrbuted control of networked mult-agent systems has recently receved consderable attenton. Such systems typcally consst of large numbers of nexpensve agents equpped wth ntegrated sensng and wreless communcaton capabltes. Whle the agents prmary task s detecton of certan physcal changes wthn ther proxmty, ther communcaton capabltes enable them to share the ndvdually collected data wth ther peers, n order to acheve a global coordnated objectve. Consequently, connectvty of the underlyng network s a crtcal requrement. In the presence of moble agents or agents that can swtch between actve and sleep operatng modes, mantanng connectvty of the underlyng network becomes a challengng task due to the contnuous changes n the network topology. In the former class of problems belongs [], where a measure of local connectvty of a network s ntroduced that under certan condtons s suffcent for global connectvty as well as [2], where a controllablty framework for state-dependent dynamc graphs s developed. Dstrbuted mantenance of nearest neghbor lnks n formaton stablzaton s addressed n [3], whle n [4] topology control of a moble network Ths work s partally supported by ARO MURI SWARMS Grants W9NF and W9NF as well as DARPA DSO SToMP and NSF ECS Mchael M. Zavlanos, Alreza Tahbaz-Saleh, Al Jadbabae and George J. Pappas are wth the Department of Electrcal and Systems Engneerng, Unversty of Pennsylvana, Phladelpha, PA 94, USA. {zavlanos,atahbaz,jadbaba,pappasg}@seas.upenn.edu s acheved by means of gossp algorthms and marketbased coordnaton. In [5], the authors address the problem of maxmzng the second smallest egenvalue of the graph Laplacan, whle a decentralzed approach to ths problem based on supergradent methods and dstrbuted egenvector computaton s consdered n [6]. Network connectvty for double ntegrator agents s nvestgated n [7], where exstental as well as optmal controller desgn results are dscussed. Equally challengng problems arse when the changes n the network topology are due to power constrants that requre agents to occasonally swtch off. In ths context, duty cyclng of sensor networks s nvestgated n [8]. Smlarly, cone based topology control for ad-hoc sensor networks [9] as well as dstrbuted connectvty control algorthms n the absence of exact locaton nformaton [] are among other varants of the problem nvestgated n the lterature. Inspred by the problems of the latter class, n ths paper, we propose a dstrbuted strategy for topology control of a network of statonary agents, each one capable of swtchng between on and off operaton modes. In partcular, gven a subset of so called boundary agents, we desgn local coordnaton protocols that allow agents to ndvdually swtch on and off, whle mantanng a connected network among the boundary agents. Our approach assumes no knowledge of the network topology, other than nearest neghbor nformaton, whle the proposed coordnaton scheme depends on the operaton status of every agent. In partcular, off agents can only swtch on f by dong so they do not create clusters of actve agents, dsconnected from the man network. On the other hand, every request to swtch off s assocated wth a bd and gossp algorthms run over the network allow agents to verfy combnatons of requests wth respect to the connectvty specfcaton and serve the one correspondng the hghest aggregate bd. Connectvty s captured by the graph Laplacan matrx and can be checked n a dstrbuted way by comparng the asymptotc values of a randomly ntalzed consensus run by all actve agents n the network that do not request to swtch off. Integraton of the ndvdual controllers results n a dstrbuted networked mult-agent system for whch we show that connectvty of the network nvolvng the boundary agents s guaranteed almost surely. The rest of ths paper s organzed as follows. In Secton II we defne the problem of topology control of networked mult-agent systems and develop the necessary graph theoretc background to capture connectvty. In Secton III we develop the proposed dstrbuted coordnaton protocols and dscuss ther propertes. Fnally, nontrval computer smulatons llustratng the effcency of our approach are presented n Secton IV.
2 II. PRELIMINARIES AND PROBLEM FORMULATI Consder a group of N statonary agents wth ntegrated sensng and wreless communcaton capabltes, deployed n a p-dmensonal space R p. Let x R p denote the poston of agent and assume that each agent s subject to energy constrants and as a result, has two modes of operaton, namely (actve) and (sleep). When, agent s capable of communcatng wth other agents located n a dsk of radus r c centered at x. When, all communcaton lnks wth other agents n the network are dsabled. Fnally, we assume a set of so called boundary agents, whch are agents that reman permanently. Such agents would be placed n key locatons where contnuous sensng and communcaton s requred. The setup descrbed so far can be captured usng an undrected dynamc graph G(t) = (V b V(t), E(t)), where V b denotes the fxed set of boundary agents, V(t) denotes the set of agents that are at tme t and E(t) denotes the set of communcaton lnks between all agents n V b V(t) at tme t. Any par of agents and j at tme t such that x x j < r c are called neghbors or adjacent and the assocated communcaton lnk s denoted by (, j) E(t). In partcular, we can defne the set of neghbors of agent at tme t by N (t) = {j V b V(t) (, j) E(t)}. Then, the objectve nvestgated n ths paper can be stated as follows. Problem (Dstrbuted Topology Control): Gven a set of N agents, consstng of boundary and non-boundary ones, determne a dstrbuted control framework that regulates the operaton status of all non-boundary agents such that a communcaton path s mantaned between any two boundary agents at all tmes. The exstence of a communcaton path between any two boundary agents s closely related to the noton of connectvty of the graph G(t). In partcular, we say that G(t) s connected at tme t, f there exsts a path,.e., a sequence of dstnct nodes such that consecutve nodes are adjacent, between any two nodes n G(t). Hence, Problem equvalently mples that we want G(t) to reman connected for al tme. The desred connectvty objectve can be captured usng the algebrac representaton of the dynamc graph G(t). In partcular, the structure of any dynamc graph G(t) can be equvalently represented by a dynamc Laplacan matrx, L(G(t)) = D(G(t)) A(G(t)) where A(G(t)) = (j (t)) denotes the V b V(t) V b V(t) adjacency matrx of the graph G(t), such that (t) = and j (t) = f and only f (, j) E(t), and D(G(t)) = dag ( j V b V(t) j(t) ) denotes ts correspondng degree matrx. 2 The followng lemma relates graph connectvty to the spectral propertes of the Laplacan matrx L(G(t)) []. Clearly, communcaton paths between any two boundary agents may exst even f G(t) conssts of multple connected components that are dsconnected from each other, as long as all boundary agents belong to the same connected component. We wll not deal wth ths case here. Instead we wll requre that G(t) conssts of a sngle connected component. 2 We denote the cardnalty of the set V by V. Lemma 2.: Let L(G) be the Laplacan matrx correspondng to the graph G and let λ (L(G)) λ 2 (L(G))... be ts ordered egenvalues. Then, λ (L(G)) = wth correspondng egenvector,.e., the vector of all entres equal to. Moreover, λ 2 (L(G)) > f and only f G s connected. Lemma 2. mples that the second smallest egenvalue, also called the Fedler egenvalue, of the postve semdefnte Laplacan matrx L(G) s strctly postve, or equvalently, that ker L(G) = span{}. As a result, we have the followng well-known result. Theorem 2.2: Consder a fxed graph G on N nodes assocated wth state varables θ (t) R each, that are updated accordng to the set of lnear dfferental equatons θ(t) = L(G)θ(t), where θ(t) = [ θ (t) θ N (t) ] T. Then the network G s connected f and only f, lm θ(t) = α span{}. () t for all ntal condtons θ() R N. In other words, Theorem 2.2 says that all nodes n G wll eventually reach a consensus on ther state values θ (t), for all ntal condtons, f and only f the graph G s connected. Ths theorem s n fact a specal case of the well-known dstrbuted consensus schemes over graphs dscussed n [2] [6]. In the case that G s dsconnected, let G c = (V c, E c ) denote ts c-th connected component. Then, ker L(G) = span{ Gc G c } where Gc s an N vector wth ts -th entry equal to f V c and equal to, otherwse. Consequently, for random ntalzaton of the states θ(), lm t θ(t) = c α c Gc such that α c R are dfferent for dfferent connected components G c almost surely. Therefore, connectvty of a network G can be verfed almost surely by comparng the asymptotc state values () of all agents, for any random ntalzaton. III. DISTRIBUTED COORDINATI The man objectve n ths secton s to derve a dstrbuted coordnaton mechansm that allows agents to swtch and wthout volatng the desred connectvty specfcaton. Clearly, agents swtchng can, n general, only ncrease connectvty of the network, f by dong so they do not create new connected components. On the other hand, swtchng whle preservng connectvty becomes possble by means of a dstrbuted vrtual market, where agents that are bd n order to swtch. Combnatons of swtchng requests can be consdered smultaneously. Each such request s verfed wth respect to the connectvty specfcaton and among the ones that are safe, those correspondng to the hghest aggregate bds are eventually processed. Other than knowledge of the nearest neghbors of every agent, no further nformaton regardng the topology of the network s requred. Nevertheless, correctness of our approach reles on knowledge of all agents partcpatng n every aucton, whch can be obtaned n a dstrbuted multhop fashon, as well as on some noton of synchronzaton
3 Algorthm Intalzaton Phase for Agent. () =, phase() = ; Requre: Self-Bd b () ; : f I I I then 2: Fnd neghbors N := {j N 3: Exchange status and bds wth neghbors,.e., := max j N {, s [j] b := max j N 4: Fnd agents, I 5: else f I {b, b [j] }; := {j I s I = I then 6: f wat() = then 7: Set wat() := wat() + and repeat steps 2-3; 8: else f wat() = then 9: Set R := 2 : Set I {j I j=argmax(k) l I {b a (l)}} := I\I ; : Swtch to Verfcaton Phase,.e., phase() = 2; 2: end f 3: end f of all agents to the same aucton. Snce, dstrbuted systems, ncludng the one proposed n ths paper, are n general asynchronous, the desred synchronzaton s event-based and s obtaned by labelng every aucton n the set {, 2, 3} and requrng that any nformaton exchange takes place only among neghbors that are n equally labeled auctons. Effectvely, all agents that are are always synchronzed n the sequence of auctons {, 2, 3,, 2, 3,... }. Dependng on the status of an agent, the coordnaton mechansm can be decomposed nto an ntalzaton phase, a verfcaton phase and a decson phase for agents as well as a swtchng phase for agents. A. Intalzaton Phase for Agents As dscussed above, any new aucton {, 2, 3} that s ntalzed requres knowledge of all the agents partcpatng n that aucton. Ths nformaton s encoded n a status vector {, } N such that (j) = f agent j s and (j) = f agent j s. We further defne the sets I and I that consst estmates of the and agents n the network, respectvely. Intally, every agent s aware of ts own operaton status only,.e., I = {} and I =. On the other hand, the operaton status of the whole network s obtaned when I I = I. The ntalzaton phase for every agent, denoted by phase() =, conssts of updatng I, gven an estmate of I. Durng ths process, agent also collects bds b (j) R from all agents j that desre to swtch and forms the set of requests to be verfed wth respect to connectvty. The ntalzaton phase s descrbed n Algorthm. For every agent enterng the ntalzaton phase we requre that () =, (j) = for all j, I = {} as well as a self-bd b a () R, such that b () >, f agent desres to swtch, and b () =, otherwse. Note that b () = for all boundary agents. Whle the operaton status of the whole network has not yet been obtaned (lne, Algorthm ), agent dentfes ts neghbors N (lne 2, Algorthm ) and updates ts status and bds vectors and b, respectvely (lne 3, Algorthm ), as well as the set I (lne 4, Algorthm ). Once the condton I I = I ndcatng full knowledge of the network status s satsfed (lne 5, Algorthm ), one more update of the status and bds vectors s requred for agent to also obtan accurate knowledge of the status and bds of all agents. Ths s due to the requrement that agents can only swtch f they have neghbors, n order to avod clusters of agents that are dsconnected from the man network. Clearly, collectng the status and bds of the new addtons to the network requres no more than one communcaton cycle once the condton I I = I, ndcatng that nformaton from ther neghbors has been receved, s satsfed (lne 7, Algorthm ). To model ths extra communcaton cycle, we ntroduce a dummy varable wat(), ntalzed at and set to once the extra update has been done. The fnal step of the ntalzaton phase conssts of dentfyng the agents assocated wth the k largest bds n b and formng the set of requests R consstng of all 2 k combnatons of these agents (lne 9, Algorthm ). Havng accurate knowledge of the agents I, agent can also update I and then swtch to the verfcaton phase (lnes and 2, Algorthm ). Note that, snce updatng of the status and bds vectors of any agent nvolves nformaton provded by neghbors that are n the same aucton (lne 3, Algorthm ), all agents mplementng Algorthm wll eventually converge to the same values for and b. B. Verfcaton Phase for Agents The verfcaton phase for every request r R conssts of every agent r runnng a consensus update, x (r) := x ( (r) x (r) x [j] (r) ) (2) j N \{r} where x (r) R s a randomly ntalzed scalar, on the reduced network obtaned by assumng that all agents n r are. If the reduced network s not connected, the assocated consensus wll converge to equal values x [j] (r) for all agents j I \{r} wth probablty zero. Ths can be checked n a dstrbuted fashon, by means of a maxmum and mnmum consensus on the solutons of the correspondng consensus (2). For ths, every agent updates varables M a, m R R contanng the current values for all requests for the maxmum and mnmum consensus, respectvely. The verfcaton phase s descrbed n Algorthm 2. Runnng consensus (2) for request r conssts of two stages, namely ntalzaton and updatng of consensus (2) and determnng whether t has converged. Wth each one of these stages and every agent we assocate varables u, c {, } N R, respectvely, such that u (j, r) = (smlarly, c a (j, r) = ) ndcates that agent s aware that agent j has begun updatng (smlarly, has determned convergence) of
4 Algorthm 2 Verfcaton Phase for Agent. () =, phase() = 2; Requre: mn j I,r R c (j, r) = ; : Fnd neghbors N := {j N 2: Exchange nformaton wth neghbors,.e., u := max j N {u, u [j] c := max j N {c, c [j] M a := max j N {M a, M a [j] m := mn j N {m, m [j] }; 3: Fnd set of requests that are not beng updated, R u := {r R u (, r) = }; 4: for all requests r R u do 5: Set u (, r) = ; 6: Randomly ntalze a scalar x a (r); 7: end for 8: Fnd set of requests that are beng updated but have not converged, R u c := {r R u (, r) =, c 9: for all requests r R u c do : f r then : Update x (r) accordng to (2); 2: f {x (r)} and mn j I 3: Set c (, r) :=, 4: end f 5: end f 6: end for (, r) = }; u M (r) := max{x (r), M m (r) := mn{x (r), m (j, r) = then (r) (r)}; consensus (2) for request r. Durng the ntalzaton stage of the verfcaton process, every agent dentfes requests R u that are not beng updated yet (lne 3, Algorthm 2) as well as requests R u c that are beng updated but the correspondng consensus (2) has not yet converged (lne 8, Algorthm 2). For all requests r R u, agent ntalzes consensus (2) by settng u (, r) = and randomly ntalzng a scalar x (r) (lnes 5 and 6, Algorthm 2). On the other hand, for every request r R u c, f agent r, t updates x (r) accordng to consensus (2) (lne 5, Algorthm 2). Determnng whether consensus (2) for request r R u c has converged depends not only on convergence of the sequence {x (r) but also on the condton that all other agents I have ntalzed the correspondng consensus (lne 2, Algorthm 2). In ths way, false convergence alarms due to delays n nformaton propagaton n the network, are avoded. When consensus (2) for a request r R u c has converged, agent sets c (, r) = and performs a maxmum and mnmum update on the varables M a (r) and m (r), respectvely (lne 3, Algorthm 2). The verfcaton phase lasts as long as there exst requests r R for whch agent s awatng a convergence message c (j, r) by agents j I, whch translates to the requrement that Algorthm 3 Decson Phase for Agent. () =, phase() = 2; Requre: mn j I,r R c (j, r) = ; : Reset, b := a old a old N, u a old M a old := 3 R, m a old = (mod 3);, c := a old N R and := 3 R, where a old 2: Fnd safe requests, S := { r R M a (r) m (r) < ɛ } { 3: f S and argmax r S j r b (j) } then 4: Set := and () := ; 5: else 6: Set := + (mod 3); 7: Set () :=, I := {} and phase() := ; 8: Set I := I { { argmax r S j r b (j) }} ; 9: end f mn j I,r R c (j, r) =. Note that, wth every cycle of Algorthm 2, the varables u, c, M, m are locally updated wth nformaton from agent s neghbors N that are n the same aucton (lne 2, Algorthm 2), whch guarantees that eventually all varables converge to the same values for all agents. C. Decson Phase for Agents Once agent has obtaned convergence messages for all requests from all agents,.e., once mn j I,r R c (j, r) =, t enters the decson phase (Algorthm 3). Upon enterng the decson phase both varables M a, m have converged to ther global mnmum and maxmum values, respectvely, over the whole network, whch s due to smultaneous updatng of all c, M a, m (lne 2, Algorthm 2). The decson phase conssts of comparng the values of M a (r) and m (r) for every request r R and decdng safety dependng on whether these values are equal or not. In partcular, every agent dentfes the set of safe requests S (lne 2, Algorthm 3) and wth every request r S, t assocates a cost correspondng to the aggregate bd values j r b (j) of all agents partcpatng n ths request. 3 If requests that are safe wth respect to connectvty exst,.e., f S, then the one assocated wth the hghest cost s fnally served. In other words, f agent belongs to the request wth the hghest cost (lne 3, Algorthm 3) t swtches (lne 4, Algorthm 3). Otherwse, t ntalzes a new aucton (lne 6, Algorthm 3) and updates ts set of agents I by addng the agents n the hghest-cost request that s to be served (lne 8, Algorthm 3). Ths new set of agents I s to be used n the followng ntalzaton phase (Algorthm ). Whether agent stays or swtches, t resets all varables correspondng to the prevous aucton 3 Other cost functons could also be consdered.
5 Algorthm 4 Agent swtchng () = ; : f pend() = and agent wakes up then 2: Fnd neghbors N := {j N s [j] 3: Set := max j N a j {a j } + (mod 3); 4: Set pend() = ; 5: else f pend() = then 6: Fnd neghbors N := {j N s [j] 7: f N and max j N 8: Set a j {a j } = then () := and phase() := ; 9: Set I := {} and I := I[l] \{ where l := argmax j N {a j }; : else f N = then : Set pend() = ; 2: end f 3: end f (lne, Algorthm 3), so that ths old nformaton can not be used n future equally labeled auctons. D. Agents Swtchng Swtchng needs to satsfy two man objectves. Frst, no clusters of agents that are dsconnected from the man network should be created. Second, all agents swtchng should synchronze themselves wth the ntalzaton phase of the current aucton of ther neghbors. The frst objectve s acheved by requrng that no agent can swtch f t has no neghbors. The second, on the other hand, reles on observng the sequence of auctons of the neghbors and jonng when possble. In partcular, when an agent wakes up, t dentfes ts neghbors N (lne 2, Algorthm 4) and, f such neghbors exst, t prepares to jon the aucton followed by ts neghbors current aucton by approprately ntalzng (lne 3, Algorthm 4). Note that, due to synchronzaton of all agents to the same aucton, at the tme when agent wakes up, all ts neghbors are ether n the same aucton or n two consecutve ones. The latter case occurs f wakng up of agent concdes wth a transton of ts neghbors to a new aucton. Hence, the update n lne 3 of Algorthm 4 s well defned. Once agent has dentfed the aucton t plans to jon, t enters a pendng phase denoted by pend() = (lne 4, Algorthm 4). Durng ths phase, t keeps observng the auctons of ts neghbors N and as soon as one of ts neghbors enters the aucton agent plans to jon (lne 7, Algorthm 4), 4 t swtches and prepares to jon the ntalzaton phase by updatng the varables I, I and s () (lnes 8 and 9, Algorthm 4). Note that, f durng the tme that agent s pendng, all ts neghbors decde to swtch, then agent remans and wats for ts neghbors to swtch back (lnes and, Algorthm 4). Note also that, n ths latter case 4 The maxmum here s taken modulo (a) Intal Confguraton (c) Swtchng / Phase Fg (b) Swtchng Phase (d) Fnal Confguraton Dstrbuted Topology Control for N = 5 agents. none of ts neghbors wll swtch to the aucton that agent wshes to jon due to the update n lne 4 of Algorthm 3, whch guarantees that the condton n lne 7 of Algorthm 4 wll not be enabled. E. Correctness of Dstrbuted Coordnaton Correctness of the proposed dstrbuted coordnaton framework s obtaned by constructon and s dscussed n detals n the prevous subsectons. Those deas are summarzed n the followng result. 5 Proposton 3. (Correctness): Assume N agents, ntally formng a connected network, each one of whch s able to swtch or accordng to Algorthms -4. Then, a connected network ncludng all boundary agents s guaranteed almost always. IV. SIMULATIS In ths secton we llustrate the proposed topology control algorthm n a nontrval connectvty task and show that t has the desred lveness, safety and scalablty propertes. In partcular, we consder ten boundary agents symmetrcally postoned on the upper and lower faces of a rectangle regon and 4 other agents randomly dstrbuted n the nteror of the regon such that all N = 5 agents ntally form a connected network (Fg. (a)). Boundary agents are denoted wth green squares, whle the remanng agents wth blue or red dots, dependng on whether they are or, respectvely. The communcaton range s taken r c =.2 and neghborng relatons are denoted wth lnes drawn between them. The goal of ths task s to let agents swtch and, always mantanng a connected network among the boundary agents. To best llustrate our approach, we decompose the proposed connectvty task n three stages. Frst we only allow agents to swtch amng at ntroducng some sparseness n the network (Fg. (b)). Then, we enable agents to also swtch (wth probablty.) and study how they are able to synchronze wth the man network (Fg. (c)). 5 Due to space lmtatons, the proof of ths result s omtted.
6 Fg. 2. (a) Number of Agents (b) Fedler Egenvalue Performance of Dstrbuted Topology Control for N = 5 agents. The fnal stage conssts of pushng our algorthm to ts lmt and checkng whether t s able to always mantan a connected network even f we never allow agents to swtch agan. In partcular, we see that the fnal network s almost a tree structure (Fg. (d)). The requests verfed wth respect to connectvty durng every aucton consst of all 2 k combnatons of the k = 6 hghest bds. Fgs. 2(a) and 2(b) llustrate the number of agents that are and the Fedler egenvalue of the overall network, respectvely. Note the three stages of our task as well as the fact that our approach succeeds n mantanng a connected network among the boundary agents. Fg. 3 shows a snapshot of the sequence of auctons durng the transton tme from the swtchng stage of the task to the swtchng / stage. Vertcal lnes ndcate transtons from one aucton to another. Horzontal lnes, on the other hand, ndcate ether the last aucton of agents before they swtched (thn blue lnes) or the tme spent n every aucton by agents (thck red lnes). Observe that the sequence of auctons s of the form {, 2, 3,, 2, 3,... } as predcted, as well as that all agents are synchronzed n equally labeled auctons. On the other hand, agents that swtch are always synchronzed wth the network n the desred aucton (arrows and numbers ndcatng the aucton). Fnally, note that n the presence of more agents (/ stage) the tme spent n every aucton s slghtly shorter than before due to the fact that nearest neghbor consensus updates converge faster n denser networks. V. CCLUSIS In ths paper, we presented a dstrbuted control framework to regulate swtchng between the and operaton modes of a group of agents such that the overall network guaranteed mult-hop communcaton lnks among a set of boundary agents. Coordnaton was based on a vrtual market where requests to swtch off were assocated wth bds. Gossp algorthms were used to verfy safety of combnatons of these requests wth respect to connectvty. Among the safe requests, the one correspondng to the hghest aggregate bd was fnally served. Connectvty was captured by the graph Laplacan matrx and was verfed n a dstrbuted way by comparng the asymptotc values of a randomly ntalzed consensus run by all actve agents n the network. Other than nearest neghbor nformaton, our approach requred no knowledge of the network topology. We showed that the Fg. 3. Sequence of Auctons ntegrated networked control system satsfes the connectvty specfcaton almost surely. We fnally llustrated effcency of our scalable approach by nontrval computer smulatons. REFERENCES [] D. P. Spanos and R. M. Murray, Robust connectvty of networked vehcles, n Proceedngs of the 43rd IEEE Conference on Decson and Control, Bahamas, Dec. 24, pp [2] M. Mesbah, On state-dependent dynamc graphs and ther controllablty propertes, IEEE Transactons on Automatc Control, vol. 5, no. 3, pp , 25. [3] M. J and M. Egerstedt, Dstrbuted formaton control whle preservng connectedness, n Proceedngs of the 45th IEEE Conference on Decson and Control, San Dego, CA, Dec. 26, pp [4] M. M. Zavlanos and G. J. Pappas, Dstrbuted connectvty control of moble networks, n Proceedngs of the 46th IEEE Conference on Decson and Control, New Orlens, LA, pp [5] Y. Km and M. Mesbah, On maxmzng the second smallest egenvalue of a state-dependent graph laplacan, IEEE Transactons on Automatc Control, vol. 5, no., pp. 6 2, Jan. 26. [6] M. C. DeGennaro and A. Jadbabae, Decentralzed control of connectvty for mult-agent systems, n Proceedng of the 45th IEEE Conference on Decson and Control, San Dego, CA, Dec. 26, pp [7] G. Notarstefano, K. Savla, F. Bullo, and A. Jadbabae, Mantanng lmted-range connectvty among second-order agents, n Proceedngs of Amercan Control Conference, Mnneapols, MN, 26, pp [8] C. F. Hsn and M. Lu, Network coverage usng low duty-cycled sensors: random & coordnated sleep algorthms, n IPSN 4: Proceedngs of the thrd nternatonal symposum on Informaton processng n sensor networks, Berkeley, CA, 24, pp [9] L. L, J. Y. Halpern, P. Bahl, Y. M. Wang, and R. Wattenhofer, A cone-based dstrbuted topology-control algorthm for wreless multhop networks, IEEE/ACM Transactons on Networkng, vol. 3, no., pp , Feb. 25. [] R. Wattenhofer and A. Zollnger, XTC: A practcal topology control algorthm for ad-hoc networks, n Proceedngs of the 8th IEEE Internatonal Parallel and Dstrbuted Processng Symposum, Santa Fe, NM, 24, pp [] N. Bggs, Algebrac Graph Theory. Cambrdge Unversty press, 993. [2] A. Jadbabae, J. Ln, and A. S. Morse, Coordnaton of groups of moble autonomous agents usng nearest neghbor rules, IEEE Transactons on Automatc Control, vol. 48, no. 6, pp. 988, 23. [3] R. Olfat-Saber and R. M. Murray, Consensus problems n networks of agents wth swtchng topology and tme-delays, IEEE Transactons on Automatc Control, vol. 49, no. 9, pp , Sept. 24. [4] H. G. Tanner, A. Jadbabae, and G. J. Pappas, Flockng n fxed and swtchng networks, IEEE Transactons on Automatc Control, vol. 52, no. 5, pp , May 27. [5] W. Ren and R. Beard, Consensus of nformaton under dynamcally changng nteracton topologes, n Proceedngs of the Amercan Control Conference, 24, pp [6] J. Cortes, S. Martnez, and F. Bullo, Robust rendezvous for moble autonomous agents va proxmty graphs n arbtrary dmensons, IEEE Transactons on Automatc Control, vol. 5, no. 8, pp , Aug. 26.
Dynamic Optimization. Assignment 1. Sasanka Nagavalli January 29, 2013 Robotics Institute Carnegie Mellon University
Dynamc Optmzaton Assgnment 1 Sasanka Nagavall snagaval@andrew.cmu.edu 16-745 January 29, 213 Robotcs Insttute Carnege Mellon Unversty Table of Contents 1. Problem and Approach... 1 2. Optmzaton wthout
More informationPriority based Dynamic Multiple Robot Path Planning
2nd Internatonal Conference on Autonomous obots and Agents Prorty based Dynamc Multple obot Path Plannng Abstract Taxong Zheng Department of Automaton Chongqng Unversty of Post and Telecommuncaton, Chna
More informationA Comparison of Two Equivalent Real Formulations for Complex-Valued Linear Systems Part 2: Results
AMERICAN JOURNAL OF UNDERGRADUATE RESEARCH VOL. 1 NO. () A Comparson of Two Equvalent Real Formulatons for Complex-Valued Lnear Systems Part : Results Abnta Munankarmy and Mchael A. Heroux Department of
More informationWalsh Function Based Synthesis Method of PWM Pattern for Full-Bridge Inverter
Walsh Functon Based Synthess Method of PWM Pattern for Full-Brdge Inverter Sej Kondo and Krt Choesa Nagaoka Unversty of Technology 63-, Kamtomoka-cho, Nagaoka 9-, JAPAN Fax: +8-58-7-95, Phone: +8-58-7-957
More informationPRACTICAL, COMPUTATION EFFICIENT HIGH-ORDER NEURAL NETWORK FOR ROTATION AND SHIFT INVARIANT PATTERN RECOGNITION. Evgeny Artyomov and Orly Yadid-Pecht
68 Internatonal Journal "Informaton Theores & Applcatons" Vol.11 PRACTICAL, COMPUTATION EFFICIENT HIGH-ORDER NEURAL NETWORK FOR ROTATION AND SHIFT INVARIANT PATTERN RECOGNITION Evgeny Artyomov and Orly
More informationPrevention of Sequential Message Loss in CAN Systems
Preventon of Sequental Message Loss n CAN Systems Shengbng Jang Electrcal & Controls Integraton Lab GM R&D Center, MC: 480-106-390 30500 Mound Road, Warren, MI 48090 shengbng.jang@gm.com Ratnesh Kumar
More informationDefine Y = # of mobiles from M total mobiles that have an adequate link. Measure of average portion of mobiles allocated a link of adequate quality.
Wreless Communcatons Technologes 6::559 (Advanced Topcs n Communcatons) Lecture 5 (Aprl th ) and Lecture 6 (May st ) Instructor: Professor Narayan Mandayam Summarzed by: Steve Leung (leungs@ece.rutgers.edu)
More informationRational Secret Sharing without Broadcast
Ratonal Secret Sharng wthout Broadcast Amjed Shareef, Department of Computer Scence and Engneerng, Indan Insttute of Technology Madras, Chenna, Inda. Emal: amjedshareef@gmal.com Abstract We use the concept
More informationOn Interference Alignment for Multi-hop MIMO Networks
013 Proceedngs IEEE INFOCOM On Interference Algnment for Mult-hop MIMO Networks Huacheng Zeng Y Sh Y. Thomas Hou Wenng Lou Sastry Kompella Scott F. Mdkff Vrgna Polytechnc Insttute and State Unversty, USA
More informationOptimal Placement of PMU and RTU by Hybrid Genetic Algorithm and Simulated Annealing for Multiarea Power System State Estimation
T. Kerdchuen and W. Ongsakul / GMSARN Internatonal Journal (09) - Optmal Placement of and by Hybrd Genetc Algorthm and Smulated Annealng for Multarea Power System State Estmaton Thawatch Kerdchuen and
More informationDigital Transmission
Dgtal Transmsson Most modern communcaton systems are dgtal, meanng that the transmtted normaton sgnal carres bts and symbols rather than an analog sgnal. The eect o C/N rato ncrease or decrease on dgtal
More informationMulti-Robot Map-Merging-Free Connectivity-Based Positioning and Tethering in Unknown Environments
Mult-Robot Map-Mergng-Free Connectvty-Based Postonng and Tetherng n Unknown Envronments Somchaya Lemhetcharat and Manuela Veloso February 16, 2012 Abstract We consder a set of statc towers out of communcaton
More informationNetwork Reconfiguration in Distribution Systems Using a Modified TS Algorithm
Network Reconfguraton n Dstrbuton Systems Usng a Modfed TS Algorthm ZHANG DONG,FU ZHENGCAI,ZHANG LIUCHUN,SONG ZHENGQIANG School of Electroncs, Informaton and Electrcal Engneerng Shangha Jaotong Unversty
More informationPerformance Analysis of Multi User MIMO System with Block-Diagonalization Precoding Scheme
Performance Analyss of Mult User MIMO System wth Block-Dagonalzaton Precodng Scheme Yoon Hyun m and Jn Young m, wanwoon Unversty, Department of Electroncs Convergence Engneerng, Wolgye-Dong, Nowon-Gu,
More informationLocalization in mobile networks via virtual convex hulls
Localzaton n moble networs va vrtual convex hulls Sam Safav, Student Member, IEEE, and Usman A. Khan, Senor Member, IEEE arxv:.7v [cs.sy] Jan 7 Abstract In ths paper, we develop a dstrbuted algorthm to
More informationThroughput Maximization by Adaptive Threshold Adjustment for AMC Systems
APSIPA ASC 2011 X an Throughput Maxmzaton by Adaptve Threshold Adjustment for AMC Systems We-Shun Lao and Hsuan-Jung Su Graduate Insttute of Communcaton Engneerng Department of Electrcal Engneerng Natonal
More informationAlgorithms Airline Scheduling. Airline Scheduling. Design and Analysis of Algorithms Andrei Bulatov
Algorthms Arlne Schedulng Arlne Schedulng Desgn and Analyss of Algorthms Andre Bulatov Algorthms Arlne Schedulng 11-2 The Problem An arlne carrer wants to serve certan set of flghts Example: Boston (6
More informationGraph Method for Solving Switched Capacitors Circuits
Recent Advances n rcuts, ystems, gnal and Telecommuncatons Graph Method for olvng wtched apactors rcuts BHUMIL BRTNÍ Department of lectroncs and Informatcs ollege of Polytechncs Jhlava Tolstého 6, 586
More informationFall 2018 #11 Games and Nimbers. A. Game. 0.5 seconds, 64 megabytes
5-95 Fall 08 # Games and Nmbers A. Game 0.5 seconds, 64 megabytes There s a legend n the IT Cty college. A student that faled to answer all questons on the game theory exam s gven one more chance by hs
More informationJoint Adaptive Modulation and Power Allocation in Cognitive Radio Networks
I. J. Communcatons, etwork and System Scences, 8, 3, 7-83 Publshed Onlne August 8 n ScRes (http://www.scrp.org/journal/jcns/). Jont Adaptve Modulaton and Power Allocaton n Cogntve Rado etworks Dong LI,
More informationMulti-hop Coordination in Gossiping-based Wireless Sensor Networks
Mult-hop Coordnaton n Gosspng-based Wreless Sensor Networks Zhlang Chen, Alexander Kuehne, and Anja Klen Communcatons Engneerng Lab, Technsche Unverstät Darmstadt, Germany Emal: {z.chen,a.kuehne,a.klen}@nt.tu-darmstadt.de
More informationComparative Analysis of Reuse 1 and 3 in Cellular Network Based On SIR Distribution and Rate
Comparatve Analyss of Reuse and 3 n ular Network Based On IR Dstrbuton and Rate Chandra Thapa M.Tech. II, DEC V College of Engneerng & Technology R.V.. Nagar, Chttoor-5727, A.P. Inda Emal: chandra2thapa@gmal.com
More informationAnalysis of Time Delays in Synchronous and. Asynchronous Control Loops. Bj rn Wittenmark, Ben Bastian, and Johan Nilsson
37th CDC, Tampa, December 1998 Analyss of Delays n Synchronous and Asynchronous Control Loops Bj rn Wttenmark, Ben Bastan, and Johan Nlsson emal: bjorn@control.lth.se, ben@control.lth.se, and johan@control.lth.se
More informationAsynchronous TDMA ad hoc networks: Scheduling and Performance
Asynchronous TDMA ad hoc networks: Schedulng and Performance Theodoros Salonds and Leandros Tassulas, Department of Electrcal and Computer Engneerng and Insttute of Systems Research Unversty of Maryland,
More informationMultiband Jamming Strategies with Minimum Rate Constraints
Multband Jammng Strateges wth Mnmum Rate Constrants Karm Banawan, Sennur Ulukus, Peng Wang, and Bran Henz Department of Electrcal and Computer Engneerng, Unversty of Maryland, College Park, MD 7 US Army
More information熊本大学学術リポジトリ. Kumamoto University Repositor
熊本大学学術リポジトリ Kumamoto Unversty Repostor Ttle Wreless LAN Based Indoor Poston and Its Smulaton Author(s) Ktasuka, Teruak; Nakansh, Tsune CtatonIEEE Pacfc RIM Conference on Comm Computers, and Sgnal Processng
More informationA Fuzzy-based Routing Strategy for Multihop Cognitive Radio Networks
74 Internatonal Journal of Communcaton Networks and Informaton Securty (IJCNIS) Vol. 3, No., Aprl 0 A Fuzzy-based Routng Strategy for Multhop Cogntve Rado Networks Al El Masr, Naceur Malouch and Hcham
More informationTest 2. ECON3161, Game Theory. Tuesday, November 6 th
Test 2 ECON36, Game Theory Tuesday, November 6 th Drectons: Answer each queston completely. If you cannot determne the answer, explanng how you would arrve at the answer may earn you some ponts.. (20 ponts)
More informationReview: Our Approach 2. CSC310 Information Theory
CSC30 Informaton Theory Sam Rowes Lecture 3: Provng the Kraft-McMllan Inequaltes September 8, 6 Revew: Our Approach The study of both compresson and transmsson requres that we abstract data and messages
More informationA Current Differential Line Protection Using a Synchronous Reference Frame Approach
A Current Dfferental Lne rotecton Usng a Synchronous Reference Frame Approach L. Sousa Martns *, Carlos Fortunato *, and V.Fernão res * * Escola Sup. Tecnologa Setúbal / Inst. oltécnco Setúbal, Setúbal,
More informationCooperative perimeter surveillance with a team of mobile robots under communication constraints
213 IEEE/RSJ Internatonal Conference on Intellgent Robots and Systems (IROS) November 3-7, 213. Toyo, Japan Cooperatve permeter survellance wth a team of moble robots under communcaton constrants J.J.
More informationTECHNICAL RESEARCH REPORT
TECHNICAL RESEARCH REPORT Performance ssues of Bluetooth scatternets and other asynchronous TDMA ad hoc networks by Theodoros Salonds, Leandros Tassulas CSHCN TR 00 (ISR TR 005) The Center for Satellte
More informationEnhancing Throughput in Wireless Multi-Hop Network with Multiple Packet Reception
Enhancng Throughput n Wreless Mult-Hop Network wth Multple Packet Recepton Ja-lang Lu, Paulne Vandenhove, We Shu, Mn-You Wu Dept. of Computer Scence & Engneerng, Shangha JaoTong Unversty, Shangha, Chna
More informationThe Spectrum Sharing in Cognitive Radio Networks Based on Competitive Price Game
8 Y. B. LI, R. YAG, Y. LI, F. YE, THE SPECTRUM SHARIG I COGITIVE RADIO ETWORKS BASED O COMPETITIVE The Spectrum Sharng n Cogntve Rado etworks Based on Compettve Prce Game Y-bng LI, Ru YAG., Yun LI, Fang
More informationFigure 1. DC-DC Boost Converter
EE46, Power Electroncs, DC-DC Boost Converter Verson Oct. 3, 11 Overvew Boost converters make t possble to effcently convert a DC voltage from a lower level to a hgher level. Theory of Operaton Relaton
More informationCalculation of the received voltage due to the radiation from multiple co-frequency sources
Rec. ITU-R SM.1271-0 1 RECOMMENDATION ITU-R SM.1271-0 * EFFICIENT SPECTRUM UTILIZATION USING PROBABILISTIC METHODS Rec. ITU-R SM.1271 (1997) The ITU Radocommuncaton Assembly, consderng a) that communcatons
More informationA Novel Optimization of the Distance Source Routing (DSR) Protocol for the Mobile Ad Hoc Networks (MANET)
A Novel Optmzaton of the Dstance Source Routng (DSR) Protocol for the Moble Ad Hoc Networs (MANET) Syed S. Rzv 1, Majd A. Jafr, and Khaled Ellethy Computer Scence and Engneerng Department Unversty of Brdgeport
More informationA New Type of Weighted DV-Hop Algorithm Based on Correction Factor in WSNs
Journal of Communcatons Vol. 9, No. 9, September 2014 A New Type of Weghted DV-Hop Algorthm Based on Correcton Factor n WSNs Yng Wang, Zhy Fang, and Ln Chen Department of Computer scence and technology,
More informationTo: Professor Avitabile Date: February 4, 2003 From: Mechanical Student Subject: Experiment #1 Numerical Methods Using Excel
To: Professor Avtable Date: February 4, 3 From: Mechancal Student Subject:.3 Experment # Numercal Methods Usng Excel Introducton Mcrosoft Excel s a spreadsheet program that can be used for data analyss,
More informationAsynchronous TDMA ad hoc networks: Scheduling and Performance
Communcaton Networks Asynchronous TDMA ad hoc networks: Schedulng and Performance THEODOROS SALONIDIS AND LEANDROS TASSIULAS, Department of Electrcal and Computer Engneerng, Unversty of Maryland at College
More informationMTBF PREDICTION REPORT
MTBF PREDICTION REPORT PRODUCT NAME: BLE112-A-V2 Issued date: 01-23-2015 Rev:1.0 Copyrght@2015 Bluegga Technologes. All rghts reserved. 1 MTBF PREDICTION REPORT... 1 PRODUCT NAME: BLE112-A-V2... 1 1.0
More informationUNIT 11 TWO-PERSON ZERO-SUM GAMES WITH SADDLE POINT
UNIT TWO-PERSON ZERO-SUM GAMES WITH SADDLE POINT Structure. Introducton Obectves. Key Terms Used n Game Theory.3 The Maxmn-Mnmax Prncple.4 Summary.5 Solutons/Answers. INTRODUCTION In Game Theory, the word
More informationJoint Power Control and Scheduling for Two-Cell Energy Efficient Broadcasting with Network Coding
Communcatons and Network, 2013, 5, 312-318 http://dx.do.org/10.4236/cn.2013.53b2058 Publshed Onlne September 2013 (http://www.scrp.org/journal/cn) Jont Power Control and Schedulng for Two-Cell Energy Effcent
More informationDistributed Kalman Filtering for Sensor Networks
Proceedngs of the 46th IEEE Conference on Decson and Control New Orleans, LA, USA, Dec. 12-14, 2007 Dstrbuted Kalman Flterng for Sensor Networks R. Olfat-Saber Abstract In ths paper, we ntroduce three
More informationA MODIFIED DIFFERENTIAL EVOLUTION ALGORITHM IN SPARSE LINEAR ANTENNA ARRAY SYNTHESIS
A MODIFIED DIFFERENTIAL EVOLUTION ALORITHM IN SPARSE LINEAR ANTENNA ARRAY SYNTHESIS Kaml Dmller Department of Electrcal-Electroncs Engneerng rne Amercan Unversty North Cyprus, Mersn TURKEY kdmller@gau.edu.tr
More informationA NSGA-II algorithm to solve a bi-objective optimization of the redundancy allocation problem for series-parallel systems
0 nd Internatonal Conference on Industral Technology and Management (ICITM 0) IPCSIT vol. 49 (0) (0) IACSIT Press, Sngapore DOI: 0.776/IPCSIT.0.V49.8 A NSGA-II algorthm to solve a b-obectve optmzaton of
More informationGeneralized Incomplete Trojan-Type Designs with Unequal Cell Sizes
Internatonal Journal of Theoretcal & Appled Scences 6(1): 50-54(2014) ISSN No. (Prnt): 0975-1718 ISSN No. (Onlne): 2249-3247 Generalzed Incomplete Trojan-Type Desgns wth Unequal Cell Szes Cn Varghese,
More informationAdaptive Modulation for Multiple Antenna Channels
Adaptve Modulaton for Multple Antenna Channels June Chul Roh and Bhaskar D. Rao Department of Electrcal and Computer Engneerng Unversty of Calforna, San Dego La Jolla, CA 993-7 E-mal: jroh@ece.ucsd.edu,
More informationAn Energy Efficient Hierarchical Clustering Algorithm for Wireless Sensor Networks
An Energy Effcent Herarchcal Clusterng Algorthm for Wreless Sensor Networks Seema Bandyopadhyay and Edward J. Coyle School of Electrcal and Computer Engneerng Purdue Unversty West Lafayette, IN, USA {seema,
More informationUplink User Selection Scheme for Multiuser MIMO Systems in a Multicell Environment
Uplnk User Selecton Scheme for Multuser MIMO Systems n a Multcell Envronment Byong Ok Lee School of Electrcal Engneerng and Computer Scence and INMC Seoul Natonal Unversty leebo@moble.snu.ac.kr Oh-Soon
More informationMASTER TIMING AND TOF MODULE-
MASTER TMNG AND TOF MODULE- G. Mazaher Stanford Lnear Accelerator Center, Stanford Unversty, Stanford, CA 9409 USA SLAC-PUB-66 November 99 (/E) Abstract n conjuncton wth the development of a Beam Sze Montor
More informationApproximating User Distributions in WCDMA Networks Using 2-D Gaussian
CCCT 05: INTERNATIONAL CONFERENCE ON COMPUTING, COMMUNICATIONS, AND CONTROL TECHNOLOGIES 1 Approxmatng User Dstrbutons n CDMA Networks Usng 2-D Gaussan Son NGUYEN and Robert AKL Department of Computer
More informationCoverage Control for Multiple Event Types with Heterogeneous Robots
Coverage Control for Multple Event Types wth Heterogeneous Robots Armn Sadegh Stephen L. Smth Abstract Ths paper focuses on the problem of deployng a set of autonomous robots to effcently montor multple
More informationA Simple Satellite Exclusion Algorithm for Advanced RAIM
A Smple Satellte Excluson Algorthm for Advanced RAIM Juan Blanch, Todd Walter, Per Enge Stanford Unversty ABSTRACT Advanced Recever Autonomous Integrty Montorng s a concept that extends RAIM to mult-constellaton
More informationPassive Filters. References: Barbow (pp ), Hayes & Horowitz (pp 32-60), Rizzoni (Chap. 6)
Passve Flters eferences: Barbow (pp 6575), Hayes & Horowtz (pp 360), zzon (Chap. 6) Frequencyselectve or flter crcuts pass to the output only those nput sgnals that are n a desred range of frequences (called
More informationNOVEL ITERATIVE TECHNIQUES FOR RADAR TARGET DISCRIMINATION
NOVEL ITERATIVE TECHNIQUES FOR RADAR TARGET DISCRIMINATION Phaneendra R.Venkata, Nathan A. Goodman Department of Electrcal and Computer Engneerng, Unversty of Arzona, 30 E. Speedway Blvd, Tucson, Arzona
More informationFigure 1. DC-DC Boost Converter
EE36L, Power Electroncs, DC-DC Boost Converter Verson Feb. 8, 9 Overvew Boost converters make t possble to effcently convert a DC voltage from a lower level to a hgher level. Theory of Operaton Relaton
More informationResearch of Dispatching Method in Elevator Group Control System Based on Fuzzy Neural Network. Yufeng Dai a, Yun Du b
2nd Internatonal Conference on Computer Engneerng, Informaton Scence & Applcaton Technology (ICCIA 207) Research of Dspatchng Method n Elevator Group Control System Based on Fuzzy Neural Network Yufeng
More informationVRT014 User s guide V0.8. Address: Saltoniškių g. 10c, Vilnius LT-08105, Phone: (370-5) , Fax: (370-5) ,
VRT014 User s gude V0.8 Thank you for purchasng our product. We hope ths user-frendly devce wll be helpful n realsng your deas and brngng comfort to your lfe. Please take few mnutes to read ths manual
More informationDiscussion on How to Express a Regional GPS Solution in the ITRF
162 Dscusson on How to Express a Regonal GPS Soluton n the ITRF Z. ALTAMIMI 1 Abstract The usefulness of the densfcaton of the Internatonal Terrestral Reference Frame (ITRF) s to facltate ts access as
More informationMedium Access Control for Multi-Channel Parallel Transmission in Cognitive Radio Networks
Medum ccess Control for Mult-Channel Parallel Transmsson n Cogntve Rado Networs Tao Shu, Shuguang Cu, and Marwan Krunz Department of Electrcal and Computer Engneerng Unversty of rzona Tucson, Z 85721 {tshu,
More informationCharacterization and Analysis of Multi-Hop Wireless MIMO Network Throughput
Characterzaton and Analyss of Mult-Hop Wreless MIMO Network Throughput Bechr Hamdaou EECS Dept., Unversty of Mchgan 226 Hayward Ave, Ann Arbor, Mchgan, USA hamdaou@eecs.umch.edu Kang G. Shn EECS Dept.,
More informationANNUAL OF NAVIGATION 11/2006
ANNUAL OF NAVIGATION 11/2006 TOMASZ PRACZYK Naval Unversty of Gdyna A FEEDFORWARD LINEAR NEURAL NETWORK WITH HEBBA SELFORGANIZATION IN RADAR IMAGE COMPRESSION ABSTRACT The artcle presents the applcaton
More informationAdaptive Distributed Topology Control for Wireless Ad-Hoc Sensor Networks
Adaptve Dstrbuted Topology Control for Wreless Ad-Hoc Sensor Networks Ka-Tng Chu, Chh-Yu Wen, Yen-Cheh Ouyang, and Wllam A. Sethares Abstract Ths paper presents a decentralzed clusterng and gateway selecton
More informationLow Switching Frequency Active Harmonic Elimination in Multilevel Converters with Unequal DC Voltages
Low Swtchng Frequency Actve Harmonc Elmnaton n Multlevel Converters wth Unequal DC Voltages Zhong Du,, Leon M. Tolbert, John N. Chasson, Hu L The Unversty of Tennessee Electrcal and Computer Engneerng
More informationResource Allocation Optimization for Device-to- Device Communication Underlaying Cellular Networks
Resource Allocaton Optmzaton for Devce-to- Devce Communcaton Underlayng Cellular Networks Bn Wang, L Chen, Xaohang Chen, Xn Zhang, and Dacheng Yang Wreless Theores and Technologes (WT&T) Bejng Unversty
More informationMaximizing Lifetime of Sensor-Target Surveillance in Wireless Sensor Networks
Maxmzng Lfetme of Sensor-Target Survellance n Wreless Sensor Networks Ha Lu, Xaowen Chu, Yu-Wng Leung Computer Scence, Hong Kong Baptst Unversty Xaohua Ja, Peng-Jun Wan Computer Scence, Cty Unversty of
More informationIntelligent Wakening Scheme for Wireless Sensor Networks Surveillance
The Frst Internatonal Workshop on Cyber-Physcal Networkng Systems Intellgent Wakenng Scheme for Wreless Sensor Networks Survellance Ru Wang, Le Zhang, L Cu Insttute of Computng Technology of the Chnese
More informationAn Energy-aware Awakening Routing Algorithm in Heterogeneous Sensor Networks
An Energy-aware Awakenng Routng Algorthm n Heterogeneous Sensor Networks TAO Dan 1, CHEN Houjn 1, SUN Yan 2, CEN Ygang 3 1. School of Electronc and Informaton Engneerng, Bejng Jaotong Unversty, Bejng,
More informationFormation Control of Mobile Robots using Multiple Aerial Cameras
Ctaton: M. Aranda, G. López-Ncolás, C. Sagüés, Y. Mezouar. Formaton control of moble robots usng multple aeral cameras. IEEE Transactons on Robotcs, vol. 3, no. 4, pp. 64-7, 5 Formaton Control of Moble
More informationMulti-sensor optimal information fusion Kalman filter with mobile agents in ring sensor networks
Mult-sensor optmal nformaton fuson Kalman flter wth moble agents n rng sensor networs Behrouz Safarneadan *, Kazem asanpoor ** *Shraz Unversty of echnology, safarnead@sutech.ac.r ** Shraz Unversty of echnology,.hasanpor@gmal.com
More informationFull-duplex Relaying for D2D Communication in mmwave based 5G Networks
Full-duplex Relayng for D2D Communcaton n mmwave based 5G Networks Boang Ma Hamed Shah-Mansour Member IEEE and Vncent W.S. Wong Fellow IEEE Abstract Devce-to-devce D2D communcaton whch can offload data
More informationDesign of Shunt Active Filter for Harmonic Compensation in a 3 Phase 3 Wire Distribution Network
Internatonal Journal of Research n Electrcal & Electroncs Engneerng olume 1, Issue 1, July-September, 2013, pp. 85-92, IASTER 2013 www.aster.com, Onlne: 2347-5439, Prnt: 2348-0025 Desgn of Shunt Actve
More informationHigh Speed ADC Sampling Transients
Hgh Speed ADC Samplng Transents Doug Stuetzle Hgh speed analog to dgtal converters (ADCs) are, at the analog sgnal nterface, track and hold devces. As such, they nclude samplng capactors and samplng swtches.
More informationA Novel Soft-Switching Two-Switch Flyback Converter with a Wide Operating Range and Regenerative Clamping
77 Journal of ower Electroncs, ol 9, No 5, September 009 JE 9-5- A Novel Soft-Swtchng Two-Swtch Flybac Converter wth a Wde Operatng Range and Regeneratve Clampng Marn-Go Km and Young-Seo Jung * Dvson of
More informationEfficient Large Integers Arithmetic by Adopting Squaring and Complement Recoding Techniques
The th Worshop on Combnatoral Mathematcs and Computaton Theory Effcent Large Integers Arthmetc by Adoptng Squarng and Complement Recodng Technques Cha-Long Wu*, Der-Chyuan Lou, and Te-Jen Chang *Department
More informationIEE Electronics Letters, vol 34, no 17, August 1998, pp ESTIMATING STARTING POINT OF CONDUCTION OF CMOS GATES
IEE Electroncs Letters, vol 34, no 17, August 1998, pp. 1622-1624. ESTIMATING STARTING POINT OF CONDUCTION OF CMOS GATES A. Chatzgeorgou, S. Nkolads 1 and I. Tsoukalas Computer Scence Department, 1 Department
More informationThe Dynamic Utilization of Substation Measurements to Maintain Power System Observability
1 The Dynamc Utlzaton of Substaton Measurements to Mantan Power System Observablty Y. Wu, Student Member, IEEE, M. Kezunovc, Fellow, IEEE and T. Kostc, Member, IEEE Abstract-- In a power system State Estmator
More informationsensors ISSN
Sensors 009, 9, 8593-8609; do:10.3390/s91108593 Artcle OPEN ACCESS sensors ISSN 144-80 www.mdp.com/journal/sensors Dstrbuted Envronment Control Usng Wreless Sensor/Actuator Networks for Lghtng Applcatons
More informationAchieving Transparent Coexistence in a Multi-hop Secondary Network Through Distributed Computation
Achevng Transparent Coexstence n a Mult-hop econdary Network Through Dstrbuted Computaton Xu Yuan Y h Y. Thomas Hou Wenng Lou cott F. Mdkff astry Kompella Vrgna olytechnc Insttute and tate Unversty, UA
More informationApplication of Intelligent Voltage Control System to Korean Power Systems
Applcaton of Intellgent Voltage Control System to Korean Power Systems WonKun Yu a,1 and HeungJae Lee b, *,2 a Department of Power System, Seol Unversty, South Korea. b Department of Power System, Kwangwoon
More informationUncertainty in measurements of power and energy on power networks
Uncertanty n measurements of power and energy on power networks E. Manov, N. Kolev Department of Measurement and Instrumentaton, Techncal Unversty Sofa, bul. Klment Ohrdsk No8, bl., 000 Sofa, Bulgara Tel./fax:
More informationThe Impact of Spectrum Sensing Frequency and Packet- Loading Scheme on Multimedia Transmission over Cognitive Radio Networks
Ths artcle has been accepted for publcaton n a future ssue of ths journal, but has not been fully edted. Content may change pror to fnal publcaton. The Impact of Spectrum Sensng Frequency and Pacet- Loadng
More informationMonitoring large-scale power distribution grids
Montorng large-scale power dstrbuton grds D. Gavrlov, M. Gouzman, and S. Lury Center for Advanced Technology n Sensor Systems, Stony Brook Unversty, Stony Brook, NY 11794 Keywords: smart grd; sensor network;
More informationA Mathematical Model for Restoration Problem in Smart Grids Incorporating Load Shedding Concept
J. Appl. Envron. Bol. Sc., 5(1)20-27, 2015 2015, TextRoad Publcaton ISSN: 2090-4274 Journal of Appled Envronmental and Bologcal Scences www.textroad.com A Mathematcal Model for Restoraton Problem n Smart
More informationOn the Feasibility of Receive Collaboration in Wireless Sensor Networks
On the Feasblty of Receve Collaboraton n Wreless Sensor Networs B. Bantaleb, S. Sgg and M. Begl Computer Scence Department Insttute of Operatng System and Computer Networs (IBR) Braunschweg, Germany {behnam,
More informationOptimal Allocation of Static VAr Compensator for Active Power Loss Reduction by Different Decision Variables
S. Aucharyamet and S. Srsumrannukul / GMSARN Internatonal Journal 4 (2010) 57-66 Optmal Allocaton of Statc VAr Compensator for Actve Power oss Reducton by Dfferent Decson Varables S. Aucharyamet and S.
More informationTopology Control for C-RAN Architecture Based on Complex Network
Topology Control for C-RAN Archtecture Based on Complex Network Zhanun Lu, Yung He, Yunpeng L, Zhaoy L, Ka Dng Chongqng key laboratory of moble communcatons technology Chongqng unversty of post and telecommuncaton
More informationLearning Ensembles of Convolutional Neural Networks
Learnng Ensembles of Convolutonal Neural Networks Lran Chen The Unversty of Chcago Faculty Mentor: Greg Shakhnarovch Toyota Technologcal Insttute at Chcago 1 Introducton Convolutonal Neural Networks (CNN)
More informationControl of Chaos in Positive Output Luo Converter by means of Time Delay Feedback
Control of Chaos n Postve Output Luo Converter by means of Tme Delay Feedback Nagulapat nkran.ped@gmal.com Abstract Faster development n Dc to Dc converter technques are undergong very drastc changes due
More informationChaotic Filter Bank for Computer Cryptography
Chaotc Flter Bank for Computer Cryptography Bngo Wng-uen Lng Telephone: 44 () 784894 Fax: 44 () 784893 Emal: HTwng-kuen.lng@kcl.ac.ukTH Department of Electronc Engneerng, Dvson of Engneerng, ng s College
More informationVoltage security constrained reactive power optimization incorporating wind generation
Unversty of Wollongong Research Onlne Faculty of Engneerng and Informaton Scences - Papers: Part A Faculty of Engneerng and Informaton Scences 2012 Voltage securty constraned reactve power optmzaton ncorporatng
More informationDistributed Energy Efficient Spectrum Access in Cognitive Radio Wireless Ad Hoc Networks
Dstrbuted Energy Effcent Spectrum Access n Cogntve Rado Wreless Ad Hoc Networks Song Gao, Ljun Qan, Dhadesugoor. R. Vaman ARO/ARL Center for Battlefeld Communcatons Research Prare Vew A&M Unversty, Texas
More informationA Predictive QoS Control Strategy for Wireless Sensor Networks
The 1st Worshop on Resource Provsonng and Management n Sensor Networs (RPMSN '5) n conjuncton wth the 2nd IEEE MASS, Washngton, DC, Nov. 25 A Predctve QoS Control Strategy for Wreless Sensor Networs Byu
More informationAn Adaptive Over-current Protection Scheme for MV Distribution Networks Including DG
An Adaptve Over-current Protecton Scheme for MV Dstrbuton Networks Includng DG S.A.M. Javadan Islamc Azad Unversty s.a.m.javadan@gmal.com M.-R. Haghfam Tarbat Modares Unversty haghfam@modares.ac.r P. Barazandeh
More informationSpace Time Equalization-space time codes System Model for STCM
Space Tme Eualzaton-space tme codes System Model for STCM The system under consderaton conssts of ST encoder, fadng channel model wth AWGN, two transmt antennas, one receve antenna, Vterb eualzer wth deal
More informationDistributed Fault Detection of Wireless Sensor Networks
Dstrbuted Fault Detecton of Wreless Sensor Networs Jnran Chen, Shubha Kher, and Arun Soman Dependable Computng and Networng Lab Iowa State Unversty Ames, Iowa 50010 {jrchen, shubha, arun}@astate.edu ABSTRACT
More informationIEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 13, NO. 12, DECEMBER
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 3, NO. 2, DECEMBER 204 695 On Spatal Capacty of Wreless Ad Hoc Networks wth Threshold Based Schedulng Yue Lng Che, Student Member, IEEE, Ru Zhang, Member,
More informationTODAY S wireless networks are characterized as a static
IEEE TRANSACTIONS ON MOBILE COMPUTING, VOL. 10, NO. 2, FEBRUARY 2011 161 A Spectrum Decson Framework for Cogntve Rado Networks Won-Yeol Lee, Student Member, IEEE, and Ian F. Akyldz, Fellow, IEEE Abstract
More informationUnderstanding the Spike Algorithm
Understandng the Spke Algorthm Vctor Ejkhout and Robert van de Gejn May, ntroducton The parallel soluton of lnear systems has a long hstory, spannng both drect and teratve methods Whle drect methods exst
More information