A distributed clustering algorithm for target coverage in Directional Sensor Networks

Maximum target coverage with minimum number of sensor nodes, known as MCMS problem, is an important problem in Directional Sensor Networks (DSNs). Existing solutions allow individual sensor nodes to determine the sensing direction for maximum target coverage which causes sensing coverage redundancy as well as high energy consumption. Gathering nodes into clusters might provide a better solution to this problem. In this paper, we have designed distributed clustering and target coverage algorithms to address the problem in an energy-efficient way. Our extensive simulation study shows that our system outperforms a number of state-of-the-art approaches.