In the ad-hoc radio network model, nodes communicate with their neighbors via radio signals, without knowing the topology of the underlying digraph. We study the information gathering problem, where each node has a piece of information called a rumor, and the objective is to transmit all rumors to the designated target node. For the model without any collision detection we provide an $\tilde{O}(n^{1.5})$ deterministic protocol, significantly improving the trivial bound of $O(n^2)$. We also consider a model with a mild form of collision detection, where a node receives a 1-bit acknowledgment if its transmission was received by at least one out-neighbor. For this model we give an $\tilde{O}(n)$ deterministic protocol for information gathering in acyclic graphs.

在 ad-hoc 无线电网络模型中，节点通过无线电信号与其邻居进行通信，而无需知道底层有向图的拓扑结构。我们研究信息收集问题，其中每个节点都有一条信息称为谣言，目标是将所有谣言传输到指定的目标节点。对于没有任何碰撞检测的模型，我们提供了一个$\stackrel{～}{哦}(n^{1.5})$ 确定性协议，显着提高了 $哦(n^2)$. 我们还考虑了一种具有温和形式的冲突检测的模型，如果节点的传输被至少一个外部邻居接收到，则该节点会收到 1 位确认。对于这个模型，我们给出$\stackrel{～}{哦}(n)$ 用于非循环图中信息收集的确定性协议。