TY - GEN
T1 - Brief announcement
T2 - 25th International Symposium on Distributed Computing, DISC 2011
AU - Farach-Colton, Martín
AU - Fernández Anta, Antonio
AU - Milani, Alessia
AU - Mosteiro, Miguel A.
AU - Zaks, Shmuel
N1 - Funding Information:
We thank Seth Gilbert for triggering the development of this work asking a question at DISC 2010. This research was partially supported by Spanish MICINN grant TIN2008-06735-C02-01, Comunidad de Madrid grant S2009TIC-1692, the National Science Foundation CCF-0937829 and by the ANR-project “ALADDIN”.
PY - 2011
Y1 - 2011
N2 - In the context of Mobile Ad-hoc Networks (MANET), we study the problem of disseminating a piece of information, initially held by a source node, to some subset of nodes. We use a model of MANETs that is well suited for dynamic networks and opportunistic communication. We assume that network nodes are placed in a plane where they can move with bounded speed; they may start, crash and recover at different times; and they communicate in a collision-prone single channel. In this setup informed and uninformed nodes may be disconnected for some time, but eventually some informed-uninformed pair must be connected long enough to communicate. We show negative and positive results for different types of randomized protocols, and we contrast them with our previous deterministic results.
AB - In the context of Mobile Ad-hoc Networks (MANET), we study the problem of disseminating a piece of information, initially held by a source node, to some subset of nodes. We use a model of MANETs that is well suited for dynamic networks and opportunistic communication. We assume that network nodes are placed in a plane where they can move with bounded speed; they may start, crash and recover at different times; and they communicate in a collision-prone single channel. In this setup informed and uninformed nodes may be disconnected for some time, but eventually some informed-uninformed pair must be connected long enough to communicate. We show negative and positive results for different types of randomized protocols, and we contrast them with our previous deterministic results.
UR - http://www.scopus.com/inward/record.url?scp=80055038959&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=80055038959&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-24100-0_19
DO - 10.1007/978-3-642-24100-0_19
M3 - Conference contribution
AN - SCOPUS:80055038959
SN - 9783642240997
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 202
EP - 204
BT - Distributed Computing - 25th International Symposium, DISC 2011, Proceedings
Y2 - 20 September 2011 through 22 September 2011
ER -