1. 电子科技大学计算机科学与工程学院,四川,成都,610051
2. 桂林电子科技大学 机构 广西高校云计算与复杂系统重点实验室,广西,桂林,541004
纸质出版:2016
移动端阅览
俸皓, 罗蕾, 王勇, 董荣胜. 基于萤火虫算法的无线传感器网络移动sink节点路径规划方法[J]. 微电子学与计算机, 2016, 33(5): 47-51.
FENG Hao, LUO Lei, WANG Yong, et al. Path Planning in Wireless Sensor Networks for Mobile Sink Based on Glowworm Swarm Optimization Algorithm[J]. 2016, 33(5): 47-51.
为了解决通信范围建模为圆形区域且存在相互重叠的无线传感器网络中移动sink路径规划这一NP难问题
提出了一种新的基于萤火虫群的路径规划方法.首先依据问题的特性对可行解空间进行了压缩; 然后为提高算法在高维解空间的搜索效率
对离群萤火虫粒子设计了变异操作并设计了个体逐维移动的方式
提高了算法的求解精度并加快了算法的收敛速度.通过仿真实验分析及与其他算法的对比
验证了该方法的有效性.
Mobile-sink shortest path planning problem can be regarded as a special case of TSPN problem
since the neighborhoods are the communication ranges of sensor nodes
which can be modeled as possibly overlapped disks. This problem is NP-Hard. To solve it
a novel glowworm swarm optimization based algorithm is proposed. At first
a search space reduction method is designed for compressing search space and improving efficiency of problem solving according to the nature of the problem. Then
a mutation operator for the outliers of the glowworms and an improved moving method are applied to improve the convergence speed and the quality of the result. The simulation results show that the proposed algorithm can achieve a better result than the related algorithms.
周永权, 黄正新, 刘洪霞. 求解TSP问题的离散型萤火虫群优化算法[J]. 电子学报, 2012, 40(6): 1164-1170. DOI: 1164
Yuan Bo, Orlowska M, Sadiq S. On the optimal robot routing problem in wireless censor networks[J]. IEEE Trans on Konowledge and Date Engineering, 2007, 19(9): 1252-1261. DOI: 1252
Ma Ming, Yang Yuanyuan, Zhao Miao. Tour planning for mobile data-gathering mechanisms in wireless sensor networks[J]. IEEE Trans on Vehicular Technology, 2013, 62(4): 1472-1483. DOI: 1472
Mario Di Francesco, Sajal K Das, Giuseppe Anastasi. Data collection in wireless sensor ntworks with mile eements: a srvey[J]. ACM Trans on Sensor Networks, 2011, 8(1): 108-142. DOI: 108
Wu F J, Yu Chee Tseng. Energy conserving data gathering by mobile mules in a spatially separated wireless sensor network[J]. Wireless Communications and Mobile Computing, 2013, 13(15): 1369-1385. DOI: 1369
Yung Liang Lai, Jehn Ruey Jiang. A genetic algorithm for data mule path planning in wireless sensor networks[J]. Appl Math Inf Sci, 2013, 7(1): 413-419. DOI: 413
Krishnanand K N, Ghose D. A glowworm swarm optimization based multi-robot sytem for signal source localization[J]. Design and Control of Intel. Robotic Systems, 2009, 177(7): 49-68. DOI: 49
De Berg M, Gudmundsson J, Katz M. J, et al. TSP with neighborhoods of varying size[J]. Journal of Algorithms, 2005, 57(1): 22-36. DOI: 22
Sugihara R, Rajesh K Gupta. Path planning of data mules in sensor networks[J]. ACM Transactions on Sensor Networks, 2011, 8(1): 1-27. DOI: 1
He Liang, Pan Jianping, Xu Jingdong. A progressive approach to reducing data collection latency in wireless sensor ntworks with mbile eements[J]. IEEE Trans on Mobile Computing, 2013, 12(7): 1308-1320. DOI: 1308
彭硕, 欧阳艾嘉, 乐光学, 等. 求解高维函数的改进萤火虫群优化算法[J]. 计算机应用, 2013, 33(8): 2253-2256. DOI: 2253
吴斌, 崔志勇, 倪卫红. 具有混合群智能行为的萤火虫群优化算法研究[J]. 计算机科学, 2012, 39(5): 198-200. DOI: 198
0
浏览量
7
下载量
0
CSCD
关联资源
相关文章
相关作者
相关机构
京公网安备11010602201714号