A Distributed Actor Deployment Algorithm for Maximum Connected Coverage in WSAN

Wireless sensor and actor networks receive more interests with the appearance of wireless sensor networks´ weakness and the development of robotics. In this new autonomous network, actors are deployed to cover the monitored area, receiving sense data from sensors and taking proper actions. In this paper, we presented a distributed actor deployment algorithm for maximum coverage. We prove that regular six-polygon can achieve maximum coverage with the least waste, and our approach is based on it. This distributed algorithm moves actor nodes to extend their coverage while maintaining sensor-actor connectivity and with less blind-areas. Finally all actors can reach equilibrium by this self-excitation mechanism. The performance of our algorithm is validated analytically and experimentally.