This article proposes a stochastic model to obtain the end-to-end delay law between two nodes of a Delay Tolerant Network (DTN). We focus on the commonly used Binary Spray and Wait (BSW) routing protocol and propose a model that can be applied to homogeneous or heterogeneous networks (i.e. when the inter-contact law parameter takes one or several values). To the best of our knowledge, this is the first model allowing to estimate the delay distribution of Binary Spray and Wait DTN protocol in heterogeneous networks. We first detail the model and propose a set of simulations to validate the theoretical results.
Congestion Aware Spray And Wait Protocol: A Congestion Control Mechanism For The Vehicular Delay Tolerant Network
在过去的几年里，车载自组织网络（VANET）已经成为一个重要的研究领域。为提高车辆网络排放系统的性能进行了大量研究。对VANET进行的进一步研究的一个结果是车辆延迟容忍网络（VDTN）。它是移动DTN的一种应用，其中节点使用存储-携带-转发方法在网络中中继消息。由于它的高移动性，它遭受频繁的断开连接，也在节点处，这导致消息丢弃的拥塞。为了最大限度地减少消息的下降率，从而优化消息传递的概率，使司机越来越多地了解道路的情况，我们提出了一种拥塞控制机制：拥塞感知喷射和等待（CASaW）协议在这项工作中，以优化消息传递到其目的地的速率，从而提高司机在车辆环境中的意识，从而提高道路安全。结果表明，我们的命题表现优于其他经典的VDTN协议的消息传递概率和丢包率的性能指标。我们使用虚拟网络环境（ONE）模拟器实现了经典的VDTN协议：PROPHET协议，Epidemic协议，MaxProp协议和Spray and Wait协议。仿真结果表明，我们提出的拥塞控制机制具有更好的性能，因为它保持了良好的消息传递率，以及最小化数据包丢失率，从而优化了消息到达目的地的机会，从而提高道路安全。
Unlike classical routing algorithms, quantum routing algorithms make use of entangled states - a type of resources that have a limited lifetime and need to be regenerated after consumption. In a nutshell, quantum routing algorithms have to use these resources efficiently, while optimizing some objectives such as the total waiting time. Current routing algorithms tend to keep a routing request waiting until all of the resources on its path are available. In this paper, we introduce a new way of managing entanglement resources in an opportunistic fashion: a request can move forward along its pat…
Evaluating Performance Characteristic of Opportunistic Routing Protocols: A Case Study of the 2016 Italian League Match Earthquake in the Stadio Adriatico
University of Nottingham（诺丁汉大学）
本文通过2016年意大利地震场景评估机会路由协议性能，采用Epidemic和Spray and Wait协议，在相同模拟条件下比较交付概率、延迟、开销比、跳数和丢包率，发现Spray and Wait在可靠性与效率间取得更好平衡。
Social-aware Opportunistic Routing Protocol based on User's Interactions and Interests
如今，路由建议必须处理各种异构设备、间歇性连接以及用户对通信的持续需求，即使是在相当具有挑战性的网络场景中。因此，我们提出了一个社会意识的基于内容的路由协议，SCORP，考虑用户的社会互动和他们的利益，以提高数据传输在城市，密集的场景。通过模拟，使用合成移动性和人类痕迹场景，我们将我们的解决方案与其他两种社会感知解决方案dLife和Bubble Rap以及社会遗忘的Spray and Wait进行了比较，以表明社会意识和内容知识的结合在具有挑战性的网络中传播数据时可以是有益的。
Reducing the response time of Emergency Vehicles (EVs) has an undoubted advantage in saving life and property. Implementing pre-emption can aid in achieving it. EVs get unobstructed movement via pre-emption, usually by altering traffic signals and giving a green wave throughout the route. This approach of absolute pre-emption effects adversely on regular traffic by imposing unnecessary waiting. In this paper, we propose a novel emergency vehicle pre-emption (EVP) algorithm implemented in the Vehicular Ad-hoc Network (VANET) that can reduce the imposed undesirable waiting time, but still ascert…
A One-Hop Information Based Geographic Routing Protocol for Delay Tolerant MANETs
延迟和中断容忍网络（DTN）可能缺乏连续的网络连接。因此，DTN中的路由是一个挑战，因为它必须处理网络分区，长延迟和动态拓扑。与此同时，传统的移动自组织网络（MANET）的路由协议不能很好地工作，因为它的假设，大多数网络连接是可用的失败。在这篇文章中，提出了一个地理路由协议的MANNETWORK在延迟容忍的情况下，通过使用不超过一跳的信息。设计了一个效用函数来实现欠控制复制策略。为了减少消息泛滥所造成的开销，我们采用了一个标准来评估消息的冗余程度。因此，一个消息冗余处理机制被添加到我们的路由协议。大量的仿真结果表明，当节点移动速度较低时，该路由协议在引入可接受的网络开销率的同时，在投递率和平均跳数方面优于Epidemic、Spray and Wait、FirstContact等协议.
Sink mobility is seen as a successful strategy to resolve the hotspot problem in Wireless Sensor Network (WSN). Mobile sinks roam in the network and collect data from special nodes such as Cluster Heads (CH) by means of short-range communications which improves the energy efficiency. Numerous mobile sink based routing protocols have been proposed, however, they incur high delays especially in large scale networks where the mobile sink has to travel for a long distance to collect data from CHs and consequently they failed to ensure a tradeoff between energy efficiency and delay. To resolve this…
Network traffic classification using machine learning techniques has been widely studied. Most existing schemes classify entire traffic flows, but there are major limitations to their practicality. At a network router, the packets need to be processed with minimum delay, so the classifier cannot wait until the end of the flow to make a decision. Furthermore, a complicated machine learning algorithm can be too computationally expensive to implement inside the router. In this paper, we introduce flow-packet hybrid traffic classification (FPHTC), where the router makes a decision per packet based…
Wesleyan University（卫斯理大学）；University of Connecticut（康涅狄格大学）；Fordham University（福特汉姆大学）
While routing in wireless networks has been studied extensively, existing protocols are typically designed for a specific set of network conditions and so cannot accommodate any drastic changes in those conditions. For instance, protocols designed for connected networks cannot be easily applied to disconnected networks. In this paper, we develop a distributed routing strategy based on deep reinforcement learning that generalizes to diverse traffic patterns, congestion levels, network connectivity, and link dynamics. We make the following key innovations in our design: (i) the use of relational…
Maintaining a resilient computer network is a delicate task with conflicting priorities. Flows should be served while controlling risk due to attackers. Upon publication of a vulnerability, administrators scramble to manually mitigate risk while waiting for a patch. We introduce FASHION: a linear optimizer that balances routing flows with the security risk posed by these flows. FASHION formalizes routing as a multi-commodity flow problem with side constraints. FASHION formulates security using two approximations of risk in a probabilistic attack graph (Frigault et al., Network Security Metrics…
