文章基本信息

标题：Minimal K-Covering Set Algorithm based on Particle Swarm Optimizer
本地全文：下载
作者：Hu, Yong
期刊名称：Journal of Networks
印刷版ISSN：1796-2056
出版年度：2013
卷号：8
期号：12
页码：2872-2877
DOI：10.4304/jnw.8.12.2872-2877
语种：English
出版社：Academy Publisher
摘要：For random high density distribution in wireless sensor networks in this article have serious redundancy problems. In order to maximize the cost savings network resources for wireless sensor networks, extend the life network, this paper proposed a algorithm for the minimal k-covering set based on particle swarm optimizer. Firstly, the network monitoring area is divided into a number of grid points. Utilization rate and the node minimum are used as optional objective, and a combinatorial optimization mathematical model is established. Then using Particle Swarm Optimizer to solve optimization model, thus the optimal network coverage and the utilization od sensor nodes are obtained. Simulation results that algorithm has reduced node redundancy and the energy consumption, and improved the network coverage effectively
关键词：Wireless Sensor Networks (WSN);Particle Swarm Optimizer (PSO);The Minimal K-Covering Set;Network Lifetime