无源移动通信对数Space机
Passively Mobile Communicating Logarithmic Space Machines
摘要:
提出了一种新的被动移动无线传感器网络的理论模型。我们称之为PALOMA模型,代表被动移动对数空间机器。主要修改w.r.t.人口协议模型是,现在的代理,而不是自动机,是图灵机,其内存是对数的人口规模n。请注意,新模型仍然很容易实现与当前的技术。我们专注于完整的通信图。我们定义的复杂性类PLM,由所有对称谓词的输入分配,是稳定计算的PALOMA模型。我们假设这些代理最初是相同的。令人惊讶的是,事实证明,PALOMA模型可以为代理分配唯一的连续ID,并通知他们人口规模!这使我们能够直接模拟O(nlogn)空间的确定性图灵机,从而建立SPACE(nlogn)中的任何对称谓词也属于PLM。接下来我们证明PALoma模型可以模拟社区协议模型,从而改进了NSPACE(nlogn)中所有对称谓词的先前下限。更进一步,我们推广了确定性TM的模拟,以证明PALOMA模型可以模拟O(nlogn)空间的非确定性TM。虽然提供了相同的下限,但这里重要的是,现在以直接的方式获得该界限,在这个意义上,它不依赖于指针机对TM的模拟。最后,通过证明O(nlogn)空间的非确定性TM决定了任何语言都可以通过PALOMA模型稳定计算,我们最终得到了PLM的精确表征:它正是NSPACE(nlogn)中所有对称谓词的类。
英文摘要:
We propose a new theoretical model for passively mobile Wireless Sensor Networks. We call it the PALOMA model, standing for PAssively mobile LOgarithmic space MAchines. The main modification w.r.t. the Population Protocol model is that agents now, instead of being automata, are Turing Machines whose memory is logarithmic in the population size n. Note that the new model is still easily implementable with current technology. We focus on complete communication graphs. We define the complexity class PLM, consisting of all symmetric predicates on input assignments that are stably computable by the PALOMA model. We assume that the agents are initially identical. Surprisingly, it turns out that the PALOMA model can assign unique consecutive ids to the agents and inform them of the population size! This allows us to give a direct simulation of a Deterministic Turing Machine of O(nlogn) space, thus, establishing that any symmetric predicate in SPACE(nlogn) also belongs to PLM. We next prove that the PALOMA model can simulate the Community Protocol model, thus, improving the previous lower bound to all symmetric predicates in NSPACE(nlogn). Going one step further, we generalize the simulation of the deterministic TM to prove that the PALOMA model can simulate a Nondeterministic TM of O(nlogn) space. Although providing the same lower bound, the important remark here is that the bound is now obtained in a direct manner, in the sense that it does not depend on the simulation of a TM by a Pointer Machine. Finally, by showing that a Nondeterministic TM of O(nlogn) space decides any language stably computable by the PALOMA model, we end up with an exact characterization for PLM: it is precisely the class of all symmetric predicates in NSPACE(nlogn).
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。