IDEAS home Printed from https://ideas.repec.org/p/aeg/wpaper/2009-14.html
   My bibliography  Save this paper

A Power-Indexed Formulation for Wireless Network Design

Author

Listed:
  • Fabio D'Andreagiovanni

    (Dipartimento di Informatica e Sistemistica "A. Ruberti", Sapienza - Universita' di Roma, Roma, Italy.)

  • Carlo Mannino

    (Dipartimento di Informatica e Sistemistica "A. Ruberti", Sapienza - Universita' di Roma, Roma, Italy.)

  • Antonio Sassano

    (Dipartimento di Informatica e Sistemistica "A. Ruberti", Sapienza - Universita' di Roma, Roma, Italy.)

Abstract

Wireless networks have shown a rapid growth over the past two decades and now play an increasingly prominent role in different telecommunication systems. Consequently, scarce resources such as the radio spectrum and the physical sites that accommodate transmitters have become extremely congested and need to be allocated in more effective ways. Since the early 1980s several optimization models have been developed to design wireless networks, that is to localize and configure transmitters by assigning transmission frequencies and emission powers to them. Most such models represent emission powers as continuous decision variables. This choice typically yields ill-conditioned constraint matrices and requires the introduction of very large coefficients to model disjunctive relations. The corresponding relaxations are very weak and the solutions returned by Mixed-Integer Linear Programming solvers are typically far from the optimum and sometimes even infeasible. In order to overcome these difficulties, we introduce a pure 0-1 formulation for the problem that is obtained by considering only a finite set of power values. Basing on such formulation we also developed an iterative, row generation algorithm to solve wireless network design problems. The new approach presents many computational and modeling advantages. First, albeit considering only a subset of feasible solutions, it allows to find better solutions to large practical instances with less computational effort. Second, since the feasible powers are well spaced over the power spectrum, the final plans tend to be robust. Third, it directly models power restrictions that are often imposed by the technology and that sometimes permits two values only (i.e., on/off). Finally, it easily allows for generalizations, such as power consumption minimization.

Suggested Citation

  • 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".
  • Handle: RePEc:aeg:wpaper:2009-14
    as

    Download full text from publisher

    File URL: http://www.dis.uniroma1.it/~bibdis/RePEc/aeg/wpaper/2009-14.pdf
    File Function: First version, 2009
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Carlo Mannino & Fabrizio Rossi & Stefano Smriglio, 2006. "The Network Packing Problem in Terrestrial Broadcasting," Operations Research, INFORMS, vol. 54(4), pages 611-626, August.
    2. DYER, Martin E. & WOLSEY, Laurence A., 1990. "Formulating the single machine sequencing problem with release dates as a mixed integer program," LIDAM Reprints CORE 878, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    3. E. DYER, Martin & WOLSEY, Laurence A., 1990. "Formulating the single machine sequencing problem with release dates as a mixed integer program," LIDAM Reprints CORE 917, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    4. 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.
    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. Fabio D'Andreagiovanni & Carlo Mannino & Antonio Sassano, 2010. "GUB Covers and Power-Indexed Formulations for Wireless Network Design," DIS Technical Reports 2010-14, Department of Computer, Control and Management Engineering, Universita' degli Studi di Roma "La Sapienza".
    2. J.M. van den Akker & C.A.J. Hurkens & M.W.P. Savelsbergh, 2000. "Time-Indexed Formulations for Machine Scheduling Problems: Column Generation," INFORMS Journal on Computing, INFORMS, vol. 12(2), pages 111-124, May.
    3. Daniel Kowalczyk & Roel Leus, 2018. "A Branch-and-Price Algorithm for Parallel Machine Scheduling Using ZDDs and Generic Branching," INFORMS Journal on Computing, INFORMS, vol. 30(4), pages 768-782, November.
    4. Artur Alves Pessoa & Teobaldo Bulhões & Vitor Nesello & Anand Subramanian, 2022. "Exact Approaches for Single Machine Total Weighted Tardiness Batch Scheduling," INFORMS Journal on Computing, INFORMS, vol. 34(3), pages 1512-1530, May.
    5. Maria Fleischer Fauske & Carlo Mannino & Paolo Ventura, 2020. "Generalized Periodic Vehicle Routing and Maritime Surveillance," Transportation Science, INFORMS, vol. 54(1), pages 164-183, January.
    6. Carlo Mannino & Alessandro Mascis, 2009. "Optimal Real-Time Traffic Control in Metro Stations," Operations Research, INFORMS, vol. 57(4), pages 1026-1039, August.
    7. Jain, A. S. & Meeran, S., 1999. "Deterministic job-shop scheduling: Past, present and future," European Journal of Operational Research, Elsevier, vol. 113(2), pages 390-434, March.
    8. Tjark Vredeveld & Cor Hurkens, 2002. "Experimental Comparison of Approximation Algorithms for Scheduling Unrelated Parallel Machines," INFORMS Journal on Computing, INFORMS, vol. 14(2), pages 175-189, May.
    9. Soric, Kristina, 2000. "A cutting plane algorithm for a single machine scheduling problem," European Journal of Operational Research, Elsevier, vol. 127(2), pages 383-393, December.
    10. Giuseppe Lancia & Franca Rinaldi & Paolo Serafini, 2011. "A time-indexed LP-based approach for min-sum job-shop problems," Annals of Operations Research, Springer, vol. 186(1), pages 175-198, June.
    11. José R. Correa & Andreas S. Schulz, 2005. "Single-Machine Scheduling with Precedence Constraints," Mathematics of Operations Research, INFORMS, vol. 30(4), pages 1005-1021, November.
    12. Sophie Demassey & Christian Artigues & Philippe Michelon, 2005. "Constraint-Propagation-Based Cutting Planes: An Application to the Resource-Constrained Project Scheduling Problem," INFORMS Journal on Computing, INFORMS, vol. 17(1), pages 52-65, February.
    13. Francis Sourd, 2009. "New Exact Algorithms for One-Machine Earliness-Tardiness Scheduling," INFORMS Journal on Computing, INFORMS, vol. 21(1), pages 167-175, February.
    14. Pasquale Avella & Maurizio Boccia & Bernardo D’Auria, 2005. "Near-Optimal Solutions of Large-Scale Single-Machine Scheduling Problems," INFORMS Journal on Computing, INFORMS, vol. 17(2), pages 183-191, May.
    15. Lotte Berghman & Roel Leus & Frits Spieksma, 2014. "Optimal solutions for a dock assignment problem with trailer transportation," Annals of Operations Research, Springer, vol. 213(1), pages 3-25, February.
    16. Martin W. P. Savelsbergh & R. N. Uma & Joel Wein, 2005. "An Experimental Study of LP-Based Approximation Algorithms for Scheduling Problems," INFORMS Journal on Computing, INFORMS, vol. 17(1), pages 123-136, February.
    17. José Manuel García-Sánchez & Plácido Moreno, 2024. "Novel Approaches to the Formulation of Scheduling Problems," Mathematics, MDPI, vol. 12(7), pages 1-15, March.
    18. Philippe Baptiste & Ruslan Sadykov, 2009. "On scheduling a single machine to minimize a piecewise linear objective function: A compact MIP formulation," Naval Research Logistics (NRL), John Wiley & Sons, vol. 56(6), pages 487-502, September.
    19. Louis-Philippe Bigras & Michel Gamache & Gilles Savard, 2008. "Time-Indexed Formulations and the Total Weighted Tardiness Problem," INFORMS Journal on Computing, INFORMS, vol. 20(1), pages 133-142, February.
    20. Natashia Boland & Riley Clement & Hamish Waterer, 2016. "A Bucket Indexed Formulation for Nonpreemptive Single Machine Scheduling Problems," INFORMS Journal on Computing, INFORMS, vol. 28(1), pages 14-30, February.

    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:aeg:wpaper:2009-14. 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: Antonietta Angelica Zucconi (email available below). General contact details of provider: https://edirc.repec.org/data/dirosit.html .

    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.