75 search results - page 1 / 15 » Longest-queue-first scheduling under SINR interference model |
MOBIHOC
2009
ACM
14 years 4 months ago
2009
ACM
Due to its low complexity, Greedy Maximal Scheduling (GMS), also known as Longest Queue First (LQF), has been studied extensively for wireless networks. However, GMS can result in...
MOBIHOC
2010
ACM
13 years 2 months ago
2010
ACM
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...
TON
2010
12 years 11 months ago
2010
In this paper, we consider the classical problem of link scheduling in wireless networks under an accurate interference model, in which correct packet reception at a receiver node ...
SECON
2007
IEEE
13 years 10 months ago
2007
IEEE
— The capacity of wireless multi-hop networks has been studied extensively in recent years. Most existing work tackles the problem from an asymptotic perspective and assumes a si...
LCN
2008
IEEE
13 years 10 months ago
2008
IEEE
—Carrier Sense Multiple Access (CSMA) protocols in Multi-hop Wireless Networks (MHWN) are known to suffer from different forms of the hidden and exposed terminal problems, leadin...