Capacity Analysis and Link Scheduling Design in Double-Channel Full-Duplex Wireless Networks

Full-duplex communication has been proved as a realizable way to enhance the capacity of wireless network. In this paper, we analyze the asymptotic capacity of full-duplex wireless networks where each terminal is equipped with only one interface, but two channels are available. By analysis, we obtain the upperbound of the full-duplex capacity. Based on the theoretical analysis, we design two link scheduling algorithms. One is a Centralized Link Scheduling Algorithm (CLSA) based on Maximal Independent Set (MIS) Selection. The other is a Distributed Link Scheduling Algorithm (DLSA) following the idea Carrier Sensing Multiple Access. In CLSA, we design a simulated annealing based mechanism for MIS selection problem. In DLSA, we modify the subtraction of backoff timer when it is non-zero to effectively utilize idle time in networks. We investigate the performance of these two algorithms through simulations. For comparison, we implement a Greedy Link Scheduling Algorithm (GLSA). It is found that the throughput obtained from CLSA is about 15%-25% higher than that obtained from GLSA. Simulation results also show that our proposed DLSA performs almost as good as CLSA and GLSA and its time complexity and space complexity are lower than CLSA.