A novel scheduler for concurrent Tx/Rx wireless mesh networks with weighted links
MetadataShow full item record
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.
Showing items related by title, author, creator and subject.
Modelling the co-occurence of Streptococcus pneumoniae with other bacterial and viral pathogens in the upper respiratory tractJacoby, P.; Watson, K.; Bowman, J.; Taylor, A.; Riley, T.; Smith, D.; Lehmann, Deborah (2007)Go to ScienceDirect® Home Skip Main Navigation Links Brought to you by: The University of Western Australia Library Login: + Register Athens/Institution Login Not Registered? - User Name: Password: ...
Xu, Y.; Chin, K.; Soh, Sie Teng; Raad, R. (2016)A key advance in enabling higher wireless mesh network capacity is allowing routers to transmit or receive (MTR) from multiple neighbors simultaneously over the same frequency. Achieving this capacity, however, is predicated ...
Lin, G.; Soh, Sie Teng; Chin, K.; Lazarescu, Mihai (2016)Current network infrastructures are over-provisioned and thus exhibit poor power efficiency at low traffic load. We consider networks consisting of bundled links, whereby each link has one or more physical cables that can ...