论文部分内容阅读
在ARRIVE算法的基础上,提出一种信任和能量意识的补救路由算法(Tea RR).在选择下一跳节点时,Tea RR综合考虑候选节点的信任值和剩余能量,选择信任值和剩余能量最优的节点转发数据.为了防御链路不稳定和On-Off攻击造成的丢包问题,Tea RR采用发送节点主动推荐和邻居节点被动参与相结合的补救策略,快速恢复对可能丢失包的转发.实验结果表明,Tea RR更加适用于延时敏感的应用,可在接收率与能耗间平衡.
Based on the ARRIVE algorithm, a trust and energy-aware remediation routing algorithm (Tea RR) is proposed.When selecting the next-hop node, Tea RR considers the trust value and residual energy of the candidate node synthetically, selects the trust value and residual energy The optimal node forwards the data.In order to prevent packet loss caused by link instability and On-Off attacks, Tea RR adopts the remediation strategy that the sending node actively recommends combining with the passive participation of the neighbor nodes to rapidly recover the packet that may be lost The experimental results show that Tea RR is more suitable for delay sensitive applications and balances reception and energy consumption.