Longest-queue-first scheduling under SINR interference model
We investigate the performance of longest-queue-first (LQF) scheduling (i.e., greedy maximal scheduling) for wireless networks under the SINR interference model. This interference model takes network geometry and the cumulative interference effect into account, which, therefore, capture the wireless...
Main Authors: | Le, Long Bao (Contributor), Joo, Changhee (Author), Shroff, Ness B. (Author), Modiano, Eytan H. (Contributor) |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Aeronautics and Astronautics (Contributor) |
Format: | Article |
Language: | English |
Published: |
Association for Computing Machinery (ACM),
2013-10-21T18:16:58Z.
|
Subjects: | |
Online Access: | Get fulltext |
Similar Items
-
Scheduling in parallel queues with randomly varying connectivity and switchover delay
by: Celik, Guner Dincer, et al.
Published: (2011) -
Approximation Algorithms for Maximum Link Scheduling under SINR-Based Interference Model
by: Zi-Ao Zhou, et al.
Published: (2015-07-01) -
A Longest-Queue-First Signal Scheduling Algorithm with Quality of Service Provisioning for an Isolated Intersection
by: Wunderlich, Richard James
Published: (2007) -
Max-Weight Scheduling in Queueing Networks With Heavy-Tailed Traffic
by: Markakis, Michail, et al.
Published: (2018) -
Optimal control of wireless networks with finite buffers
by: Le, Long Bao, et al.
Published: (2011)