On Some Distributed Scheduling Algorithms for Wireless Networks With Hypergraph Interference Models
- 16 February 2021
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 67 (5) , 2952-2957
Abstract
It 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.Keywords
All Related Versions
This publication has 11 references indexed in Scilit:
- Radio Resource Allocation for Device-to-Device Underlay Communication Using Hypergraph TheoryIEEE Transactions on Wireless Communications, 2016
- Performance of sufficient conditions for distributed quality-of-service support in wireless networksWireless Networks, 2013
- Maximal Scheduling in Wireless Ad Hoc Networks With Hypergraph Interference ModelsIEEE Transactions on Vehicular Technology, 2011
- The performance of an upper bound on the fractional chromatic number of weighted graphsApplied Mathematics Letters, 2010
- Throughput and Fairness Guarantees Through Maximal Scheduling in Wireless NetworksIEEE Transactions on Information Theory, 2008
- Sufficient rate constraints for QoS flows in ad-hoc networksAd Hoc Networks, 2007
- Sufficient conditions for flow admission control in wireless ad-hoc networksACM SIGMOBILE Mobile Computing and Communications Review, 2005
- Hypergraph models for cellular mobile communication systemsIEEE Transactions on Vehicular Technology, 1998
- Performance limits for channelized cellular telephone systemsIEEE Transactions on Information Theory, 1994
- Link scheduling in polynomial timeIEEE Transactions on Information Theory, 1988