Sciweavers

108 search results - page 4 / 22
» Spreading Messages
Sort
View
ICASSP
2008
IEEE
14 years 2 months ago
Implementation of message-passing algorithms for the acquisition of spreading codes
A new technique to acquire pseudo-noise (PN) sequences has been recently proposed in [1] and [2]. It is based on the paradigm of iterative Message Passing (iMP) to be run on loopy...
Massimo Rovini, Fabio Principe, Luca Fanucci, Marc...
APPROX
2010
Springer
179views Algorithms» more  APPROX 2010»
13 years 9 months ago
Rumor Spreading on Random Regular Graphs and Expanders
Broadcasting algorithms are important building blocks of distributed systems. In this work we investigate the typical performance of the classical and well-studied push model. Assu...
Nikolaos Fountoulakis, Konstantinos Panagiotou
ICALP
2009
Springer
14 years 2 months ago
Quasirandom Rumor Spreading: Expanders, Push vs. Pull, and Robustness
Abstract Randomized rumor spreading is an efficient protocol to distribute information in networks. Recently, a quasirandom version has been proposed and proven to work equally we...
Benjamin Doerr, Tobias Friedrich, Thomas Sauerwald
ICALP
2009
Springer
14 years 7 months ago
Rumor Spreading in Social Networks
Social networks are an interesting class of graphs likely to become of increasing importance in the future, not only theoretically, but also for its probable applications to ad hoc...
Flavio Chierichetti, Silvio Lattanzi, Alessandro P...
ICC
2007
IEEE
186views Communications» more  ICC 2007»
14 years 1 months ago
A Spreading Code MAC Protocol for Multi-Hop Wireless Ad Hoc Networks
— We propose a spreading code medium access control (MAC) protocol with each node equipped with single transceiver for wireless ad hoc networks, based on the code division multip...
Hang Su, Xi Zhang