Unreliable failure detectors for reliable distributed systems
Journal of the ACM (JACM)
Performance of multihop wireless networks: shortest path is not enough
ACM SIGCOMM Computer Communication Review
Real-World Experiences with an Interactive Ad Hoc Sensor Network
ICPPW '02 Proceedings of the 2002 International Conference on Parallel Processing Workshops
Ad-hoc networks beyond unit disk graphs
DIALM-POMC '03 Proceedings of the 2003 joint workshop on Foundations of mobile computing
Round Robin is optimal for fault-tolerant broadcasting on wireless networks
Journal of Parallel and Distributed Computing
Initializing newly deployed ad hoc and sensor networks
Proceedings of the 10th annual international conference on Mobile computing and networking
Maximal independent sets in radio networks
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Constant-time distributed dominating set approximation
Distributed Computing
A high-throughput path metric for multi-hop wireless routing
Wireless Networks - Special issue: Selected papers from ACM MobiCom 2003
On accurate measurement of link quality in multi-hop wireless mesh networks
Proceedings of the 12th annual international conference on Mobile computing and networking
The β-factor: measuring wireless link burstiness
Proceedings of the 6th ACM conference on Embedded network sensor systems
Brief announcement: hardness of broadcasting in wireless networks with unreliable communication
Proceedings of the 28th ACM symposium on Principles of distributed computing
Routing stability in static wireless mesh networks
PAM'07 Proceedings of the 8th international conference on Passive and active network measurement
Broadcasting in unreliable radio networks
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Distributed algorithms for coloring and domination in wireless ad hoc networks
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Distributed multiple-message broadcast in wireless ad-hoc networks under the SINR model
SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity
Distributed backbone structure for algorithms in the SINR model of wireless networks
DISC'12 Proceedings of the 26th international conference on Distributed Computing
Bounds on contention management in radio networks
DISC'12 Proceedings of the 26th international conference on Distributed Computing
Maximal independent sets in multichannel radio networks
Proceedings of the 2013 ACM symposium on Principles of distributed computing
The cost of radio network broadcast for different models of unreliable links
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Hi-index | 0.00 |
In this paper we study the problem of building a connected dominating set with constant degree (CCDS) in the dual graph radio network model [4,9,10]. This model includes two types of links: reliable, which always deliver messages, and unreliable, which sometimes fail to deliver messages. Real networks compensate for this differing quality by deploying low-layer detection protocols to filter unreliable from reliable links. With this in mind, we begin by presenting an algorithm that solves the CCDS problem in the dual graph model under the assumption that every process u is provided a local link detector set consisting of every neighbor connected to u by a reliable link. The algorithm solves the CCDS problem in O(Δ\log2 n/b + log3 n) rounds, with high probability, where Δ is the maximum degree in the reliable link graph, n is the network size, and b is an upper bound in bits on the message size. The algorithm works by first building a Maximal Independent Set (MIS) in log3 n time, and then leveraging the local topology knowledge to efficiently connect nearby MIS processes. A natural follow up question is whether the link detector must be perfectly reliable to solve the CCDS problem. With this in mind, we first describe an algorithm that builds a CCDS in O(Δpolylog(n)) time under the assumption of O(1) unreliable links included in each link detector set. We then prove this algorithm to be (almost) tight by showing that the possible inclusion of only a single unreliable link in each process's local link detector set is sufficient to require Ω(Δ) rounds to solve the CCDS problem, regardless of message size. We conclude by discussing how to apply our algorithm in the setting where the topology of reliable and unreliable links can change over time.