Utilize este identificador para referenciar este registo:
http://hdl.handle.net/11144/3433
Registo completo
Campo DC | Valor | Idioma |
---|---|---|
dc.contributor.author | Silvestre, Daniel | - |
dc.date.accessioned | 2018-02-07T21:06:33Z | - |
dc.date.available | 2018-02-07T21:06:33Z | - |
dc.date.issued | 2011-12 | - |
dc.identifier.uri | http://hdl.handle.net/11144/3433 | - |
dc.description.abstract | We consider that a set of distributed agents desire to reach consensus on the average of their initial state values, while communicating with neighboring agents through a shared medium. This communication medium allows only one agent to transmit unidirectionally at a given time, which is true, e.g., in wireless networks. We address scenarios where the choice of agents that transmit and receive messages at each transmission time follows a stochastic characterization, and we model the topology of allowable transmissions with asymmetric graphs. In particular, we consider: (i) randomized gossip algorithms in wireless networks, where each agent becomes active at randomly chosen times, transmitting its data to a single neighbor; (ii) broadcast wireless networks, where each agent transmits to all the other agents, and access to the network occurs with the same probability for every node. We propose a solution in terms of a linear distributed algorithm based on a state augmentation technique, and prove that this solution achieves average consensus in a stochastic sense, for the special cases (i) and (ii). Expressions for absolute time convergence rates at which average consensus is achieved are also given. | por |
dc.language.iso | eng | por |
dc.rights | openAccess | por |
dc.title | Average Consensus and Gossip Algorithms in Networks with Stochastic Asymmetric Communications | por |
dc.type | lecture | por |
Aparece nas colecções: | AUTONOMA TECHLAB - Comunicações em conferências DCT- Comunicações em conferências |
Ficheiros deste registo:
Ficheiro | Descrição | Tamanho | Formato | |
---|---|---|---|---|
presentation.pdf | 1,25 MB | Adobe PDF | Ver/Abrir |
Todos os registos no repositório estão protegidos por leis de copyright, com todos os direitos reservados.