Sciweavers

Share
TON
2008

Distributed throughput maximization in wireless mesh networks via pre-partitioning

10 years 11 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 of distributed scheduling algorithms for wireless networks have emerged. Due to their distributed operation, these algorithms can achieve only a fraction of the maximum possible throughput. As an alternative to increasing the throughput fraction by designing new algorithms, we present a novel approach that takes advantage of the inherent multi-radio capability of WMNs. We show that this capability can enable partitioning of the network into subnetworks in which simple distributed scheduling algorithms can achieve 100% throughput. The partitioning is based on the notion of Local Pooling. Using this notion, we characterize topologies in which 100% throughput can be achieved distributedly. These topologies are used in order to develop a number of centralized channel assignment algorithms that are based on a matr...
Andrew Brzezinski, Gil Zussman, Eytan Modiano
Added 15 Dec 2010
Updated 15 Dec 2010
Type Journal
Year 2008
Where TON
Authors Andrew Brzezinski, Gil Zussman, Eytan Modiano
Comments (0)
books