arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1208.5738cs.NIcs.DS
收藏

无线网络中支配集的高效构造

Efficient Construction of Dominating Set in Wireless Networks

Xiaohua Xu, Xiang-Yang Li

摘要:

考虑由图建模的无线网络的通信拓扑,其中如果两个节点在彼此的通信范围内,则在两个节点之间存在边。如果每个节点在$U$中或与$U$中的某个节点相邻,则节点的子集$U$是支配集。假设每个节点有一个不同的通信范围,并与一个积极的权重,我们提出了一个随机算法来找到一个最小权支配集。如果节点$v$位于$u$的通信范围内,则考虑存在弧$\overrightarrow{uv}$的图的任何方向。一个节点子集$U$是一个强支配集,如果除了$U$之外的每个节点在$U$中都有内邻居和外邻居。我们提出了一个多项式时间算法,以找到一个强支配集集的大小最多$(2+ε)$倍的最佳。我们还调查了另一个相关问题,称为$K$ -Coverage。给定具有正权重的盘的集合${\cal D}$和节点的集合${\cal P}$。假设所有输入节点位于平面中的水平线$l$之下,并且所有输入盘位于该线$l$之上。目标是找到磁盘的最小权重子集${\cal D}'\subseteq {\cal D}$,使得每个节点至少覆盖${\cal D}'$中的$K$磁盘。我们提出了一个新的两个近似算法来解决这个问题.

英文摘要:

Considering a communication topology of a wireless network modeled by a graph where an edge exists between two nodes if they are within each other's communication range. A subset $U$ of nodes is a dominating set if each node is either in $U$ or adjacent to some node in $U$. Assume each node has a disparate communication range and is associated with a positive weight, we present a randomized algorithm to find a min-weight dominating set. Considering any orientation of the graph where an arc $\overrightarrow{uv}$ exists if the node $v$ lies in $u$'s communication range. A subset $U$ of nodes is a strongly dominating set if every node except $U$ has both in-neighbor(s) and out-neighbor(s) in $U$. We present a polynomial-time algorithm to find a strongly dominating set of size at most $(2+ε)$ times of the optimum. We also investigate another related problem called $K$-Coverage. Given are a set ${\cal D}$ of disks with positive weight and a set ${\cal P}$ of nodes. Assume all input nodes lie below a horizontal line $l$ and all input disks lie above this line $l$ in the plane. The objective is to find a min-weight subset ${\cal D}'\subseteq {\cal D}$ of disks such that each node is covered at least $K$ disks in ${\cal D}'$. We propose a novel two-approximation algorithm for this problem.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑