A Novel Scheduler for Concurrent Tx/Rx Wireless Mesh Networks with Weighted Links.
IEEE Communications Letters(2012)
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 w ij 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.
MoreTranslated text
Key words
Schedules,Topology,Wireless mesh networks,Approximation algorithms,Algorithm design and analysis,Approximation methods,Force
AI Read Science
Must-Reading Tree
Example
![](https://originalfileserver.aminer.cn/sys/aminer/pubs/mrt_preview.jpeg)
Generate MRT to find the research sequence of this paper
Chat Paper
Summary is being generated by the instructions you defined