一种贪婪地理路由协议的改进算法  

An improved algorithm of greedy geographic routing protocol

作　　者：孙磊[1] 张和伟[1] 冯铁军[1] 郭继联[2] 

机构地区：[1]枣庄学院计算机系,山东枣庄277160 [2]枣庄科技职业学院电气工程系,山东滕州277500

出　　处：《现代电子技术》2016年第11期16-20,共5页Modern Electronics Technique

基　　金：国家自然科学基金(61462069)

摘　　要：贪婪转发策略广泛应用于无线传感网络(WSNs)的地理路由协议中,但是,该协议存在数据包丢失严重以及在遭遇路由空洞时路由效率低下的不足。为此,提出一种贪婪地理路由协议的改进算法,记为GPSR-I算法。GPSR-I算法在选择下一跳转发节点时,利用节点离目的节点距离、方向以及节点密度信息计算度量值,然后依据该度量值决策下一跳转发节点。仿真数据表明,与GPSR相比,GPSR-I算法能够有效降低平均端到端传输时延、路由开销,并提高了数据包传输率。The greedy forwarding strategy is widely used in geographic routing protocol of wireless sensor networks（WSNs）. Since the protocol has the problem of low routing efficiency in cases of routing void and serious packet loss,an improved algorithm of greedy perimeter stateless routing（GPSR-I） is proposed. The distance and direction from the target node and node density information are used to calculate the measurements when the GPSR-I algorithm is used to select the next-hop forwarding node,and then the next-hop forwarding node is determined. The simulation results show that,in comparison with the GPSR algorithm,the GPSR-I algorithm can effectively reduce the average end-to-end transmission delay and routing overhead,and improve the packet transmission rate.

关 键 词：无线传感网 路由 GPSR 度量值 贪婪转发 

分 类 号：TN915.04[电子电信—通信与信息系统]