4.4 Article

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

Publisher

SPRINGER
DOI: 10.1186/s13638-016-0605-5

Keywords

Wireless sensor network; Node optimal coverage; Genetic algorithm; Binary ant colony algorithm

Funding

  1. National Natural Science Foundation of China [61271370]
  2. National High Technology Research and Development Program of China (863 Program) [2013AA013202]
  3. Funding Project for Academic Human Resources Development in Beijing Union University [11101501105]

Ask authors/readers for more resources

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.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.4
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available