Randomized rounding: a technique for provably good algorithms and algorithmic proofs
Combinatorica - Theory of Computing
Probabilistic construction of deterministic algorithms: approximating packing integer programs
Journal of Computer and System Sciences - 27th IEEE Conference on Foundations of Computer Science October 27-29, 1986
Scheduling algorithms for multi-hop radio networks
SIGCOMM '92 Conference proceedings on Communications architectures & protocols
Randomized routing and sorting on fixed-connection networks
Journal of Algorithms
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Balls and bins: a study in negative dependence
Random Structures & Algorithms
Minimum energy paths for reliable communication in multi-hop wireless networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Energy-efficient broadcast and multicast trees in wireless networks
Mobile Networks and Applications
Energy-efficient broadcast and multicast trees in wireless networks
Mobile Networks and Applications
Topology control meets SINR: the scheduling complexity of arbitrary topologies
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
Cross-layer latency minimization in wireless networks with SINR constraints
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
Local broadcasting in the physical interference model
Proceedings of the fifth international workshop on Foundations of mobile computing
Wireless Communication Is in APX
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Oblivious interference scheduling
Proceedings of the 28th ACM symposium on Principles of distributed computing
Distributed contention resolution in wireless networks
DISC'10 Proceedings of the 24th international conference on Distributed computing
The capacity of wireless networks
IEEE Transactions on Information Theory
IEEE Journal on Selected Areas in Communications
Capacity of wireless networks under SINR interference constraints
Wireless Networks
Multi-hop routing and scheduling in wireless networks in the SINR model
ALGOSENSORS'11 Proceedings of the 7th international conference on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities
Scheduling in wireless networks with rayleigh-fading interference
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
Dynamic packet scheduling in wireless networks
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Approximation algorithms for wireless link scheduling with flexible data rates
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
| Hi-index | 5.23 |
In the interference scheduling problem, one is given a set of n communication requests described by source-destination pairs of nodes from a metric space. The nodes correspond to devices in a wireless network. 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. The objective is to minimize the number of colors as this corresponds to the time needed to schedule all requests. We introduce an instance-based measure of interference, denoted by I, that enables us to improve on previous results for the interference scheduling problem. We prove the upper and lower bounds in terms of I on the number of steps needed for scheduling a set of requests. For general power assignments, we prove a lower bound of @W(I/(log@Dlogn)) steps, where @D denotes the aspect ratio of the metric. When restricting to the two-dimensional Euclidean space (as in the previous work) the bound improves to @W(I/log@D). Alternatively, when restricting to linear power assignments, the lower bound improves even to @W(I). The lower bounds are complemented by an efficient algorithm computing a schedule for linear power assignments using only O(Ilogn) steps. A more sophisticated algorithm computes a schedule using even only O(I+log^2n) steps. For dense instances in the two-dimensional Euclidean space, this gives a constant factor approximation for scheduling under linear power assignments, which shows that the price for using linear (and, hence, energy-efficient) power assignments is bounded by a factor of O(log@D). In addition, we extend these results for single-hop scheduling to multi-hop scheduling and combined scheduling and routing problems, where our analysis generalizes the previous results towards general metrics and improves on the previous approximation factors.