Assignment on Coverage in WSN with a new algorithm

Introduction of Coverage in WSN with a new algorithm

In the present era, the coverage problem is one of the most critical issues in wireless sensor networks used for different security applications around the whole world. It can be noted that there is a perception hole caused by the failure and movement of nodes in the wireless sensor network. Due to this, there is a loss of important data. For that case, the hybrid particle swarm optimization algorithm will solve this problem. Moreover, these wireless sensor networks are extremely useful for the coverage of Microgrids. It is one of the most important research topics for wireless sensor networks.

Literature review of Coverage in WSN with a new algorithm

In this article, the author is discussing the ant-colony-based scheduling algorithm. It is used for the energy-efficient coverage of WSN. There is one of the main issues and it is related to sensors that are used in wireless sensor networks. It contains a battery system as an energy source. Due to this fact, it will become infeasible to remove batteries when they are discharged. Due to this case, it is one of the main problems for the working of WSN. This problem can be solved easily through the use of this algorithm. The author is also using probability sensor detection models and different algorithms are applied to the heterogeneous sensors for WSN (Joon-Woo Lee, 2012).

According to the author Aziz, there is one of the most important in wireless sensor networks and it is related to the coverage. Due to this case, the author has presented a new algorithm for efficiently solving this problem. This algorithm named Particle swarm optimization. It will solve the overage problem through the use of the Voronoi diagram.

 Moreover, there is also a discussion about its useful applications with proper detail. The author has also used software for evaluating this algorithm and perform simulations. The results are showing that network coverage is enhanced with enhanced time efficiency (Aziz & Ammar W. Mohemmed, 2009).

In this article, the author has presented a new topology construction protocol. This will efficiently help with connected area coverage in WSN. It can be noted that Topology control is one of the most important strategies for saving energy and also enhancing the lifetime of wireless sensors networks. Moreover, the author has presented topology construction and its maintenance algorithms. The next thing is that topology construction is involved in building a reduced topology system and its maintenance will convert the reduced topology when there is no availability of the current one for operation. This paper is dealing with the ideal topology maintenance technique for enhancing control solutions. Due to this, it will put a huge impact on wireless sensor networks (Wightman & Labrador, 2011).

Work plan of Coverage in WSN with a new algorithm

Research objective

·         Provide an efficient algorithm for the coverage in WSN

·         Explanation of this algorithm with complete steps

·         Information about the future outcomes of the coverage in WSN

Research problem of Coverage in WSN with a new algorithm

·         Sensors used in WSN are showing less efficiency

·         Resolve coverage issues in the WSN

Features and innovation of Coverage in WSN with a new algorithm

This section will deal with the complete information about the algorithm used for solving the coverage problem

References of Coverage in WSN with a new algorithm

Aziz, N. A., & Ammar W. Mohemmed, a. M. (2009). A wireless sensor network coverage optimization algorithm based on particle swarm optimization and Voronoi diagram. In 2009 international conference on networking, sensing and control, pp. 602-607.

Joon-Woo Lee, a. J.-J. (2012). Ant-colony-based scheduling algorithm for energy-efficient coverage of WSN. EEE sensors journal .

Wightman, P. M., & Labrador, M. A. (2011). A3Cov: a new topology construction protocol for connected area coverage in WSN. In 2011 IEEE Wireless Communications and Networking Conference, pp. 522-527.