IDEAS home Printed from https://ideas.repec.org/h/spr/isochp/978-1-4419-6111-2_10.html
   My bibliography  Save this book chapter

Compact Integer Programming Models for Power-optimal Trees in Ad Hoc Wireless Networks

In: Wireless Network Design

Author

Listed:
  • Dag Haugland

    (University of Bergen)

  • Di Yuan

    (Linköping University)

Abstract

This chapter examines two types of optimization problems of minimizing the total transmission power required to satisfy some connectivity requirement for a group of nodes in ad hoc wireless networks. The first problem type is broadcast and multicast of messages from a source node to the rest of the group. The second problem type, also known as range assignment, amounts to forming a strongly connected subgraph containing all nodes of the group by bi-directional links. Optimal solutions to these problems are characterized by trees or arborescences. As a consequence of power minimization in a wireless transmission environment, the structural properties of these optimal trees and arborescences differ significantly from the classical ones. We discuss compact integer programming models for both problem types. In addition to reviewing models based on network flows, we develop a new compact model for range assignment. We provide theoretical analysis of how the models relate to each other in the strengths of their linear programming (LP) relaxations. Experimental results are provided to illustrate the performance of the models in bounding and in approaching integer optimality. The new compact model for range assignment turns out to be very competitive in both aspects.

Suggested Citation

  • 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.
    • Handle: RePEc:spr:isochp:978-1-4419-6111-2_10
    DOI: 10.1007/978-1-4419-6111-2_10
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. 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.

    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:isochp:978-1-4419-6111-2_10. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.