Online Distributed Evolutionary Optimization of Time Division Multiple Access Protocols

• URL: http://arxiv.org/abs/2204.13190v1
• Date: Wed, 27 Apr 2022 20:47:48 GMT
• Title: Online Distributed Evolutionary Optimization of Time Division Multiple Access Protocols
• Authors: Anil Yaman, Tim van der Lee, Giovanni Iacca
• Abstract summary: We envision a protocol as an emergent property of a network, obtained by an environment-driven Distributed Hill Climbing algorithm. We show how Distributed Hill Climbing can reach different trade-offs in terms of energy consumption and protocol performance.
• Score: 4.87717454493713
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: With the advent of cheap, miniaturized electronics, ubiquitous networking has reached an unprecedented level of complexity, scale and heterogeneity, becoming the core of several modern applications such as smart industry, smart buildings and smart cities. A crucial element for network performance is the protocol stack, namely the sets of rules and data formats that determine how the nodes in the network exchange information. A great effort has been put to devise formal techniques to synthesize (offline) network protocols, starting from system specifications and strict assumptions on the network environment. However, offline design can be hard to apply in the most modern network applications, either due to numerical complexity, or to the fact that the environment might be unknown and the specifications might not available. In these cases, online protocol design and adaptation has the potential to offer a much more scalable and robust solution. Nevertheless, so far only a few attempts have been done towards online automatic protocol design. Here, we envision a protocol as an emergent property of a network, obtained by an environment-driven Distributed Hill Climbing algorithm that uses node-local reinforcement signals to evolve, at runtime and without any central coordination, a network protocol from scratch. We test this approach with a 3-state Time Division Multiple Access (TDMA) Medium Access Control (MAC) protocol and we observe its emergence in networks of various scales and with various settings. We also show how Distributed Hill Climbing can reach different trade-offs in terms of energy consumption and protocol performance.

Related papers

• Protocols to Code: Formal Verification of a Next-Generation Internet Router [9.971817718196997]
  SCION routers run a cryptographic protocol for secure packet forwarding in an adversarial environment. We verify both the protocol's network-wide security properties and low-level properties of its implementation. This paper explains our approach, summarizes the main results, and distills lessons for the design and implementation of verifiable systems.
  arXiv  Detail & Related papers  (2024-05-09T19:57:59Z)
• Task-dependent semi-quantum secure communication in layered networks with OAM states of light [0.0]
  We present two protocols for secure communication in layered networks. First protocol allows sharing of two keys simultaneously in a network of two layers. Second protocol facilitates direct communication in one layer and key distribution in the other.
  arXiv  Detail & Related papers  (2023-06-20T17:57:00Z)
• Towards Diverse Binary Segmentation via A Simple yet General Gated Network [71.19503376629083]
  We propose a simple yet general gated network (GateNet) to tackle binary segmentation tasks. With the help of multi-level gate units, the valuable context information from the encoder can be selectively transmitted to the decoder. We introduce a "Fold" operation to improve the atrous convolution and form a novel folded atrous convolution.
  arXiv  Detail & Related papers  (2023-03-18T11:26:36Z)
• 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)
• Multiparty Entanglement Routing in Quantum Networks [0.0]
  A protocol is proposed for extracting maximally entangled (GHZn) states for any number of parties in quantum networks. The protocol only requires local measurements at the network nodes and just a single qubit memory per user.
  arXiv  Detail & Related papers  (2022-11-12T15:40:34Z)
• A scheme for multipartite entanglement distribution via separable carriers [68.8204255655161]
  We develop a strategy for entanglement distribution via separable carriers that can be applied to any number of network nodes. We show that our protocol results in multipartite entanglement, while the carrier mediating the process is always in a separable state with respect to the network.
  arXiv  Detail & Related papers  (2022-06-20T10:50:45Z)
• Genetic Improvement of Routing Protocols for Delay Tolerant Networks [3.9571744700171756]
  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.
  arXiv  Detail & Related papers  (2021-03-12T17:46:51Z)
• Towards Multi-agent Reinforcement Learning for Wireless Network Protocol Synthesis [2.6397379133308214]
  This paper proposes a multi-agent reinforcement learning based medium access framework for wireless networks. The access problem is formulated as a Markov Decision Process (MDP), and solved using reinforcement learning with every network node acting as a distributed learning agent.
  arXiv  Detail & Related papers  (2021-02-02T17:13:37Z)
• Deep Multi-Task Learning for Cooperative NOMA: System Design and Principles [52.79089414630366]
  We develop a novel deep cooperative NOMA scheme, drawing upon the recent advances in deep learning (DL) We develop a novel hybrid-cascaded deep neural network (DNN) architecture such that the entire system can be optimized in a holistic manner.
  arXiv  Detail & Related papers  (2020-07-27T12:38:37Z)
• Continual Adaptation for Deep Stereo [52.181067640300014]
  We propose a continual adaptation paradigm for deep stereo networks designed to deal with challenging and ever-changing environments. In our paradigm, the learning signals needed to continuously adapt models online can be sourced from self-supervision via right-to-left image warping or from traditional stereo algorithms. Our network architecture and adaptation algorithms realize the first real-time self-adaptive deep stereo system.
  arXiv  Detail & Related papers  (2020-07-10T08:15:58Z)
• Multi-Agent Routing Value Iteration Network [88.38796921838203]
  We propose a graph neural network based model that is able to perform multi-agent routing based on learned value in a sparsely connected graph. We show that our model trained with only two agents on graphs with a maximum of 25 nodes can easily generalize to situations with more agents and/or nodes.
  arXiv  Detail & Related papers  (2020-07-09T22:16:45Z)

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.