Complexity in geometric SINR

In this paper we study the problem of scheduling wireless links in the geometric SINR model, which explicitly uses the fact that nodes are distributed in the Euclidean plane. We present the first NP-completeness proofs in such a model. In particular, we prove two problems to be NP-complete: Scheduling and One-Shot Scheduling. The first problem consists in finding a minimum-length schedule for a given set of links. The second problem receives a weighted set of links as input and consists in finding a maximum-weight subset of links to be scheduled simultaneously in one shot. In addition to the complexity proofs, we devise an approximation algorithm for each problem. Categories and Subject Descriptors F.2.2 [Analysis of Algorithms and Problem Complexity]: Nonnumerical Algorithms and Problems, Geometrical Problems and Computations, Sequencing and Scheduling; G.2.1 [Discrete Mathematics]: Combinatorics, Combinatorial Algorithms; G.2.2 [Discrete Mathematics]: Graph Theory, Network Problems....

• Type: Conference
• Year: 2007
• Where: MOBIHOC
• Authors: Olga Goussevskaia, Yvonne Anne Oswald, Roger Wattenhofer
• Keywords: Approximation Algorithms, General Terms Algorithms, MOBIHOC 2007, One-Shot Scheduling, Wireless Networks