无线Ad Hoc网络的确定性数字分簇
Deterministic Digital Clustering of Wireless Ad Hoc Networks
摘要:
我们认为确定性分布式通信在无线自组织网络中相同的弱设备的SINR模型下,没有预定义的基础设施。该模型中的大多数算法结果依赖于各种附加特征或能力,例如,随机化、对地理坐标的访问、功率控制、具有各种测量精度的载波侦听和/或干扰消除。我们研究一个纯粹的情况下,没有这样的属性。作为一个通用的工具,我们开发了一个确定性的分布式聚类算法。我们的解决方案依赖于一种新型的组合结构(选择器),这可能是独立的利益。使用聚类,我们开发了一个确定性的分布式本地广播算法完成这项任务的$O(Δ\log^*N \log N)$轮,其中$Δ$是网络的密度。据我们所知,这是纯场景中的第一个解决方案,它距离通用下限$Ω(Δ)$只有polylog $(n)$,对于具有随机化和其他特征的场景也有效。因此,这些特征中没有一个实质上有助于执行本地广播任务。使用聚类,我们还建立了一个确定性的全球广播算法,终止于$O(D(Δ+ \log^* N) \log N)$轮,其中$D$是网络的直径。该结果由下限$Ω(D Δ^{1-1/α})$补充,其中$α> 2$是环境的路径损耗参数。该下限示出了随机化或自身位置的知识实质上有助于(通过$Δ$中的因子多项式)全局广播。因此,与本地广播的情况不同,一些额外的模型功能可能有助于全局广播。
英文摘要:
We consider deterministic distributed communication in wireless ad hoc networks of identical weak devices under the SINR model without predefined infrastructure. Most algorithmic results in this model rely on various additional features or capabilities, e.g., randomization, access to geographic coordinates, power control, carrier sensing with various precision of measurements, and/or interference cancellation. We study a pure scenario, when no such properties are available. As a general tool, we develop a deterministic distributed clustering algorithm. Our solution relies on a new type of combinatorial structures (selectors), which might be of independent interest. Using the clustering, we develop a deterministic distributed local broadcast algorithm accomplishing this task in $O(Δ\log^*N \log N)$ rounds, where $Δ$ is the density of the network. To the best of our knowledge, this is the first solution in pure scenario which is only polylog$(n)$ away from the universal lower bound $Ω(Δ)$, valid also for scenarios with randomization and other features. Therefore, none of these features substantially helps in performing the local broadcast task. Using clustering, we also build a deterministic global broadcast algorithm that terminates within $O(D(Δ+ \log^* N) \log N)$ rounds, where $D$ is the diameter of the network. This result is complemented by a lower bound $Ω(D Δ^{1-1/α})$, where $α> 2$ is the path-loss parameter of the environment. This lower bound shows that randomization or knowledge of own location substantially help (by a factor polynomial in $Δ$) in the global broadcast. Therefore, unlike in the case of local broadcast, some additional model features may help in global broadcast.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。