基于NSGA-II的无线传感网络簇首选择算法
CSTR:
作者:
作者单位:

(兰州理工大学计算机与通信学院,兰州730050)

作者简介:

通讯作者:

E-mail: chenzh@lut.cn.

中图分类号:

TP393

基金项目:

国家自然科学基金项目(61763028,61663023).


A NSGA-II-based algorithm for WSN cluster head selection
Author:
Affiliation:

( College of Computer and Communication,Lanzhou University of Technology,Lanzhou730050,China)

Fund Project:

  • 摘要
  • |
  • 图/表
  • |
  • 访问统计
  • |
  • 参考文献
  • |
  • 相似文献
  • |
  • 引证文献
  • |
  • 资源附件
  • |
  • 文章评论
    摘要:

    延长网络生命周期是无线传感网络需要解决的主要问题之一,拓扑控制对于延长网络生命周期具有重要意义.针对分簇结构无线传感网络的簇首选择问题,提出一种基于NSGA-II的多目标簇首选择算法.同时考虑网络通信距离、能量消耗、负载均衡以及节点生存时间等多个优化目标,通过理论计算确定最优簇首数量指导种群初始化,引入正交实验机制降低搜索次数,提高寻优效率.实验结果表明, 所提出的算法与低功耗自适应层次分簇(LEACH)算法相比,簇首分布均匀、负载均衡,可明显延长网络的生命周期,与标准NSGA-II算法相比,可更好地提高搜索寻优效率.

    Abstract:

    Prolonging the network life cycle is one of the major goals to be achieved in the wireless sensor network (WSN), and topology control is of great significance for it. To solve the problem of cluster head selection in WSN, a multi-objective cluster head selection algorithm, which is based on NSGA-II, is proposed. Many factors such as network communication distance, energy consumption, load balancing and node survival time are considered in the algorithm. The optimal number of cluster heads is determined by theoretical calculation to guide population initialization, and the orthogonal experiment mechanism is introduced to reduce the times of search and improve the efficiency of optimizing. Experiments show that the proposed algorithm, compared with the low-energy adaptive clustering hierarchy (LEACH) algorithm, has evenly distributed cluster head, balanced load and extended network life cycle. In addition, it is of higher searching efficiency than the standard NSGA-II algorithm.

    参考文献
    相似文献
    引证文献
引用本文

陈作汉,曹洁,赵付青.基于NSGA-II的无线传感网络簇首选择算法[J].控制与决策,2019,34(11):2358-2365

复制
分享
文章指标
  • 点击次数:
  • 下载次数:
  • HTML阅读次数:
  • 引用次数:
历史
  • 收稿日期:
  • 最后修改日期:
  • 录用日期:
  • 在线发布日期: 2019-10-30
  • 出版日期:
文章二维码