CMTN-SP: A Novel Coverage-Control Algorithm for Moving-Target Nodes Based on Sensing Probability Model in Sensor Networks

The non-consecutive coverage problem for the target nodes in Sensor Networks could lead to the coverage blind area and a large amount of redundant data, which causes the bottleneck phenomenon for the communication link. A novel Coverage Control Algorithm for Moving Target Nodes Based on Sensing Probability Model (CMTN-SP) is proposed in this work. Firstly, according to the probability theory, we derive the calculation method for the expectation of the coverage quality with multiple joint nodes, which aims to reduce the coverage blind area and improving network coverage rate. Secondly, we employ the dynamic transferring mechanism of the nodes to re-optimize the deployment of the nodes, which alleviates the rapid exhaustion of the proper network energy. Finally, it is verified via the results of the simulation that the network coverage quality could not only be improved by the proposed algorithm, but the proposed algorithm could also effectively curb the rapid exhaustion of the node energy.

Abstract licence: CC BY

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.