Strict Log-Convexity of the Minimum Power Vector
暂无分享,去创建一个
[1] Jean C. Walrand,et al. Fair end-to-end window-based congestion control , 2000, TNET.
[2] Frank Kelly,et al. Rate control for communication networks: shadow prices, proportional fairness and stability , 1998, J. Oper. Res. Soc..
[3] Valerie Isham,et al. Non‐Negative Matrices and Markov Chains , 1983 .
[4] Ness B. Shroff,et al. A utility-based power-control scheme in wireless cellular systems , 2003, TNET.
[5] Slawomir Stanczak,et al. The infeasible SIR region is not a convex set , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..
[6] E. Seneta. Non-negative Matrices and Markov Chains , 2008 .
[7] Rudolf Mathar,et al. The geometry of the capacity region for CDMA systems with general power constraints , 2005, IEEE Transactions on Wireless Communications.
[8] Cem U. Saraydar,et al. Efficient power control via pricing in wireless data networks , 2002, IEEE Trans. Commun..
[9] Dimitri P. Bertsekas,et al. Nonlinear Programming , 1997 .
[10] Michael L. Honig,et al. A game theoretic analysis of distributed power control for spread spectrum ad hoc networks , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..
[11] Slawomir Stanczak,et al. Log-convexity of the minimum total power in CDMA systems with certain quality-of-service guaranteed , 2005, IEEE Transactions on Information Theory.