检索
E-mail
RSS
作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2011, Vol. 37 ›› Issue (9): 138-140,143.doi: 10.3969/j.issn.1000-3428.2011.09.047

• 网络与通信 • 上一篇    下一篇

无线传感器网络中的目标关联覆盖算法

孙泽宇1，邢萧飞2，魏 巍1   

  1. (1. 洛阳理工学院计算机与信息工程系，河南 洛阳 471023；2. 中南大学信息科学与工程学院，长沙 410083)
  • 出版日期:2011-05-05 发布日期:2011-05-12
  • 作者简介:孙泽宇(1977－)，男，讲师、硕士，主研方向：无线传感器网络；邢萧飞，博士；魏 巍，副教授、硕士
  • 基金项目:
    河南省科技厅攻关计划基金资助项目(102300410140)；河南省教育厅自然科学基金资助项目(2010B510016)；洛阳理工学院青年基金资助项目(2010QZ18)

Target Association Coverage Algorithm in WSN

SUN Ze-yu  1, XING Xiao-fei  2, WEI Wei  1   

  1. (1. Department of Computer and Information Engineering, Luoyang Institute of Science and Technology, Luoyang 471023, China; 2. School of Information Science and Engineering, Central South University, Changsha 410083, China)
  • Online:2011-05-05 Published:2011-05-12

PDF

1009

被引次数

18 | 5

摘要： 为提高无线传感器网络的节点覆盖度，提出一种目标关联覆盖算法，利用节点间的关联性和动态分组调整覆盖区域，利用贪心算法对覆盖区域进行优化，以保证所关注的目标节点被传感器节点均匀覆盖，同时提高网络资源的利用率。在每个周期内唤醒部分节点，轮流进行工作，以均衡网络能量消耗。实验结果表明，该算法适应性更强，并且能有效降低网络能耗，提高网络性能。

关键词: 无线传感器网络, 目标关联覆盖算法, 贪心算法, 动态分组, 节点关联性

Abstract: In order to enlarge node coverage range in WSN, this paper proposes a Target Associate Coverage Algorithm(TACA). It employs associability of nodes and dynamic partition to adjust the coverage range. The coverage range is optimized with greedy algorithm, which guarantees that the concerned target nodes are covered by sensor nodes equally, and at network resources are optimized. Partial nodes are roused to work alternately in every cycle to ensure the energy balance of WSN. Experimental result shows that the algorithm has better adaptability, and it can decrease the network energy consumption efficiently and enhance the performance of network

Key words: WSN, Target Association Coverage Algorithm(TACA), greedy algorithm, dynamic partition, associability of nodes

中图分类号: