Tuning Up the Performance of Constant-Time Distributed Scheduling Algorithms via Majorization

— Scheduling algorithms assign contention probability for each link in Wireless Ad Hoc Networks and plays a key role in deciding the system performance. Recently, many lowcost distributed scheduling algorithms are proposed. In this paper, we propose to improve the performance of a class of distributed collision-based scheduling algorithms, called constanttime distributed scheduling algorithms, by exploring the advantage brought by the unevenness of links’ contention probabilities. Specifically, we prove that there exists ordering relationship for the success probability of any neighborhood when the contention probability vectors are ordered in the sense of majorization. We show how to modify the existing algorithms so as to find a new contention probability vector that majorizes the original one in a distributed manner. Our simulation results indicate that by using our modified algorithms, the average queue-lengths of a stable system can be reduced by 25% to 50%, while keeping t...

• Type: Conference
• Year: 2008
• Where: ICC
• Authors: Han Cai, Do Young Eun
• Keywords: Communications, Contention Probability, Contention Probability Vector, ICC 2008, Scheduling Algorithms