An online distributed gossiping protocol for mobile networks

Zhengnan Shi and Pradip K. Srimani ()
Additional contact information
Zhengnan Shi: Clemson University
Pradip K. Srimani: Clemson University

Journal of Combinatorial Optimization, 2006, vol. 11, issue 1, No 7, 87-97

Abstract: Abstract Gossiping in a communication network has long been studied as a combinatorial optimization problem in graphs under many different objective functions and communication models. In this paper, we propose a new online distributed gossiping protocol in the multicasting communication environment, where each node knows only its immediate neighbors. We show that the protocol can tolerate multiple node and link faults, mobility of nodes in the network (as long as the network remains connected) and it is more efficient than the a recently proposed protocol.

Keywords: Distributed computing; Fault tolerance; Mobile ad hoc networks; Online gossiping protocol (search for similar items in EconPapers)
Date: 2006
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-006-5979-6 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:11:y:2006:i:1:d:10.1007_s10878-006-5979-6

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-006-5979-6

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().