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!
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.
AbstractList 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.
Author Upadhye, Neelesh S
Ganti, Radha Krishna
Jagannath, Rakshith
Author_xml – sequence: 1
  givenname: Rakshith
  surname: Jagannath
  fullname: Jagannath, Rakshith
  organization: Indian Institute of Technology, Madras, Chennai, 600036, India
– sequence: 2
  givenname: Radha Krishna
  surname: Ganti
  fullname: Ganti, Radha Krishna
  organization: Indian Institute of Technology, Madras, Chennai, 600036, India
– sequence: 3
  givenname: Neelesh S
  surname: Upadhye
  fullname: Upadhye, Neelesh S
  organization: Indian Institute of Technology, Madras, Chennai, 600036, India
BookMark eNotj81KAzEURmNRsK19AHEzLzDjzX9mKYPVQv1ZKC7LTeaORmsqyYD69hbs6oOzOJxvxo7TLhFj5xwazqG9fOnuu0YAbxvnnFZCHbFFax3X0hlrlBETNuVau1oYLk7ZrJR3AAFaqSmr7_AnfuK2esTwEdNr9R3Ht2qVRsoDZUqBqm6XypgxprGcsZMBt4UWh52z5-X1U3dbrx9uVt3Vuo4C5FgrcIEkShFaaaVARGGBe7-HnvsBLOneG41Ga-Ch74MFUIjQo_MhkJFzdvHvjUS0-cr7wvy7ObyTf6xsRUs
ContentType Conference Proceeding
DBID 6IE
6IL
CBEJK
RIE
RIL
DOI 10.1109/WCNC.2019.8885424
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Xplore POP ALL
IEEE Xplore All Conference Proceedings
IEEE/IET Electronic Library
IEEE Proceedings Order Plans (POP All) 1998-Present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE/IET Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISBN 9781538676462
153867646X
EISSN 1558-2612
EndPage 6
ExternalDocumentID 8885424
Genre orig-research
GroupedDBID 29I
6IE
6IF
6IH
6IK
6IL
6IN
AAJGR
AAWTH
ABLEC
ACGFS
ADZIZ
AI.
ALMA_UNASSIGNED_HOLDINGS
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
CHZPO
IEGSK
IPLJI
M43
OCL
RIE
RIL
RNS
VH1
ID FETCH-LOGICAL-i203t-408ce3a32c93732aaa2701bbce3b1bf07e5db65a65501cddc7004aa0da8bcce63
IEDL.DBID RIE
ISICitedReferencesCount 0
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000519086300009&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
IngestDate Wed Aug 27 02:43:22 EDT 2025
IsPeerReviewed false
IsScholarly true
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i203t-408ce3a32c93732aaa2701bbce3b1bf07e5db65a65501cddc7004aa0da8bcce63
PageCount 6
ParticipantIDs ieee_primary_8885424
PublicationCentury 2000
PublicationDate 2019-April
PublicationDateYYYYMMDD 2019-04-01
PublicationDate_xml – month: 04
  year: 2019
  text: 2019-April
PublicationDecade 2010
PublicationTitle IEEE Wireless Communications and Networking Conference : [proceedings] : WCNC
PublicationTitleAbbrev WCNC
PublicationYear 2019
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssj0020544
Score 2.0611608
Snippet In this work, we analyze the maximum number of wireless transmitters (nodes) that can be scheduled subject to interference constraints across the nodes. Given...
SourceID ieee
SourceType Publisher
StartPage 1
SubjectTerms Approximation algorithms
Interference constraints
Optimization
Processor scheduling
Scheduling
Wireless sensor networks
Title Maximal Packing with Interference Constraints
URI https://ieeexplore.ieee.org/document/8885424
WOSCitedRecordID wos000519086300009&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV07T8MwED61FQMsPFrEWxkYCfUrcTpHVAwQZQDRrTo_IlWCFrVpxc_HdkIBiYXNsvyQX7r7znf3AVxTxjDl1MQOfGSxUIbECrWDKjSRFaaVxCqwljzIosgmk1HZgZttLIy1Njif2VtfDH_5ZqHX3lQ2dGgtEUx0oStl2sRqbcGVUz1E-2tJyWj4khe5d9zyNyF0-sWeEoTHeP9_0x7A4DsKLyq38uUQOnZ-BHs_Egj2IX7Ej9kbvkYlam_zjrxZNQpWvq8RPCNn4IGoVwN4Ht895fdxS4AQzxjhtcN2mbYcOdNOieAMEZkkVClXqaiqiLSJUWmCqYMZVBujfa56RGIwU1rblB9Db76Y2xOIEqYzrq2SQlRCosyQJEQY6xq5V03UKfT9wqfvTY6Labvms7-rz2HX723jwXIBvXq5tpewozf1bLW8CgfzCSwNj8I
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LSwMxEB5qFdSLjyq-3YNH1-a1m-25WCq2Sw8VeyuTx0JBW2m34s83Sdeq4MVbCHmQFzPfZGY-gBvKGKacmtiBjywWypBYoXZQhSaywLSQWATWkp7M82w0ag1qcLuOhbHWBucze-eL4S_fzPTSm8qaDq0lgokN2PTMWVW01hpeOeVDVP-WlLSaz-287V23_F0I3X7xpwTx0dn738T7cPQdhxcN1hLmAGp2egi7P1IINiDu48fkFV-iAWpv9Y68YTUKdr6vETwnZ2CCKBdH8NS5H7a7cUWBEE8Y4aVDd5m2HDnTTo3gDBGZJFQpV6moKoi0iVFpgqkDGlQbo322ekRiMFNa25QfQ306m9oTiBKmM66tkkIUQqLMkCREGOsauXdN1Ck0_MLHb6ssF-NqzWd_V1_DdnfY7417D_njOez4fV75s1xAvZwv7SVs6fdysphfhUP6BNt0kws
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=IEEE+Wireless+Communications+and+Networking+Conference+%3A+%5Bproceedings%5D+%3A+WCNC&rft.atitle=Maximal+Packing+with+Interference+Constraints&rft.au=Jagannath%2C+Rakshith&rft.au=Ganti%2C+Radha+Krishna&rft.au=Upadhye%2C+Neelesh+S&rft.date=2019-04-01&rft.pub=IEEE&rft.eissn=1558-2612&rft.spage=1&rft.epage=6&rft_id=info:doi/10.1109%2FWCNC.2019.8885424&rft.externalDocID=8885424