Abstract
The widely considered power constraints on optimizing power allocation in wireless networks, e.g., \(p_{n}\ge 0, \forall n\), and \(\sum _{n=1}^{N}{p_{n}}\le P_{\text {max}}\) where N and \(P_{\text {max}}\) are given constants, imply the constraints, i.e., \(p_{n}\le P_{\text {max}}, \forall n\). However, the related implicit constraints are regarded as redundant in the most current studies. In this paper, we explore the question “Are the implicit constraints really redundant?” in the optimization of power allocation especially when using iterative methods that have slow convergence speeds. Using the water-filling problem as an illustration, we derive the structural properties of the optimal solutions based on Karush-Kuhn-Tucker conditions, propose a non-iterative closed-form optimal method, and use subgradient methods to solve the problem. Our theoretical analysis shows that the implicit constraints are not redundant, and their consideration can effectively speed up convergence of the used iterative methods and reduce the sensitivity to the chosen step sizes. Numerical results for the water-filling problem and another existing power allocation problem confirm the effectiveness of considering the implicit constraints.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Zander, J., Kim, S.L., Almgren, M.: Radio Resource Management. Artech House Publishers, Norwood (2001)
Peng, M., Wang, C., Li, J., Xiang, H., Lau, V.: Recent advances in underlay heterogeneous networks: interference control, resource allocation, and self-organization. IEEE Commun. Surv. Tutorials 17(2), 700–729 (2015)
Zhang, L., Xin, Y., Liang, Y.C., Poor, H.V.: Cognitive multiple access channels: optimal power allocation for weighted sum rate maximization. IEEE Trans. Commun. 57(9), 2754–2762 (2009)
Nguyen, D.N., Krunz, M.: Spectrum management and power allocation in MIMO cognitive networks. In: Proceedings of IEEE INFOCOM, pp. 2023–2031, April 2012
Xiao, L., Johansson, M., Boyd, S.: Simultaneous routing and resource allocation via dual decomposition. IEEE Trans. Commun. 52(7), 136–1134 (2004)
Li, Z., Li, B.: Efficient and distributed computation of maximum multicast rates. In: Proceedings of IEEE INFOCOM, pp. 1618–1628, March 2005
Fang, X., Yang, D., Xue, G.: Consort: node-constrained opportunistic routing in wireless mesh networks. In: Proceedings of IEEE INFOCOM, pp. 1907–1915, April 2011
Masiero, R., Neglia, G.: Distributed subgradient methods for delay tolerant networks. In: Proceedings of IEEE INFOCOM, pp. 261–265, April 2011
Hajiaghayi, M., Dong, M., Liang, B.: Optimal channel assignment and power allocation for dual-hop multi-channel multi-user relaying. In: Proceedings of IEEE INFOCOM, pp. 76–80, April 2011
Fang, X., Yang, D., Xue, G.: Resource allocation in load-constrained multihopwireless networks. In: Proceedings of IEEE INFOCOM, pp. 280–288, April 2012
Guo, S., Yang, Y.: A distributed optimal framework for mobile data gathering with concurrent data uploading in wireless sensor networks. In: Proceedings of IEEE INFOCOM, pp. 1305–1313, April 2012
Zhao, F., Médard, M., Ozdaglar, A., Lun, D.: Convergence study of decentralized min-cost subgraph algorithms for multicast in coded networks. IEEE Trans. Inf. Theor. 60(1), 410–421 (2014)
Tous, H.A., Barhumi, I.: Resource allocation for multiuser improved AF cooperative communication scheme. IEEE Trans. Wirel. Commun. 14(7), 3655–3672 (2015)
Boyd, S., Vandenbergh, L.: Convex Optimization. Cambridge University Press, New York (2004)
Gäler, O.: Foundations of Optimization. Springer, New York (2010)
Chung, Y.J., Paik, C.H., Kim, H.G.: Subgradient approach for resource management in multiuser OFDM systems. In: Proceedings of International Conference on Communications and Electronics, pp. 203–207, October 2006
He, P., Zhao, L., Zhou, S., Niu, Z.: Water-filling: a geometric approach and its application to solve generalized radio resource allocation problems. IEEE Trans. Wirel. Commun. 12(7), 3637–3667 (2013)
Acknowledgment
This work is support in part by a China Scholarship Council Four Year Doctoral Fellowship, the Canadian Natural Sciences and Engineering Research Council through grants RGPIN-2014-06119 and RGPAS-462031-2014 and the National Natural Science Foundation of China through Grant No. 61271182.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering
About this paper
Cite this paper
Li, X., Leung, V.C.M. (2017). Optimizing Power Allocation in Wireless Networks: Are the Implicit Constraints Really Redundant?. In: Zhou, Y., Kunz, T. (eds) Ad Hoc Networks. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 184. Springer, Cham. https://doi.org/10.1007/978-3-319-51204-4_12
Download citation
DOI: https://doi.org/10.1007/978-3-319-51204-4_12
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-51203-7
Online ISBN: 978-3-319-51204-4
eBook Packages: Computer ScienceComputer Science (R0)