论文部分内容阅读
在多跳中继的Wi Max Mesh网络中,当发送功率和信道带宽为定值时,用户接入链路的速率取决于用户到中继的距离,对于接入层中继位置的设计可以提高整个网络的吞吐量和进行无视距通信(Non Line Of Sight,NLOS)具有重要的意义。本文将该问题转化为空间最少簇的问题,算法首先根据用户位置的信息来划分出每个单个簇,然后在每个单个簇中生成符合的覆盖圆,寻找覆盖圆的圆心,得出中继的位置。模拟实验结果表明,与该问题已有算法MIS相比本文算法部署的中继的个数减少了51%,与算法HS相比减少了23%。通过使用较少的中继,本文算法较好地保证了网络的性能、提高了网络用户吞吐量。
In multi-hop relayed Wi Max Mesh networks, when the transmit power and channel bandwidth are fixed, the rate at which the user accesses the link depends on the user-to-relay distance and the design of the access layer relay position can be improved The throughput of the entire network and the Non Line Of Sight (NLOS) are of great importance. In this paper, the problem is transformed into the least-space cluster problem. The algorithm first divides each single cluster according to the information of the user’s location, and then generates a coincidence coverage circle in each single cluster, finds the center of the coverage circle, and obtains the relay s position. Simulation results show that compared with MIS, the proposed algorithm reduces the number of relays deployed by the algorithm by 51% and decreases by 23% compared with the algorithm HS. By using fewer relays, the proposed algorithm better guarantees network performance and improves network user throughput.