We consider wireless networks operating under the SINR model of interference. Nodes have limited individual knowledge and capabilities: they do not know their positions in a coordinate system in the plane, further they do not know their neighborhoods, nor do they know the size of the network n, and finally they cannot sense collisions resulting from simultaneous transmissions by at least two neighbors. Each node is equipped with a unique integer name, where N as an upper bound on the a range of names. We refer as a backbone to a subnetwork induced by a diameter-preserving dominating set of nodes. Let \(\Delta \) denote a maximum number of nodes that can successfully receive a message transmitted by a node when no other nodes transmit concurrently. We study distributed algorithms for communication problems in three settings. In the single-node-start case, when one node starts an execution and other nodes are awoken by receiving messages from already awoken nodes, we present a randomized broadcast algorithm that wakes up all nodes in \(\mathcal {O}(n \log ^2 N)\) rounds with high probability. For the synchronized-start case, when all nodes start an execution simultaneously, we give a randomized algorithm computing a backbone in \(\mathcal {O}(\Delta \log ^{7} N)\) rounds with high probability. In the partly-coordinated-start case, when a number of nodes start an execution together and other nodes are awoken by receiving messages from the already awoken nodes, we develop an algorithm that creates a backbone in time \(\mathcal {O}(n\log ^2 N +\Delta \log ^{7} N)\) with high probability

我们考虑在干扰的 SINR 模型下运行的无线网络。节点的个体知识和能力有限：它们不知道它们在平面坐标系中的位置，更不知道它们的邻域，也不知道网络的大小n，最后它们无法感知同时产生的碰撞至少两个邻居的传输。每个节点都配备了一个唯一的整数名称，其中N作为名称范围的上限。我们将主干称为由保持直径的主导节点集诱导的子网。让\(\Delta \)表示当没有其他节点同时发送时，可以成功接收一个节点发送的消息的最大节点数。我们研究了三种环境下通信问题的分布式算法。在单节点启动的情况下，当一个节点开始执行并且其他节点通过接收来自已唤醒节点的消息而被唤醒时，我们提出了一种随机广播算法，该算法唤醒\(\mathcal {O}(n \以高概率记录 ^2 N)\)轮。对于同步启动的情况，当所有节点同时开始执行时，我们给出了一个随机算法，计算\(\mathcal {O}(\Delta \log ^{7} N)\)高概率回合。在部分协调启动的情况下，当多个节点一起开始执行并且其他节点通过接收来自已唤醒节点的消息而被唤醒时，我们开发了一种算法来及时创建主干\(\mathcal {O}( n\log ^2 N +\Delta \log ^{7} N)\)概率很高