TY - GEN

T1 - Distributed throughput-maximization using the up- and downlink duality in wireless networks

AU - Park, Jung Min

AU - Kim, Seong Lyun

PY - 2007

Y1 - 2007

N2 - We consider the throughput-maximization problem for both up- and downlink in the wireless network. For the purpose, we design an iterative and distributive uplink algorithm based on Lagrangian relaxation. Using the Lagrange multipliers and the network duality, we make throughput-maximization in the downlink. Our analysis and computational tests assume that channels are symmetric between up- and downlink. The network duality we proved here is a generalized version of previous researches by Jindal et al. and Catrein et al. Computational test shows that the performance of up- and downlink throughput for our algorithms is close to the optimal value for the channel orthogonality factor between 0.5 and 1. In particular, our duality-based approach gives 97-98% throughput of the optimal uplink algorithm proposed by Kumaran and Quian, and a downlink heuristic algorithm (MPA-1) proposed by Mo and Kim, when the channel orthogonality factor is a value between 0.5 and 1. On the other hand, when channels are rather orthogonal (between 0 and 0.5), we have observed some throughput degradation in the downlink, which is about 86% of MPA-1. Considering the complexity of the existing algorithms, we conclude that these results are quite encouraging in terms of both performance and practical applicability of the generalized duality theorem.

AB - We consider the throughput-maximization problem for both up- and downlink in the wireless network. For the purpose, we design an iterative and distributive uplink algorithm based on Lagrangian relaxation. Using the Lagrange multipliers and the network duality, we make throughput-maximization in the downlink. Our analysis and computational tests assume that channels are symmetric between up- and downlink. The network duality we proved here is a generalized version of previous researches by Jindal et al. and Catrein et al. Computational test shows that the performance of up- and downlink throughput for our algorithms is close to the optimal value for the channel orthogonality factor between 0.5 and 1. In particular, our duality-based approach gives 97-98% throughput of the optimal uplink algorithm proposed by Kumaran and Quian, and a downlink heuristic algorithm (MPA-1) proposed by Mo and Kim, when the channel orthogonality factor is a value between 0.5 and 1. On the other hand, when channels are rather orthogonal (between 0 and 0.5), we have observed some throughput degradation in the downlink, which is about 86% of MPA-1. Considering the complexity of the existing algorithms, we conclude that these results are quite encouraging in terms of both performance and practical applicability of the generalized duality theorem.

UR - http://www.scopus.com/inward/record.url?scp=36849063750&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=36849063750&partnerID=8YFLogxK

U2 - 10.1145/1280940.1280961

DO - 10.1145/1280940.1280961

M3 - Conference contribution

AN - SCOPUS:36849063750

SN - 1595936955

SN - 9781595936950

T3 - IWCMC 2007: Proceedings of the 2007 International Wireless Communications and Mobile Computing Conference

SP - 97

EP - 102

BT - IWCMC 2007

T2 - IWCMC 2007: 2007 International Wireless Communications and Mobile Computing Conference

Y2 - 12 August 2007 through 16 August 2007

ER -