Wireless sensor network node optimal coverage based on improved genetic algorithm and binary ant colony algorithm

72Citations
Citations of this article
34Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Considering the situation of some practical factors such as energy saving of the nodes and the high density of distributing nodes in wireless sensor networks, a wireless sensor network (WSN) node optimal coverage method based on improved genetic algorithm and binary ant colony algorithm is proposed in this paper. The genetic algorithm and ant colony algorithm are improved and fused aiming at their disadvantages. The binary code expects a low intelligence of each ant, and each path corresponds to a comparatively small storage space, thus considerably improving the efficiency of computation. The optimal working node set is computed according to the max-coverage area of working sensor and the min-number of working sensor constraint conditions to optimize algorithm. The simulation results demonstrate that the proposed algorithm can converge at the optimal solution fast and satisfy the requirement of low node utilization rate and a high coverage rate, thus prolonging the network lifetime efficiently.

Cite

CITATION STYLE

APA

Tian, J., Gao, M., & Ge, G. (2016). Wireless sensor network node optimal coverage based on improved genetic algorithm and binary ant colony algorithm. Eurasip Journal on Wireless Communications and Networking, 2016(1). https://doi.org/10.1186/s13638-016-0605-5

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