This Article Full Text (PDF) References Alert me when this article is cited Alert me if a correction is posted Services Email this article to a friend Similar articles in this journal Alert me to new issues of the journal Download to citation manager Citing Articles Citing Articles via Google Scholar Google Scholar Articles by Mannino, C. Articles by Smriglio, S. Search for Related Content

The Network Packing Problem in Terrestrial Broadcasting

Dipartimento di Informatica e Sistemistica, Università di Roma "La Sapienza," via Buonarroti 12, 00185, Roma, Italy
Dipartimento di Informatica, Università di L'Aquila, via Vetoio, 67010, Coppito (AQ), Italy
Dipartimento di Informatica, Università di L'Aquila, via Vetoio, 67010, Coppito (AQ), Italy
mannino{at}dis.uniromal.it
rossi{at}di.univaq.it
smriglio{at}di.univaq.it

The introduction of digital terrestrial broadcasting all over Europe requires a complete and challenging replanning of in-place analog systems. However, an abrupt migration of resources (transmitters and frequencies) from analog to digital networks cannot be accomplished because the analog services must be preserved temporarily. Hence, a multiobjective problem arises, in which several networks sharing a common set of resources have to be designed. This problem is referred to as the network packing problem. In Italy, this problem is particularly challenging because of a large number of transmitters, orographical features, and strict requirements imposed by Italian law. In this paper, we report our experience in developing solution methods at the major Italian broadcaster Radiotelevisione Italiana (RAI S.p.A.). We propose a two-stage heuristic. In the first stage, emission powers are assigned to each network separately. In the second stage, frequencies are assigned to all networks so as to minimize the loss from mutual interference. A software tool incorporating our methodology is currently in use at RAI to help discover and select high-quality alternatives for the deployment of digital equipment.

Subject classifications: communications: frequency and power assignment; integer programming, heuristic: neighborhood search.
History: Received October 2003; revision received March 2005; accepted July 2005.