Abstract
We consider a class of wireless networks with general interference constraints and heterogeneous transmission rates under single-hop traffic. The delay analysis of throughput optimal (queue length based) scheduling policies in such systems is extremely difficult due to complex correlations arising between the arrival, service and the queue length process. We use the underlying interference constraints to obtain a fundamental lower bound on the delay performance of any scheduling scheme for this system. We also present upper bounds for the performance of these networks operating under the well-known maximum weighted matching (MWM) scheduling policy.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
