Minimal K-Covering Set Algorithm based on Particle Swarm Optimizer

@article{Hu2013MinimalKS,
  title={Minimal K-Covering Set Algorithm based on Particle Swarm Optimizer},
  author={Yong Hu},
  journal={JNW},
  year={2013},
  volume={8},
  pages={2872-2877}
}
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… CONTINUE READING