Local voting: Optimal distributed node scheduling algorithm for multihop wireless networks
Local voting: Optimal distributed node scheduling algorithm for multihop wireless networks
复制标题
本地投票：多跳无线网络的最优分布式节点调度算法
DOI：
--
复制
发表时间：
2017
期刊：
影响因子：
--
通讯作者：
O. Granichin
中科院分区：
文献类型：
--
作者：
D. Vergados;N. Amelina;Yuming Jiang;Katina Kralevska;O. Granichin
高效、公平的节点调度是多跳无线网络中的一大挑战。在这项工作中，我们提出了一种分布式节点调度算法，称为本地投票。这个想法来自于这样的发现：当整个网络的负载均衡时，可以获得最短的传输时间或延迟。仿真结果表明，与文献中的几种代表性调度算法相比，本地投票在平均延迟、最大延迟和公平性方面取得了更好的性能。尽管是分布式的，本地投票的性能非常接近集中式算法，被认为具有最佳性能。
An efficient and fair node scheduling is a big challenge in multihop wireless networks. In this work, we propose a distributed node scheduling algorithm, called Local Voting. The idea comes from the finding that the shortest delivery time or delay is obtained when the load is equalized throughout the network. Simulation results demonstrate that Local Voting achieves better performance in terms of average delay, maximum delay, and fairness compared to several representative scheduling algorithms from the literature. Despite being distributed, Local Voting has a very close performance to a centralized algorithm that is considered to have the optimal performance.