Distributed Time Resource Allocation Algorithm for Multi-Beam Directional Ad-Hoc Networks

In order to enhance the network capacity of multi-beam directional Ad-hoc networks under the constraint of nodes unable to simultaneously transmit and receive, one has to effectively handle the dynamic and on-demand allocation of time resources. This letter establishes a mathematical model for resource allocation in multi-beam directional Ad-hoc networks, and reveals the limits of network capacity. In order to achieve a maximum network capacity, a distributed time slot allocation algorithm is designed and optimized, followed by simulation validation. The numerical results indicate that the proposed algorithm can approximate the theoretical performance limits. It effectively resolves the dynamic and on-demand allocation of time resources in multi-beam directional ad hoc networks, thereby significantly enhancing the network capacity.