| We study the problem of deriving the shortest schedule required to forward both uplink and downlink packets in Wireless Mesh Networks (WMNs) with full duplex capability. We derive the theoretical upper and lower bound of the schedule and propose a novel centralized algorithm, called UDMAC, that greedily generates a schedule on a path-by-path basis and ensures nodes have sufficient antennas for transmissions, receptions and interference cancellation. Our results show that UDMAC outperforms a state-of-the-art half-duplex scheduling algorithm by at least 60\% in terms of schedule length. |