A heuristic clique based STDMA scheduling algorithm for spatial concurrent transmission in mmWave networks

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

9 Scopus citations

Abstract

In this paper, a heuristic clique based spatial time division multiplexing access (STDMA) scheduling algorithm is proposed for concurrent transmission in millimeter wave networks. Firstly, based on the physical interference model an interference level caused by one transmission request to another is defined, which transforms the SINR condition to a summation form. Then, an un-directional conflict graph is constructed, a feasible clique of which is proved corresponding to a feasible concurrent transmission requests group in one timeslot. Finally, a heuristic clique based STDMA scheduling algorithm is proposed to find the maximum feasible concurrent scheduled transmission requests in one timeslot. Extensive simulations are conducted, and the simulation results show that compared to the existing blind scheduling algorithm, the spatial sharing gain is improved by 11%-36%.

Original languageEnglish
Title of host publication2015 IEEE Wireless Communications and Networking Conference, WCNC 2015
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages1036-1041
Number of pages6
ISBN (Electronic)9781479984060
DOIs
StatePublished - 17 Jun 2015
Event2015 IEEE Wireless Communications and Networking Conference, WCNC 2015 - New Orleans, United States
Duration: 9 Mar 201512 Mar 2015

Publication series

Name2015 IEEE Wireless Communications and Networking Conference, WCNC 2015

Conference

Conference2015 IEEE Wireless Communications and Networking Conference, WCNC 2015
Country/TerritoryUnited States
CityNew Orleans
Period9/03/1512/03/15

Keywords

  • clique
  • conflict graph
  • scheduling
  • STDMA

Fingerprint

Dive into the research topics of 'A heuristic clique based STDMA scheduling algorithm for spatial concurrent transmission in mmWave networks'. Together they form a unique fingerprint.

Cite this