On some distributed scheduling algorithms for wireless networks with hypergraph interference models

Simple item page
dc.contributor.authorGanesan, Ashwin
dc.date.accessioned2025-02-11T04:46:41Z
dc.date.available2025-02-11T04:46:41Z
dc.date.issued2021-05-01
dc.descriptionuGDX
dc.description.abstractIt is shown that the performance of the maximal scheduling algorithm in wireless ad hoc networks under the hypergraph interference model can be further away from optimal than previously known. The exact worst-case performance of this distributed, greedy scheduling algorithm is analyzed.
dc.identifier.issn0018-9448
dc.identifier.urihttps://atlasuniversitylibraryir.in/handle/123456789/499
dc.language.isoen
dc.publisherIEEE
dc.relation.ispartofseriesIEEE TRANSACTIONS ON INFORMATION THEORY
dc.subjectHypergraph interference models
dc.subjectwireless net- works
dc.subjectadmission control
dc.subjectfractional chromatic number
dc.subjectupper bounds
dc.subjectmaximal scheduling
dc.subjectdistributed algorithms
dc.titleOn some distributed scheduling algorithms for wireless networks with hypergraph interference models
dc.typeBook chapter

Files

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

2021