首页> 中文期刊> 《电子技术应用》 >基于协作中继的高吞吐量机会网络路由算法

基于协作中继的高吞吐量机会网络路由算法

         

摘要

基于Barter机制的机会网络路由算法在数据分组交易过程中存在的僵局问题,导致网络吞吐量降低,为此,提出一种基于协作中继的路由算法(Routing Algorithm based on Cooperative Relays,RACR),在Barter机制中采用协作中继机制,引入多方交易激活数据分组的单向传递,同时优化分组删除的判定条件,对分组交易僵局问题加以有效解决,从而提高网络吞吐量,降低数据分组端到端时延.仿真结果表明,与现有的Barter路由算法和DT (Direct Transmission)路由算法相比,RACR路由算法的网络吞吐量提高了7.9%以上,分组平均端到端时延则至少降低了8.5%.%To address the trading deadlock problem in exchanging data packets of Barter routing algorithm for opportunistic net works,a new routing algorithm based on cooperative relays,RACR,is proposed.RACR introduces cooperative relays strategy in the message exchange process,brings in multi-player trade to invoke unidirectional transmission of data packets,and optimizes the judgment of packet deleting,so that it can effectively solve the deadlock problem in message exchange process,which improves the network throughput and reduces the data packets end-to-end delay.Theoretical analysis and simulation results show that RACR can improve network throughput by 7.9%,and the decrease in the average end-to-end delay is more than 8.5%,as compared to Barter routing algorithm and Direct Transmission(DT) routing algorithm.

著录项

相似文献

  • 中文文献
  • 外文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号