Keren Censor-Hillel
Nancy Lynch
ABSTRACT
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.
- M. Abusubaih. A New Approach for Interference Measurement in 802.11 WLANs. In Proceedings of the International Symposium on Personal Indoor and Mobile Radio Communications, 2010.Google Scholar
- D. Aguayo, J. Bicket, S. Biswas, R. Morris, B. Chambers, and D. De Couto. MIT Roofnet. In Proceedings of the International Conference on Mobile Computing and Networking, 2003.Google Scholar
- T. D. Chandra and S. Toueg. Unreliable failure detectors for reliable distributed systems. Journal of the ACM, 43(2):225--267, 1996. Google ScholarDigital Library
- A. Clementi, A. Monti, and R. Silvestri. Round robin is optimal for fault-tolerant broadcasting on wireless networks. Journal of Parallel Distributed Computing, 64:89--96, 2004. Google ScholarDigital Library
- D. De Couto, D. Aguayo, J. Bicket, and R. Morris. A High-Throughput Path Metric for Multi-Hop Wireless Routing. Wireless Networks, 11(4):419--434, 2005. Google ScholarDigital Library
- D. De Couto, D. Aguayo, B. Chambers, and R. Morris. Performance of Multihop Wireless Networks: Shortest Path is Not Enough. ACM SIGCOMM Computer Communication Review, 33(1):83--88, 2003. Google ScholarDigital Library
- K. Kim and K. Shin. On Accurate Measurement of Link Quality in Multi-Hop Wireless Mesh Networks. In Proceedings of the Annual International Conference on Mobile Computing and Networking, 2006. Google ScholarDigital Library
- F. Kuhn. The Price of Locality: Exploring the Complexity of Distributed Coordination Primitives. PhD thesis, ETH Zurich, 2005.Google Scholar
- F. Kuhn, N. Lynch, and C. Newport. Brief Announcement: Hardness of Broadcasting in Wireless Networks with Unreliable Communication. In Proceedings of the International Symposium on Principles of Distributed Computing, 2009. Google ScholarDigital Library
- F. Kuhn, N. Lynch, C. Newport, R. Oshman, and A. Richa. Broadcasting in Unreliable Radio Networks. In Proceedings of the International Symposium on Principles of Distributed Computing, 2010. Google ScholarDigital Library
- F. Kuhn, T. Moscibroda, and R. Wattenhofer. Initializing Newly Deployed Ad Hoc and Sensor Networks. In Proceedings of the Annual International Conference on Mobile Computing and Networking, 2004. Google ScholarDigital Library
- F. Kuhn and R. Wattenhofer. Constant-Time Distributed Dominating Set Approximation. Distributed Computing, 17(4):303--310, 2005. Google ScholarDigital Library
- F. Kuhn and A. Zollinger. Ad-Hoc Networks Beyond Unit Disk Graphs. In Proceedings of the Workshop on the Foundations of Mobile Computing, 2003. Google ScholarDigital Library
- T. Moscibroda and R. Wattenhofer. Maximal independent sets in radio networks. In Proceedings of the International Symposium on Principles of Distributed Computing, 2005. Google ScholarDigital Library
- S. Parthasarathy and R. Gandhi. Distributed Algorithms for Coloring and Domination in Wireless Ad Hoc Networks. In Proceedings of the Conference on the Foundations of Software Technology and Theoretical Computer Science, 2005. Google ScholarDigital Library
- K. Ramachandran, I. Sheriff, E. Belding, and K. Almeroth. Routing Stability in Static Wireless Mesh Networks. Passive and Active Network Measurement, pages 73--82, 2007. Google ScholarDigital Library
- J. Schneider. Personal Communication, ETH Zurich, Jan. 2011.Google Scholar
- K. Srinivasan, M. Kazandjieva, S. Agarwal, and P. Levis. The β-Factor: Measuring Wireless Link Burstiness. In Proceedings of the Conference on Embedded Networked Sensor System, 2008. Google ScholarDigital Library
- P. Wan, K. Alzoubi, and O. Frieder. Distributed Construction of Connected Dominating Sets in Wireless Ad Hoc Networks. In Proceedings of the IEEE Conference on Computer Communnications, 2002.Google Scholar
- M. Yarvis, W. Conner, L. Krishnamurthy, J. Chhabra, B. Elliott, and A. Mainwaring. Real-World Experiences with an Interactive Ad Hoc Sensor Network. In Proceedings of the International Conference of Parallel Processing, 2002. Google ScholarDigital Library
Index Terms
- Structuring unreliable radio networks
Recommendations
Broadcasting in unreliable radio networks
PODC '10: Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computingPractitioners agree that unreliable links, which sometimes deliver messages and sometime do not, are an important characteristic of wireless networks. In contrast, most theoretical models of radio networks fix a static set of links and assume that these ...
Structuring unreliable radio networks
In this paper we study the problem of building a constant-degree connected dominating set (CCDS), a network structure that can be used as a communication backbone, in the dual graph radio network model (Clementi et al. in J Parallel Distrib Comput 64:89-...
On the dualization of hypergraphs with bounded edge-intersections and other related classes of hypergraphs
Given a finite set V , and integers k ý1 and r ý0, let us denote by the class of hypergraphs with ( k,r )-bounded intersections, i.e. in which the intersection of any k distinct hyperedges has size at most r . We consider the problem : given a ...
Comments