An online distributed gossiping protocol for mobile networks-Reference-Cited by-同舟云学术

An online distributed gossiping protocol for mobile networks

Published:2006-02 Issue:1 Volume:11 Page:87-97
ISSN:1382-6905
Container-title:Journal of Combinatorial Optimization
language:en
Short-container-title:J Comb Optim

Author:

Shi Zhengnan,Srimani Pradip K.

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computational Theory and Mathematics,Control and Optimization,Discrete Mathematics and Combinatorics,Computer Science Applications

Link

http://link.springer.com/content/pdf/10.1007/s10878-006-5979-6.pdf

Reference8 articles.

1. Fraigniaud P, Lazard E (1994) Methods and problems of communication in usual networks. Discrete Applied Math. 53:79–133

2. Hedetniemi ST, Hedetniemi SM, Liestman AL (1988) A survey of gossiping and broadcasting in communication networks. Networks (18):129–134

3. Even S, Monien B (2001) On the number of rounds necessary to disseminate information. In Proc. Int'l Symp. Algorithms. Parallel Algorithms and Architectures, pp. 318–327

4. Fujita S, Yamashita M (1996) Optimal group gossiping in hypercube under circuit switching rounds. SIAM J. Computing 25(5):1045–1060

5. Venkataraman KN, Krumme DW, Cybenko G (1992) Gossiping in minimal times. SIAM J. Computing 21(2):111–139

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Data collection and node counting by opportunistic communication;2019 IFIP Networking Conference (IFIP Networking);2019-05-20

2. Distributed wireless link scheduling in the SINR model;Journal of Combinatorial Optimization;2015-04-18