WCDMA for UMTS: Radio Access for Third Generation Mobile Communications
WCDMA for UMTS: Radio Access for Third Generation Mobile Communications
Introduction to the Design and Analysis of Algorithms
Introduction to the Design and Analysis of Algorithms
WISE Design of Indoor Wireless Systems: Practical Computation and Optimization
IEEE Computational Science & Engineering
Placing Base Stations in Wireless Indoor Communication Networks
IEEE Intelligent Systems
Traffic Analysis and Design of Wireless IP Networks
Traffic Analysis and Design of Wireless IP Networks
Radio planning and coverage optimization of 3G cellular networks
Wireless Networks
Optimization of Antenna Placement in 3G Networks Using Genetic Algorithms
BROADCOM '08 Proceedings of the 2008 Third International Conference on Broadband Communications, Information Technology & Biomedical Applications
Indoor Radio Planning: A Practical Guide for GSM, DCS, UMTS and HSPA
Indoor Radio Planning: A Practical Guide for GSM, DCS, UMTS and HSPA
CNSR '09 Proceedings of the 2009 Seventh Annual Communication Networks and Services Research Conference
Planning UMTS base station location: optimization models with power control and algorithms
IEEE Transactions on Wireless Communications
Spatial traffic estimation and characterization for mobile communication network design
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
A new hybrid algorithm termed Reduction Estimation--Combinatorial Optimisation--Reduction Approximation is proposed to identify an optimal base station placement as a subset of a known set of potential sites to provide wireless communication services to a given set of stationary users. Both forward and reverse link signal-to-interference ratios are considered, and the performance of the proposed algorithm is reported for several representative case studies and compared with Brute Force Search and existing optimisation algorithms (including Genetic, Ngadiman and Greedy algorithms). For the cases considered, the proposed algorithm is found to be superior to the existing algorithms in that it can yield an optimal deployment (equivalent to Brute Force Search) in an acceptable time.