2017/01/31 by Dimitrios J. Vergados, Natalia Amelina, Vergados, Dimitrios J. +7
Computer Science · Engineering · #Advanced Wireless Network Optimization #Cooperative Communication and Network Coding #FOS: Computer and information sciences #Mobile Ad Hoc Networks #Networking and Internet Architecture (cs.NI) #Wireless Networks and Protocols
paper · pdf · doi:10.48550/arxiv.1701.09010
openalex publication_date 2017/01/31 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In a multihop wireless network, it is crucial but challenging to schedule\ntransmissions in an efficient and fair manner. In this paper, a novel\ndistributed node scheduling algorithm, called Local Voting, is proposed. This\nalgorithm tries to semi-equalize the load (defined as the ratio of the queue\nlength over the number of allocated slots) through slot reallocation based on\nlocal information exchange. The algorithm stems from the finding that the\nshortest delivery time or delay is obtained when the load is semi-equalized\nthroughout the network. In addition, we prove that, with Local Voting, the\nnetwork system converges asymptotically towards the optimal scheduling.\nMoreover, through extensive simulations, the performance of Local Voting is\nfurther investigated in comparison with several representative scheduling\nalgorithms from the literature. Simulation results show that the proposed\nalgorithm achieves better performance than the other distributed algorithms in\nterms of average delay, maximum delay, and fairness. Despite being distributed,\nthe performance of Local Voting is also found to be very close to a centralized\nalgorithm that is deemed to have the optimal performance.\n