System-Level Optimization in Poisson Cellular Networks: An Approach Based on the Generalized Benders Decomposition

• Published in: IEEE wireless communications letters Vol. 9; no. 10; pp. 1773 - 1777
• Main Authors: Song, Jian, Di Renzo, Marco, Zappone, Alessio, Sciancalepore, Vincenzo, Perez, Xavier Costa
• Format: Journal Article
• Language: English
• Published: Piscataway IEEE 01-10-2020; The Institute of Electrical and Electronics Engineers, Inc. (IEEE); IEEE comsoc
• Subjects: Algorithms; Analytical models; Bandwidth; Benders decomposition; Cellular communication; Cellular networks; Convexity; Engineering Sciences; Geometry; Greedy algorithms; Mixed integer; mixed-integer non-linear optimization; Networks; Nonlinear systems; Optimization; Parameters; Resource allocation; Signal and Image processing; Silicon; stochastic geometry; Stochastic processes; system-level analysis; Cellular networks; systemlevel analysis; mixed-integer non-linear optimization; stochastic geometry
• ISSN: 2162-2337; 2162-2345
• DOI: 10.1109/LWC.2020.3004193

During the last decade, stochastic geometry has been widely employed for system-level analysis in cellular networks. The resulting analytical frameworks are, however, not always amenable for system-level optimization. This is due to three main reasons: (i) the performance metric of interest may not be formulated in closed-form; (ii) under some analytically tractable modeling assumptions, important system parameters may not explicitly appear in the analytical frameworks; and (iii) the optimization problem may not possess any structural properties, e.g., convexity, that facilitate the development of numerical algorithms for optimizing multiple (continuous- and discrete-valued) parameters at an affordable computational complexity and with performance-guarantee, e.g., the convergence to the global optimum is provable. In this letter, by leveraging a recently proposed definition of coverage probability, we formulate mixed-integer non-linear system-level resource allocation problems in Poisson cellular networks and prove that their global optimum can be efficiently calculated by applying the generalized Benders decomposition. Numerical results are illustrated in order to compare the proposed approach against brute-force and greedy-like optimization algorithms.