Abstract
Wireless scheduling has been extensively studied in the literature. Since Maximum Weighted Scheduling has been developed and shown to achieve the optimal performance, there have been many efforts to overcome its complexity issue. In this paper, we develop a novel random access scheduling scheme that maintains constant collision rate. We employ the Additive Increase Multiplicative Decrease (AIMD) control algorithm, and show that our proposed scheme can achieve the same performance bound as the previous random access schemes with high control overhead. We show through simulations that our proposed scheme achieves the performance close to that of the centralized greedy algorithm.
Original language | English |
---|---|
Title of host publication | International Conference on ICT Convergence 2015 |
Subtitle of host publication | Innovations Toward the IoT, 5G, and Smart Media Era, ICTC 2015 |
Publisher | Institute of Electrical and Electronics Engineers Inc. |
Pages | 518-522 |
Number of pages | 5 |
ISBN (Electronic) | 9781467371155 |
DOIs | |
Publication status | Published - 2015 Dec 11 |
Externally published | Yes |
Event | 6th International Conference on Information and Communication Technology Convergence, ICTC 2015 - Jeju Island, Korea, Republic of Duration: 2015 Oct 28 → 2015 Oct 30 |
Publication series
Name | International Conference on ICT Convergence 2015: Innovations Toward the IoT, 5G, and Smart Media Era, ICTC 2015 |
---|
Other
Other | 6th International Conference on Information and Communication Technology Convergence, ICTC 2015 |
---|---|
Country/Territory | Korea, Republic of |
City | Jeju Island |
Period | 15/10/28 → 15/10/30 |
Bibliographical note
Funding Information:This work is in part supported by IITP grant funded by the Korea government (MSIP) (No. B0126-15-1064, Research on Near-Zero Latency Network for 5G Immersive Service).
Publisher Copyright:
© 2015 IEEE.
ASJC Scopus subject areas
- Computer Networks and Communications
- Information Systems