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

Author

Tran, Nguyen H. ; Hong, Choong Seon

Author_Institution

Dept. of Comput. Eng., Kyung Hee Univ., Yongin, South Korea

fYear

2010

fDate

19-23 April 2010

Firstpage

59

Lastpage

62

Abstract

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.

Keywords

computational complexity; delays; optimisation; radio networks; radiofrequency interference; scheduling; NP-hard problem; delay analysis; k-hop interference model; multihop wireless networks; throughput-optimal distributed scheduling schemes; Delay; Distributed computing; Interference; Optimal scheduling; Processor scheduling; Resource management; Scheduling algorithm; Spread spectrum communication; Throughput; Wireless networks; Optimal Throughput; Resource Allocation; Scheduling Algorithms; Wireless Networks;

fLanguage

English

Publisher

ieee

Conference_Titel

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

Conference_Location

Osaka

Print_ISBN

978-1-4244-6037-3

Type

conf

DOI

10.1109/NOMSW.2010.5486600

Filename

5486600