首页> 外文期刊>IEEE Transactions on Parallel and Distributed Systems >Self-Adaptive Contention Aware Routing Protocol for Intermittently Connected Mobile Networks
【24h】

Self-Adaptive Contention Aware Routing Protocol for Intermittently Connected Mobile Networks

机译:间歇连接的移动网络的自适应竞争感知路由协议

获取原文
获取原文并翻译 | 示例
           

摘要

This paper introduces a novel multicopy routing protocol, called Self-Adaptive Utility-based Routing Protocol (SAURP), for Delay Tolerant Networks (DTNs) that are possibly composed of a vast number of devices in miniature such as smart phones of heterogeneous capacities in terms of energy resources and buffer spaces. SAURP is characterized by the ability of identifying potential opportunities for forwarding messages to their destinations via a novel utility function-based mechanism, in which a suite of environment parameters, such as wireless channel condition, nodal buffer occupancy, and encounter statistics, are jointly considered. Thus, SAURP can reroute messages around nodes experiencing high-buffer occupancy, wireless interference, and/or congestion, while taking a considerably small number of transmissions. The developed utility function in SAURP is proved to be able to achieve optimal performance, which is further analyzed via a stochastic modeling approach. Extensive simulations are conducted to verify the developed analytical model and compare the proposed SAURP with a number of recently reported encounter-based routing approaches in terms of delivery ratio, delivery delay, and the number of transmissions required for each message delivery. The simulation results show that SAURP outperforms all the counterpart multicopy encounter-based routing protocols considered in the study.
机译:本文介绍了一种新的多副本路由协议,称为基于自适应实用程序的路由协议(SAURP),用于延迟耐受网络(DTN),它可能由大量微型设备组成,例如功能不同的智能手机。能源资源和缓冲区空间。 SAURP的特征在于能够通过一种基于实用程序功能的新颖机制来识别将消息转发到其目的地的潜在机会,在该机制中,共同考虑了一组环境参数,例如无线信道条件,节点缓冲区占用率和遭遇统计信息。因此,SAURP可以在经历高缓冲区占用,无线干扰和/或拥塞的节点周围重新路由消息,同时进行相当少量的传输。实践证明,在SAURP中开发的效用函数能够实现最佳性能,并通过随机建模方法对其进行了进一步分析。进行了广泛的仿真,以验证所开发的分析模型,并将所建议的SAURP与最近报告的基于遭遇的路由方法进行比较,该方法涉及传递比率,传递延迟和每个消息传递所需的传输次数。仿真结果表明,SAURP优于本研究中考虑的所有对应的多副本基于遭遇的路由协议。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号