检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:聂萌瑶 刘鑫[2] NIE Meng-yao;LIU Xin(School of Computer and Information Engineering,Xinxiang University,Xinxiang Henan 453000,China;School of Computing,Central South University,Changsha Hunan 410083,China)
机构地区:[1]新乡学院计算机与信息工程学院,河南新乡453000 [2]中南大学计算机学院,湖南长沙410083
出 处:《计算机仿真》2024年第2期415-419,共5页Computer Simulation
摘 要:针对因物联网群体用户访问数据量较大、访问频率不稳定,导致访问时延大、效率低的问题,提出一种基于事件驱动的访问路由算法予以解决。考虑到物联网群体数据动态特性强、难捕捉的问题,分析相邻访问节点位置信息、访问频率以及能耗变化与传输时延的关系。设置任意节点的簇首参数,通过物联网群体访问节点拓扑模型,计算簇首到访问点可容纳的最大通信量,作为路由算法的初始参照,采用事件驱动法将访问过程看作事件自然变动过程,结合实际负载情况,得到最终路由决策结果。实验结果表明,无论是干扰环境还是无干扰环境,所提路由算法的访问成功率均较高,且访问时延较低,具有一定的实用价值。At present,the large amount of data and unstable access frequency of IoT users often lead to high access 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 adjacent 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.
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.28