基于表面自适应的定向贪婪选路

Directed Greedy Adaptive Face-Based Routing

针对无线传感器网络中基于位置的路由算法中存在的重复搜索和冗余计算问题,提出一种基于表面自适应的定向贪婪路由算法(DGAFR)。该算法充分发挥贪婪转发、表面路由转发和定向选路的优势,依据局部区域节点的状态信息进行整个网络的路由选择。理论上分析证明DGAFR算法具备渐近最优性;仿真结果表明,相比于GPSR和GOAFR,该算法降低了大量额外的通信和计算开销,更适于大型的传感器网络。

In this paper, we present DGAFR, a novel WSN geometric routing algorithm containing greedy, face and directed routing. In DGAFR, forwarding decisions merely depended on information about a node＇ s immediate neighbors in the network topology, which made the algorithm absolutely local and highly scalable. Additionally, we proved that DGAFR was asymptotically optimal. Simulations demonstrate that DGAFR sufficiently outperformed other prominent algorithms ,such as GPSR and GOAFR.