منابع مشابه
Lower Bounds for Structuring Unreliable Radio Networks
In this paper, we study lower bounds for randomized solutions to the maximal independent set (MIS) and connected dominating set (CDS) problems in the dual graph model of radio networks—a generalization of the standard graph-based model that now includes unreliable links controlled by an adversary. We begin by proving that a natural geographic constraint on the network topology is required to so...
متن کاملLeader Election in Unreliable Radio Networks
The dual graph model describes a radio network that contains both reliable and unreliable links. In recent years, this model has received significant attention by the distributed algorithms community [1,4,8–10,12,14,16]. Due to results in [10], it is known that leader election plays a key role in enabling efficient computation in this difficult setting: a leader can synchronize the network in s...
متن کاملFast Structuring of Radio Networks for Multi-Message Communications
We introduce collision free layerings as a powerful way to structure distributed radio networks. These layerings can replace hard-to-compute BFS-trees in many contexts while having an efficient randomized construction. We demonstrate their versatility by using them to provide near optimal distributed algorithms for several multi-message communication primitives. Designing efficient communicatio...
متن کاملFast Structuring of Radio Networks Large for Multi-message Communications
We introduce collision free layerings as a powerful way to structure radio networks. These layerings can replace hard-to-compute BFS-trees in many contexts while having an efficient randomized distributed construction. We demonstrate their versatility by using them to provide near optimal distributed algorithms for several multi-message communication primitives. Designing efficient communicatio...
متن کاملDistributed computation on unreliable radio channels
An important topic in wireless networking is the development of reliable algorithms for environments suffering from adversarial interference. This term captures any type of channel disruption outside the control of the algorithm designer—from contention with unrelated devices to malicious jamming. In this thesis, we provide four contributions toward a comprehensive theoretical treatment of this...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Distributed Computing
سال: 2013
ISSN: 0178-2770,1432-0452
DOI: 10.1007/s00446-013-0198-8