The fixed spectrum frequency assignment problem : Upper and lower bounds

Roberto Montemanni

ISBN 10: 383833308X / ISBN 13: 9783838333083

Published by LAP LAMBERT Academic Publishing, 2010

About this Item

nach der Bestellung gedruckt Neuware - Printed after ordering - The frequency assignment problem involves the assignment of discrete channels (frequencies) to the transmitters of a radio network. A separation between the frequencies assigned to transmitters close to each other is required to avoid interference. Unnecessary separation causes an excess requirement for spectrum, which is a valuable resource. Consequently good assignments minimise both interference and the spectrum required. The fixed spectrum frequency assignment problem, where the spectrum available is given and the target is to minimise the total interference of the system, is considered. Interference is modelled through binary constraints, and the problem is represented by an undirected weighted graph. Some integer programming formulations are discussed, together with the adaptation of two metaheuristics. Novel lower bounding techniques, which work by combining lower bounds calculated for some subproblems, are presented. The most effective method is based on a linear program which is reinforced with inequalities derived from the lower bounds calculated on clique-like subproblems. Detailed computational results, obtained on a wide range of benchmarks, are finally reported.

Seller Inventory # 9783838333083

Bibliographic Details

• Title: The fixed spectrum frequency assignment problem : Upper and lower bounds
• Publisher: LAP LAMBERT Academic Publishing
• Publication Date: 2010
• Language: English
• ISBN 10: 383833308X
• ISBN 13: 9783838333083
• Binding: Taschenbuch
• Condition: Neu
• Dimensions: 220W x 150H x 12D millimeters 220 millimeters width by 150 millimeters height by 12 millimeters depth
• Weight: 310 grams

About this title

Synopsis

The frequency assignment problem involves the assignment of discrete channels (frequencies) to the transmitters of a radio network. A separation between the frequencies assigned to transmitters close to each other is required to avoid interference. Unnecessary separation causes an excess requirement for spectrum, which is a valuable resource. Consequently good assignments minimise both interference and the spectrum required. The fixed spectrum frequency assignment problem, where the spectrum available is given and the target is to minimise the total interference of the system, is considered. Interference is modelled through binary constraints, and the problem is represented by an undirected weighted graph. Some integer programming formulations are discussed, together with the adaptation of two metaheuristics. Novel lower bounding techniques, which work by combining lower bounds calculated for some subproblems, are presented. The most effective method is based on a linear program which is reinforced with inequalities derived from the lower bounds calculated on clique-like subproblems. Detailed computational results, obtained on a wide range of benchmarks, are finally reported.