Random access scheduling with constant collision rate

Seunghyun Lee, Changhee Joo, Hyoil Kim

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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 languageEnglish
Title of host publicationInternational Conference on ICT Convergence 2015
Subtitle of host publicationInnovations Toward the IoT, 5G, and Smart Media Era, ICTC 2015
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages518-522
Number of pages5
ISBN (Electronic)9781467371155
DOIs
Publication statusPublished - 2015 Dec 11
Externally publishedYes
Event6th International Conference on Information and Communication Technology Convergence, ICTC 2015 - Jeju Island, Korea, Republic of
Duration: 2015 Oct 282015 Oct 30

Publication series

NameInternational Conference on ICT Convergence 2015: Innovations Toward the IoT, 5G, and Smart Media Era, ICTC 2015

Other

Other6th International Conference on Information and Communication Technology Convergence, ICTC 2015
Country/TerritoryKorea, Republic of
CityJeju Island
Period15/10/2815/10/30

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Information Systems

Fingerprint

Dive into the research topics of 'Random access scheduling with constant collision rate'. Together they form a unique fingerprint.

Cite this