IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v38y2019i3d10.1007_s10878-019-00428-8.html
   My bibliography  Save this article

Integer programming formulations for the shared multicast tree problem

Author

Listed:
  • Marika Ivanova

    (University of Bergen)

  • Dag Haugland

    (University of Bergen)

Abstract

We study the shared multicast tree (SMT) problem in wireless networks. To support a multicast session between a set of network nodes, SMT aims to establish a wireless connection between them, such that the total energy consumption is minimized. All destinations of the multicast message must be connected, while non-destinations are optional nodes that can be used to relay messages. The objective function reflecting power consumption distinguishes SMT clearly from the traditional minimum Steiner tree problem. We develop two integer programming formulations for SMT. Both models are subsequently extended and strengthened. Theorems on relations between the LP bounds corresponding to the models are stated and proved. As the number of variables in the strongest formulations is a polynomial of degree four in the number of network nodes, the models are impractical for computing lower bounds in instances beyond a fairly small size, and therefore a constraint generation scheme is developed. Results from computational experiments with the models demonstrate good promise of the approaches taken.

Suggested Citation

  • Marika Ivanova & Dag Haugland, 2019. "Integer programming formulations for the shared multicast tree problem," Journal of Combinatorial Optimization, Springer, vol. 38(3), pages 927-956, October.
    • Handle: RePEc:spr:jcomop:v:38:y:2019:i:3:d:10.1007_s10878-019-00428-8
    DOI: 10.1007/s10878-019-00428-8
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-019-00428-8
    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/s10878-019-00428-8?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. Dag Haugland & Di Yuan, 2011. "Compact Integer Programming Models for Power-optimal Trees in Ad Hoc Wireless Networks," International Series in Operations Research & Management Science, in: Jeff Kennington & Eli Olinick & Dinesh Rajan (ed.), Wireless Network Design, chapter 0, pages 219-246, Springer.
    2. Valeria Leggieri & Paolo Nobili & Chefi Triki, 2008. "Minimum power multicasting problem in wireless networks," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 68(2), pages 295-311, October.
    3. R. Montemanni & V. Leggieri, 2011. "A branch and price algorithm for the minimum power multicasting problem in wireless sensor networks," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 74(3), pages 327-342, December.
    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. Rossi, André & Aubry, Alexis & Jacomino, Mireille, 2012. "Connectivity-and-hop-constrained design of electricity distribution networks," European Journal of Operational Research, Elsevier, vol. 218(1), pages 48-57.
    2. R. Montemanni & V. Leggieri, 2011. "A branch and price algorithm for the minimum power multicasting problem in wireless sensor networks," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 74(3), pages 327-342, December.
    3. Xiangyong Li & Y. P. Aneja, 2012. "A Branch-and-Cut Approach for the Minimum-Energy Broadcasting Problem in Wireless Networks," INFORMS Journal on Computing, INFORMS, vol. 24(3), pages 443-456, August.
    4. János Barta & Valeria Leggieri & Roberto Montemanni & Paolo Nobili & Chefi Triki, 2011. "Minimum power multicasting in wireless networks under probabilistic node failures," Computational Optimization and Applications, Springer, vol. 49(1), pages 193-212, May.

    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:jcomop:v:38:y:2019:i:3:d:10.1007_s10878-019-00428-8. 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.