Cart (Loading....) | Create Account
Close category search window
 

Maximal k-Clique Scheduling: A simple algorithm to bound maximal independent graph scheduling

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Sutuntivorakoon, K. ; Dept. of Electr. & Comput. Eng., Rice Univ., Houston, TX, USA ; Aggarwal, V. ; Avestimehr, A.S. ; Sabharwal, A.

In this paper, we study interference networks with local views, where each node only knows the channel gains of h hops around them, leading to mismatched knowledge about the network. For networks with a local view, we propose a new sub-network scheduling called Maximal k-Clique Scheduling (MCS). A key benefit of MCS is that it can be explicitly constructed and hence easier to analyze compared to prior sub- graph schedulers. Our main result is that MCS can be used to bound the performance from above and below of a more complex sub-graph scheduling algorithm, known as Maximal Independent Graph Scheduling (MIGS), which in many cases does not have a known explicit construction.

Published in:

Communication, Control, and Computing (Allerton), 2011 49th Annual Allerton Conference on

Date of Conference:

28-30 Sept. 2011

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.