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

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...

Full description

Saved in:
Bibliographic Details
Published in:EURASIP journal on wireless communications and networking Vol. 2016; no. 1; pp. 1 - 11
Main Authors: Tian, Jingwen, Gao, Meijuan, Ge, Guangshuang
Format: Journal Article
Language:English
Published: Cham Springer International Publishing 14.04.2016
Springer Nature B.V
Subjects:
ISSN:1687-1499, 1687-1472, 1687-1499
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
ISSN:1687-1499
1687-1472
1687-1499
DOI:10.1186/s13638-016-0605-5