A low coverage first classifying algorithm for wireless sensor networks

Abstract

The issue of node scheduling for wireless sensor networks (WSNs) is studied in this paper. In WSNs with node scheduling, nodes may be classified into different sets and each set is activated in turn. All nodes in one set will continue working until another is awakened. Hence the power of the network is saved and the conflicts in the channel are reduced. In this paper, classification-based scheduling algorithms are researched and a low coverage first classifying algorithm (LCFC) is proposed. Comparison experiments showed that LCFC achieved good results.