检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:温诗华 崔岩 WEN Shihua;CUI Yan(Guangzhou Power Supply Bureau of Guangdong Grid Co.,Guangzhou 510000,China;Southern Power Grid Finance Co.,Ltd.,Guangzhou 510623,China)
机构地区:[1]广东电网有限责任公司广州供电局,广东广州510000 [2]南方电网财务有限公司,广东广州510623
出 处:《电子设计工程》2024年第21期122-126,共5页Electronic Design Engineering
基 金:南方电网公司科技项目资助(031900KK52220003)。
摘 要:无线自组织网络具有移动变换属性,传统静态路由协议存在丢包率大、传输时延长、网络吞吐量小的问题,因此提出了无线自组织网络的节能路由协议研究方法。确定路由请求标志符所在位置,综合考虑节点剩余能量,估算节点生存时间,发现存活节点。采用LEACH算法选举存活节点簇头,融合成数据形式。通过相邻节点区域分布方式,检测冗余节点,计算能量消耗,调度休眠冗余节点。从相邻簇头集合中选择最佳下一跳路径,充分考虑节点剩余能量,设计簇间多跳路由。由实验结果可知,该方法最高丢包率为2.3%,最长时延为9 ms,最大吞吐量为157 b/s,提高了网络可靠性。Wireless Ad Hoc networks have the attribute of mobile transformation.Traditional static routing protocols have the problems of high packet loss rate,long transmission time,and low network throughput.Therefore,research on energy saving routing protocol for wireless Ad Hoc networks is designed.Determine the location of the routing request identifier,comprehensively consider the remaining energy of the node,estimate the node′s survival time,and discover the surviving nodes.The LEACH algorithm is used to select the surviving node cluster heads and fuse them into data form.Detect redundant nodes through the distribution of adjacent node regions,calculate energy consumption,and schedule dormant redundant nodes.Select the optimal next hop path from the set of adjacent cluster heads,fully consider the remaining energy of nodes,and design multi hop routing between clusters.According to the experimental results,the highest packet loss rate of this method is 2.3%,the longest delay is 9 ms,and the maximum throughput is 157 b/s,which improves network reliability.
关 键 词:无线自组织网络 节能路由协议 路由请求 LEACH算法
分 类 号:TN92[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.220.192.109