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

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE Wireless Communications and Networking Conference : [proceedings] : WCNC s. 1 - 6
Hlavní autoři: Jagannath, Rakshith, Ganti, Radha Krishna, Upadhye, Neelesh S
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.04.2019
Témata:
Approximation algorithms
Interference constraints
Optimization
Processor scheduling
Scheduling
Wireless sensor networks
ISSN:1558-2612
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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