Please use this identifier to cite or link to this item:
https://hdl.handle.net/20.500.11851/8648
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Mete E. | - |
dc.contributor.author | Girici, Tolga | - |
dc.date.accessioned | 2022-07-30T16:43:42Z | - |
dc.date.available | 2022-07-30T16:43:42Z | - |
dc.date.issued | 2021 | - |
dc.identifier.citation | Mete, E., & Girici, T. (2021, November). Jointly Optimal Routing and Minimum-Length Scheduling in Successive Interference Cancellation-Enabled Wireless Ad Hoc Networks. In 2021 29th Telecommunications Forum (TELFOR) (pp. 1-4). IEEE. | en_US |
dc.identifier.isbn | 9781665425841 | - |
dc.identifier.uri | https://doi.org/10.1109/TELFOR52709.2021.9653195 | - |
dc.identifier.uri | https://hdl.handle.net/20.500.11851/8648 | - |
dc.description | 29th Telecommunications Forum, TELFOR 2021 -- 23 November 2021 through 24 November 2021 -- -- 176031 | en_US |
dc.description.abstract | This work studies the problem of jointly optimal routing and minimum length scheduling in a Successive Interference Cancellation (SIC) - enabled distributed wireless ad hoc network. The optimal solution finds the minimum number of time slots needed for the scheduling frame at a given flow rate in the presence of the SIC technique. Performance of the optimal solution that uses SIC is compared to the case wherein the interference is assumed as noise during reception. Numerical results show that the optimal solution with SIC shows significantly improved performance compared to the optimal solution without SIC. © 2021 IEEE. | en_US |
dc.language.iso | en | en_US |
dc.publisher | Institute of Electrical and Electronics Engineers Inc. | en_US |
dc.relation.ispartof | 2021 29th Telecommunications Forum, TELFOR 2021 - Proceedings | en_US |
dc.rights | info:eu-repo/semantics/closedAccess | en_US |
dc.subject | Minimum length | en_US |
dc.subject | Routing | en_US |
dc.subject | Scheduling | en_US |
dc.subject | Successive interference cancellation | en_US |
dc.subject | Wireless ad hoc network | en_US |
dc.subject | Ad hoc networks | en_US |
dc.subject | Network routing | en_US |
dc.subject | Optimal systems | en_US |
dc.subject | Distributed wireless | en_US |
dc.subject | Length scheduling | en_US |
dc.subject | Minimum length | en_US |
dc.subject | Optimal routing | en_US |
dc.subject | Optimal solutions | en_US |
dc.subject | Performance | en_US |
dc.subject | Routings | en_US |
dc.subject | Successive interference cancellations | en_US |
dc.subject | Wireless ad-hoc networks | en_US |
dc.subject | Work study | en_US |
dc.subject | Scheduling | en_US |
dc.title | Jointly Optimal Routing and Minimum-Length Scheduling in Successive Interference Cancellation-Enabled Wireless Ad Hoc Networks | en_US |
dc.type | Conference Object | en_US |
dc.department | Fakülteler, Mühendislik Fakültesi, Elektrik ve Elektronik Mühendisliği Bölümü | en_US |
dc.department | Faculties, Faculty of Engineering, Department of Electrical and Electronics Engineering | en_US |
dc.identifier.wos | WOS:000838086600034 | en_US |
dc.identifier.scopus | 2-s2.0-85124626604 | en_US |
dc.institutionauthor | Girici, Tolga | - |
dc.identifier.doi | 10.1109/TELFOR52709.2021.9653195 | - |
dc.authorscopusid | 57222472891 | - |
dc.authorscopusid | 24485519800 | - |
dc.relation.publicationcategory | Konferans Öğesi - Uluslararası - Kurum Öğretim Elemanı | en_US |
item.openairetype | Conference Object | - |
item.languageiso639-1 | en | - |
item.grantfulltext | none | - |
item.fulltext | No Fulltext | - |
item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
item.cerifentitytype | Publications | - |
crisitem.author.dept | 02.5. Department of Electrical and Electronics Engineering | - |
Appears in Collections: | Elektrik ve Elektronik Mühendisliği Bölümü / Department of Electrical & Electronics Engineering Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection WoS İndeksli Yayınlar Koleksiyonu / WoS Indexed Publications Collection |
CORE Recommender
Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.