摘要
针对已有隐式路由协议转发节点选择算法效率不高的缺点,提出了一种基于IEEE 802.11 DCF机制的转发节点快速选择算法(FFS).该算法让候选转发节点根据自己的转发优先级退避相应的时隙后发送CTS帧,并在多个候选节点发生冲突时随机选择退避时隙值,从而快速高效地唯一确定转发节点.仿真结果表明,FFS算法在能效、时延、分组到达率等网络性能指标上优于已有算法.*
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.
出处
《信息与控制》
CSCD
北大核心
2006年第2期135-140,共6页
Information and Control
基金
国家自然科学基金资助项目(60434030
60374072)
辽宁省博士启动基金资助项目(20041004)
辽宁省青年人才基金资助项目(3040004)
关键词
无线传感器网络
隐式路由协议
转发节点选择
wireless sensor network
implicit routing protocol
forwarder selection
