检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:舒红[1]
机构地区:[1]重庆邮电大学重庆市移动通信重点实验室,重庆400065
出 处:《无线电通信技术》2015年第5期41-45,共5页Radio Communications Technology
基 金:长江学者和创新团队发展计划(IRT1299);重庆市科委项目(CSTC2012jj A40044;cstc2013yykf A40010);重庆市科委重点实验室专项经费
摘 要:ZigBee网络中的AODVjr算法通过全网广播路由请求RREQ消息而获得分组发送的最短路径,但节点大量广播RREQ消息增加了网络控制开销,导致网络节点耗能剧增,同时网络堵塞的可能性也大大提升。针对AODVjr算法存在的网络节点耗能剧增问题,在AODVjr算法基础上,结合节点邻居表,提出筛选RREQ消息转发节点,从而限制RREQ消息转发次数的路由算法Zig Bee树节点自剪裁转发算法(ZigBee On-tree Self-pruning Rebroadcast Algorithm,ZOSR)和ZigBee转发节点选择算法(ZigBee On-tree Forwarding Node Selection Algorithm,ZOFNS)。仿真结果表明,算法能有效降低网络节点的转发次数,从而降低网络整体功耗,延长网络工作时间。Although the AODVjr algorithm can obtain the shortest path of packet through broadcasting route request RREQ message to the whole ZigBee network, a large amount of RREQ messages increase the network control overhead, the energy consumption of network nodes,and the possibility of network congestion. Considering the dramatic increase of network nodes' energy consumption in AODVjr algorithm, based on AODVjr and combined with nodes' neighbor table, two algorithms called ZigBee On-tree Self-pruning Rebroadcast Algorithm (ZOSR)and ZigBee On-tree Forwarding Node Selection Algorithm (ZOFNS)are proposed, which limit the number of RREQ messages by screening the forwarding nodes that broadcast RREQ messages.Simulation results show that the algorithms effectively reduce the forwarding number of network nodes, thereby reduce the whole network power consumption and expand the network lifetime.
关 键 词:ZIGBEE 自剪裁 AODVJR RREQ 路由
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.229