IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v107y2001i1p267-28310.1023-a1014915519359.html
   My bibliography  Save this article

Models and Algorithms for Terrestrial Digital Broadcasting

Author

Listed:
  • F. Rossi
  • S. Smriglio
  • A. Sassano

Abstract

The service provided by a Digital Video Broadcasting (DVB) system in terms of coverage of territory and population is greatly affected by transmitters emission power and temporal offset. We show that the problem of computing the emission powers so as to guarantee the required signal to interference ratio can be formulated as a mixed integer linear program. We also model the optimization of temporal offsets as a maximum clique problem on interval graphs. We analyze the behaviour of the models and verify their practical applicability in a computational experience on the whole Italian territory. Both the models allow to manage large scale instances and to achieve high coverage of population and territory. Copyright Kluwer Academic Publishers 2001

Suggested Citation

  • F. Rossi & S. Smriglio & A. Sassano, 2001. "Models and Algorithms for Terrestrial Digital Broadcasting," Annals of Operations Research, Springer, vol. 107(1), pages 267-283, October.
    • Handle: RePEc:spr:annopr:v:107:y:2001:i:1:p:267-283:10.1023/a:1014915519359
    DOI: 10.1023/A:1014915519359
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1023/A:1014915519359
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1023/A:1014915519359?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.

    Citations

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


    Cited by:

    1. Edoardo Amaldi & Raphael Hauser, 2005. "Boundedness Theorems for the Relaxation Method," Mathematics of Operations Research, INFORMS, vol. 30(4), pages 939-955, November.
    2. Feng Qiu & Shabbir Ahmed & Santanu S. Dey & Laurence A. Wolsey, 2014. "Covering Linear Programming with Violations," INFORMS Journal on Computing, INFORMS, vol. 26(3), pages 531-546, August.
    3. Carlo Mannino & Fabrizio Rossi & Stefano Smriglio, 2006. "The Network Packing Problem in Terrestrial Broadcasting," Operations Research, INFORMS, vol. 54(4), pages 611-626, August.
    4. Carlo Mannino & Sara Mattia & Antonio Sassano, 2009. "Planning Wireless Networks by Shortest Path," DIS Technical Reports 2009-02, Department of Computer, Control and Management Engineering, Universita' degli Studi di Roma "La Sapienza".

    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:107:y:2001:i:1:p:267-283:10.1023/a:1014915519359. 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.