Planning wireless networks by shortest path |
| |
Authors: | Email author" target="_blank">C?ManninoEmail author S?Mattia A?Sassano |
| |
Institution: | (1) Computer Sciences Department, Ben Gurion University of the Negev, Beer-Sheva, Israel;(2) Communication Systems Engineering Department, Ben Gurion University of the Negev, Beer-Sheva, Israel |
| |
Abstract: | 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. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|