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...
Uloženo v:
| Vydáno v: | IEEE Wireless Communications and Networking Conference : [proceedings] : WCNC s. 1 - 6 |
|---|---|
| Hlavní autoři: | , , |
| Médium: | Konferenční příspěvek |
| Jazyk: | angličtina |
| Vydáno: |
IEEE
01.04.2019
|
| Témata: | |
| 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!
|
| 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 Proceedings Order Plan All Online (POP All Online) 1998-present by volume IEEE Xplore All Conference Proceedings IEEE Electronic Library (IEL) IEEE Proceedings Order Plans (POP All) 1998-Present |
| DatabaseTitleList | |
| Database_xml | – sequence: 1 dbid: RIE name: IEEE 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.061268 |
| 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/eLvHCXMwlV3LT8MgGP-yLR704mMzvtODR-sobYGeFxcvLj1o3G35Ch_JEt3M1hn_fIHOqokXL4RAgPAI8PteP4Brgzo31jqk6q4_B1BkERfkkhStkrpQXKuGbEJOJmo6LcoO3LS-MEQUjM_o1meDLt8s9caLyoYOreUZz7rQlVI0vlotuHJfj2yrtUxYMXweTUbecMufhNDoF3tKeDzG-_8b9gAG3154Udm-L4fQocUR7P0IINiH-AE_5q_4EpWovcw78mLVKEj5vnrwjJyBB6JeD-BpfPc4uo-3BAjxnLO0dkunNKWYcu0-ESlHRC5ZUlWusEoqyyTlphI5CgczEm2M9rHqEZlBVWlNIj2G3mK5oBOIrOXkqgpSqDNihELkNvPh13OLxMQp9P3EZ29NjIvZds5nfxefw65f28aC5QJ69WpDl7Cj3-v5enUVNuYThiuQjg |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1JTwIxFH5BNFEvLmDcnYNHRzqdrXMmEoww4YCRG3nTviYkAgYG48-3LSNq4sVL07Rpmy5p-73tA7hVKGOltUGq5vozACXN_IxMEqIWqcwEl2JNNpHmuRiNskEN7ja-METkjM_o3madLl_N5cqKyloGrcURj7Zg2zJnVd5aG3hlPh9RpbcMWNZ6aedta7plz4Jr9os_xT0fnYP_DXwIzW8_PG-weWGOoEazY9j_EUKwAX4fPyZTfPUGKK3U27OCVc_J-b56sJycjgmiXDbhufMwbHf9igLBn3AWlmbxhKQQQy7NNyLkiMhTFhSFKSyCQrOUYlUkMSYGaARSKWmj1SMyhaKQkpLwBOqz-YxOwdOak6nKSKCMiBEmSawjG4A91kgsOYOGnfj4bR3lYlzN-fzv4hvY7Q77vXHvMX-6gD27zmt7lkuol4sVXcGOfC8ny8W126RPPyWT1w |
| 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 |