西安电子科技大学学报 ›› 2016, Vol. 43 ›› Issue (4): 141-146.doi: 10.3969/j.issn.1001-2400.2016.04.025

• 研究论文 • 上一篇    下一篇

WSNs中一种寻找最小工作节点集的覆盖算法

王爱民1,2;刘永强1;张婧1;刘衍珩1,2   

  1. (1. 吉林大学 计算机科学与技术学院,吉林 长春  130012;
    2. 吉林大学 符号计算与知识工程教育部重点实验室,吉林 长春  130012)
  • 收稿日期:2015-04-13 出版日期:2016-08-20 发布日期:2016-10-12
  • 作者简介:王爱民(1970-),男,副教授,博士,E-mail: wangam@jlu.edu.cn.
  • 基金资助:

    国家自然科学基金资助项目(61073164)

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

摘要:

针对现有覆盖算法存在的很多冗余节点,提出了寻找最小工作节点集的覆盖算法.该算法分为两个阶段: 第1阶段运行已有的覆盖算法;第2阶段运行节点替换算法,它用更少的节点替换更多的工作节点,如此循环迭代使工作节点数不断减少.仿真实验表明,该算法比其他覆盖算法能获得更多的休眠节点,使工作节点数减少10%左右,从而延长了网络生命周期.

关键词: 无线传感器网络, 覆盖, 睡眠调度算法, 休眠顺序

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