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 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, in this paper 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 recently introduced 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 channel assignment algorithms that are bas...

• Type: Conference
• Year: 2006
• Where: MOBICOM
• Authors: Andrew Brzezinski, Gil Zussman, Eytan Modiano
• Keywords: Algorithms, Capacity Region, MOBICOM 2006, Scheduling Algorithms