无线通信中的功率分配问题
Power Assignment Problems in Wireless Communication
摘要:
无线通信中的一类基本问题涉及向无线设备/站分配合适的传输功率,使得所得到的通信图满足某些期望的属性并且使消耗的总能量最小化。无线网络中的许多具体通信任务,如广播、多播、点对点路由、通信骨干网的创建等,可以被视为这样的功率分配问题。本文考虑了几个问题的那种,例如一个问题之前研究的\cite{Carrots, Bilo}的目的是选择和分配权力的$k$的站,使所有其他站的范围内的至少一个选定的站。我们改进的运行时间获得$(1+ε)$ -近似的解决方案,这个问题从$n^{((α/ε)^{O(d)})}$报告的Bilo等人。(\cite{Bilo})到$O(n+ {(\frac{k^{2d+1}}{ε^d})}^{\min{\{2k, (α/ε)^{O(d)} \}}})$,也就是说,我们获得的运行时间是\emph{linear}的网络大小。进一步的结果包括一个常数近似算法的TSP问题下平方(非度量!)边缘成本,其可用于实现新颖的数据聚合协议,以及执行$k$跳多播的有效方案。
英文摘要:
A fundamental class of problems in wireless communication is concerned with the assignment of suitable transmission powers to wireless devices/stations such that the resulting communication graph satisfies certain desired properties and the overall energy consumed is minimized. Many concrete communication tasks in a wireless network like broadcast, multicast, point-to-point routing, creation of a communication backbone, etc. can be regarded as such a power assignment problem. This paper considers several problems of that kind; for example one problem studied before in \cite{Carrots, Bilo} aims to select and assign powers to $k$ of the stations such that all other stations are within reach of at least one of the selected stations. We improve the running time for obtaining a $(1+ε)$-approximate solution for this problem from $n^{((α/ε)^{O(d)})}$ as reported by Bilo et al. (\cite{Bilo}) to $O(n+ {(\frac{k^{2d+1}}{ε^d})}^{\min{\{2k, (α/ε)^{O(d)} \}}})$ that is, we obtain a running time that is \emph{linear} in the network size. Further results include a constant approximation algorithm for the TSP problem under squared (non-metric!) edge costs, which can be employed to implement a novel data aggregation protocol, as well as efficient schemes to perform $k$-hop multicasts.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。