检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:张继荣[1] 赵晓彤[1] 屈军锁[1] 崔燕[2]
机构地区:[1]西安邮电大学通信与信息工程学院,陕西西安710121 [2]电信科学技术第四研究所研发中心,陕西西安710061
出 处:《西安邮电大学学报》2015年第4期16-18,61,共4页Journal of Xi’an University of Posts and Telecommunications
基 金:陕西省科技厅科学技术研究发展计划资助项目(2012K06-50)
摘 要:对贪婪型周边无状态路由协议加以改进。在报头中加入邻居节点的移动速度和方向信息,当节点转发过程遭遇路由空洞时,据此信息预测邻居节点下一时刻的位置。若预测位置不符合贪婪转发要求,仍继续周边转发模式,否则,进入"等待转发模式",即经过一个极小的等待时延后,跳转回到贪婪转发模式,以减少周边转发过程存在的大量冗余。借助仿真软件Network Simulator version 2搭建网络环境,对改进协议与原协议在节点速度为10~40m/s的情况下仿真,比较其端到端时延和平均跳数,结果显示,改进协议在给定环境中能够降低时延5%~17%,减少跳数5%左右。An improvement to the greedy perimeter stateless routing protocol is proposed by adding the moving speed and direction of adjacent node to the header. According to the added information, the next location of an adjacent node can be predicted, as the forwarded node is suffering routing empty. If the predicted position does not match with the requirement of a greedy forwarding, it goes on with the perimeter forwarding mode, otherwise, it goes into a waiting mode, which means, after a minimal waiting time delay, it jumps back to the greedy forwarding mode, thus a large amount of redundancy in perimeter forwarding can be reduced. With simulation software Network Simulator version 2, a network environment is set up, in which, the end-to-end delay and the average hop count of the improved protocol and the original protocol is compared as the node speed varies in 10 -40 m/s. Results show that, the improving methods can bring an reduce to the time delay of 55- 175, and to the hop of 5% around.
关 键 词:路由空洞 贪婪型周边无状态路由协议 NETWORK SIMULATOR
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.200