窄条和宽条上的齐次广播问题
The Homogeneous Broadcast Problem in Narrow and Wide Strips
摘要:
假设$P$是无线网络中的一组节点,其中每个节点被建模为平面中的点,并且假设$s\in P$是给定的源节点。每个节点$p$可以向单位距离内的所有其他节点发送信息,只要$p$被激活。(同构)广播问题是激活最小数量的节点,使得在所得到的有向通信图中,源$s$可以到达任何其他节点。我们研究的复杂性,经常和跳跃有界的版本的问题(在后者中,$s$必须能够达到指定数量的跳跃内的每个节点),与限制,所有点位于一个带的宽度$w$。我们几乎完全表征的复杂性,作为一个函数的带宽度$w$的定期和跳跃有界的版本。
英文摘要:
Let $P$ be a set of nodes in a wireless network, where each node is modeled as a point in the plane, and let $s\in P$ be a given source node. Each node $p$ can transmit information to all other nodes within unit distance, provided $p$ is activated. The (homogeneous) broadcast problem is to activate a minimum number of nodes such that in the resulting directed communication graph, the source $s$ can reach any other node. We study the complexity of the regular and the hop-bounded version of the problem (in the latter, $s$ must be able to reach every node within a specified number of hops), with the restriction that all points lie inside a strip of width $w$. We almost completely characterize the complexity of both the regular and the hop-bounded versions as a function of the strip width $w$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。