K-target coverage connectivity in wireless sensor network considering the angle coverage

摘要

One of the challenges of the wireless sensor networks is problem of having coverage while keeping connectivity. In this paper we have proposed a method in which we can cover a set of discrete targets in a field considering the k-angle coverage. In k-angled coverage, it is guaranteed that any target in the area should at least be covered by k sensor in a way that the peripheral area of such targets is covered by the sensors. Using this method, in each round, a set of sensors is selected in a way that they can cover all targets while keeping the connectivity. Then each sensor of this group reduces its communication range as less as the network in not disconnected. This approach may also use the sensors that are not capable of separating data of their targets. The results show that in comparison with similar methods, the proposed method consumes less energy and it can also increase the accuracy of the submitted data. The proposed method is a distributed algorithm which is executed in the nodes locally and is able to be implemented in the wide area networks having plenty of nodes.