A Polynomial-Time Approximation Algorithm for Weighted Sum-Rate Maximization in UWB Networks

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...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE International Conference on Communications (2003) s. 3775 - 3779
Hlavní autoři: Gyouhwan Kim, Qiao Li, Negi, R.
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.05.2008
Témata:
Ad hoc networks
Algorithm design and analysis
Approximation algorithms
Bandwidth
Broadcasting
Cost function
Interference
Polynomials
Ultra wideband technology
Wireless networks
ISSN:1550-3607
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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, we propose a polynomial-time approximation algorithm with guaranteed accuracy for WSRM under an Ultra- wide 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. The worst case accuracy and complexity of the algorithm are analyzed by utilizing the quadratic link rate function derived in previous research, under the assumption of a large bandwidth, as is typical in UWB networks. The average case performance of the algorithm is investigated by simulations on random ad hoc networks.
ISSN:1550-3607
DOI:10.1109/ICC.2008.709