Maximal Packing with Interference Constraints

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 interfere...

Full description

Saved in:
Bibliographic Details
Published in:IEEE Wireless Communications and Networking Conference : [proceedings] : WCNC pp. 1 - 6
Main Authors: Jagannath, Rakshith, Ganti, Radha Krishna, Upadhye, Neelesh S
Format: Conference Proceeding
Language:English
Published: IEEE 01.04.2019
Subjects:
Approximation algorithms
Interference constraints
Optimization
Processor scheduling
Scheduling
Wireless sensor networks
ISSN:1558-2612
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:1558-2612
DOI:10.1109/WCNC.2019.8885424