摘要
为利用最少的基站数实现规定的服务质量 ,对无线通信网的基站位置进行优化 ,是一个 NP难题 .针对一个区域 ,提出了在 k个备选的位置中选择合适组合的粗粒度并行遗传算法 ,在不提高成本的同时 ,优化网络的覆盖率 .不但提出了一种高效的局部搜索算子 ,而且比较了子群体连接拓扑对优化质量的影响 .仿真证明 ,优化效果超过了已有的算法 .
Locating transmitters optimally in a radio network, to guarantee a stipulated quality of service (QOS), is a NP-hard combinational problem. Regarding a known area, choosing transmitter locations among alternatives is tackled by a coarse-grained parallel genetic algorithm, which maximize the coverage together with reducing the number of utilized transmitters. An effective local search operator is raised, and the affection of the neighbor topology is compared. Simulations on a dedicated cluster demonstrate that contrasting to existent algorithms, the parallel GA improves the optimizing quality and speed greatly.
出处
《系统工程理论与实践》
EI
CSCD
北大核心
2003年第2期57-61,110,共6页
Systems Engineering-Theory & Practice
基金
清华同方探索 1 0 8基础研究基金
