Scheduling Algorithm for Area Coverage Problem in Directional Sensor Networks

Recently, directional sensor networks (DSNs) composed of a large number of directional sensors have attracted more and more attention in the research field. Area coverage enhancement and energy consumption are the fundamental issues of DSNs to evaluate the quality of monitoring. However, the current research mainly focused on optimizing the coverage of networks, but ignored closing redundant sensors to extending the network lifetime. In this paper, a energy aware based on learning automata node scheduling algorithm (EALANS) is presented to construct non-disjoint cover sets each of which could achieve effective area coverage of a desired area. The proposed algorithm EALANS includes two phases: area coverage enhancement (ACE) and cover set construction (CSC). We performed several simulation experiments to evaluate the performance of the proposed algorithm. The results prove the good performance of the proposed algorithm in terms of enhancing area coverage and extending network effective lifetime.