Sciweavers

13 search results - page 1 / 3
» Flow rank based probabilistic fair scheduling for wireless a...
Sort
View
WINET
2010
105views more  WINET 2010»
13 years 2 months ago
Flow rank based probabilistic fair scheduling for wireless ad hoc networks
Fair scheduling is an ideal candidate for fair bandwidth sharing and thereby achieving fairness among the contending flows in a network. It is particularly challenging for ad hoc ...
Md. Mamun-Or-Rashid, Muhammad Mahbub Alam, Md. Abd...
APNOMS
2006
Springer
13 years 8 months ago
QoS-Aware Fair Scheduling in Wireless Ad Hoc Networks with Link Errors
To provide scheduling in wireless ad hoc networks, that is both highly efficient and fair in resource allocation, is not a trivial task because of the unique problems in wireless n...
Muhammad Mahbub Alam, Md. Mamun-Or-Rashid, Choong ...
NETWORKING
2004
13 years 5 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
2003
ACM
13 years 9 months 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
PERCOM
2003
ACM
14 years 4 months ago
Dynamic Bandwidth Management for Single-Hop Ad Hoc Wireless Networks
Distributed weighted fair scheduling schemes for QoS support in wireless networks have not yet become standard. In this paper we propose an Admission Control and Dynamic Bandwidth...
Samarth H. Shah, Kai Chen, Klara Nahrstedt