A novel method for scheduling of wireless ad hoc networks in polynomial time

Simple item page
buir.contributor.authorGökcesu, Hakan
dc.citation.epage480en_US
dc.citation.issueNumber1en_US
dc.citation.spage468en_US
dc.citation.volumeNumber20en_US
dc.contributor.authorKöse, A.
dc.contributor.authorGökcesu, Hakan
dc.contributor.authorEvirgen, N.
dc.contributor.authorGökcesu, K.
dc.contributor.authorMédard, M.
dc.date.accessioned2021-02-25T12:11:27Z
dc.date.available2021-02-25T12:11:27Z
dc.date.issued2020-09-28
dc.departmentDepartment of Electrical and Electronics Engineeringen_US
dc.description.abstractIn this article, we address the scheduling problem in wireless ad hoc networks by exploiting the computational advantage that comes when scheduling problems can be represented by claw-free conflict graphs where we consider a wireless broadcast medium. It is possible to formulate a scheduling problem of broadcast transmissions as finding the maximum weighted independent set (MWIS) in the conflict graph of the network. Finding the MWIS of a general graph is NP-hard leading to an NP-hard complexity of scheduling. In a claw-free conflict graph, MWIS may be found in polynomial time leading to a throughput-optimal scheduling. We show that the conflict graphs of certain wireless ad hoc networks are claw-free. In order to obtain claw-free conflict graphs in general networks, we suggest introducing additional conflicts (edges) with the aim of keeping the decrease in MWIS size minimal. To this end, we introduce an iterative optimization problem to decide where to introduce edges and investigate its efficient implementation. We conclude that the claw breaking method by adding extra edges can perform very close to optimal scenario and better than the polynomial time maximal independent set scheduling benchmark under the necessary assumptions.en_US
dc.description.provenanceSubmitted by Onur Emek (onur.emek@bilkent.edu.tr) on 2021-02-25T12:11:27Z No. of bitstreams: 1 A_Novel_Method_for_Scheduling_of_Wireless_Ad_Hoc_Networks_in_Polynomial_Time.pdf: 1983051 bytes, checksum: 122cd4e82b158d95052e491bc8025fa8 (MD5)en
dc.description.provenanceMade available in DSpace on 2021-02-25T12:11:27Z (GMT). No. of bitstreams: 1 A_Novel_Method_for_Scheduling_of_Wireless_Ad_Hoc_Networks_in_Polynomial_Time.pdf: 1983051 bytes, checksum: 122cd4e82b158d95052e491bc8025fa8 (MD5) Previous issue date: 2021en
dc.identifier.doi10.1109/TWC.2020.3025448en_US
dc.identifier.issn1536-1276
dc.identifier.urihttp://hdl.handle.net/11693/75591
dc.language.isoEnglishen_US
dc.publisherIEEEen_US
dc.relation.isversionofhttps://dx.doi.org/10.1109/TWC.2020.3025448en_US
dc.source.titleIEEE Transactions on Wireless Communicationsen_US
dc.subjectScheduling in polynomial timeen_US
dc.subjectWireless ad hoc networksen_US
dc.subjectConflict graphen_US
dc.subjectClaw-free graphen_US
dc.subjectMaximum weighted independent set.en_US
dc.titleA novel method for scheduling of wireless ad hoc networks in polynomial timeen_US
dc.typeArticleen_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
A_Novel_Method_for_Scheduling_of_Wireless_Ad_Hoc_Networks_in_Polynomial_Time.pdf
Size:
1.89 MB
Format:
Adobe Portable Document Format
Description:
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

Scholarly Publications - Electrical and Electronics Engineering