Solving the Problem of Target k-Coverage in WSNs Using Fuzzy Clustering Algorithm

Abstract

The purpose of the present research was to introduce an algorithm to solve the coverage problem in wireless multimedia networks that can be used to optimize energy consumption and network lifetime. In this regard, the problem of target k-coverage in WSNs was solved by dividing the environment into the proportional area and random selection. This can be done using a fuzzy clustering algorithm. It is worth noting that the results of the proposed algorithm were compared with previous methods such as genetic and annealing algorithm. The simulation results and comparison with other algorithms show a 27% superiority of the proposed algorithm. It is hoped that this method can be used in networks with larger dimensions in the future