Oblivious interference scheduling
Authors:
Open Access
- 10 August 2009
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 220-229
Abstract
In the interference scheduling problem, one is given a set of n communication requests described by pairs of points from a metric space. The points correspond to devices in a wireless network. In the directed version of the problem, each pair of points consists of a dedicated sending and a dedicated receiving device. In the bidirectional version the devices within a pair shall be able to exchange signals in both directions. In both versions, each pair must be assigned a power level and a color such that the pairs in each color class can communicate simultaneously at the specified power levels. The feasibility of simultaneous communication within a color class is defined in terms of the Signal to Interference Plus Noise Ratio (SINR) that compares the strength of a signal at a receiver to the sum of the strengths of other signals. This is commonly referred to as the "physical model" and is the established way of modelling interference in the engineering community. The objective is to minimize the number of colors as this corresponds to the time needed to schedule all requests. We study oblivious power assignments in which the power value of a pair only depends on the distance between the points of this pair. We prove that oblivious power assignments cannot yield ap- proximation ratios better than ( n) for the directed version of the problem, which is the worst possible performance guarantee as there is a straightforward algorithm that achieves an O(n)-approximation. For the bidirectional version, however, we can show the existence of a universally good oblivious power assignment: For any set of n bidirectional communication requests, the so-called "square root assign- ment" admits a coloring with at most polylog(n) times the minimal number of colors. The proof for the existence of this coloring is non-constructive. We complement it by an approximation algorithm for the coloring problem under the square root assignment. This way, we obtain the first polynomial time algorithm with approximation ratio polylog(n) for interference scheduling in the physical model.Keywords
This publication has 13 references indexed in Scilit:
- Improved Algorithms for Latency Minimization in Wireless Networks2009
- Approximation Algorithms for Computing Capacity of Wireless Networks with SINR Constraints2008
- Cross-layer latency minimization in wireless networks with SINR constraints2007
- Topology control meets SINR2006
- The Complexity of Connectivity in Wireless Networks2006
- The Distance-2 Matching Problem and Its Relationship to the MAC-Layer Capacity of Ad Hoc Wireless NetworksIEEE Journal on Selected Areas in Communications, 2004
- Interference in Wireless Multi-Hop Ad-Hoc Networks and Its Effect on Network CapacityWireless Networks, 2004
- The capacity of wireless networksIEEE Transactions on Information Theory, 2000
- PAMAS—power aware multi-access protocol with signalling for ad hoc networksACM SIGCOMM Computer Communication Review, 1998
- Scheduling algorithms for multi-hop radio networksACM SIGCOMM Computer Communication Review, 1992