A Systematic Study Of Maximal Scheduling Algorithms In Multiradio Multichannel Wireless Networks

Basic infomation
Authors: Yu ChengHongkun LiDevu Manikantan ShilaXianghui Cao
Published in: IEEE/ACM Transactions On Networking
Year: 2015   
DOI: 10.1109/TNET.2014.2324976
Citations: 1
the greedy maximal scheduling \( gms \) and maximal scheduling \( ms \) algorithms are well known low complexity scheduling policies with guaranteed capacity region in the context of single radio single channel \( sr sc \) wireless networks however , how to design maximal scheduling algorithms for multiradio multichannel \( mr mc \) wireless networks and the associated capacity analysis are not well understood yet in this paper , we develop a new model by transforming an mr mc network node to multiple node radio channel \( nrc \) tuples such a framework facilitates the derivation of a tuple based back pressure algorithm for throughput optimal control in mr mc wireless networks and enables the tuple based gms and ms scheduling as low complexity approximation algorithms with guaranteed performance an important existing work on gms and ms for mr mc networks is that of lin and rasool \( ieee acm trans networking , vol 17 , no 6 , 1874 1887 , dec 2009 \) , where link based algorithms are developed compared to the link based algorithms , the tuple based modeling has significant advantages in enabling a fully decomposable cross layer control framework another theoretical contribution in this paper is that we , for the first time , extend the local pooling factor analysis to study the capacity efficiency ratio of the tuple based gms in mr mc networks and obtain a lower bound that is much tighter than those known in the literature moreover , we analyze the communications and computation overhead in implementing the distributed ms algorithm and present simulation results to demonstrate the performance of the tuple based maximal scheduling algorithms
Popular Words:

Write Comments

There is no comment yet.