An Improved Artificial Bees Colony Algorithm to Solve Minimal Exposure Problem in Wireless Sensor Networks

Abstract

The problem of exposure, which is associated with the quality of coverage, is a basic issue faced in wireless sensor networks. Search for the Minimum Exposure Path (MEP) is one among the crucial problems in Wireless Sensor Networks (WSNs). The exposure with respect to the MEP is one of the indicators used for measuring the coverage quality of a WSN, depicting the efficiency with which the monitoring of a mobile target is done all along the sensing field. The available hybrid technique does not have sufficient accuracy to get the MEP, which is too complicated, and is not suitable to networks having heterogeneous sensor nodes, or in large number, or an all-sensor field intensity function. In order to get over these problems, an Improved Artificial Bee Colony (IABC) model is introduced for the MEP problem associated with getting the optimal shortest path in this research work. The IABC model exhibits an extensive use of energy and data congestion will happen. In order to have an efficient resolution to the data congestion problem, Prim’s algorithm has introduced the link level congestion scenario. Also for effective solving of this issue, in accordance with the features of the node, a semi Hidden Markov Model is developed to solve the problem of energy efficiency in WSN model. A number of experiments were carried out, and the results show that the proposed model and the designed IABC can help in increasing the solution accuracy and can be useful to not just the heterogeneous sensors’ case but also the scenario in where there are a big number of sensor nodes and also an all-sensor field intensity function.