Download now Free registration required
Scheduling in an ad hoc wireless network suffers from the non-convexity of the cost function, caused by the interference between communication links. In previous optimization theoretic analysis, the Weighted Sum-Rate Maximization (WSRM) which inherits the non-convexity has been identified as a core problem of the hard scheduling problem. In this paper, the authors propose a polynomial-time approximation algorithm with guaranteed accuracy for WSRM under an UltraWide Band (UWB) assumption. The algorithm is obtained by an appropriate adaptation of the 'Shifting' strategy (a well-known approximation technique for some geometric problems) for the wireless broadcast environment.
- Format: PDF
- Size: 208.73 KB