构造不可靠无线电网络的下界
Lower Bounds for Structuring Unreliable Radio Networks
摘要:
在本文中,我们研究随机解的最大独立集(MIS)和连接支配集(CDS)问题的无线电网络的对偶图模型-一个推广的标准的基于图的模型,现在包括不可靠的链路控制的对手。我们首先证明,需要对网络拓扑的自然地理约束来有效地解决这些问题(即,在时间上,网络大小是多对数的)。然后,我们证明的重要性的假设,即节点提供提前知道他们的可靠邻居(即,邻居连接的可靠链路)。结合起来,这些结果通过证明[Censor-Hillel,PODC 2011]中的有效MIS和CDS算法在其对偶图模型假设方面是最优的来回答一个悬而未决的问题。它们还提供了对不可靠网络的哪些属性能够实现高效本地计算的洞察。
英文摘要:
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 solve these problems efficiently (i.e., in time polylogarthmic in the network size). We then prove the importance of the assumption that nodes are provided advance knowledge of their reliable neighbors (i.e, neighbors connected by reliable links). Combined, these results answer an open question by proving that the efficient MIS and CDS algorithms from [Censor-Hillel, PODC 2011] are optimal with respect to their dual graph model assumptions. They also provide insight into what properties of an unreliable network enable efficient local computation.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。