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 algorithms for networks with primary- or secondary-interference constraints have been developed. Due to their distributed operation, these algorithms can achieve only a guaranteed fraction of the maximum possible throughput. It was also recently shown that if a set of conditions (known as Local Pooling) is satisfied, simple distributed scheduling algorithms achieve 100% throughput. However, previous work g Local Pooling focused mostly on obtaining abstract conditions and on networks with single-hop interference or singlehop traffic. In this paper, we identify several graph classes that satisfy the Local Pooling conditions, thereby enabling the use of such graphs in network design algorithms. Then, we study the multihop implications of Local Pooling. We show that in many cases, as the interference degree increases,...

• Type: Conference
• Year: 2008
• Where: INFOCOM
• Authors: Gil Zussman, Andrew Brzezinski, Eytan Modiano
• Keywords: Algorithms, Communications, INFOCOM 2008, Local Pooling, Local Pooling Conditions