基于链式聚类博弈机制的太赫兹纳米传感网能量空洞修补算法
DOI:
CSTR:
作者:
作者单位:

南京中医药大学

作者简介:

通讯作者:

中图分类号:

TP393.04

基金项目:

江苏省高校自然科学基金资助项目(19KJD460061);江苏省“333工程”基金(BRA2015212);江苏省“十三五”规划重点资助课题(B-a20160329)


Energy Hole Repair Algorithm of Terahertz Nano Sensor Network Based on Chain Clustering Game Mechanism
Author:
Affiliation:

Fund Project:

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

    为改善太赫兹纳米传感网部署过程中存在的链路节点能量消耗较快,内外层数据交互困难及传输性能较低等不足,提出了一种基于链式聚类博弈机制的太赫兹纳米传感网能量空洞修补算法。首先,基于等距划分模型,设计了一种等距环结构,快速提高节点链路性能;通过内外层节点交换传输数据,优化等距环结构内层与外层数据的交互质量,采取轮询均衡内层节点能量消耗方式,设计了一种新的基于能量空洞形成预测方案的链式聚类博弈机制,分担内外层节点间流量,修补节点受限导致的能量空洞;随后,基于流量均衡思想设计了一种基于能量可控的均衡消耗优化方法,改善节点能量在不同层级上的消耗水平,增强节点对能量受限的适应能力,规避节点受限风险。仿真实验表明:与当前常用的基于动态簇机制的无线传感器网络节能方案及基于亲和传播的考虑节点剩余能量和减轻簇头负担方案相比,本文算法具有更高的网络生命周期,以及更低的数据传输轮数和节点受限程度。

    Abstract:

    In order to improve the energy consumption of the link nodes in the deployment process of terahertz nano sensor network, the difficulty of data exchange between the inner and outer layers and the low transmission performance, an energy hole repair algorithm based on the chain clustering game mechanism is proposed. First of all, based on the equidistant division model, a kind of equidistant ring structure is designed to improve the link performance of nodes rapidly. By exchanging and transmitting data between the inner and outer nodes of the equidistant ring structure, the interaction quality between the inner and outer layers of the data is optimized. By polling and balancing the energy consumption of the inner nodes, a new chain clustering game mechanism based on the prediction scheme of energy hole formation is designed to share the energy. Then, based on the idea of flow balance, an optimization method of balanced consumption based on energy controllable is designed to improve the energy consumption level of nodes at different levels, enhance the adaptability of nodes to energy constraints, and avoid the risk of node constraints. The simulation results show that compared with the current energy-saving scheme based on dynamic clustering mechanism and the scheme based on affinity propagation considering the residual energy of nodes and reducing the burden of cluster head, the algorithm in this paper has a higher network life cycle, a lower number of data transmission rounds and a lower degree of node restriction.

    参考文献
    相似文献
    引证文献
引用本文
分享
文章指标
  • 点击次数:
  • 下载次数:
  • HTML阅读次数:
  • 引用次数:
历史
  • 收稿日期:2020-01-06
  • 最后修改日期:2020-11-03
  • 录用日期:2021-01-04
  • 在线发布日期:
  • 出版日期:
文章二维码