优秀论文翻译.docVIP

Fewest Repeaters for a Circular Area: Iterative Extremal Optimization Based on Voronoi Diagrams 一个圆形区域内的最少中继器：基于泰森多边形法图迭代极值优化 Abstract We propose a two-tiered network in which lower-power users communicate with one another through repeaters, which amplify signals and retransmit them, have limited capacity, and may interfere with one another if their transmitter frequencies are close and they share the same private-line tone. 摘要 我们提出一个用户通过中继器彼此交流功耗更低的双层网络,它放大信号和重新发送的能力有限,如果他们发射机频率接近，可能会互相干扰,于是让它们共享相同的专线基调。 Our objective is the fewest repeaters so that either every user is covered by at least one repeater or else every user can communicate with any other user anywhere in the considered area. 我们的目标是最少的中继器使得每个用户至少被一个中继器所覆盖,否则每个用户可以与在考虑区域内的其他任何用户通信。 Motivated by cellular networks, we give a na¨?ve solution where the number of repeaters and their positions can be obtained analytically. In a circular area with radius 40 miles, 12 repeaters can accommodate 1,000 simultaneous users 基于蜂窝网络,我们给出一个能够确定中继站的数量和位置的方案。在半径40英里的圆形区域内,12个中继器可以同时容纳1000用户。 We further propose an iterative refinement algorithm consisting of three fundamental modules that draw the Voronoi diagram, determine the centers of the circumscribed circles of the Voronoi regions, and escape the local optimum by using extremal optimization. The algorithm obtains a solution with 11 repeaters, which we prove to be the absolute minimum. For 10,000 users，it uses 104 repeaters, better than the na¨?ve solution’s 108. 我们进一步提出由三个基本模块组成的迭代细化算法,画出泰森多边形法图,确定泰森多边形法的外接圆的中心区域,利用极值优化和逃离最优局部。该算法得到一个使用11个中继器的解决方案,那被证明是最少的。对于10000个用户,它需要104个中继器,比na¨?ve方案需要108个中继器更优。 We further discuss how to assign frequencies and private-line tones (based on maximum and minimum spanning tree techniques), accommodating simultaneous users, the fluctuation of user density in reality, how the landscape can affect repeaters’ locations, and the strengths and weaknesses of the model and the algorithms 我们进一步讨论如何分配频率和专用线音调(基于最大和最小生成树技术),同时适应所有的用户, 在实际上，用户密度