大规模多跳网络中的自组织均衡路由机制
Self-Organization Scheme for Balanced Routing in Large-Scale Multi-Hop Networks
摘要：
我们提出了一个自组织计划的成本效益和负载平衡的多跳网络路由。为了避免超载节点提供有利的路由条件，我们分配给每个节点的成本函数，惩罚高负载。因此，寻找到汇聚节点的路由被公式化为一个优化问题，其中全局目标函数在路由成本和节点负载之间取得平衡。我们应用信念传播（其最小和版本）来解决网络优化问题，并获得一个分布式算法，使节点集体发现全局最优路由，通过执行低复杂度的计算和交换消息与他们的邻居。我们证明了所提出的方法收敛到全局最优后，有限数量的本地交换的消息。最后，我们证明了我们的框架的有效性，在平衡节点负载和研究负载减少和总成本最小化之间的权衡。
英文摘要：
We propose a self-organization scheme for cost-effective and load-balanced routing in multi-hop networks. To avoid overloading nodes that provide favourable routing conditions, we assign each node with a cost function that penalizes high loads. Thus, finding routes to sink nodes is formulated as an optimization problem in which the global objective function strikes a balance between route costs and node loads. We apply belief propagation (its min-sum version) to solve the network optimization problem and obtain a distributed algorithm whereby the nodes collectively discover globally optimal routes by performing low-complexity computations and exchanging messages with their neighbours. We prove that the proposed method converges to the global optimum after a finite number of local exchanges of messages. Finally, we demonstrate numerically our framework's efficacy in balancing the node loads and study the trade-off between load reduction and total cost minimization.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
