Show simple item record

dc.contributor.authorChin, Kuek
dc.contributor.authorSoh, Sieteng
dc.contributor.authorMeng, C.
dc.date.accessioned2017-01-30T13:59:20Z
dc.date.available2017-01-30T13:59:20Z
dc.date.created2015-03-03T20:17:36Z
dc.date.issued2012
dc.identifier.citationChin, K. and Soh, S. and Meng, C. 2012. A novel scheduler for concurrent Tx/Rx wireless mesh networks with weighted links. IEEE Communications Letters. 16 (2): pp. 246-248.
dc.identifier.urihttp://hdl.handle.net/20.500.11937/37051
dc.identifier.doi10.1109/LCOMM.2011.122211.112264
dc.description.abstract

This paper considers the NP-hard problem of scheduling weighted links in concurrent transmit/receive wireless mesh networks. The problem generalizes existing works to links with weight wij ≥ 1. We propose an O(|V|2) algorithm, where V is the set of routers, that is orders of magnitude faster than computationally intensive approaches that use the well-known Goemans-Williamson (GWA)'s maximum cut algorithm and also brute-force. Our algorithm generates schedules, on average, with at most 3% and 9% fewer links than the GWA and brute-force approaches respectively.

dc.publisherIEEE Communications Society
dc.titleA novel scheduler for concurrent Tx/Rx wireless mesh networks with weighted links
dc.typeJournal Article
dcterms.source.volume16
dcterms.source.number2
dcterms.source.startPage246
dcterms.source.endPage248
dcterms.source.issn1089-7798
dcterms.source.titleIEEE Communications Letters
curtin.accessStatusFulltext not available


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record