Sciweavers

144 search results - page 16 / 29
» Maxmin fair scheduling in wireless networks
Sort
View
ICC
2008
IEEE
110views Communications» more  ICC 2008»
14 years 2 months ago
PAQ: A Starvation-Resistant Alternative to Proportional Fair
Abstract—Proportional Fair (PF) is a frequently used channelaware scheduling algorithm in 3G wireless networks. However, recent work by us and others has shown that, in practice,...
Soshant Bali, Sridhar Machiraju, Hui Zang
MOBIHOC
2003
ACM
14 years 24 days ago
Improving fairness among TCP flows crossing wireless ad hoc and wired networks
In scenarios where wireless ad hoc networks are deployed, sometimes it would be desirable that ad hoc nodes can communicate with servers in wired networks to upload or download da...
Luqing Yang, Winston Khoon Guan Seah, Qinghe Yin
INFOCOM
2010
IEEE
13 years 6 months ago
Practical Scheduling Algorithms for Concurrent Transmissions in Rate-adaptive Wireless Networks
—Optimal scheduling for concurrent transmissions in rate-nonadaptive wireless networks is NP-hard. Optimal scheduling in rate-adaptive wireless networks is even more difficult, ...
Zhe Yang, Lin Cai, Wu-sheng Lu
CONEXT
2007
ACM
13 years 11 months ago
Fair and efficient scheduling in data ferrying networks
Data-ferrying disconnection-tolerant networks allow remote rural areas to access the Internet at very low cost, making them viable alternatives to more expensive access technologi...
Shimin Guo, Srinivasan Keshav
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ü...