无线网络上的最佳传输
Optimal transport on wireless networks
摘要：
我们提出了一个新的启发式算法的一个变种的应用程序的研究，复杂网络上的运输路线的优化问题，找到最佳的无线网络节点之间的通信路线。我们的算法迭代平衡网络流量，最大限度地减少网络上的节点介数。我们考虑的变体通过使用不同的介数度量来具体说明无线通信所施加的广播限制。我们比较我们的算法的性能，其他两个已知的算法，发现我们的算法实现了最高的传输容量最小节点度几何网络，这是有向几何网络模型的无线通信网络，和配置模型网络是不相关的无标度网络。
英文摘要：
We present a study of the application of a variant of a recently introduced heuristic algorithm for the optimization of transport routes on complex networks to the problem of finding the optimal routes of communication between nodes on wireless networks. Our algorithm iteratively balances network traffic by minimizing the maximum node betweenness on the network. The variant we consider specifically accounts for the broadcast restrictions imposed by wireless communication by using a different betweenness measure. We compare the performance of our algorithm to two other known algorithms and find that our algorithm achieves the highest transport capacity both for minimum node degree geometric networks, which are directed geometric networks that model wireless communication networks, and for configuration model networks that are uncorrelated scale-free networks.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
