Research Article
A New Energy-Efficient Coverage Control with Multinodes Redundancy Verification in Wireless Sensor Networks
Algorithm 1
ECMRV algorithm description.
(1) Procedure | (2) Begin | (3) n←Null // Parameter Initializing | (4) CL,i←Null | (5) While () | (6) | (7) | (8) .information→s[i].bata //Calculating and restoring the node information | (9) .coverage-rate→s[i].information // according to the formula (18), calculate coverage | rate of sensor node | (10) .neighbor.information→s[i].neighbor.bata | (11) .broadcast→Gn // Send the nodes to the Gathering Nodes | (12) ++ | (13) | (14) ConstuctGraph() // Construct Connecting Graph | (15) while(.energy >= minenergy) | (16) if(redundancy.nodes <= ) // Nodes’ energy is not less than the threshold | (17) Network_working | (18) else | (19) | (20) sorting(.energy) // sort according to nodes’ energy | (21) .maxenergy→dormancy // make the nodes of max-energy dormant | (22) | (23) if(Gn←s[i].inf_covergae) // | (24) | (25) CL[i]←s[i].inf_coverage // Restore the received information in the linked list. | (26) ++ // direct to the next sensor nodes | (27) | (28) if(.energy >= .energy) | (29) | (30) Gn.inf_notice→s[i].data // Gathering node information sent | (31) .coverage→target.nodes // cover the target nodes with present nodes | (32) | (33) |
|