拓扑控制的局部逼近方法
Local Approximation Schemes for Topology Control
摘要：
本文提出了一种无线ad-hoc网络的分布式算法，该算法以网络规模的多对数轮数运行，并对任意给定的ε> 0构造了一个线性规模的轻量级（1+ε）-ε。用d维α-准单位球图（α-UBG）对无线网络进行建模，α-UBG是标准单位盘图（UDG）模型的高维推广. d维α-UBG模型超越了UDG不切实际的“平坦世界”假设，并考虑了传输误差、衰落信号强度和物理障碍。本文的主要结果是：对于任意固定的ε> 0，0 < α \le 1，\ge 2，存在一个在n节点d维α-UBG G上运行的O（\log n \log^* n）通信轮的分布式算法，该算法计算G的一个（1+ε）-子G'，其最大度Δ（G'）= O（1），总重量w（G '）= O（w（MST（G））.这一结果的动机是在无线ad-hoc网络的拓扑控制问题，并改善现有的拓扑控制算法沿几个维度。该文件的技术贡献包括一个新的，顺序的，贪心算法与宽松的边缘排序和懒惰的更新，和聚类技术过滤掉不必要的边缘。
英文摘要：
This paper presents a distributed algorithm on wireless ad-hoc networks that runs in polylogarithmic number of rounds in the size of the network and constructs a linear size, lightweight, (1+ε)-spanner for any given ε> 0. A wireless network is modeled by a d-dimensional α-quasi unit ball graph (α-UBG), which is a higher dimensional generalization of the standard unit disk graph (UDG) model. The d-dimensional α-UBG model goes beyond the unrealistic ``flat world'' assumption of UDGs and also takes into account transmission errors, fading signal strength, and physical obstructions. The main result in the paper is this: for any fixed ε> 0, 0 < α\le 1, and d \ge 2, there is a distributed algorithm running in O(\log n \log^* n) communication rounds on an n-node, d-dimensional α-UBG G that computes a (1+ε)-spanner G' of G with maximum degree Δ(G') = O(1) and total weight w(G') = O(w(MST(G)). This result is motivated by the topology control problem in wireless ad-hoc networks and improves on existing topology control algorithms along several dimensions. The technical contributions of the paper include a new, sequential, greedy algorithm with relaxed edge ordering and lazy updating, and clustering techniques for filtering out unnecessary edges.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
