A Fair TDMA Scheduling Based on Weight of Flows
Shuai Xiaoying · Journal of Physics Conference Series · 2019
Nodes in wireless ad hoc networks transmit data to 1-hop neighbour nodes through broadcast channel. Conflicts occur when multiple nodes within the communication range send data at the same time or when one node receives data sent by multiple nodes at the same time. For broadcast scheduling problem (BSP), many researchers used TDMA (Time Division Multiple Access) scheme based on SVC (Sequential Vertex Colouring) in ad hoc networks to achieve conflict-free scheduling. However, SVC is related to the order of nodes. To improve the fairness of network, the slots of nodes are adjusted by changing the order of nodes. In this paper, we proposed a fair scheduling algorithm for TDMA, which takes into account the number of flows, the size of the flows and the bandwidth of each node. The simulation and analysis results show that this scheduling algorithm can enhance the fairness of the ad hoc compared with the traditional algorithm based on SVC.