Sciweavers

51 search results - page 1 / 11
» Multihop Local Pooling for Distributed Throughput Maximizati...
Sort
View
INFOCOM
2008
IEEE
13 years 11 months 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
WIOPT
2006
IEEE
13 years 11 months ago
Fairness and throughput guarantees with maximal scheduling in multi-hop wireless networks
Abstract— We investigate the fairness and throughput properties of a simple distributed scheduling policy, maximal scheduling, in the context of a general ad-hoc wireless network...
Saswati Sarkar, Prasanna Chaporkar, Koushik Kar
INFOCOM
2010
IEEE
13 years 3 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 ...
TON
2008
122views more  TON 2008»
13 years 4 months ago
Distributed throughput maximization in wireless mesh networks via pre-partitioning
Abstract-- This paper considers the interaction between channel assignment and distributed scheduling in multi-channel multiradio Wireless Mesh Networks (WMNs). Recently, a number ...
Andrew Brzezinski, Gil Zussman, Eytan Modiano
MOBICOM
2006
ACM
13 years 11 months ago
Enabling distributed throughput maximization in wireless mesh networks: a partitioning approach
This paper considers the interaction between channel assignment and distributed scheduling in multi-channel multiradio Wireless Mesh Networks (WMNs). Recently, a number of distrib...
Andrew Brzezinski, Gil Zussman, Eytan Modiano