Most disruption-tolerant networking (DTN) protocols available in the literature have focused on mere contact and intercontact characteristics to make forwarding decisions. Nevertheless, there is a world behind contacts: just because one node is not in contact with some potential destination, it does not mean that this node is alone. There may be interesting end-to-end transmission opportunities through other nearby nodes. Existing protocols miss such possibilities by maintaining a simple contact-based view of the network. In this paper, we investigate how the vicinity of a node evolves through time and whether such information can be useful when routing data. We observe a clear tradeoff between routing performance and the cost for monitoring the neighborhood. Our analyses suggest that limiting a node's neighborhood view to three or four hops is more than enough to significantly improve forwarding efficiency without incurring prohibitive overhead.
In disruption-tolerant networking (DTN), data is transmitted in a store-carry-forward fashion from network node to network node. In this paper, we present an open source DTN implementation, called DTN7, of the recently released Bundle Protocol Version 7 (draft version 13). DTN7 is written in Go and provides features like memory safety and concurrent execution. With its modular design and interchangeable components, DTN7 facilitates DTN research and application development. Furthermore, we present results of a comparative experimental evaluation of DTN7 and other DTN systems including Serval, I…
Disruption Tolerant Networks (DTNs) are employed in applications where the network is likely to be disrupted due to environmental conditions or where the network topology makes it impossible to find a direct route from the sender to the receiver. Underwater networks typically use acoustic waves for transmitting data. However, these waves are susceptible to interference from sources of noise such as the wake from ships, sounds from snapping shrimp, and collisions from acoustic waves generated by other nodes. DTNs are good candidates for situations where successfully delivering the message is mo…
The objective of this analysis was to simulate the performance of three different ad-hoc protocols for disruption-tolerant networking (DTN) - i.e. the transfer of information through a network of nodes in contexts prone to signal interruption/signal degradation - and to perform a trade-off analysis that will yield a recommendation of the best course of action (COA) for a user of a space-based network to employ. This is important for space-based networks in particular since transmitting information over long distances - e.g. from directly from the initial node to the destination node - will res…
University of Chinese Academy of Sciences(中国科学院大学);Technology and Engineering Center for Space Utilization, Chinese Academy of Sciences(中国科学院空间应用工程与技术中心)
In recent years, with the large-scale deployment of space spacecraft entities and the increase of satellite onboard capabilities, delay/disruption tolerant network (DTN) emerged as a more robust communication protocol than TCP/IP in the case of excessive network dynamics. DTN node buffer management is still an active area of research, as the current implementation of the DTN core protocol still relies on the assumption that there is always enough memory available in different network nodes to store and forward bundles. In addition, the classical queuing theory does not apply to the dynamic man…
Delay-Tolerant Networks (DTN) enable store-carry-and-forward data transmission in networks challenged by frequent disruptions and high latency. Existing classification distinguishes between scheduled and probabilistic DTNs, for which specific routing solutions have been developed. In this paper, we uncover a gap in-between where uncertain contact plans can be exploited to enhance data delivery in many practical scenarios described by probabilistic schedules available a priori. Routing under uncertain contact plans (RUCoP) is next formulated as a multiple-copy Markov Decision Process and then e…
A One-Hop Information Based Geographic Routing Protocol for Delay Tolerant MANETs
延迟和中断容忍网络(DTN)可能缺乏连续的网络连接。因此,DTN中的路由是一个挑战,因为它必须处理网络分区,长延迟和动态拓扑。与此同时,传统的移动自组织网络(MANET)的路由协议不能很好地工作,因为它的假设,大多数网络连接是可用的失败。在这篇文章中,提出了一个地理路由协议的MANNETWORK在延迟容忍的情况下,通过使用不超过一跳的信息。设计了一个效用函数来实现欠控制复制策略。为了减少消息泛滥所造成的开销,我们采用了一个标准来评估消息的冗余程度。因此,一个消息冗余处理机制被添加到我们的路由协议。大量的仿真结果表明,当节点移动速度较低时,该路由协议在引入可接受的网络开销率的同时,在投递率和平均跳数方面优于Epidemic、Spray and Wait、FirstContact等协议.
In this paper, we focus on a popular DML framework -- the parameter server computation paradigm and iterative learning algorithms that proceed in rounds. We aim to reduce the communication complexity of Byzantine-tolerant DML algorithms in the single-hop radio network. Inspired by the CGC filter developed by Gupta and Vaidya, PODC 2020, we propose a gradient descent-based algorithm, Echo-CGC. Our main novelty is a mechanism to utilize the broadcast properties of the radio network to avoid transmitting the raw gradients (full $d$-dimensional vectors). In the radio network, each worker is able t…
Vehicular Ad hoc Network (VANET) is a new sort of wireless ad-hoc network. Vehicle-to-Vehicle (V2V) communication is one of the main communication paradigms that provide a level of safety and convenience to drivers and passengers on the road. In such an environment, routing data packets is challenging due to frequent changes of network topology because of the highly dynamic nature of vehicles. Thus, routing in VANETs requires efficient protocols that guarantee message transmission among vehicles. Numerous routing protocols and algorithms have been proposed or enhanced to solve the aforemention…
Next to the high performance, the essential feature of the multiprocessor systems is their fault-tolerant capability. In this regard, fault-tolerant interconnection networks and especially fault-tolerant routing methods are crucial parts of these systems. Hypercube is a popular interconnection network that is used in many multiprocessors. There are several suggested practices for fault tolerant routing in these systems. In this paper, a neural routing method is introduced which is named as Fault Avoidance Routing (FAR). This method keeps the message as far from the faulty nodes as possible. Th…
Many Internet of things (IoT) applications have been developed and implemented on unreliable wireless networks like the Delay tolerant network (DTN), however, efficient data transfer in DTN is still an important issue for the IoT applications. One of the application areas of DTN is Vehicular Delay Tolerant Network (VDTN) where the network faces communication disruption due to lack of end-to-end relay route. It is challenging as some of the nodes show selfish behavior to preserve their resources like memory, and energy level and become non-cooperative. In this article, an Honesty based Democrat…
The term Delay/Disruption-Tolerant Networks (DTN) invented to describe and cover all types of long-delay, disconnected, intermittently connected networks, where mobility and outages or scheduled contacts may be experienced. This environment is characterized by frequent network partitioning, intermittent connectivity, large or variable delay, asymmetric data rate, and low transmission reliability. There have been routing protocols developed in DTN. However, those routing algorithms are design based upon specific assumptions. The assumption makes existing algorithms suitable for specific environ…
The emergence of connected vehicles paradigm has made secure communication a key concern amongst the connected vehicles. Communication between the vehicles and Road Side Units (RSUs) is critical to disseminate message among the vehicles. We focus on secure message transmission in connected vehicles using multi_hop social networks environment to deliver the message with varying trustworthiness. We proposed a Geographic Social Trust Routing (GSTR) approach; messages are propagated using multiple hops and by considering the various available users in the vehicular network. GSTR is proposed in an …
Routing plays a fundamental role in network applications, but it is especially challenging in Delay Tolerant Networks (DTNs). These are a kind of mobile ad hoc networks made of e.g. (possibly, unmanned) vehicles and humans where, despite a lack of continuous connectivity, data must be transmitted while the network conditions change due to the nodes' mobility. In these contexts, routing is NP-hard and is usually solved by heuristic "store and forward" replication-based approaches, where multiple copies of the same message are moved and stored across nodes in the hope that at least one will reac…
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在可靠性与效率间取得更好平衡。