Solving Efficient Target-Oriented Scheduling in Directional Sensor Networks by DCA

Unlike convectional omnidirectional sensors that consistently have an omniangle of detecting range, directional sensors may have a restricted point of detecting range because of specialized requirements or cost considerations. A directional sensor system comprises of various directional sensors, which can switch to several directions to broaden their detecting capacity to cover every one of the objectives in a given territory. Power preservation is still a significant issue in such directional sensor networks. In this paper, we consider the multiple directional cover sets (MDCS) problem of organizing the directions of sensors into a group of non-disjoint cover sets to extend the network lifetime. It is an NP-complete problem. Firstly, a new model of MDCS is introduced in the form of Mixed Binary Integer Linear Programming (MBILP). Secondly, we investigate a new method based on DC programming and DC algorithm (DCA) for solving MDCS. Numerical results are presented to demonstrate the performance of the algorithm.