An online distributed gossiping protocol for mobile networks

DOI10.1007/S10878-006-5979-6zbMATH Open1132.90314OpenAlexW2032786813MaRDI QIDQ857763FDOQ857763

Pradip K. Srimani, Zhengnan Shi

Publication date: 5 January 2007

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-006-5979-6

zbMATH Keywords

distributed computingfault tolerancemobile ad hoc networksonline gossiping protocol

Mathematics Subject Classification ID

Communication networks in operations research (90B18)

Cites Work

• A survey of gossiping and broadcasting in communication networks
• Methods and problems of communication in usual networks
• Negotiation-based protocols for disseminating information in wireless sensor networks
• Gossiping in Minimal Time
• Optimal Group Gossiping in Hypercubes under a Circuit-Switching Model

Cited In (3)

• Distributed wireless link scheduling in the SINR model
• Distributed protocols for networks with mobile users -- the Mobilizer approach
• A novel group communication protocol using the RingNet hierarchy in mobile Internet

   Recommendations

• Optimal gossiping in geometric radio networks in the presence of dynamical faults 👍 👎
• Dynamic gossip 👍 👎
• Title not available (Why is that?) 👍 👎
• Sub-linear universal spatial gossip protocols 👍 👎
• On Efficient Gossiping in Radio Networks 👍 👎

This page was built for publication: An online distributed gossiping protocol for mobile networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q857763)