Capacity of Arbitrary Wireless Networks

— In this work we study the problem of determining the throughput capacity of a wireless network. We propose a scheduling algorithm to achieve this capacity within an approximation factor. Our analysis is performed in the physical interference model, where nodes are arbitrarily distributed in Euclidean space. We consider the problem separately from the routing problem and the power control problem, i.e., all requests are single-hop, and all nodes transmit at a fixed power level. The existing solutions to this problem have either concentrated on special-case topologies, or presented optimality guarantees which become arbitrarily bad (linear in the number of nodes) depending on the network’s topology. We propose the first scheduling algorithm with approximation guarantee independent of the topology of the network. The algorithm has a constant approximation guarantee for the problem of maximizing the number of links scheduled in one time-slot. Furthermore, we obtain a O(log n) appro...

• Type: Conference
• Year: 2009
• Where: INFOCOM
• Authors: Olga Goussevskaia, Roger Wattenhofer, Magnús M. Halldórsson, Emo Welzl
• Keywords: Algorithm, Approximation, Communications, INFOCOM 2009, Scheduling Algorithm