Sensor networks have found many applications in different branches of science. A sensor grid is made up of a large number of small sensors. These sensors help each other to provide information about the sensory field. One of the major issues in sensor networks is the pr More
Sensor networks have found many applications in different branches of science. A sensor grid is made up of a large number of small sensors. These sensors help each other to provide information about the sensory field. One of the major issues in sensor networks is the problem of coverage. The problem of coverage explores the answer to the question of how far the physical environment of a sensor network is properly monitored by the nodes of the network. The importance of this issue is to the extent that it is considered as one of the parameters of the quality of service in such networks. In all cases, the need for the methods that can accurately calculate network coverage is well known. In this paper, we try to provide an optimal solution to the problem of coverage in a wireless sensor network with the help of a modified gravitational search algorithm.
Manuscript profile