4 search results - page 1 / 1 » Analyzing the Performance of Greedy Maximal Scheduling via L... |
INFOCOM
2010
IEEE
13 years 3 months ago
2010
IEEE
—Efficient operation of wireless networks and switches requires using simple (and in some cases distributed) scheduling algorithms. In general, simple greedy algorithms (known a...
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...
MOBICOM
2006
ACM
13 years 10 months ago
2006
ACM
This paper considers the interaction between channel assignment and distributed scheduling in multi-channel multiradio Wireless Mesh Networks (WMNs). Recently, a number of distrib...
TON
2008
13 years 4 months ago
2008
Abstract-- This paper considers the interaction between channel assignment and distributed scheduling in multi-channel multiradio Wireless Mesh Networks (WMNs). Recently, a number ...