The Impact of Mobility on Gossip Algorithms
From MaRDI portal
Publication:5272061
DOI10.1109/TIT.2011.2177753zbMath1365.94036OpenAlexW1988434354WikidataQ60021624 ScholiaQ60021624MaRDI QIDQ5272061
Anand Dilip Sarwate, Alexandros G. Dimakis
Publication date: 12 July 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.2011.2177753
Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Network protocols (68M12) Communication theory (94A05)
Related Items
A mobility model for studying wireless communication and the complexity of problems in the model ⋮ Convergence of gossip algorithms for consensus in wireless sensor networks with intermittent links and mobile nodes ⋮ Nonlinear gossip algorithms for wireless sensor networks