On Uplink and Downlink Packet Scheduling in Full-Duplex Wireless Mesh Networks
dc.contributor.author | Wang, H. | |
dc.contributor.author | Chin, K. | |
dc.contributor.author | Soh, Sie Teng | |
dc.date.accessioned | 2017-01-30T13:33:15Z | |
dc.date.available | 2017-01-30T13:33:15Z | |
dc.date.created | 2016-03-17T19:30:17Z | |
dc.date.issued | 2015 | |
dc.identifier.citation | Wang, H. and Chin, K. and Soh, S.T. 2015. On Uplink and Downlink Packet Scheduling in Full-Duplex Wireless Mesh Networks. IEEE Communications Letters. 19 (10): pp. 1810-1813. | |
dc.identifier.uri | http://hdl.handle.net/20.500.11937/32823 | |
dc.identifier.doi | 10.1109/LCOMM.2015.2470246 | |
dc.description.abstract |
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. | |
dc.publisher | IEEE Communications Society | |
dc.title | On Uplink and Downlink Packet Scheduling in Full-Duplex Wireless Mesh Networks | |
dc.type | Journal Article | |
dcterms.source.volume | 19 | |
dcterms.source.number | 10 | |
dcterms.source.startPage | 1810 | |
dcterms.source.endPage | 1813 | |
dcterms.source.issn | 1089-7798 | |
dcterms.source.title | IEEE Communication Letters | |
curtin.department | Department of Computing | |
curtin.accessStatus | Fulltext not available |
Files in this item
Files | Size | Format | View |
---|---|---|---|
There are no files associated with this item. |