Journal on Communications ›› 2019, Vol. 40 ›› Issue (1): 34-42.doi: 10.11959/j.issn.1000-436x.2019010

• Papers • Previous Articles     Next Articles

Contention graph based concurrent scheduling algorithm in millimeter wave WPAN

Yibing WANG,Yong NIU,Weiguang DING,Hao WU   

  1. School of Electronics and Information Engineering,Beijing Jiaotong University,Beijing 100044,China
  • Revised:2018-11-06 Online:2019-01-01 Published:2019-02-03
  • Supported by:
    The National Natural Science Foundation of China(61801016);China Postdoctoral Science Foundation(2018T110041);The State Key Lab of Rail Traffic control & safety of Beijing Jiaotong University(RCS2017ZT009)

Abstract:

The directional antennas and beamforming techniques in millimeter wave (mmWave) bands are used to make concurrent transmission between multiple flows become possible.However,higher mutual interference may be caused by concurrent transmission.Therefore,when the time slots were limited and the number of data flows was large,how to schedule the concurrent flows efficiently was solved by proposed algorithm.The contention graph based spatial-time division multiple access (CB-STDMA) concurrent scheduling algorithm guaranteed the quality of service (QoS) of users,and aimed at maximizing the number of flows with their QoS requirements satisfied.It considered the interference between different flows,and a higher priority was given to the flow with fewer time slots requirement.Extensive simulations demonstrated that the proposed CB-STDMA algorithm increased the number of flows with their QoS requirements satisfied and the network throughput by 50% and 20% respectively compared with the existing algorithms.

Key words: communication and information system, millimeter-wave communications, concurrent scheduling, WPAN,contention graph

CLC Number: 

No Suggested Reading articles found!