电子学报 ›› 2016, Vol. 44 ›› Issue (9): 2158-2163.DOI: 10.3969/j.issn.0372-2112.2016.09.020

• 学术论文 • 上一篇    下一篇

一种基于演化博弈的分簇协作路由算法

张继1, 张大方1, 谢鲲1, 何施茗2, 乔宏1   

  1. 1. 湖南大学信息科学与工程学院, 湖南长沙 410082;
    2. 长沙理工大学计算机与通信学院, 湖南长沙 410014
  • 收稿日期:2014-12-30 修回日期:2015-05-08 出版日期:2016-09-25
    • 作者简介:
    • 张继 男,1984年生,湖南长沙人,湖南大学博士生.主要研究方向为协作路由、无线传感网.E-mail:tosky984@163.com;张大方 男,1959年生,上海人,湖南大学教授、博士生导师.主要研究方向为可信系统与网络、软件容错.E-mail:dfzhang@hnu.edu.cn;谢鲲 女,1978年生,湖南黔阳人,湖南大学教授,博士生导师.主要研究方向为分布式计算、协作路由.E-mail:xiekun@hnu.edu.cn;何施茗 女,1986年生,湖南本州人,博士,长沙理工大学讲师.主要研究方向为机会路由.E-mail:heshiming_hsm@163.com;乔宏 男,1984年生,湖南岳阳人,湖南大学博士生.主要研究方向为无线Mesh网、协作路由.E-mail:hqiao@hnu.edu.cn
    • 基金资助:
    • 国家973重点基础研究发展计划 (No.2012CB315805); 国家自然科学基金 (No.61173167,No.61472130)

A Cluster Cooperative Routing Algorithm Based on Evolutionary Game

ZHANG Ji1, ZHANG Da-fang1, XIE Kun1, HE Shi-ming2, QIAO Hong1   

  1. 1. School of Information Science and Engineering, Hunan University, Changsha, Hunan 410082, China;
    2. School of Computer and Communication Engineering, Changsha University of Science and Technology, Changsha, Hunan 410004, China
  • Received:2014-12-30 Revised:2015-05-08 Online:2016-09-25 Published:2016-09-25
    • Supported by:
    • National Program on Key Basic Research Project of China  (973 Program) (No.2012CB315805); National Natural Science Foundation of China (No.61173167, No.61472130)

摘要:

现有的分簇协作路由没有依据协作通信的特点选择簇头,也没能根据簇头节点的服务能力均衡簇成员负载,因而不能充分发挥协作通信能量高效的优势.本文提出了一种基于演化博弈的分簇协作路由算法CCREG.算法首先定义虚节点剩余能量作为簇头确立的指标,然后通过动态演化博弈为簇联盟问题建立模型.簇成员节点选择不同簇头结成联盟,可获得不同的收益.收益由簇头的能力、簇成员节点个数等因素决定.簇成员节点都可以根据自身得到的信息有限理性的选择簇结成联盟,直到网络中所有节点改变簇联盟都不能获得更高的收益.实验结果表明,与协作多输入多输出路由算法CMIMO相比,CCREG算法的网络生存周期在两个簇头情况下延长14%到70%,三个簇头情况下延长5%到80%.

关键词: 协作路由, 演化博弈, 分簇路由, 网络生存周期

Abstract:

Since the existing cluster cooperative routing algorithms select cluster heads without considering the characteristics of cooperative communication and don't balance the cluster member according to the capacity of cluster heads,they can't fully exploit the advantage of cooperative communication on saving energy consumption.A cluster cooperative routing algorithm based on evolutionary game (CCREG) is proposed.Firstly,the energy of virtual node is the metric of cluster head selection.Secondly,the model of cluster membership based on the evolutionary game is formulated,where member nodes select different clusters to join in leading to different payoffs which are decided by the capacity of the cluster head and the number of cluster members.Each member node selects a cluster to join in,till it can't achieve more payoffs by changing the cluster to join in.The experiment shows that CCREG can prompt the network lifetime by 14%~70% with two cluster headers,by 5%~80% with three cluster headers,compared with cooperative multi-input multi-output routing (CMIMO).

Key words: cooperative routing, the evolutionary game, cluster routing, network lifetime

中图分类号: