Automatic tuning of communication protocols for vehicular ad hoc networks using metaheuristics

• URL: http://arxiv.org/abs/2501.08847v1
• Date: Wed, 15 Jan 2025 14:59:00 GMT
• Title: Automatic tuning of communication protocols for vehicular ad hoc networks using metaheuristics
• Authors: José García-Nieto, Jamal Toutouh, Enrique Alba,
• Abstract summary: vehicular ad hoc networks (VANETs) deal with a set of communicating vehicles which are able to spontaneously interconnect.<n>It is crucial to make an optimal configuration of the communication protocols previously to the final network deployment.
• Score: 4.734135226897704
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The emerging field of vehicular ad hoc networks (VANETs) deals with a set of communicating vehicles which are able to spontaneously interconnect without any pre-existing infrastructure. In such kind of networks, it is crucial to make an optimal configuration of the communication protocols previously to the final network deployment. This way, a human designer can obtain an optimal QoS of the network beforehand. The problem we consider in this work lies in configuring the File Transfer protocol Configuration (FTC) with the aim of optimizing the transmission time, the number of lost packets, and the amount of data transferred in realistic VANET scenarios. We face the FTC with five representative state-of-the-art optimization techniques and compare their performance. These algorithms are: Particle Swarm Optimization (PSO), Differential Evolution (DE), Genetic Algorithm (GA), Evolutionary Strategy (ES), and Simulated Annealing (SA). For our tests, two typical environment instances of VANETs for Urban and Highway scenarios have been defined. The experiments using ns- 2 (a well-known realistic VANET simulator) reveal that PSO outperforms all the compared algorithms for both studied VANET instances.

Related papers

• Joint Optimal Transport and Embedding for Network Alignment [66.49765320358361]
  We propose a joint optimal transport and embedding framework for network alignment named JOENA. With a unified objective, the mutual benefits of both methods can be achieved by an alternating optimization schema with guaranteed convergence. Experiments on real-world networks validate the effectiveness and scalability of JOENA, achieving up to 16% improvement in MRR and 20x speedup.
  arXiv  Detail & Related papers  (2025-02-26T17:28:08Z)
• Intelligent OLSR Routing Protocol Optimization for VANETs [4.734135226897704]
  This paper deals with the optimal parameter setting of the optimized link state routing (OLSR) In the experiments, our tuned OLSR configurations result in better quality of service (QoS) than the standard request for comments (RFC 3626)
  arXiv  Detail & Related papers  (2025-01-16T18:05:28Z)
• Communication- and Computation-Efficient Distributed Decision-Making in Multi-Robot Networks [2.8936428431504164]
  We provide a distributed coordination paradigm that enables scalable and near-optimal joint motion planning among multiple robots. Our algorithm is up to two orders faster than competitive near-optimal algorithms. In simulations of surveillance tasks with up to 45 robots, it enables real-time planning at the order of 1 Hz with superior coverage performance.
  arXiv  Detail & Related papers  (2024-07-15T01:25:39Z)
• Automatic AI Model Selection for Wireless Systems: Online Learning via Digital Twinning [50.332027356848094]
  AI-based applications are deployed at intelligent controllers to carry out functionalities like scheduling or power control. The mapping between context and AI model parameters is ideally done in a zero-shot fashion. This paper introduces a general methodology for the online optimization of AMS mappings.
  arXiv  Detail & Related papers  (2024-06-22T11:17:50Z)
• Cellular Traffic Prediction Using Online Prediction Algorithms [5.416701003120508]
  This paper investigates the efficacy of live prediction algorithms for forecasting cellular network traffic in real-time scenarios. We apply two live prediction algorithms on machine learning models, one of which is recently proposed Fast LiveStream Prediction (FLSP) algorithm. Our study reveals that the FLSP algorithm can halve the required bandwidth for asynchronous data reporting compared to conventional online prediction algorithms.
  arXiv  Detail & Related papers  (2024-05-08T17:36:14Z)
• TCCT-Net: Two-Stream Network Architecture for Fast and Efficient Engagement Estimation via Behavioral Feature Signals [58.865901821451295]
  We present a novel two-stream feature fusion "Tensor-Convolution and Convolution-Transformer Network" (TCCT-Net) architecture. To better learn the meaningful patterns in the temporal-spatial domain, we design a "CT" stream that integrates a hybrid convolutional-transformer. In parallel, to efficiently extract rich patterns from the temporal-frequency domain, we introduce a "TC" stream that uses Continuous Wavelet Transform (CWT) to represent information in a 2D tensor form.
  arXiv  Detail & Related papers  (2024-04-15T06:01:48Z)
• Learnable Digital Twin for Efficient Wireless Network Evaluation [40.829275623191656]
  Network digital twins (NDTs) facilitate the estimation of key performance indicators (KPIs) before physically implementing a network. In this paper, we propose a learning-based NDT for network simulators.
  arXiv  Detail & Related papers  (2023-06-11T03:43:39Z)
• Multi-Exit Semantic Segmentation Networks [78.44441236864057]
  We propose a framework for converting state-of-the-art segmentation models to MESS networks. specially trained CNNs that employ parametrised early exits along their depth to save during inference on easier samples. We co-optimise the number, placement and architecture of the attached segmentation heads, along with the exit policy, to adapt to the device capabilities and application-specific requirements.
  arXiv  Detail & Related papers  (2021-06-07T11:37:03Z)
• Spatio-temporal Modeling for Large-scale Vehicular Networks Using Graph Convolutional Networks [110.80088437391379]
  A graph-based framework called SMART is proposed to model and keep track of the statistics of vehicle-to-temporal (V2I) communication latency across a large geographical area. We develop a graph reconstruction-based approach using a graph convolutional network integrated with a deep Q-networks algorithm. Our results show that the proposed method can significantly improve both the accuracy and efficiency for modeling and the latency performance of large vehicular networks.
  arXiv  Detail & Related papers  (2021-03-13T06:56:29Z)
• Deep Learning-based Resource Allocation For Device-to-Device Communication [66.74874646973593]
  We propose a framework for the optimization of the resource allocation in multi-channel cellular systems with device-to-device (D2D) communication. A deep learning (DL) framework is proposed, where the optimal resource allocation strategy for arbitrary channel conditions is approximated by deep neural network (DNN) models. Our simulation results confirm that near-optimal performance can be attained with low time, which underlines the real-time capability of the proposed scheme.
  arXiv  Detail & Related papers  (2020-11-25T14:19:23Z)
• A Machine Learning based Framework for KPI Maximization in Emerging Networks using Mobility Parameters [3.6671455337053573]
  Current LTE network is faced with a plethora of configuration and optimization parameters. With 5G in view, the number of these COPs are expected to reach 2000 per site. We propose a machine learning-based framework combined with a technique to discover the optimal combination of two pertinent COPs.
  arXiv  Detail & Related papers  (2020-05-04T13:28:04Z)
• Hyperparameter Optimization in Binary Communication Networks for Neuromorphic Deployment [4.280642750854163]
  Training neural networks for neuromorphic deployment is non-trivial. We introduce a Bayesian approach for optimizing the hyper parameters of an algorithm for training binary communication networks that can be deployed to neuromorphic hardware. We show that by optimizing the hyper parameters on this algorithm for each dataset, we can achieve improvements in accuracy over the previous state-of-the-art for this algorithm on each dataset.
  arXiv  Detail & Related papers  (2020-04-21T01:15: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.