Journal of Xidian University ›› 2016, Vol. 43 ›› Issue (4): 141-146.doi: 10.3969/j.issn.1001-2400.2016.04.025

• Article • Previous Articles     Next Articles

Coverage algorithm for finding the minimum working sets in WSNs

WANG Aimin1,2;LIU Yongqiang1;ZHANG Jing1;LIU Yanheng1,2   

  1. (1. College of Computer Science and Technology, Jilin Univ., Changchun  130012, China;
    2. Key Lab. of Symbolic Computation and Knowledge Engineering of Ministry of Edu., Jilin Univ., Changchun  130012, China)
  • Received:2015-04-13 Online:2016-08-20 Published:2016-10-12

Abstract:

Since the existing coverage algorithm has a lot of redundant nodes, a coverage algorithm for finding the minimum working sets in WSNs(FMWS) is proposed. The algorithm is divided into two phases: the first phase runs an existing coverage algorithm; the second phase runs an algorithm that uses fewer working nodes to replace more working nodes, with the number of working nodes continuously decreasing through iteration. Simulation shows that the proposed algorithm can obtain more sleep nodes than other algorithms. It can make the number of working nodes reduce around 10%, so as to prolong the network life.

Key words: wireless sensor networks, coverage, sleep scheduling, sleep order