Sciweavers

144 search results - page 5 / 29
» Maxmin fair scheduling in wireless networks
Sort
View
INFOCOM
2000
IEEE
13 years 12 months ago
Max-Min D-Cluster Formation in Wireless Ad Hoc Networks
— An ad hoc network may be logically represented as a set of clusters. The clusterheads form a -hop dominating set. Each node is at most hops from a clusterhead. Clusterheads for...
Alan D. Amis, Ravi Prakash, Dung Huynh, Thai Vuong
MONET
2011
13 years 2 months ago
Achieving End-to-end Fairness in 802.11e Based Wireless Multi-Hop Mesh Networks Without Coordination
Abstract To mitigate the damaging impacts caused by interference and hidden terminals, it has been proposed to use orthogonal channels in wireless multi-hop mesh networks. We demon...
Tianji Li, Douglas J. Leith, Venkataramana Badarla...
ISCC
2003
IEEE
152views Communications» more  ISCC 2003»
14 years 23 days ago
Dynamic Fair Queuing (DFQ): A Novel Fair Scheduler Improving Wireless Transmission over Hybrid LANs
Local area network (LAN) will be a hybrid network that includes wired and wireless links together. Nonetheless, the wired hosts always take the most bandwidth and bring about the ...
Ce-Kuen Shieh, Yu-Ben Miao, Ming-Qi Shieh, Wen-Shy...
TWC
2008
152views more  TWC 2008»
13 years 7 months ago
Bandwidth-Guaranteed Fair Scheduling with Effective Excess Bandwidth Allocation for Wireless Networks
Traffic scheduling is key to the provision of quality of service (QoS) differentiation and guarantees in wireless networks. Unlike its wireline counterpart, wireless communications...
Yaxin Cao, Ka-Cheong Leung, Victor O. K. Li
TCOM
2010
162views more  TCOM 2010»
13 years 2 months ago
Design of Fair Weights for Heterogeneous Traffic Scheduling in Multichannel Wireless Networks
Fair weights have been implemented to maintain fairness in recent resource allocation schemes. However, designing fair weights for multiservice wireless networks is not trivial bec...
Mehri Mehrjoo, Mohamad Khattar Awad, Mehrdad Diana...