考虑最大通信量的物联网群体访问路由算法
A Group Access Routing Algorithm for IoT Considering Maximum Traffic
聂萌瑶 1刘鑫2
作者信息
- 1. 新乡学院计算机与信息工程学院,河南 新乡 453000
- 2. 中南大学计算机学院,湖南 长沙 410083
- 折叠
摘要
针对因物联网群体用户访问数据量较大、访问频率不稳定,导致访问时延大、效率低的问题,提出一种基于事件驱动的访问路由算法予以解决.考虑到物联网群体数据动态特性强、难捕捉的问题,分析相邻访问节点位置信息、访问频率以及能耗变化与传输时延的关系.设置任意节点的簇首参数,通过物联网群体访问节点拓扑模型,计算簇首到访问点可容纳的最大通信量,作为路由算法的初始参照,采用事件驱动法将访问过程看作事件自然变动过程,结合实际负载情况,得到最终路由决策结果.实验结果表明,无论是干扰环境还是无干扰环境,所提路由算法的访问成功率均较高,且访问时延较低,具有一定的实用价值.
Abstract
At present,the large amount of data and unstable access frequency of IoT users often lead to high ac-cess delay and low efficiency.Therefore,an event-driven access routing algorithm was proposed to effectively solve this problem.Considering the strong dynamic characteristics of IoT group data,we analyzed the relationship among ad-jacent node position information,access frequency,energy consumption changes,and transmission delay at first.Then,we set the cluster head parameters of any node.Moreover,we used the topology model of IoT group access nodes to calculate the maximum communication capacity from the cluster head to the access point as the initial reference for the routing algorithm.Based on the event-driven method,we regarded the access process as a natural change process of events.Finally,we got the routing decision result according to the actual load situation.Experimental results show that the access success rate of the proposed algorithm is high in both interference and non-interference environments,and the access delay is low.This algorithm has certain practical value.
关键词
事件驱动/物联网群体访问/路由算法/访问时延Key words
Event-driven/Group access to the Internet of Things IoT/Routing algorithm/Access delay引用本文复制引用
出版年
2024
NETL
NSTL
万方数据