检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]武警工程大学,陕西西安710086
出 处:《计算机仿真》2015年第6期271-275,共5页Computer Simulation
摘 要:无线传感器网络覆盖中,由于节点分布不均而造成覆盖重复率高,能量消耗不平衡,网络寿命短的难题,传统覆盖算法不能很好的解决上述问题。为了更合理布置传感器节点,进一步提高覆盖率,延长网络生存时间,提出一种基于引力和碰撞作用的粒子群优化算法(CGPSO)。改进算法在粒子群算法的基础上,融合了粒子的引力和碰撞作用,优化了节点布局。仿真结果表明,在最优的碰撞阈值下,该算法能够选出更多的冗余节点;在迭代次数足够的情况下,能够用更少的节点达到覆盖要求;和传统算法相比,在相同的仿真条件下覆盖率更高。证明上述算法更加适合在无线传感器网络覆盖中应用,提高了覆盖质量,延长了网络寿命。Uneven distribution of nodes in wireless sensor networks (WSNs) coverage area, causes the problems of high repetitive coverage rate, imbalanced energy consumption, and short network lifetime, which traditional cover- ing algorithms cannot solve well. In order to arrange sensor nodes more rationally, further improve coverage rate and prolong network lifetime, a PSO algorithm based on gravitation and collision (CGPSO) was proposed. We took the advantage of gravitation and collision to optimize the node layout. The simulation resuhs show that under optimal col- lision threshold, the algorithm can select more redundant nodes. If iterations are enough, the coverage requirements can be achieved with fewer nodes. Compared with empirical algorithm, the coverage rate is higher in the same simu- lation condition. The algorithm is more suitable for the application of WSNs coverage, which is a potential method for improving the coverage quality and prolonging the network lifetime.
关 键 词:无线传感器网络 覆盖优化 粒子群优化 引力 碰撞
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.30