计算机与现代化

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

基于加权帝国竞争算法的无线传感器网络覆盖机制

  

  1. 西安文理学院数学与计算机工程学院,陕西西安710065
  • 收稿日期:2014-02-17 出版日期:2014-06-13 发布日期:2014-06-25
  • 作者简介: 李立(1974-),男,陕西西安人,西安文理学院数学与计算机工程学院讲师,硕士,研究方向:计算机网络,Web开发技术。

Coverage Mechanism of WSN Based on Weighted Imperialist Competitive Algorithm

  1. College of Math and Computer Engineering, Xi’an University, Xi’an 710065, China
  • Received:2014-02-17 Online:2014-06-13 Published:2014-06-25

摘要:

 为了克服当前无线传感器网络(WSN-Wirelessless Sensor Network)覆盖优化机制的收敛速度慢,易陷局部最优等不足;并同时兼顾高的覆盖率和较低的能耗,以延长生命周期,本文引入
权重理论,并以节点利用率以及覆盖率设计适应度函数,提出基于加权帝国竞争算法的WSN覆盖优化机制,并测试该机制与其他优化机制。测试结果表明:与其他几种机制相比,本机制的收敛速度更快,
覆盖率更高,工作节点数量更少。

关键词:  , WSN, 覆盖率, 传感器节点, 权重, 帝国竞争算法, 收敛速度

Abstract:

In order to overcome these defects such as slow convergence speed, and falling into local optimum in optimized coverage mechanism of WSN, and to make it have
high coverage rate and low energy consuming to extend the life cycle, the coverage mechanism of WSN based on weighted discrete imperialist competitive algorithm is proposed by
introducing the weigh theory and using the node utilization and coverage rate to design the fitness function. This mechanism and others are tested. The results show that:
comparing with other optimization coverage methods, the convergence speed of this mechanism is faster; and the coverage is higher, as well as the number of working sensor node
is less.

Key words: WSN, coverage rate, sensor nodes, weigh, imperialist competitive algorithm, convergence speed