Modified t-distribution evolutionary algorithm for dynamic deployment ofwireless sensor networks

2Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

Optimizating the deployment of wireless sensor networks, which is one of the key issues in wireless sensor networks research, helps improve the coverage of the networks and the system reliability. In this paper, we propose an evolutionary algorithm based on modified t-distribution for the wireless sensor by introducing a deployment optimization operator and an intelligent allocation operator. A directed perturbation operator is applied to the algorithm to guide the evolution of the node deployment and to speed up the convergence. In addition, with a new geometric sensor detection model instead of the old probability model, the computing speed is increased by 20 times. The simulation results show that when this algorithm is utilized in the actual scene, it can get the minimum number of nodes and the optimal deployment quickly and effectively.Compared with the existing mainstream swarm intelligence algorithms, this method has satisfied the need for convergence speed and better coverage, which is closer to the theoretical coverage value.

Cite

CITATION STYLE

APA

Liu, X., Zhang, X., Jiang, Y., & Zhu, Q. (2016). Modified t-distribution evolutionary algorithm for dynamic deployment ofwireless sensor networks. IEICE Transactions on Information and Systems, E99D(6), 1595–1602. https://doi.org/10.1587/transinf.2015EDP7464

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free