16 search results - page 3 / 4 » Distributed Low-Complexity Maximum-Throughput Scheduling for... |
SIGMETRICS
2006
ACM
13 years 11 months ago
2006
ACM
A major challenge in the design of wireless networks is the need for distributed scheduling algorithms that will efficiently share the common spectrum. Recently, a few distributed...
VTC
2008
IEEE
13 years 11 months ago
2008
IEEE
Abstract—Cross-layer routing and scheduling algorithms design for wireless backhaul mesh network has attracted much research interest recently. The network is expected to support...
GLOBECOM
2009
IEEE
13 years 9 months ago
2009
IEEE
Wireless Mesh Networks (WMNs) is a promising key technology for next generation wireless backhauling that is expected to support various types of applications with different qualit...
INFOCOM
2008
IEEE
13 years 11 months ago
2008
IEEE
Abstract—Efficient operation of wireless networks requires distributed routing and scheduling algorithms that take into account interference constraints. Recently, a few algorit...
MOBIHOC
2009
ACM
14 years 5 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...