检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]西安交通大学电子与信息工程学院,西安710049 [2]北京航空航天大学中德软件技术联合研究所,北京100085
出 处:《西安交通大学学报》2009年第12期55-59,74,共6页Journal of Xi'an Jiaotong University
基 金:国家自然科学基金资助项目(60773118)
摘 要:为了解决在非理想链路上采用传统贪婪度量的地理位置路由协议引发数据包投递率下降的问题,设计并实现了一种基于链路质量的地理位置路由度量方法(SRAB).通过周期性监听邻居节点发送的数据包,依据其中的链路层序列号估算出相应的链路质量,得到数据包在该链路上传输时所花费的代价.根据节点的地理位置信息,分别计算出当前节点和邻居节点与目的节点间的欧式距离,进一步得到邻居节点将数据包向目的节点推进的程度.在采用blacklist机制将链路质量小于规定阈值的邻居节点过滤后,SRAB将单位代价下向目的节点推进程度最大的邻居节点选为下一跳节点.测试结果表明,与非理想链路上的传统贪婪度量法相比,SRAB的成功投递率提高了22%,传输能耗减少了12%.To solve the problem that the geographic routing using traditional greedy metric decreases the packet delivery rate on non-ideal communication links, a new routing metric SRAB for geographic routing is proposed and implemented based on link quality. The SRAB estimates the relevant link quality through monitoring packets from neighbor nodes periodically to obtain the sequence of link layers, and computes the cost for packets traversing on the link from its link quality. Then the SRAB calculates the Euclidean distances from the current node and its neighbor nodes to the destination based on nodes' geographic positions, respectively, and gets the progresses from the neighbor nodes toward the destination. The SRAB utilizes the blacklist approach to filter neighbor nodes with link quality less than the threshold, and chooses the next hop that has the maximum progress toward the destination per unit cost from the neighbor nodes. The simulation results and comparisons with the traditional greedy metric on the non-ideal links show that the SRAB increases packet delivery rate by 22% and decreases energy consumption by 12%.
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.143.228.88