摘要
With the development of self-interference(SI) cancelation technology, full-duplex(FD) communication becomes possible. FD communication can theoretically double the spectral efficiency. When the time slot(TS) resources are limited and the number of flows is large, the scheduling mechanism of the flows becomes more important. Therefore, the effectiveness of FD scheduling mechanism for the flows is studied in millimeter wave wireless backhaul network with the limited TS resources. We proposed a full duplex concurrent scheduling algorithm based on coalition game(FDCG) to maximize the number of flows with their QoS requirements satisfied. We transformed the problem of maximizing the number of flows with their QoS requirements satisfied into the problem of maximizing sum rate of concurrently scheduled flows in each slot. We obtained the scheduled flows with maximum sum rate in first slot by using coalition game.And then with certain restrictions, the maximum sum rate of concurrently scheduled flows can also be achieved in subsequent time slots. The simulation results show that the proposed FDCG algorithm canachieve superior performance in terms of the number of flows that meet their QoS requirements and system throughput compared with other three algorithms.
With the development of self-interference(SI) cancelation technology, full-duplex(FD) communication becomes possible. FD communication can theoretically double the spectral efficiency. When the time slot(TS) resources are limited and the number of flows is large, the scheduling mechanism of the flows becomes more important. Therefore, the effectiveness of FD scheduling mechanism for the flows is studied in millimeter wave wireless backhaul network with the limited TS resources. We proposed a full duplex concurrent scheduling algorithm based on coalition game(FDCG) to maximize the number of flows with their QoS requirements satisfied. We transformed the problem of maximizing the number of flows with their QoS requirements satisfied into the problem of maximizing sum rate of concurrently scheduled flows in each slot. We obtained the scheduled flows with maximum sum rate in first slot by using coalition game.And then with certain restrictions, the maximum sum rate of concurrently scheduled flows can also be achieved in subsequent time slots. The simulation results show that the proposed FDCG algorithm canachieve superior performance in terms of the number of flows that meet their QoS requirements and system throughput compared with other three algorithms.
基金
supported by the National Natural Science Foundation of China Grants 61725101 and 61801016
the China Postdoctoral Science Foundation under Grant 2017M610040 and 2018T110041
National key research and development program under Grant 2016YFE0200900
the Beijing Natural Fund under Grant L172020
Major projects of Beijing Municipal Science and Technology Commission under Grant No. Z181100003218010
