IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v253y2017i1d10.1007_s10479-016-2306-1.html
   My bibliography  Save this article

A global optimization framework for distributed antenna location in CDMA cellular networks

Author

Listed:
  • Jitamitra Desai

    (Nanyang Technological University)

  • Shalinee Kishore

    (Lehigh University)

Abstract

In this paper, we present a set of (exact and approximate) mathematical models and algorithms for determining the set of (globally) optimal distributed antenna deployments and the supported user demand in cellular code division multiple access (CDMA) systems. We focus on the uplink (user-to-base station) formulation and assume that the base station combines all the received signals at each of the antennas using path-gain based weights. In CDMA systems, as all users occupy the system bandwidth at the same time thereby interfering with each other, this results in a complicated 0–1 mixed-integer multilinear programming problem, where the objective function maximizes the total system capacity, while ensuring that the minimum signal-to-interference-plus-noise ratio (SINR) constraints and maximum transmit power constraints for each user are satisfied. This highly nonlinear, nonconvex problem is reformulated to yield a tight mixed-integer 0–1 linear programming representation via the addition of several auxiliary variables and constraints, and a specialized algorithm is designed to determine globally optimal solutions. The computational results obtained, corresponding to different user distributions, demonstrate the efficacy of the proposed models and algorithms, and clearly exhibit the viability of both exact and approximate models.

Suggested Citation

  • Jitamitra Desai & Shalinee Kishore, 2017. "A global optimization framework for distributed antenna location in CDMA cellular networks," Annals of Operations Research, Springer, vol. 253(1), pages 169-191, June.
    • Handle: RePEc:spr:annopr:v:253:y:2017:i:1:d:10.1007_s10479-016-2306-1
    DOI: 10.1007/s10479-016-2306-1
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-016-2306-1
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10479-016-2306-1?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Rudolf Mathar & Michael Schmeink, 2001. "Optimal Base Station Positioning and Channel Assignment for 3G Mobile Networks by Integer Programming," Annals of Operations Research, Springer, vol. 107(1), pages 225-236, October.
    2. Manuel Laguna, 1998. "Applying Robust Optimization to Capacity Expansion of One Location in Telecommunications with Demand Uncertainty," Management Science, INFORMS, vol. 44(11-Part-2), pages 101-110, November.
    3. Hanif Sherali & Evrim Dalkiran & Jitamitra Desai, 2012. "Enhancing RLT-based relaxations for polynomial programming problems via a new class of v-semidefinite cuts," Computational Optimization and Applications, Springer, vol. 52(2), pages 483-506, June.
    4. Andreas Eisenblätter & Jonas Schweiger, 2012. "Multistage stochastic programming in strategic telecommunication network planning," Computational Management Science, Springer, vol. 9(3), pages 303-321, August.
    5. Olinick, Eli V. & Rosenberger, Jay M., 2008. "Optimizing revenue in CDMA networks under demand uncertainty," European Journal of Operational Research, Elsevier, vol. 186(2), pages 812-825, April.
    6. Joakim Kalvenes & Jeffery Kennington & Eli Olinick, 2006. "Base Station Location and Service Assignments in W--CDMA Networks," INFORMS Journal on Computing, INFORMS, vol. 18(3), pages 366-376, August.
    7. Morten Riis & Jørn Lodahl, 2002. "A bicriteria stochastic programming model for capacity expansion in telecommunications," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 56(1), pages 83-100, August.
    8. Hanif D. Sherali & Jitamitra Desai, 2005. "On Solving Polynomial, Factorable, and Black-Box Optimization Problems Using the RLT Methodology," Springer Books, in: Charles Audet & Pierre Hansen & Gilles Savard (ed.), Essays and Surveys in Global Optimization, chapter 0, pages 131-163, Springer.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Olinick, Eli V. & Rosenberger, Jay M., 2008. "Optimizing revenue in CDMA networks under demand uncertainty," European Journal of Operational Research, Elsevier, vol. 186(2), pages 812-825, April.
    2. Chen, Lei & Yuan, Di, 2010. "Solving a minimum-power covering problem with overlap constraint for cellular network design," European Journal of Operational Research, Elsevier, vol. 203(3), pages 714-723, June.
    3. Jay M. Rosenberger & Eli V. Olinick, 2007. "Robust tower location for code division multiple access networks," Naval Research Logistics (NRL), John Wiley & Sons, vol. 54(2), pages 151-161, March.
    4. Jonas Christoffer Villumsen & Joe Naoum‐Sawaya, 2016. "Column generation for stochastic green telecommunication network planning with switchable base stations," Naval Research Logistics (NRL), John Wiley & Sons, vol. 63(5), pages 351-366, August.
    5. Joe Naoum‐Sawaya & Samir Elhedhli, 2010. "A nested benders decomposition approach for telecommunication network planning," Naval Research Logistics (NRL), John Wiley & Sons, vol. 57(6), pages 519-539, September.
    6. Kavinesh J. Singh & Andy B. Philpott & R. Kevin Wood, 2009. "Dantzig-Wolfe Decomposition for Solving Multistage Stochastic Capacity-Planning Problems," Operations Research, INFORMS, vol. 57(5), pages 1271-1286, October.
    7. Evrim Dalkiran & Hanif Sherali, 2013. "Theoretical filtering of RLT bound-factor constraints for solving polynomial programming problems to global optimality," Journal of Global Optimization, Springer, vol. 57(4), pages 1147-1172, December.
    8. Chen, Andrew N.K. & Goes, Paulo B. & Gupta, Alok & Marsden, James R., 2006. "Heuristics for selecting robust database structures with dynamic query patterns," European Journal of Operational Research, Elsevier, vol. 168(1), pages 200-220, January.
    9. Karen Aardal & Stan Hoesel & Arie Koster & Carlo Mannino & Antonio Sassano, 2007. "Models and solution techniques for frequency assignment problems," Annals of Operations Research, Springer, vol. 153(1), pages 79-129, September.
    10. Yin, Yafeng, 2008. "Robust optimal traffic signal timing," Transportation Research Part B: Methodological, Elsevier, vol. 42(10), pages 911-924, December.
    11. Jimenez, Charlotte & Dauzère-Pérès, Stéphane & Feuillebois, Christian & Pauly, Eric, 2013. "Optimizing the positioning and technological choices of RFID elements for aircraft part identification," European Journal of Operational Research, Elsevier, vol. 227(2), pages 350-357.
    12. M Riis & A J V Skriver & S F Møller, 2005. "Internet protocol network design with uncertain demand," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(10), pages 1184-1195, October.
    13. S Mudchanatongsuk & F Ordóñez & J Liu, 2008. "Robust solutions for network design under transportation cost and demand uncertainty," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(5), pages 652-662, May.
    14. Mac Cawley, Alejandro & Maturana, Sergio & Pascual, Rodrigo & Tortorella, Guilherme Luz, 2022. "Scheduling wine bottling operations with multiple lines and sequence-dependent set-up times: Robust formulation and a decomposition solution approach," European Journal of Operational Research, Elsevier, vol. 303(2), pages 819-839.
    15. C A Poojari & C Lucas & G Mitra, 2008. "Robust solutions and risk measures for a supply chain planning problem under uncertainty," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(1), pages 2-12, January.
    16. Fabio D'Andreagiovanni & Carlo Mannino & Antonio Sassano, 2009. "A Power-Indexed Formulation for Wireless Network Design," DIS Technical Reports 2009-14, Department of Computer, Control and Management Engineering, Universita' degli Studi di Roma "La Sapienza".
    17. Andreas Eisenblätter & Hans-Florian Geerdes & Thorsten Koch & Alexander Martin & Roland Wessäly, 2006. "UMTS radio network evaluation and optimization beyond snapshots," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 63(1), pages 1-29, February.
    18. Qiang Fu & Tianxiao Li & Song Cui & Dong Liu & Xueping Lu, 2018. "Agricultural Multi-Water Source Allocation Model Based on Interval Two-Stage Stochastic Robust Programming under Uncertainty," Water Resources Management: An International Journal, Published for the European Water Resources Association (EWRA), Springer;European Water Resources Association (EWRA), vol. 32(4), pages 1261-1274, March.
    19. S H Melouk & B B Keskin & C Armbrester & M Anderson, 2011. "A simulation optimization-based decision support tool for mitigating traffic congestion," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(11), pages 1971-1982, November.
    20. Emmanuel Kwasi Mensah, 2020. "Robust data envelopment analysis via ellipsoidal uncertainty sets with application to the Italian banking industry," Decisions in Economics and Finance, Springer;Associazione per la Matematica, vol. 43(2), pages 491-518, December.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:annopr:v:253:y:2017:i:1:d:10.1007_s10479-016-2306-1. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.