Sciweavers

52 search results - page 7 / 11
» Fairness and throughput guarantees with maximal scheduling i...
Sort
View
VTC
2007
IEEE
192views Communications» more  VTC 2007»
14 years 1 months ago
Access Scheduling Based on Time Water-Filling for Next Generation Wireless LANs
Opportunistic user access scheduling enhances the capacity of wireless networks by exploiting the multi user diversity. When frame aggregation is used, opportunistic schemes are no...
Ertugrul Necdet Ciftcioglu, Özgür Gü...
NETWORKING
2004
13 years 8 months ago
Performance of Wireless Ad Hoc Networks under Balanced Fairness
Balanced fairness is a new resource sharing concept recently introduced by Bonald and Prouti`ere. We extend the use of this notion to wireless networks where the link capacities at...
Aleksi Penttinen, Jorma T. Virtamo
MOBIHOC
2005
ACM
14 years 7 months ago
Distributed dynamic scheduling for end-to-end rate guarantees in wireless ad hoc networks
Abstract-We present a novel framework for the provision of deterministic end-to-end bandwidth guarantees in wireless ad hoc networks. Guided by a set of local feasibility condition...
Theodoros Salonidis, Leandros Tassiulas
INFOCOM
2010
IEEE
13 years 5 months ago
Analyzing the Performance of Greedy Maximal Scheduling via Local Pooling and Graph Theory
—Efficient operation of wireless networks and switches requires using simple (and in some cases distributed) scheduling algorithms. In general, simple greedy algorithms (known a...
Berk Birand, Maria Chudnovsky, Bernard Ries, Paul ...
ITRE
2005
IEEE
14 years 1 months ago
MR-FQ: a fair scheduling algorithm for wireless networks with variable transmission rates
— Wireless networks are characterized by bursty and location-dependent errors. Although many fair scheduling methods have been proposed to address these issues, most of them assu...
You-Chiun Wang, Yu-Chee Tseng, Wen-Tsuen Chen, Kun...