Complexity of scheduling with analog network coding

Authors:
Olga Goussevskaia;Roger Wattenhofer
Affiliations:
ETH Zurich, Zurich, Switzerland;ETH Zurich, Zurich, Switzerland
Venue:
Proceedings of the 1st ACM international workshop on Foundations of wireless ad hoc and sensor networking and computing
Year:
2008

Citing 15
Cited 3

NC-approximation schemes for NP- and PSPACE-hard problems for geometric graphs

Journal of Algorithms
PAMAS—power aware multi-access protocol with signalling for ad hoc networks

ACM SIGCOMM Computer Communication Review
Models and approximation algorithms for channel assignment in radio networks

Wireless Networks
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Polynomial time algorithms for network information flow

Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
XORs in the air: practical wireless network coding

Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Hot topic: physical-layer network coding

Proceedings of the 12th annual international conference on Mobile computing and networking
Rate Allocation and Admission Control for Differentiated Services in CDMA Data Networks

IEEE Transactions on Mobile Computing
Embracing wireless interference: analog network coding

Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
Complexity in geometric SINR

Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
Cross-Layer Design for Power Efficiency and QoS Provisioning in Multi-Hop Wireless Networks

IEEE Transactions on Wireless Communications
The capacity of wireless networks

IEEE Transactions on Information Theory
Network information flow

IEEE Transactions on Information Theory
Linear network coding

IEEE Transactions on Information Theory
A Random Linear Network Coding Approach to Multicast

IEEE Transactions on Information Theory

Wireless Communication Is in APX

ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Efficiency of Wireless Networks: Approximation Algorithms for the Physical Interference Model

Foundations and Trends® in Networking
Link scheduling in wireless networks with successive interference cancellation

Computer Networks: The International Journal of Computer and Telecommunications Networking

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we analyze the complexity of scheduling wireless links in the physical interference model with analog network coding capability. We study two models with different definitions of network coding. In one model, we assume that a receiver is able to decode several signals simultaneously, provided that these signals differ in strength significantly. In the second model, we assume that routers are able to forward the interfering signal of a pair of nodes that wish to exchange a message, and nodes are able to decode the "collided" message by subtracting their own contribution from the interfered signal. For each network coding definition, we construct an instance of the scheduling problem in the geometric SINR model, in which nodes are distributed in the Euclidean plane. We present NP-completeness proofs for both scenarios.