Opportunistic information dissemination in mobile ad-hoc networks: the profit of global synchrony

Anta, Antonio Fernández; Milani, Alessia; Mosteiro, Miguel A.; Zaks, Shmuel

doi:10.1007/s00446-012-0165-9

Cited by 17 publications

(7 citation statements)

References 45 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It was also observed that random graphs, as used in previous experimental studies [13], reduce the convergence time, and therefore are not a good choice to indicate worst-case behavior. These experiments showed good behavior even for networks that sometimes are disconnected, indicating that more relaxed models of dynamics, such as (α, β)-connectivity [14,15], are worth to study.…”

Section: Previous Workmentioning

confidence: 90%

Polynomial anonymous dynamic distributed computing without a unique leader

Kowalski

Mosteiro

2022

Journal of Computer and System Sciences

Self Cite

View full text Add to dashboard Cite

Counting the number of nodes in Anonymous Dynamic Networks is enticing from an algorithmic perspective: an important computation in a restricted platform with promising applications. Starting with Michail, Chatzigiannakis, and Spirakis [18], a flurry of papers sped up the running time guarantees from doubly-exponential to polynomial [16]. There is a common theme across all those works: a distinguished node is assumed to be present, because Counting cannot be solved deterministically without at least one.In the present work we study challenging questions that naturally follow: how to efficiently count with more than one distinguished node, or how to count without any distinguished node. More importantly, what is the minimal information needed about these distinguished nodes and what is the best we can aim for (count precision, stochastic guarantees, etc.) without any. We present negative and positive results to answer these questions. To the best of our knowledge, this is the first work that addresses them.

show abstract

Section: Previous Workmentioning

confidence: 90%

Polynomial anonymous dynamic distributed computing without a unique leader

Kowalski

Mosteiro

2022

Journal of Computer and System Sciences

Self Cite

View full text Add to dashboard Cite

show abstract

“…These experiments showed good behavior even for networks that sometimes are disconnected, indicating that more relaxed models of dynamics (e.g. [14,15]) are worth studying.…”

Section: Previous Workmentioning

confidence: 90%

Polynomial Anonymous Dynamic Distributed Computing without a Unique Leader

Kowalski¹,

Mosteiro²

2021

Preprint

Self Cite

View full text Add to dashboard Cite

Counting the number of nodes in Anonymous Dynamic Networks is enticing from an algorithmic perspective: an important computation in a restricted platform with promising applications. Starting with Michail, Chatzigiannakis, and Spirakis [19], a flurry of papers sped up the running time guarantees from doubly-exponential to polynomial [16].There is a common theme across all those works: a distinguished node is assumed to be present, because Counting cannot be solved deterministically without at least one.In the present work we study challenging questions that naturally follow: how to efficiently count with more than one distinguished node, or how to count without any distinguished node. More importantly, what is the minimal information needed about these distinguished nodes and what is the best we can aim for (count precision, stochastic guarantees, etc.) without any. We present negative and positive results to answer these questions. To the best of our knowledge, this is the first work that addresses them.

show abstract

“…It was also observed that random graphs, as used in previous experimental studies [12], reduce the convergence time, and therefore are not a good choice to indicate worst-case behavior. These experiments showed good behavior even for networks that sometimes are disconnected, indicating that more relaxed models of dynamics, such as (α, β)-connectivity [13,16], are worth to study. All in all, the experiments in [6] showed that Incremental Counting behaves well in a variety of pessimistic inputs, but not having a proof of what a worst-case input looks like, and being the experiments restricted to a range of values of n far from the expected massive size of an Anonymous Dynamic Network, a theoretical proof of polynomial time remained an open problem even from a practical perspective.…”

Section: Anonymous Dynamic Networkmentioning

confidence: 99%

Polynomial Counting in Anonymous Dynamic Networks with Applications to Anonymous Dynamic Algebraic Computations

Kowalski

Mosteiro

2020

J. ACM

Self Cite

View full text Add to dashboard Cite

Starting with Michail, Chatzigiannakis, and Spirakis work [20], the problem of Counting the number of nodes in Anonymous Dynamic Networks has attracted a lot of attention. The problem is challenging because nodes are indistinguishable (they lack identifiers and execute the same program) and the topology may change arbitrarily from round to round of communication, as long as the network is connected in each round. The problem is central in distributed computing as the number of participants is frequently needed to make important decisions, such as termination, agreement, synchronization, and many others. A variety of algorithms built on top of massdistribution techniques have been presented, analyzed, and also experimentally evaluated; some of them assumed additional knowledge of network characteristics, such as bounded degree or given upper bound on the network size. However, the question of whether Counting can be solved deterministically in sub-exponential time remained open. In this work, we answer this question positively by presenting Methodical Counting, which runs in polynomial time and requires no knowledge of network characteristics. Moreover, we also show how to extend Methodical Counting to compute the sum of input values and more complex functions without extra cost. Our analysis leverages previous work on random walks in evolving graphs, combined with carefully chosen alarms in the algorithm that control the process and its parameters. To the best of our knowledge, our Counting algorithm and its extensions to other algebraic and Boolean functions are the first that can be implemented in practice with worst-case guarantees.

show abstract

Opportunistic information dissemination in mobile ad-hoc networks: the profit of global synchrony

Cited by 17 publications

References 45 publications

Polynomial anonymous dynamic distributed computing without a unique leader

Polynomial anonymous dynamic distributed computing without a unique leader

Polynomial Anonymous Dynamic Distributed Computing without a Unique Leader

Polynomial Counting in Anonymous Dynamic Networks with Applications to Anonymous Dynamic Algebraic Computations

Contact Info

Product

Resources

About