UPSO:基于划分空间粒子群优化的WSN动态覆盖优化算法

计算机科学 ›› 2014, Vol. 41 ›› Issue (Z6): 255-257.

UPSO:基于划分空间粒子群优化的WSN动态覆盖优化算法

曹剑炜,陈庆奎,庄松林

上海理工大学管理学院上海200093;上海理工大学管理学院上海200093;上海理工大学光电信息与计算机工程学院上海200093;上海理工大学上海光学系统重点实验室上海200093;上海理工大学光电信息与计算机工程学院上海200093

出版日期:2018-11-14 发布日期:2018-11-14
基金资助:
本文受国家自然科学基金资助

UPSO (Uniform Particle Swarm Optimization):An Algorithm of Dynamic Overlay Optimization for WSN

CAO Jian-wei,CHEN Qing-kui and ZHUANG Song-lin

Online:2018-11-14 Published:2018-11-14

摘要/Abstract

摘要： 针对WSN动态覆盖问题为多目标优化问题,提出一种划分空间粒子群优化动态覆盖算法UPSO(Uniform Particle Swarm Optimization,UPSO)。该算法首先定义出基于传感器平均分布和不平均分布的区域划分过程,然后分别在不同子空间利用粒子群进行子区域内搜索Pareto最优解,最后分析算法复杂度。实验表明,在不同网络规模、迭代次数和划分子空间下,区域覆盖度和网络寿命相对于传统经典算法有较好改进。

关键词: 动态覆盖,多目标优化,连续空间,粒子群优化算法,划分空间,Pareto最优解中图法分类号TP391文献标识码A

Abstract: For the problem of dynamic coverage problem can be transformed into multi-objective optimization,this paper proposed an algorithm of dynamic overlay optimization for WSN base on division space uniform particle swarm optimization (UPSO)．The algorithm first defines the process of dividing regional based on sensor distributed evenly or unevenly,and then searches for the Pareto optimal solution of sub-regional by particle swarm in different region．Experiments show that in different network size and number of iterations,the regional coverage and network lifetime compared to traditional classical algorithm have better improvement.

Key words: Dynamic overlay,Multi-objective optimization,Continuous space,Particle swarm optimization,Division space,Pareto optimal solution

曹剑炜,陈庆奎,庄松林. UPSO:基于划分空间粒子群优化的WSN动态覆盖优化算法[J]. 计算机科学, 2014, 41(Z6): 255-257. https://doi.org/

CAO Jian-wei,CHEN Qing-kui and ZHUANG Song-lin. UPSO (Uniform Particle Swarm Optimization):An Algorithm of Dynamic Overlay Optimization for WSN[J]. Computer Science, 2014, 41(Z6): 255-257. https://doi.org/

参考文献

[1] 刘永生,周颍,赵保华．WSN随机调度覆盖算法的子集划分最优解[J]．中国科技大学学报,2008,5(3):225-229
[2] 周彤,洪炳熔,朴松昊．基于虚拟力的混合感知网节点部署[J]．计算机研究与发展,2007,4(6):965-972
[3] 冯智博,黄宏光,李奕．基于改进粒子群的WSN覆盖优化策略[J]．计算应用研究,2011,8(4):1271-1275
[4] Tian D,Georganas N．A coverage-preserving node schedulingscheme for large wireless sensor networks[C]∥Raghavendra C S,Sivalingam K,eds．Proc．of the 1^st Int’l Workshop on Wireless Sensor Networks and Applications (WSNA 2002)．Atlanta:ACM Press,2002:32-41
[5] 任秀丽,教传亮,薛建生,等．与节点位置无关的无线传感器网络覆盖控制算法[J]．小型微型计算机系统,2011,2(1):121-125
[6] 付华,韩爽．基于新量子遗传算法的无线传感器网络感知节点的分布优化[J]．传感技术学报,2008,1(7):1259-1263
[7] 王雪,王晨,马俊杰．无线传感器网络布局的虚拟力导向微粒子群优化策略[J]．电子学报,2007,5(11):2038-2042
[8] 崔明义．浮点数编码小生境遗传算法研究[J]．计算机科学,2007,34(4):225-228
[9] Megerian S,Koushanfar F,Potkonjak M,et al．Worst and best case coverage in sensor networks[J]．IEEE Trans on Mobile Computing,2005,4(1):84-92
[10] 田菁,郑彦兴．基于不精确信息的Pareto最优路径搜索[J].通信学报,2007,8(3):68-77
[11] 王海军,宋协武,曹德欣,等．求多目标优化问题Pareto最优解集的方法[J].大学数学,2008,24(5):74-79

Metrics

Viewed

Full text

Abstract

Cited

Shared

Discussed