摘要
针对传感网络中的最大覆盖面问题,如何在给定条件下高效的获得最大的传感覆盖面积,提出了一种针对多约束最短链路不相交路径(MCSDP)问题的标准化方法.通过分析问题及其解集,得到解集为编码集之熵,利用Monte Carlo方法对评估函数进行设计,并对高效遗传算法的标准化进行优化处理.开始只有小数目的样本参与计算,随着遗传代数增加,参与计算的样本数也相应增加.实验证明该方法计算结果准确度高而且运行时间显著减少.
For the sensor network coverage problem and how to maximize coverage under the given condi-tions, a MCSDP problem was presented.By analyzing the problem and its solution set, the entropy of code set of solution sets was gotten.The evaluation function was designed using Monte Carlo method.The standardization and efficient genetic algorithm were optimized.Initially, only a small number of samples was involved in the cal-culation, and then the number for subsequent generations was increased.Results indicted that this method was more accurate and highly efficient and it can greatly reduce the operating time.
出处
《佳木斯大学学报（自然科学版）》
CAS
2015年第3期443-446,共4页
Journal of Jiamusi University：Natural Science Edition
基金
福建省教育厅科技计划A类资助项目(JA13334)
福建省自然科学基金基项目(2015J01661)
宁德师范学院科研创新团队项目(2013T03)
宁德师范学院科研资助项目(2012H308)
关键词
遗传算法
最大覆盖面
传感网络
解空间
genetic algorithm
maximum coverage
sensor network
solution space
