An online distributed gossiping protocol for mobile networks

DOI10.1007/S10878-006-5979-6MaRDI QIDQ857763zbMATH OpenOpenAlexFDO

Authors Zhengnan Shi, Pradip K. Srimani

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)

Recommendations

• Optimal gossiping in geometric radio networks in the presence of dynamical faults
• Dynamic gossip
• Gossip in dynamic networks
• Sub-linear universal spatial gossip protocols
• On Efficient Gossiping in Radio Networks

Cites work

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

Cited in

(7)

• A probabilistic characterization of a fault-tolerant gossiping algorithm
• Distributed wireless link scheduling in the SINR model
• Distributed protocols for networks with mobile users -- the Mobilizer approach
• Tolerating malicious gossip
• A novel group communication protocol using the RingNet hierarchy in mobile Internet
• An analytical model of information dissemination for a gossip-based protocol
• Optimal Moves for Gossiping Among Mobile Agents

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)