arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1910.09882cs.DCq-bio.QM
收藏

Beep模型中的分布式投票

Distributed Voting in Beep Model

Benyamin Ghojogh, Saber Salehkaleybar

摘要:

我们考虑的问题,分布式多选择投票的设置,每个节点可以与它的邻居仅仅通过发送蜂鸣信号。由于其简单性,哔哔声通信模型在不同的应用,如系统生物学和无线传感器网络中具有实际意义。然而,在这种情况下,分配多数表决还没有得到解决。在本文中,我们提出了两个算法,命名为分布式投票与蜂鸣声,以解决这个问题。在第一种算法中,具有相同值的相邻节点形成称为点的集合。之后,具有多数值的点试图腐蚀具有非多数值的点。第二种算法是基于节点之间的成对交互。所提出的算法有一个终止检测程序,以检查是否实现投票。我们建立这些算法的收敛性的理论保证。特别是,我们表明,第一个算法的成功概率往往是一个作为多数的初始投票的百分比增加。对于第二个算法,我们证明了它以很高的概率返回正确的输出。我们的实验表明,该算法是相当不变的网络拓扑结构,初始值的分布,和网络的大小。

英文摘要:

We consider the problem of distributed multi-choice voting in a setting that each node can communicate with its neighbors merely by sending beep signals. Given its simplicity, the beep communication model is of practical importance in different applications such as system biology and wireless sensor networks. Yet, the distributed majority voting has not been resolved in this setting. In this paper, we propose two algorithms, named Distributed Voting with Beeps, to resolve this problem. In the first proposed algorithm, the adjacent nodes having the same value form a set called spot. Afterwards, the spots with majority value try to corrode the spots with non-majority values. The second proposed algorithm is based on pairwise interactions between nodes. The proposed algorithms have a termination detection procedure to check whether voting is achieved. We establish theoretical guarantees for the convergence of these algorithms. In particular, we show that the success probability of the first algorithm tends to one as the percentage of the initial votes in majority increases. For the second algorithm, we show that it returns the correct output with high probability. Our experiments show that the algorithms are fairly invariant to the network topology, initial distribution of values, and network size.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑