Fast energy-aware OLSR routing in VANETs by means of a parallel evolutionary algorithm

• URL: http://arxiv.org/abs/2501.09996v1
• Date: Fri, 17 Jan 2025 07:26:28 GMT
• Title: Fast energy-aware OLSR routing in VANETs by means of a parallel evolutionary algorithm
• Authors: Jamal Toutouh, Sergio Nesmachnow, Enrique Alba,
• Abstract summary: This work tackles the problem of reducing the power consumption of the OLSR routing protocol in vehicular networks. This article introduces a fast automatic methodology to search for energy-efficient OLSR configurations by using a parallel evolutionary algorithm.
• Score: 2.3377096938127684
• License:
• Abstract: This work tackles the problem of reducing the power consumption of the OLSR routing protocol in vehicular networks. Nowadays, energy-aware and green communication protocols are important research topics, specially when deploying wireless mobile networks. This article introduces a fast automatic methodology to search for energy-efficient OLSR configurations by using a parallel evolutionary algorithm. The experimental analysis demonstrates that significant improvements over the standard configuration can be attained in terms of power consumption, with no noteworthy loss in the QoS.

Related papers

• 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)
• Intelligent Hybrid Resource Allocation in MEC-assisted RAN Slicing Network [72.2456220035229]
  We aim to maximize the SSR for heterogeneous service demands in the cooperative MEC-assisted RAN slicing system. We propose a recurrent graph reinforcement learning (RGRL) algorithm to intelligently learn the optimal hybrid RA policy.
  arXiv  Detail & Related papers  (2024-05-02T01:36:13Z)
• Adaptive Dynamic Programming for Energy-Efficient Base Station Cell Switching [19.520603265594108]
  Energy saving in wireless networks is growing in importance due to increasing demand for evolving new-gen cellular networks. We propose an approximate dynamic programming (ADP)-based method coupled with online optimization to switch on/off the cells of base stations to reduce network power consumption.
  arXiv  Detail & Related papers  (2023-10-05T14:50:12Z)
• Multiagent Reinforcement Learning with an Attention Mechanism for Improving Energy Efficiency in LoRa Networks [52.96907334080273]
  As the network scale increases, the energy efficiency of LoRa networks decreases sharply due to severe packet collisions. We propose a transmission parameter allocation algorithm based on multiagent reinforcement learning (MALoRa) Simulation results demonstrate that MALoRa significantly improves the system EE compared with baseline algorithms.
  arXiv  Detail & Related papers  (2023-09-16T11:37:23Z)
• An Intelligent SDWN Routing Algorithm Based on Network Situational Awareness and Deep Reinforcement Learning [4.085916808788356]
  This article introduces an intelligent routing algorithm (DRL-PPONSA) based on deep reinforcement learning with network situational awareness. Experimental results show that DRL-PPONSA outperforms traditional routing methods in network throughput, delay, packet loss rate, and wireless node distance.
  arXiv  Detail & Related papers  (2023-05-12T14:18:09Z)
• ASR: Attention-alike Structural Re-parameterization [53.019657810468026]
  We propose a simple-yet-effective attention-alike structural re- parameterization (ASR) that allows us to achieve SRP for a given network while enjoying the effectiveness of the attention mechanism. In this paper, we conduct extensive experiments from a statistical perspective and discover an interesting phenomenon Stripe Observation, which reveals that channel attention values quickly approach some constant vectors during training.
  arXiv  Detail & Related papers  (2023-04-13T08:52:34Z)
• Phase Shift Design in RIS Empowered Wireless Networks: From Optimization to AI-Based Methods [83.98961686408171]
  Reconfigurable intelligent surfaces (RISs) have a revolutionary capability to customize the radio propagation environment for wireless networks. To fully exploit the advantages of RISs in wireless systems, the phases of the reflecting elements must be jointly designed with conventional communication resources. This paper provides a review of current optimization methods and artificial intelligence-based methods for handling the constraints imposed by RIS.
  arXiv  Detail & Related papers  (2022-04-28T09:26:14Z)
• IoV Scenario: Implementation of a Bandwidth Aware Algorithm in Wireless Network Communication Mode [49.734868032441625]
  This paper proposes a bandwidth aware multi domain virtual network embedding algorithm (BA-VNE) The algorithm is mainly aimed at the problem that users need a lot of bandwidth in wireless communication mode. In order to improve the performance of the algorithm, we introduce particle swarm optimization (PSO) algorithm.
  arXiv  Detail & Related papers  (2022-02-03T03:34:06Z)
• Offline Contextual Bandits for Wireless Network Optimization [107.24086150482843]
  In this paper, we investigate how to learn policies that can automatically adjust the configuration parameters of every cell in the network in response to the changes in the user demand. Our solution combines existent methods for offline learning and adapts them in a principled way to overcome crucial challenges arising in this context.
  arXiv  Detail & Related papers  (2021-11-11T11:31:20Z)
• Fully-echoed Q-routing with Simulated Annealing Inference for Flying Adhoc Networks [6.3372141874912735]
  We propose a full-echo Q-routing algorithm with a self-adaptive learning rate. Our method exhibits a reduction in the energy consumption ranging from 7% up to 82%, as well as a 2.6 fold gain in successful packet delivery rate, compared to the state of the art Q-routing protocols.
  arXiv  Detail & Related papers  (2021-03-23T22:28:26Z)

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.