Header menu link for other important links
X
Maximal Packing with Interference Constraints
Published in Institute of Electrical and Electronics Engineers Inc.
2019
Volume: 2019-April
   
Abstract
In this work, we analyze the maximum number of wireless transmitters (nodes) that can be scheduled subject to interference constraints across the nodes. Given a set of nodes, the problem reduces to finding the maximum cardinality of a subset that can concurrently transmit without violating interference constraints. The resulting packing problem is a binary optimization problem, which is NP hard. We propose a semi-definite (SDP) relaxation for the NP hard problem and discuss the algorithm and the quality of the relaxation by providing approximation ratios for the relaxation. © 2019 IEEE.
About the journal
JournalData powered by TypesetIEEE Wireless Communications and Networking Conference, WCNC
PublisherData powered by TypesetInstitute of Electrical and Electronics Engineers Inc.
ISSN15253511
Open AccessYes
Concepts (9)
  •  related image
    Computational complexity
  •  related image
    Approximation ratios
  •  related image
    BINARY OPTIMIZATION
  •  related image
    Cardinalities
  •  related image
    Interference constraints
  •  related image
    Np-hard
  •  related image
    PACKING PROBLEMS
  •  related image
    Wireless transmitter
  •  related image
    Approximation algorithms