Joint probabilistic coverage based distributed node scheduling algorithm for wireless sensor network
Year: 2014
Type: article
Abstract: Using probabilistic detection model, a distributed node scheduling algorithm which is based on the joint probabilistic coverage method is proposed. The node obtains all the coverage match sets of its region by communicating with its neighbor nodes, and then judges the probabilistic coverage state of its region by the obtained information. At last, the node will schedule itself by the judgment result into active state or sleep state. Simulation results show that, this algorithm is more effective than CCP and DPCP, on the condition of preserving network probabilistic coverage, and can turn of lots of redundant nodes and insure the number of active nodes being steady in order to prolong the network lifetime.
Author: Tian Yin
Institution: Bohai University
Language: English
Subfield: Computer Networks and Communications
Field: Computer Science
Domain: Physical Sciences
Open Access status: diamond
OpenAlex ID: W2353731278
