This work studies multi-broadcasting for the SINR (Signal-to-Interference-plus-Noise-Ratio) model, assuming a subset of nodes are initially awake, when each device only has access to knowledge about the total number of nodes in the network n, the range from which each node's label is taken $\{1,\dots ,N\}$, and the label of the device itself. We assume no knowledge of the physical coordinates of devices and no knowledge of the neighborhood of each node. We present a deterministic protocol for this problem that runs in $O(n\lg N\lg n)$ rounds. There is no known polytime deterministic algorithm for this setting. A lower bound of $\mathrm{\Omega }(n\lg N)$ rounds is known for deterministic broadcasting without local knowledge [30]. We also present algorithms to achieve multi-broadcast in $O(n\lg N)$ rounds and create a backbone in $O(n\lg N)$ rounds, assuming that all nodes are initially awake.

这项工作研究了SINR（信号与干扰加噪声比）模型的多播，假设节点的子集最初处于唤醒状态，而每个设备只能访问有关网络中节点总数的知识n，取每个节点标签的范围$\{\mathrm{1个}，\dots ，ñ\}$，以及设备本身的标签。我们假设不了解设备的物理坐标，也不了解每个节点的邻域。我们提供了针对此问题的确定性协议，该协议在$Ø（ñ\lg ñ\lg ñ）$回合。此设置没有已知的多时确定性算法。下界$\mathrm{\Omega }（ñ\lg ñ）$回合以无本地知识的确定性广播而闻名[30]。我们还介绍了实现以下目标的多播算法$Ø（ñ\lg ñ）$ 回合并在 $Ø（ñ\lg ñ）$ 回合，假设所有节点最初都处于唤醒状态。