Transmitters and receivers are the basic elements of wireless networks and are characterized by a number of radio-electrical parameters. The generic planning problem consists of establishing suitable values for these parameters so as to optimize some network performance indicator. The version here addressed, namely the Power Assignment Problem (pap), is the problem of assigning transmission powers to the transmitters of a wireless network so as to maximize the satisfied demand. This problem has relevant practical applications both in radio-broadcasting and in mobile telephony. Typical solution approaches make use of mixed integer linear programs with huge coefficients in the constraint matrix yielding numerical inaccuracy and poor bounds, and so cannot be exploited to solve large instances of practical interest. In order to overcome these inconveniences, we developed a two-phase heuristic to solve large instances of PAP, namely a constructive heuristic followed by an improving local search. Both phases are based on successive shortest path computations on suitable directed graphs. Computational tests on a number of instances arising in the design of the national Italian Digital Video Broadcasting (DVB) network are presented. © Springer Science+Business Media, LLC 2009.
Scheda prodotto non validato
Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo
|Titolo:||Planning wireless networks by shortest path|
|Data di pubblicazione:||2011|
|Appare nella tipologia:||01a Articolo in rivista|