...
首页> 外文期刊>Journal of network and computer applications >A DTN routing strategy based on neural networks for urban bus transportation system
【24h】

A DTN routing strategy based on neural networks for urban bus transportation system

机译:基于神经网络的城市公交系统DTN路由策略

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

获取外文期刊封面封底 >>

       

摘要

Routing in Delay/Disruption Tolerant Networks (DTNs) is a challenge because it must deal with possible unconnected end-to-end paths at the time of sending a message to a destination. An efficient selection of a contact node to forward a message is a key in the routing process. Prediction techniques can be used to assist in routing decisions. In this work we present a multi-copy routing strategy for a DTN built on the top of an Urban Bus Transportation System (UBTS). Using the buses as nodes, the contact history of nodes can be used to improve the DTN communication. The strategy relies on a journey predictor to build a multi-graph of predicted journeys to the destinations. It calls a next node contact predictor based on Artificial Neural Networks (ANNs) to compute each vertex of the multi-graph. A minimal delay criterion is applied to select the best journey. A copy control algorithm is used to improve the performance of the system. Experiments were carried out with real contacts of a quasi-opportunist scenario. The proposal outperformed the MaxProp strategy in the most cases considering the number of delivered messages, the delivery delay and the delivery cost. (C) 2016 Elsevier Ltd. All rights reserved.
机译:延迟/中断容忍网络(DTN)中的路由是一个挑战,因为在将消息发送到目标时,它必须处理可能未连接的端到端路径。有效选择联系人节点以转发消息是路由过程中的关键。预测技术可用于协助路由决策。在这项工作中,我们提出了一种建立在城市公交运输系统(UBTS)顶部的DTN的多副本路由策略。使用总线作为节点,节点的联系历史可用于改善DTN通信。该策略依靠旅程预测器来构建到达目的地的预测旅程的多图。它调用基于人工神经网络(ANN)的下一节点联系预测变量,以计算多图的每个顶点。应用最小延迟标准来选择最佳旅程。复制控制算法用于提高系统性能。实验是在准机会主义者的真实接触者中进行的。考虑到已传递消息的数量,传递延迟和传递成本,该建议在大多数情况下均优于MaxProp策略。 (C)2016 Elsevier Ltd.保留所有权利。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号