Abstract
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.
Highlights
The sensor network is a large-scale and self-organized sensing network which could achieve the information world integration and the physical world integration [1,2,3,4,5]
The Coverage Control Algorithm for Moving Target Nodes based on Sensing Probability (CMTN-SP) algorithm employs the dynamic clustering mechanism to set some nodes as the cluster heads and the cluster heads could form one backbone network with self-processing ability and relaying data
When the number of moving target nodes is 6, the other three of algorithms. Main behind this is that the The other threereason algorithms the magnitude decrease isThe larger forreason the other three algorithms. Main behindemploys this is that centralized coverage scheme, without the coordination which leads the other three algorithms employsconsidering the centralized coverage among scheme,different withoutnodes, considering the to the rapid exhaustion of these three algorithms and a shorter network lifetime compared with the coordination among different nodes, which leads to the rapid exhaustion of these three algorithms proposed algorithm
Summary
The sensor network is a large-scale and self-organized sensing network which could achieve the information world integration and the physical world integration [1,2,3,4,5]. The control unit is in charge of the running of the entire sensor node, which is normally composed of the micro-processor and the memory. The wireless communication unit is in charge of the communication between different sensor nodes, exchanging control messages and transcribing data. The power unit is in charge of powering the sensor nodes to guarantee the functioning. (3) how to use thecoverage minimal network lifetime, and (3)ofhow to usetothe minimal nodes number toand satisfy the required nodes to in satisfy the required coverage rate for the users in the area of monitoring. In the covering process on the node which is the target node, usually the full coverage over the consecutive coverage, coverage, entire monitoring area is employed [15,16,17]. (3) During coverage process the moving node, the coverage nodes in the monitoring area the intoconsecutive work.
Sign-in/Register to view highlights & summary 
Published Version (
Free)
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call