On Uplink and Downlink Packet Scheduling in Full-Duplex Wireless Mesh Networks
MetadataShow full item record
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.
Showing items related by title, author, creator and subject.
Nordin, Syarifah Zyurina (2011)Task scheduling in parallel processing systems is one of the most challenging industrial problems. This problem typically arises in the manufacturing and service industries. The task scheduling problem is to determine a ...
Decision Support for an Underground Gold Mining Operation - A Case Study using the Schedule Optimisation ToolFava, L.; Maybee, Bryan; Millar, D. (2012)In the context of a case study for an underground gold mine, the value generated by a schedule optimisation tool (SOT) is assessed. SOT is a software tool for underground mine planning that maximises the net present value ...
Nehring, M.; Topal, Erkan; Knights, P.; Kizil, M. (2012)The development of short- and medium-term mine production schedules in isolation from each other has meant that only a local optimum can be achieved when each scheduling phase is carried out. The globally optimal solution, ...