DocumentCode :
2655229
Title :
Location and placement problems in information and communication systems
Author :
Smutnicki, Czeslaw
Author_Institution :
Inst. of Comput. Eng., Wroclaw Univ. of Technol., Wroclaw, Poland
fYear :
2010
fDate :
15-17 Dec. 2010
Firstpage :
1
Lastpage :
3
Abstract :
The paper deals with the antenna placement problem used in wireless cell planning problem or planning of distribution of wireless sensors. The mathematical formulation of the problem with the use of various optimization criteria and constraints has been provided. This NP-hard optimization problem has been solved next by an approximate algorithm, sufficient for attacking large problem instances. In this study, we combine a greedy algorithm with the simulated annealing and/or simulated jumping approaches. The performance of each approach has been evaluated on a set of benchmarks. Results and discussion on the performance of the algorithms are provided.
Keywords :
greedy algorithms; mobile radio; optimisation; wireless sensor networks; NP-hard optimization problem; communication systems; greedy algorithm; information systems; mathematical formulation; placement problems; various optimization criteria; wireless cell planning problem; wireless sensors; Antennas; Approximation algorithms; Mathematical model; Mobile communication; Optimization; Shape; algorithm; antenna placement; mobile telecommunication;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Broadband and Biomedical Communications (IB2Com), 2010 Fifth International Conference on
Conference_Location :
Malaga
Print_ISBN :
978-1-4244-6951-2
Electronic_ISBN :
978-1-4244-6952-9
Type :
conf
DOI :
10.1109/IB2COM.2010.5723625
Filename :
5723625
Link To Document :
بازگشت