arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1012.2440cs.CCcs.DC
收藏

使用受限空间的被动移动通信机器

Passively Mobile Communicating Machines that Use Restricted Space

Ioannis Chatzigiannakis, Othon Michail, Stavros Nikolaou, Andreas Pavlogiannis, Paul G. Spirakis

摘要:

我们提出了一个新的被动移动无线传感器网络的理论模型,称为PM,代表被动移动机器。主要修改w.r.t.人口协议模型是,代理人现在不是自动机,而是图灵机。我们提供了一般的定义无界的记忆,但我们主要感兴趣的计算上限的似是而非的空间限制。然而,我们证明了我们的结果适用于更一般的情况。我们专注于完整的通信图和定义的复杂性类PMSPACE(f(n))参数化,由所有谓词,是稳定的可计算的一些PM协议,使用O(f(n))的每个代理内存。我们提供了一个协议,该协议仅使用O(log n)内存从头开始生成唯一的id,并使用它来提供当f(n)=Ω(log n)时PMSPACE(f(n))类的精确特征:它们正是NSPACE(nf(n))中所有对称谓词的类。通过这种方式,我们提供了一个空间层次的PM模型时,内存边界是Ω(log n)。最后,我们探讨了PM模型的可计算性时,协议使用o(loglog n)空间每台机器,并证明了SEMILINEAR=PMSPACE(f(n))时,f(n)=o(loglog n),其中SEMILINEAR表示类的半线性谓词。事实上,我们证明了这个界限作为一个阈值,所以当f(n)=O(loglog n)时,SEMILINEAR是PMSPACE(f(n))的真子集。

英文摘要:

We propose a new theoretical model for passively mobile Wireless Sensor Networks, called PM, standing for Passively mobile Machines. The main modification w.r.t. the Population Protocol model is that agents now, instead of being automata, are Turing Machines. We provide general definitions for unbounded memories, but we are mainly interested in computations upper-bounded by plausible space limitations. However, we prove that our results hold for more general cases. We focus on complete communication graphs and define the complexity classes PMSPACE(f(n)) parametrically, consisting of all predicates that are stably computable by some PM protocol that uses O(f(n)) memory on each agent. We provide a protocol that generates unique ids from scratch only by using O(log n) memory, and use it to provide an exact characterization for the classes PMSPACE(f(n)) when f(n)=Ω(log n): they are precisely the classes of all symmetric predicates in NSPACE(nf(n)). In this way, we provide a space hierarchy for the PM model when the memory bounds are Ω(log n). Finally, we explore the computability of the PM model when the protocols use o(loglog n) space per machine and prove that SEMILINEAR=PMSPACE(f(n)) when f(n)=o(loglog n), where SEMILINEAR denotes the class of the semilinear predicates. In fact, we prove that this bound acts as a threshold, so that SEMILINEAR is a proper subset of PMSPACE(f(n)) when f(n)=O(loglog n).

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

↑