Sciweavers

86 search results - page 4 / 18
» Throughput and Fairness Guarantees Through Maximal Schedulin...
Sort
View
SIGMETRICS
2006
ACM
156views Hardware» more  SIGMETRICS 2006»
13 years 12 months ago
Maximizing throughput in wireless networks via gossiping
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...
Eytan Modiano, Devavrat Shah, Gil Zussman
MSWIM
2004
ACM
13 years 11 months ago
Channel-quality dependent earliest deadline due fair scheduling schemes for wireless multimedia networks
— Providing delay guarantees to time-sensitive traffic in future wireless multimedia networks is a challenging issue. This is due to the time-varying link capacities and the vari...
Ahmed K. F. Khattab, Khaled M. F. Elsayed
INFOCOM
2008
IEEE
14 years 11 days ago
Multihop Local Pooling for Distributed Throughput Maximization in Wireless Networks
Abstract—Efficient operation of wireless networks requires distributed routing and scheduling algorithms that take into account interference constraints. Recently, a few algorit...
Gil Zussman, Andrew Brzezinski, Eytan Modiano
GLOBECOM
2008
IEEE
13 years 6 months ago
Power Efficient Throughput Maximization in Multi-Hop Wireless Networks
Abstract-- We study the problem of total throughput maximization in arbitrary multi-hop wireless networks, with constraints on the total power usage (denoted by PETM), when nodes h...
Deepti Chafekar, V. S. Anil Kumar, Madhav V. Marat...
ICDCS
2005
IEEE
13 years 11 months ago
End-to-End Fair Bandwidth Allocation in Multi-Hop Wireless Ad Hoc Networks
— The shared-medium multi-hop nature of wireless ad hoc networks poses fundamental challenges to the design of an effective resource allocation algorithm to maximize spatial reus...
Baochun Li