摘要
In this paper, we proposed a scheme based on Monte Carlo algorithm to test whether or not the nodes are redundant for realizing the node density control in the sensor network. The computational complexity is only O(n). We also established the coverage collision detection and back-off mechanism applied in the wireless sensor network. The simulation results show that the system can cover all the interested area with the smallest number of nodes and a coverage void will not appear during the course of state-transition. The coverage collision detection and back-off mechanism proposed in this article can be applied when the nodes have either synchronous or asynchronous mechanism. It also provides a stable stage with the length of the time that can be adjusted.
In this paper, we proposed a scheme based on Monte Carlo algorithm to test whether or not the nodes are redundant for realizing the node density control in the sensor network. The computational complexity is only O（n）. We also established the coverage collision detection and back-off mechanism applied in the wireless sensor network. The simulation results show that the system can cover all the interested area with the smallest number of nodes and a coverage void will not appear during the course of state-transition. The coverage collision detection and back-off mechanism proposed in this article can be applied when the nodes have either synchronous or asynchronous mechanism. It also provides a stable stage with the length of the time that can be adjusted.
