| 基于表面自适应的定向贪婪选路 |
| |
| 引用本文： | 杨涛,陈建新,杨庚,谭国秀.基于表面自适应的定向贪婪选路[J].南京邮电学院学报(自然科学版),2008(6):37-43. |
| |
| 作者姓名： | 杨涛 陈建新 杨庚 谭国秀 |
| |
| 作者单位： | 南京邮电大学计算机学院,江苏南京210003 |
| |
| 基金项目： | 国家自然科学基金（60873231）、江苏省高校自然科学基金（08KJB520006、05KJD520144）、江苏省“六大人才高峰”基金（06-E-044）资助项目 |
| |
| 摘 要： | 针对无线传感器网络中基于位置的路由算法中存在的重复搜索和冗余计算问题，提出一种基于表面自适应的定向贪婪路由算法（DGAFR）。该算法充分发挥贪婪转发、表面路由转发和定向选路的优势，依据局部区域节点的状态信息进行整个网络的路由选择。理论上分析证明DGAFR算法具备渐近最优性；仿真结果表明，相比于GPSR和GOAFR，该算法降低了大量额外的通信和计算开销，更适于大型的传感器网络。
|
| 关 键 词： | 位置路由协议 贪婪路由算法 表面路由转发 |
Directed Greedy Adaptive Face-Based Routing |
| |
| YANG Tao,CHEN Jian-xin,YANG Geng,TAN Guo-xiu.Directed Greedy Adaptive Face-Based Routing[J].Journal of Nanjing University of Posts and Telecommunications(Natural Science),2008(6):37-43. |
| |
| Authors: | YANG Tao CHEN Jian-xin YANG Geng TAN Guo-xiu |
| |
| Affiliation: | ( College of Computer, Nanjing University of Posts and Telecommunications, Nanjing 210003, China) |
| |
| Abstract: | 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. |
| |
| Keywords: | Geometric routing Greedy routing Face routing |
| 本文献已被 维普 等数据库收录！ |
|
