| 隐式路由协议的一种转发节点快速选择算法 |
| |
| 引用本文： | 邢志浩,王宏,梁韡. 隐式路由协议的一种转发节点快速选择算法[J]. 信息与控制, 2006, 35(2): 135-140 |
| |
| 作者姓名： | 邢志浩 王宏 梁韡 |
| |
| 作者单位： | 1. 中国科学院研究生院,北京,100049;中国科学院沈阳自动化研究所,辽宁,沈阳,110016
2. 中国科学院沈阳自动化研究所,辽宁,沈阳,110016 |
| |
| 基金项目： | 中国科学院资助项目;辽宁省博士科研项目;辽宁省优秀青年科技人才基金 |
| |
| 摘 要： | 针对已有隐式路由协议转发节点选择算法效率不高的缺点，提出了一种基于IEEE 802.11 DCF机制的转发节点快速选择算法（FFS）．该算法让候选转发节点根据自己的转发优先级退避相应的时隙后发送CTS帧，并在多个候选节点发生冲突时随机选择退避时隙值，从而快速高效地唯一确定转发节点．仿真结果表明，FFS算法在能效、时延、分组到达率等网络性能指标上优于已有算法．
|
| 关 键 词： | 无线传感器网络 隐式路由协议 转发节点选择 |
| 文章编号： | 1002-0411（2006）02-0135-06 |
| 收稿时间： | 2006-03-14 |
| 修稿时间： | 2006-03-14 |
A Forwarder Fast Selection Algorithm for Implicit Routing Protocol |
| |
| XING Zhi-hao,WANG Hong,LIANG Wei. A Forwarder Fast Selection Algorithm for Implicit Routing Protocol[J]. Information and Control, 2006, 35(2): 135-140 |
| |
| Authors: | XING Zhi-hao WANG Hong LIANG Wei |
| |
| Affiliation: | 1. Graduate School of the Chinese Academy of Sciences, Beijing 100049, China; 2. Shenyang Institute of Automation, Chinese Academy of Sciences, Shenyang 110016, China |
| |
| Abstract: | In order to overcome the inefficiency of existing forwarder selection algorithms of implicit routing protocols,this paper presents a forwarder fast selection algorithm(FFS) based on IEEE 802.11 DCF mechanism.By requiring the forwarder candidates to backoff the slot count according to its forwarding priority before sending the CTS,and selecting a random slot as its CTS resending time when collision occurs,FFS can select the forwarder more quickly and efficiently.Simulation result shows that FFS exceeds existing algorithms in power efficiency,time delay,and packet delivery ratio. |
| |
| Keywords: | wireless sensor network implicit routing protocol forwarder selection |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《信息与控制》浏览原始摘要信息 |
|
点击此处可从《信息与控制》下载全文 |
|
