Time Slot Allocation in Directional Ad Hoc Networks Based on Matching Theory

In this paper, a time slot allocation algorithm based on matching theory is proposed to improve the channel utilization and network throughput of directional ad hoc networks. To maximize the network throughput while considering interference among nodes, we establish directional antenna and network models. By adopting a link-based slot allocation strategy and utilizing many-to-many matching theory with externalities, the algorithm optimizes the matching between communication node pairs and time slots. Simulation results show that, compared to the greedy algorithm and exhaustive search, the proposed algorithm increases network throughput while reducing computational complexity. Additionally, when the system resources are not saturated, higher antenna directionality leads to higher channel utilization and throughput.