By Topic

On the throughput-optimal distributed scheduling schemes with delay analysis in multi-hop wireless networks

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

2 Author(s)
Tran, N.H. ; Dept. of Comput. Eng., Kyung Hee Univ., Yongin, South Korea ; Choong Seon Hong

With K-hop interference model, especially when K ≥ 2, the throughput-optimal centralized scheduler needs to solve a NP-Hard problem. It leads to the desire of a distributed, low-complexity but throughput-optimal scheduling algorithm. We generalize a randomized scheduling framework for a K-hop interference model and develop two randomized distributed scheduling algorithms which can be integrated into this framework. The delay performance of our scheme is also characterized.

Published in:

Network Operations and Management Symposium Workshops (NOMS Wksps), 2010 IEEE/IFIP

Date of Conference:

19-23 April 2010