Collective movement inspired distributed blanket coverage algorithm using nearest neighbour rule

The animal aggregation has attracted many attentions in different studies for decades. A reported model of the coordinated behaviour of animals using the nearest neighbour rule has inspired many algorithms in Mobile Sensor Networks (MSNs) to optimise their coverage performance. However, the energy consumption, fault tolerance and finally, the coverage performance of these algorithms are not efficient. In this paper, a novel distributed node deployment algorithm, Nearest Neigh-bour based Node Deployment Algorithm, NNND, is proposed to enhance the performance of the requested coverage. In the NNND algorithm not only the full coverage purpose is fulfilled, but also the flexibility of accommodating several pivotal sensor nodes guided to a parallelism movement of sensor nodes that reduces the consumed energy significantly is provided. In our extensive simulation study indifferent configurations, NNND surpasses the performance evaluation in comparison to a well-known algorithm. The obtained result confirms enormous less energy consumption.