On Uplink and Downlink Packet Scheduling in Full-Duplex Wireless Mesh Networks
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 gre...
| Main Authors: | , , |
|---|---|
| Format: | Journal Article |
| Published: |
IEEE Communications Society
2015
|
| Online Access: | http://hdl.handle.net/20.500.11937/32823 |