Genetic Improvement of Routing Protocols for Delay Tolerant Networks

• URL: http://arxiv.org/abs/2103.07428v1
• Date: Fri, 12 Mar 2021 17:46:51 GMT
• Title: Genetic Improvement of Routing Protocols for Delay Tolerant Networks
• Authors: Michela Lorandi, Leonardo Lucio Custode, Giovanni Iacca
• Abstract summary: We improve two routing protocols widely adopted in Delay Tolerant Networks (DTNs) We dissect them into their fundamental components, i.e., checking if a node can transfer data, or sending messages to all connections. We apply Genetic Improvement (GI) to manipulate these components as terminal nodes of evolving trees.
• Score: 3.9571744700171756
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: 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 reach its destination. Still, the existing routing protocols produce relatively low delivery probabilities. Here, we genetically improve two routing protocols widely adopted in DTNs, namely Epidemic and PRoPHET, in the attempt to optimize their delivery probability. First, we dissect them into their fundamental components, i.e., functionalities such as checking if a node can transfer data, or sending messages to all connections. Then, we apply Genetic Improvement (GI) to manipulate these components as terminal nodes of evolving trees. We apply this methodology, in silico, to six test cases of urban networks made of hundreds of nodes, and find that GI produces consistent gains in delivery probability in four cases. We then verify if this improvement entails a worsening of other relevant network metrics, such as latency and buffer time. Finally, we compare the logics of the best evolved protocols with those of the baseline protocols, and we discuss the generalizability of the results across test cases.

Related papers

• Scalable Graph Compressed Convolutions [68.85227170390864]
  We propose a differentiable method that applies permutations to calibrate input graphs for Euclidean convolution. Based on the graph calibration, we propose the Compressed Convolution Network (CoCN) for hierarchical graph representation learning.
  arXiv  Detail & Related papers  (2024-07-26T03:14:13Z)
• MetaDetect: Metamorphic Testing Based Anomaly Detection for Multi-UAV Wireless Networks [0.5076419064097734]
  The reliability of wireless Ad Hoc Networks (WANET) communication is much lower than wired networks. The proposed MT detection method is helpful for automatically identifying incidents/accident events on WANET.
  arXiv  Detail & Related papers  (2023-12-07T23:24:58Z)
• Multi-User Entanglement Distribution in Quantum Networks Using Multipath Routing [55.2480439325792]
  We propose three protocols that increase the entanglement rate of multi-user applications by leveraging multipath routing. The protocols are evaluated on quantum networks with NISQ constraints, including limited quantum memories and probabilistic entanglement generation.
  arXiv  Detail & Related papers  (2023-03-06T18:06:00Z)
• Binary Graph Convolutional Network with Capacity Exploration [58.99478502486377]
  We propose a Binary Graph Convolutional Network (Bi-GCN), which binarizes both the network parameters and input node attributes. Our Bi-GCN can reduce the memory consumption by an average of 31x for both the network parameters and input data, and accelerate the inference speed by an average of 51x.
  arXiv  Detail & Related papers  (2022-10-24T12:05:17Z)
• Bandwidth-efficient distributed neural network architectures with application to body sensor networks [73.02174868813475]
  This paper describes a conceptual design methodology to design distributed neural network architectures. We show that the proposed framework enables up to a factor 20 in bandwidth reduction with minimal loss. While the application focus of this paper is on wearable brain-computer interfaces, the proposed methodology can be applied in other sensor network-like applications as well.
  arXiv  Detail & Related papers  (2022-10-14T12:35:32Z)
• QuTE: decentralized multiple testing on sensor networks with false discovery rate control [130.7122910646076]
  This paper designs methods for decentralized multiple hypothesis testing on graphs equipped with provable guarantees on the false discovery rate (FDR) We consider the setting where distinct agents reside on the nodes of an undirected graph, and each agent possesses p-values corresponding to one or more hypotheses local to its node. Each agent must individually decide whether to reject one or more of its local hypotheses by only communicating with its neighbors, with the joint aim that the global FDR over the entire graph must be controlled at a predefined level.
  arXiv  Detail & Related papers  (2022-10-09T19:48:39Z)
• CARL-DTN: Context Adaptive Reinforcement Learning based Routing Algorithm in Delay Tolerant Network [0.0]
  Delay/Disruption-Tolerant Networks (DTN) invented to describe and cover all types of long-delay, disconnected, intermittently connected networks. This study proposes context-adaptive reinforcement learning based routing protocol to determine optimal replicas of the message based on the real-time density.
  arXiv  Detail & Related papers  (2021-05-02T20:08:17Z)
• Medium Access using Distributed Reinforcement Learning for IoTs with Low-Complexity Wireless Transceivers [2.6397379133308214]
  This paper proposes a distributed Reinforcement Learning (RL) based framework that can be used for MAC layer wireless protocols in IoT networks with low-complexity wireless transceivers. In this framework, the access protocols are first formulated as Markov Decision Processes (MDP) and then solved using RL. The paper demonstrates the performance of the learning paradigm and its abilities to make nodes adapt their optimal transmission strategies on the fly in response to various network dynamics.
  arXiv  Detail & Related papers  (2021-04-29T17:57:43Z)
• On Topology Optimization and Routing in Integrated Access and Backhaul Networks: A Genetic Algorithm-based Approach [70.85399600288737]
  We study the problem of topology optimization and routing in IAB networks. We develop efficient genetic algorithm-based schemes for both IAB node placement and non-IAB backhaul link distribution. We discuss the main challenges for enabling mesh-based IAB networks.
  arXiv  Detail & Related papers  (2021-02-14T21:52:05Z)
• SoS-RPL: Securing Internet of Things Against Sinkhole Attack Using RPL Protocol-Based Node Rating and Ranking Mechanism [1.2691047660244335]
  IoTs are endowed with particular routing disobedience called sinkhole attack owing to their distributed features. In these attacks, a malicious node broadcasts illusive information regarding the routings to impose itself as a route towards specific nodes for the neighboring nodes and thus, attract data traffic. In this paper, the technique is assessed through wide simulations performed within the NS-3 environment. Based on the results of the simulation, it is indicated that the IoT network behavior metrics are enhanced based on the detection rate, false-negative rate, false-positive rate, packet delivery rate, maximum throughput, and packet loss rate.
  arXiv  Detail & Related papers  (2020-05-17T09:26:09Z)
• Adaptive Propagation Graph Convolutional Network [17.41698818541144]
  Graph convolutional networks (GCNs) are a family of neural network models that perform inference on graph data. We show that state-of-the-art results can be achieved by adapting the number of communication steps independently at every node. We show that the proposed adaptive propagation GCN (AP-GCN) achieves superior or similar results to the best proposed models.
  arXiv  Detail & Related papers  (2020-02-24T15:31:16Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.