<?xml version="1.0" encoding="UTF-8"?><!DOCTYPE article PUBLIC "-//NLM//DTD Journal Publishing DTD v3.0 20080202//EN" "http://dtd.nlm.nih.gov/publishing/3.0/journalpublishing3.dtd">
<article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" dtd-version="3.0" xml:lang="en" article-type="research article">
 <front>
  <journal-meta>
   <journal-id journal-id-type="publisher-id">
    eng
   </journal-id>
   <journal-title-group>
    <journal-title>
     Engineering
    </journal-title>
   </journal-title-group>
   <issn pub-type="epub">
    1947-3931
   </issn>
   <issn publication-format="print">
    1947-394X
   </issn>
   <publisher>
    <publisher-name>
     Scientific Research Publishing
    </publisher-name>
   </publisher>
  </journal-meta>
  <article-meta>
   <article-id pub-id-type="doi">
    10.4236/eng.2025.171009
   </article-id>
   <article-id pub-id-type="publisher-id">
    eng-140264
   </article-id>
   <article-categories>
    <subj-group subj-group-type="heading">
     <subject>
      Articles
     </subject>
    </subj-group>
    <subj-group subj-group-type="Discipline-v2">
     <subject>
      Engineering
     </subject>
    </subj-group>
   </article-categories>
   <title-group>
    Impact of Interference and Mobility on MAC Layer Performance in VANETs, FANETs 
   </title-group>
   <contrib-group>
    <contrib contrib-type="author" xlink:type="simple">
     <name name-style="western">
      <surname>
       Pegdwindé Justin
      </surname>
      <given-names>
       Kouraogo
      </given-names>
     </name> 
     <xref ref-type="aff" rid="aff1"> 
      <sup>1</sup>
     </xref>
    </contrib>
    <contrib contrib-type="author" xlink:type="simple">
     <name name-style="western">
      <surname>
       Hamidou Harouna
      </surname>
      <given-names>
       Omar
      </given-names>
     </name> 
     <xref ref-type="aff" rid="aff2"> 
      <sup>2</sup>
     </xref>
    </contrib>
    <contrib contrib-type="author" xlink:type="simple">
     <name name-style="western">
      <surname>
       Désiré
      </surname>
      <given-names>
       Guel
      </given-names>
     </name> 
     <xref ref-type="aff" rid="aff1"> 
      <sup>1</sup>
     </xref>
    </contrib>
   </contrib-group> 
   <aff id="aff1">
    <addr-line>
     aDepartment of Computer Science, Joseph Ki-Zerbo University, Ouagadougou, Burkina Faso
    </addr-line> 
   </aff> 
   <aff id="aff2">
    <addr-line>
     aDoctoral School of Science and Technology, Aube Nouvelle University, Ouagadougou, Burkina Faso
    </addr-line> 
   </aff> 
   <pub-date pub-type="epub">
    <day>
     13
    </day> 
    <month>
     01
    </month>
    <year>
     2025
    </year>
   </pub-date> 
   <volume>
    17
   </volume> 
   <issue>
    01
   </issue>
   <fpage>
    136
   </fpage>
   <lpage>
    154
   </lpage>
   <history>
    <date date-type="received">
     <day>
      13,
     </day>
     <month>
      December
     </month>
     <year>
      2024
     </year>
    </date>
    <date date-type="published">
     <day>
      23,
     </day>
     <month>
      December
     </month>
     <year>
      2024
     </year> 
    </date> 
    <date date-type="accepted">
     <day>
      23,
     </day>
     <month>
      January
     </month>
     <year>
      2025
     </year> 
    </date>
   </history>
   <permissions>
    <copyright-statement>
     © Copyright 2014 by authors and Scientific Research Publishing Inc. 
    </copyright-statement>
    <copyright-year>
     2014
    </copyright-year>
    <license>
     <license-p>
      This work is licensed under the Creative Commons Attribution International License (CC BY). http://creativecommons.org/licenses/by/4.0/
     </license-p>
    </license>
   </permissions>
   <abstract>
    Vehicular Ad Hoc Networks (VANETs) play a pivotal role in advancing Intelligent Transportation Systems (ITS), facilitating real-time communication among vehicles and infrastructure. However, VANETs face challenges arising from high mobility, dynamic topologies, and significant interference levels. This study proposes a novel cross-layer framework incorporating channel prediction and adaptive resource management to address these challenges. By leveraging a Software-Defined Radio (SDR) platform, the framework is evaluated under diverse mobility and interference conditions. Key contributions include an analysis of multi-code and multi-modulation schemes, identification of critical trade-offs in receiver diversity, and the introduction of mechanisms to optimize Quality of Service (QoS). Simulation results demonstrate significant improvements in throughput, packet delivery ratio, and network resilience, highlighting the framework’s potential for real-world applications such as autonomous vehicles and smart city communication networks. The study concludes with actionable recommendations for future research, emphasizing scalability, real-time adaptation, and hardware implementation to further enhance VANET performance.
   </abstract>
   <kwd-group> 
    <kwd>
     VANET
    </kwd> 
    <kwd>
      Cross-Layer Design
    </kwd> 
    <kwd>
      Channel Prediction
    </kwd> 
    <kwd>
      QoS Optimization
    </kwd> 
    <kwd>
      Interference Management
    </kwd> 
    <kwd>
      Mobility Models
    </kwd>
   </kwd-group>
  </article-meta>
 </front>
 <body>
  <sec id="s1">
   <title>1. Introduction</title>
   <p>Vehicular Ad hoc Networks (VANETs) have emerged as a critical component of Intelligent Transportation Systems (ITS), enabling enhanced road safety, traffic management and infotainment applications. Despite significant advancements in VANET technologies, several challenges persist, particularly in managing the dynamic nature of vehicular environments and addressing interference in communication systems. The inherent high mobility, rapidly changing topologies and diverse quality-of-service (QoS) requirements of VANETs create substantial complexities in network design and performance optimization.</p>
   <p>Existing studies have extensively explored Medium Access Control (MAC) protocols, including contention-based and contention-free approaches and their applications in VANETs <xref ref-type="bibr" rid="scirp.140264-1">
     [1]
    </xref>-<xref ref-type="bibr" rid="scirp.140264-3">
     [3]
    </xref>. However, the integration of these protocols often falls short of addressing critical issues such as interference management, scalability under high-density traffic and efficient resource allocation. For instance, traditional MAC designs struggle to ensure reliable communication in scenarios with high user density and co-channel interference <xref ref-type="bibr" rid="scirp.140264-2">
     [2]
    </xref> <xref ref-type="bibr" rid="scirp.140264-4">
     [4]
    </xref>. Furthermore, the lack of effective cross-layer designs limits the ability to optimize system performance across different layers of the communication stack <xref ref-type="bibr" rid="scirp.140264-5">
     [5]
    </xref> <xref ref-type="bibr" rid="scirp.140264-6">
     [6]
    </xref>.</p>
   <p>This study addresses these gaps by proposing a cross-layer framework that integrates advanced channel prediction techniques with adaptive MAC mechanisms. Specifically, the proposed approach leverages inter-layer collaboration to enhance system performance under varying traffic densities and mobility scenarios. The framework introduces innovative methods for real-time channel state estimation and interference mitigation, ensuring robust and reliable communication even in high-density vehicular networks.</p>
   <p>The key contributions of this work are summarized as follows:</p>
   <p>To illustrate the challenges addressed by the proposed framework, consider a scenario where high vehicular density leads to frequent collisions and degraded communication reliability. Traditional MAC protocols, such as IEEE 802.11p, often exhibit reduced performance due to their static channel allocation strategies <xref ref-type="bibr" rid="scirp.140264-7">
     [7]
    </xref> <xref ref-type="bibr" rid="scirp.140264-8">
     [8]
    </xref>. By introducing dynamic channel prediction and adaptive resource allocation, the proposed framework mitigates these issues and enhances the efficiency of VANET communication systems.</p>
   <p>In the following sections, we provide a detailed discussion of the methodology, simulation setup and performance analysis of the proposed framework. The insights derived from this study contribute to advancing the design of VANET systems and paving the way for their effective deployment in real-world ITS applications.</p>
  </sec><sec id="s2">
   <title>2. Background and State of the Art</title>
   <p>Vehicular Ad Hoc Networks (VANETs) have emerged as a cornerstone for enabling intelligent transportation systems, promising significant advancements in road safety and traffic efficiency. This section presents a comprehensive review of the state-of-the-art technologies and methodologies categorized into thematic subsections to enhance clarity and cohesion.</p>
   <sec id="s2_1">
    <title>2.1. Interference Management in VANETs</title>
    <p>Interference remains a primary challenge in VANETs due to the dynamic nature of vehicular environments and the high density of nodes. Various approaches have been proposed to address this issue, as shown in <xref ref-type="table" rid="table1">
      Table 1
     </xref>:</p>
    <table-wrap id="table1">
     <label>
      <xref ref-type="table" rid="table1">
       Table 1
      </xref></label>
     <caption>
      <title>
       <xref ref-type="bibr" rid="scirp.140264-"></xref>Table 1. Comparison of interference management techniques.</title>
     </caption>
     <table class="MsoTableGrid custom-table" border="0" cellspacing="0" cellpadding="0"> 
      <tr> 
       <td class="custom-bottom-td acenter" width="27.93%"><p style="text-align:center">Technique</p></td> 
       <td class="custom-bottom-td acenter" width="26.15%"><p style="text-align:center">Strengths</p></td> 
       <td class="custom-bottom-td acenter" width="28.70%"><p style="text-align:center">Limitations</p></td> 
       <td class="custom-bottom-td acenter" width="17.21%"><p style="text-align:center">References</p></td> 
      </tr> 
      <tr> 
       <td class="custom-top-td acenter" width="27.93%"><p style="text-align:center">Multi-user Detection</p></td> 
       <td class="custom-top-td acenter" width="26.15%"><p style="text-align:center">High SIR improvement</p></td> 
       <td class="custom-top-td acenter" width="28.70%"><p style="text-align:center">Computational complexity</p></td> 
       <td class="custom-top-td acenter" width="17.21%"><p style="text-align:center">
         <xref ref-type="bibr" rid="scirp.140264-3">
          [3]
         </xref> <xref ref-type="bibr" rid="scirp.140264-6">
          [6]
         </xref></p></td> 
      </tr> 
      <tr> 
       <td class="acenter" width="27.93%"><p style="text-align:center">Channel Allocation</p></td> 
       <td class="acenter" width="26.15%"><p style="text-align:center">Optimized resource utilization</p></td> 
       <td class="acenter" width="28.70%"><p style="text-align:center">Dependency on network topology</p></td> 
       <td class="acenter" width="17.21%"><p style="text-align:center">
         <xref ref-type="bibr" rid="scirp.140264-4">
          [4]
         </xref></p></td> 
      </tr> 
      <tr> 
       <td class="acenter" width="27.93%"><p style="text-align:center">Cognitive Radio</p></td> 
       <td class="acenter" width="26.15%"><p style="text-align:center">Flexible spectrum access</p></td> 
       <td class="acenter" width="28.70%"><p style="text-align:center">Hardware complexity</p></td> 
       <td class="acenter" width="17.21%"><p style="text-align:center">
         <xref ref-type="bibr" rid="scirp.140264-8">
          [8]
         </xref></p></td> 
      </tr> 
     </table>
    </table-wrap>
   </sec>
   <sec id="s2_2">
    <title>2.2. Mobility Management and Handling</title>
    <p>Mobility poses unique challenges in VANETs, such as frequent topology changes and variable communication link quality, as shown in <xref ref-type="table" rid="table2">
      Table 2
     </xref>.</p>
    <table-wrap id="table2">
     <label>
      <xref ref-type="table" rid="table2">
       Table 2
      </xref></label>
     <caption>
      <title>
       <xref ref-type="bibr" rid="scirp.140264-"></xref>Table 2. Comparison of mobility management techniques.</title>
     </caption>
     <table class="MsoTableGrid custom-table" border="0" cellspacing="0" cellpadding="0"> 
      <tr> 
       <td class="custom-bottom-td acenter" width="29.41%"><p style="text-align:center">Technique</p></td> 
       <td class="custom-bottom-td acenter" width="27.42%"><p style="text-align:center">Strengths</p></td> 
       <td class="custom-bottom-td acenter" width="29.33%"><p style="text-align:center">Limitations</p></td> 
       <td class="custom-bottom-td acenter" width="13.84%"><p style="text-align:center">References</p></td> 
      </tr> 
      <tr> 
       <td class="custom-top-td acenter" width="29.41%"><p style="text-align:center">Mobility Models</p></td> 
       <td class="custom-top-td acenter" width="27.42%"><p style="text-align:center">Realistic simulation</p></td> 
       <td class="custom-top-td acenter" width="29.33%"><p style="text-align:center">High computational cost</p></td> 
       <td class="custom-top-td acenter" width="13.84%"><p style="text-align:center">
         <xref ref-type="bibr" rid="scirp.140264-9">
          [9]
         </xref></p></td> 
      </tr> 
      <tr> 
       <td class="acenter" width="29.41%"><p style="text-align:center">Dynamic Slot Allocation</p></td> 
       <td class="acenter" width="27.42%"><p style="text-align:center">Efficient resource usage</p></td> 
       <td class="acenter" width="29.33%"><p style="text-align:center">Limited scalability</p></td> 
       <td class="acenter" width="13.84%"><p style="text-align:center">
         <xref ref-type="bibr" rid="scirp.140264-10">
          [10]
         </xref></p></td> 
      </tr> 
      <tr> 
       <td class="acenter" width="29.41%"><p style="text-align:center">Cross-layer Optimization</p></td> 
       <td class="acenter" width="27.42%"><p style="text-align:center">Enhanced network resilience</p></td> 
       <td class="acenter" width="29.33%"><p style="text-align:center">Increased design complexity</p></td> 
       <td class="acenter" width="13.84%"><p style="text-align:center">
         <xref ref-type="bibr" rid="scirp.140264-5">
          [5]
         </xref></p></td> 
      </tr> 
     </table>
    </table-wrap>
   </sec>
   <sec id="s2_3">
    <title>2.3. Medium Access Control (MAC) Protocols</title>
    <p>The design of MAC protocols is critical to ensuring reliable communication in VANETs. Various strategies have been developed to meet the unique demands of vehicular environments, as shown in <xref ref-type="table" rid="table3">
      Table 3
     </xref>:</p>
    <table-wrap id="table3">
     <label>
      <xref ref-type="table" rid="table3">
       Table 3
      </xref></label>
     <caption>
      <title>
       <xref ref-type="bibr" rid="scirp.140264-"></xref>Table 3. Comparison of MAC protocols.</title>
     </caption>
     <table class="MsoTableGrid custom-table" border="0" cellspacing="0" cellpadding="0"> 
      <tr> 
       <td class="custom-bottom-td acenter" width="24.99%"><p style="text-align:center">Protocol</p></td> 
       <td class="custom-bottom-td acenter" width="29.94%"><p style="text-align:center">Strengths</p></td> 
       <td class="custom-bottom-td acenter" width="31.02%"><p style="text-align:center">Limitations</p></td> 
       <td class="custom-bottom-td acenter" width="14.05%"><p style="text-align:center">References</p></td> 
      </tr> 
      <tr> 
       <td class="custom-top-td acenter" width="24.99%"><p style="text-align:center">IEEE 802.11p</p></td> 
       <td class="custom-top-td acenter" width="29.94%"><p style="text-align:center">Simple implementation</p></td> 
       <td class="custom-top-td acenter" width="31.02%"><p style="text-align:center">High collision rates</p></td> 
       <td class="custom-top-td acenter" width="14.05%"><p style="text-align:center">
         <xref ref-type="bibr" rid="scirp.140264-1">
          [1]
         </xref></p></td> 
      </tr> 
      <tr> 
       <td class="acenter" width="24.99%"><p style="text-align:center">Hybrid Protocols</p></td> 
       <td class="acenter" width="29.94%"><p style="text-align:center">Balanced performance</p></td> 
       <td class="acenter" width="31.02%"><p style="text-align:center">Design complexity</p></td> 
       <td class="acenter" width="14.05%"><p style="text-align:center">
         <xref ref-type="bibr" rid="scirp.140264-11">
          [11]
         </xref></p></td> 
      </tr> 
      <tr> 
       <td class="acenter" width="24.99%"><p style="text-align:center">TDMA</p></td> 
       <td class="acenter" width="29.94%"><p style="text-align:center">Reduced collisions</p></td> 
       <td class="acenter" width="31.02%"><p style="text-align:center">Fixed slot assignment</p></td> 
       <td class="acenter" width="14.05%"><p style="text-align:center">
         <xref ref-type="bibr" rid="scirp.140264-12">
          [12]
         </xref></p></td> 
      </tr> 
     </table>
    </table-wrap>
   </sec>
   <sec id="s2_4">
    <title>2.4. Advancements in Cross-Layer Design</title>
    <p>Cross-layer design has gained traction as an effective approach to address the multi-faceted challenges of VANETs, as shown in <xref ref-type="table" rid="table4">
      Table 4
     </xref>.</p>
    <table-wrap id="table4">
     <label>
      <xref ref-type="table" rid="table4">
       Table 4
      </xref></label>
     <caption>
      <title>
       <xref ref-type="bibr" rid="scirp.140264-"></xref>Table 4. Comparison of cross-layer design approaches.</title>
     </caption>
     <table class="MsoTableGrid custom-table" border="0" cellspacing="0" cellpadding="0"> 
      <tr> 
       <td class="custom-bottom-td acenter" width="24.99%"><p style="text-align:center">Approach</p></td> 
       <td class="custom-bottom-td acenter" width="27.83%"><p style="text-align:center">Strengths</p></td> 
       <td class="custom-bottom-td acenter" width="32.71%"><p style="text-align:center">Limitations</p></td> 
       <td class="custom-bottom-td acenter" width="14.47%"><p style="text-align:center">Reference</p></td> 
      </tr> 
      <tr> 
       <td class="custom-top-td acenter" width="24.99%"><p style="text-align:center">Resource Allocation</p></td> 
       <td class="custom-top-td acenter" width="27.83%"><p style="text-align:center">Improved throughput</p></td> 
       <td class="custom-top-td acenter" width="32.71%"><p style="text-align:center">Complexity in real-time applications</p></td> 
       <td class="custom-top-td acenter" width="14.47%"><p style="text-align:center">
         <xref ref-type="bibr" rid="scirp.140264-13">
          [13]
         </xref></p></td> 
      </tr> 
      <tr> 
       <td class="acenter" width="24.99%"><p style="text-align:center">Adaptive Mechanisms</p></td> 
       <td class="acenter" width="27.83%"><p style="text-align:center">Resilience to dynamic conditions</p></td> 
       <td class="acenter" width="32.71%"><p style="text-align:center">Implementation challenges</p></td> 
       <td class="acenter" width="14.47%"><p style="text-align:center">
         <xref ref-type="bibr" rid="scirp.140264-14">
          [14]
         </xref></p></td> 
      </tr> 
      <tr> 
       <td class="acenter" width="24.99%"><p style="text-align:center">Machine Learning</p></td> 
       <td class="acenter" width="27.83%"><p style="text-align:center">Enhanced decision-making</p></td> 
       <td class="acenter" width="32.71%"><p style="text-align:center">Requires extensive training data</p></td> 
       <td class="acenter" width="14.47%"><p style="text-align:center">
         <xref ref-type="bibr" rid="scirp.140264-15">
          [15]
         </xref></p></td> 
      </tr> 
     </table>
    </table-wrap>
    <p>of machine learning to enhance decision-making in cross-layer designs.</p>
    <p>This comprehensive review highlights the advancements and challenges in interference management, mobility handling, MAC protocols and cross-layer design for VANETs, setting the stage for the proposed methodologies discussed in subsequent sections.</p>
   </sec>
  </sec><sec id="s3">
   <title>3. Methodology</title>
   <p>The adopted methodology utilizes a structured approach to model VANETs in diverse scenarios through simulations using an SDR platform. The methodology is detailed below with visual representation, discussion of potential limitations and justification for selected channel prediction models.</p>
   <sec id="s3_1">
    <title>3.1. Overview of the Methodology</title>
    <p>The methodology, illustrated in <xref ref-type="fig" rid="fig1">
      Figure 1
     </xref> follows these key steps:</p>
    <fig id="fig1" position="float">
     <label>Figure 1</label>
     <caption>
      <title>Figure 1. Methodology process flow.</title>
     </caption>
     <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/8104675-rId14.jpeg?20250126040619" />
    </fig>
   </sec>
   <sec id="s3_2">
    <title>3.2. Cross-Layer Mechanism with Channel Prediction</title>
    <p>The cross-layer mechanism integrates radio and physical access layers to optimize resource management in interference-prone environments. The steps involved are:</p>
    <p>1) Neighborhood Listening: Listen for Connection Confirmation (CTS) packets to detect active transmitters.</p>
    <p>2) RTS Packet Header Analysis: Analyze headers to extract destination addresses for identifying incoming streams.</p>
    <p>3) Extracting QoS Requests: Extract QoS requirements such as throughput and delay tolerances.</p>
    <p>4) Channel Gain Estimation and Prediction: Estimate and predict channel gains to anticipate conditions.</p>
    <p>5) Rate Allocation and Loss Calculation: Allocate transmission rates and calculate packet loss rates based on predictions.</p>
    <p>6) Training Sequence Update: Update training sequences with calculated rates and loss metrics for efficient transmission.</p>
    <p>7) Transmitter Scheduling: Optimize scheduling based on throughput, loss, delay and priority.</p>
    <fig id="fig2" position="float">
     <label>Figure 2</label>
     <caption>
      <title>Figure 2. Inter-layer mechanism for channel prediction.</title>
     </caption>
     <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/8104675-rId15.jpeg?20250126040619" />
    </fig>
    <p>
     <xref ref-type="fig" rid="fig2">
      Figure 2
     </xref> provides a detailed process flow, highlighting the sequential steps in the cross-layer mechanism. Starting with neighborhood listening and RTS packet header analysis, it progresses through QoS request extraction, channel gain prediction, rate allocation, training sequence updates, and finally transmitter scheduling. Each step is designed to optimize resource allocation and ensure efficient communication in interference-heavy scenarios. At the same time, <xref ref-type="fig" rid="fig3">
      Figure 3
     </xref> demonstrates the interaction between channel prediction and adaptation mechanisms. The figure emphasizes the dynamic adaptation process in response to predicted interference levels, showcasing the ability of the system to maintain robust performance by preemptively adjusting transmission parameters and resource allocations.</p>
    <fig id="fig3" position="float">
     <label>Figure 3</label>
     <caption>
      <title>Figure 3. Prediction adaptation et interference.</title>
     </caption>
     <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/8104675-rId16.jpeg?20250126040619" />
    </fig>
   </sec>
   <sec id="s3_3">
    <title>3.3. Rationale for Channel Prediction Models</title>
    <p>The selection of channel prediction models is based on the following considerations:</p>
   </sec>
   <sec id="s3_4">
    <title>3.4. Limitations and Trade-Offs</title>
    <p>The methodology has some inherent limitations and trade-offs:</p>
    <p>This comprehensive methodology combines theoretical rigor with practical relevance to address key challenges in VANET communication.</p>
   </sec>
  </sec><sec id="s4">
   <title>4. Simulation and Results</title>
   <p>To provide a comprehensive evaluation of the proposed framework, this section outlines the simulation setup, performance metrics and results analysis. By mimicking real-world VANET conditions and testing the system under various mobility speeds and network densities, the simulations aim to validate the robustness, scalability and practical viability of the framework. The results highlight the impact of key parameters on network performance and demonstrate the advantages of incorporating channel prediction algorithms into the MUD-MAC protocol.</p>
   <sec id="s4_1">
    <title>4.1. Performance Evaluation Scenarios and Metrics</title>
    <p>This section presents the simulation scenarios and the metrics used to evaluate the system’s performance under realistic conditions. The selection of metrics and simulation parameters was carefully tailored to align with the research objectives.</p>
    <p>This subsection details the evaluation of Bit Error Rate (BER) and other metrics at the physical layer, focusing on multipath channel scenarios. These metrics were prioritized due to their direct impact on signal reliability and communication efficiency in VANETs.</p>
    <p>The receiver architecture is divided into two main components:</p>
    <p>1) Branch Operations:</p>
    <p>- Includes matched filter reception, successive interference suppression and decorrelation, which are linear processes crucial for noise and interference mitigation.</p>
    <p>- The Signal-to-Noise and Interference Ratio (SINR) expressions remain consistent with those for single-path channels, as defined in <xref ref-type="bibr" rid="scirp.140264-16">
      [16]
     </xref>.</p>
    <p>- BER is calculated using modulation-specific formulas for BPSK, QPSK and M-QAM. For instance:</p>
    <p>
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msubsup> 
        <mi>
          P 
        </mi> 
        <mrow> 
         <mi>
           e 
         </mi> 
         <mo>
           , 
         </mo> 
         <mi>
           k 
         </mi> 
        </mrow> 
        <mrow> 
         <mi>
           I 
         </mi> 
         <mo>
           / 
         </mo> 
         <mi>
           Q 
         </mi> 
        </mrow> 
       </msubsup> 
       <mo>
         ≈ 
       </mo> 
       <mfrac> 
        <mrow> 
         <msqrt> 
          <mrow> 
           <msub> 
            <mi>
              M 
            </mi> 
            <mi>
              k 
            </mi> 
           </msub> 
          </mrow> 
         </msqrt> 
         <mo>
           − 
         </mo> 
         <mn>
           1 
         </mn> 
        </mrow> 
        <mrow> 
         <msqrt> 
          <mrow> 
           <msub> 
            <mi>
              M 
            </mi> 
            <mi>
              k 
            </mi> 
           </msub> 
          </mrow> 
         </msqrt> 
        </mrow> 
       </mfrac> 
       <mo>
         ⋅ 
       </mo> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mrow> 
         <mn>
           1 
         </mn> 
         <mo>
           − 
         </mo> 
         <msqrt> 
          <mrow> 
           <mfrac> 
            <mrow> 
             <msub> 
              <mi>
                γ 
              </mi> 
              <mi>
                k 
              </mi> 
             </msub> 
            </mrow> 
            <mrow> 
             <msub> 
              <mi>
                γ 
              </mi> 
              <mrow> 
               <mi>
                 k 
               </mi> 
               <mo>
                 + 
               </mo> 
               <mn>
                 1 
               </mn> 
              </mrow> 
             </msub> 
            </mrow> 
           </mfrac> 
          </mrow> 
         </msqrt> 
        </mrow> 
        <mo>
          ) 
        </mo> 
       </mrow> 
       <mo>
         . 
       </mo> 
      </mrow> 
     </math></p>
    <p>2) Path Combination Methods:</p>
    <p>- Two methods are analyzed: maximizing SINR and applying equal gain (value 1).</p>
    <p>- The SINR maximization approach calculates the total symbol error probability as:</p>
    <p>
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msubsup> 
        <mi>
          P 
        </mi> 
        <mrow> 
         <mi>
           e 
         </mi> 
         <mo>
           , 
         </mo> 
         <mi>
           k 
         </mi> 
        </mrow> 
        <mrow> 
         <mi>
           I 
         </mi> 
         <mo>
           / 
         </mo> 
         <mi>
           Q 
         </mi> 
        </mrow> 
       </msubsup> 
       <mo>
         = 
       </mo> 
       <msup> 
        <mrow> 
         <mrow> 
          <mo>
            ( 
          </mo> 
          <mrow> 
           <msubsup> 
            <mi>
              P 
            </mi> 
            <mrow> 
             <mi>
               b 
             </mi> 
             <mo>
               , 
             </mo> 
             <mi>
               k 
             </mi> 
            </mrow> 
            <mrow> 
             <mi>
               I 
             </mi> 
             <mo>
               / 
             </mo> 
             <mi>
               Q 
             </mi> 
            </mrow> 
           </msubsup> 
          </mrow> 
          <mo>
            ) 
          </mo> 
         </mrow> 
        </mrow> 
        <mrow> 
         <msub> 
          <mi>
            L 
          </mi> 
          <mi>
            p 
          </mi> 
         </msub> 
        </mrow> 
       </msup> 
       <munderover> 
        <mstyle mathsize="140%" displaystyle="true"> 
         <mo>
           ∑ 
         </mo> 
        </mstyle> 
        <mrow> 
         <mi>
           i 
         </mi> 
         <mo>
           = 
         </mo> 
         <mn>
           0 
         </mn> 
        </mrow> 
        <mrow> 
         <msub> 
          <mi>
            L 
          </mi> 
          <mi>
            p 
          </mi> 
         </msub> 
         <mo>
           − 
         </mo> 
         <mn>
           1 
         </mn> 
        </mrow> 
       </munderover> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mrow> 
         <mtable> 
          <mtr> 
           <mtd> 
            <mrow> 
             <msub> 
              <mi>
                L 
              </mi> 
              <mi>
                p 
              </mi> 
             </msub> 
             <mo>
               − 
             </mo> 
             <mn>
               1 
             </mn> 
             <mo>
               + 
             </mo> 
             <mi>
               i 
             </mi> 
            </mrow> 
           </mtd> 
          </mtr> 
          <mtr> 
           <mtd> 
            <mi>
              i 
            </mi> 
           </mtd> 
          </mtr> 
         </mtable> 
        </mrow> 
        <mo>
          ) 
        </mo> 
       </mrow> 
       <msup> 
        <mrow> 
         <mrow> 
          <mo>
            ( 
          </mo> 
          <mrow> 
           <mn>
             1 
           </mn> 
           <mo>
             − 
           </mo> 
           <msubsup> 
            <mi>
              P 
            </mi> 
            <mrow> 
             <mi>
               b 
             </mi> 
             <mo>
               , 
             </mo> 
             <mi>
               k 
             </mi> 
            </mrow> 
            <mrow> 
             <mi>
               I 
             </mi> 
             <mo>
               / 
             </mo> 
             <mi>
               Q 
             </mi> 
            </mrow> 
           </msubsup> 
          </mrow> 
          <mo>
            ) 
          </mo> 
         </mrow> 
        </mrow> 
        <mi>
          i 
        </mi> 
       </msup> 
       <mo>
         , 
       </mo> 
      </mrow> 
     </math></p>
    <p>where 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          L 
        </mi> 
        <mi>
          p 
        </mi> 
       </msub> 
      </mrow> 
     </math> is the number of paths.</p>
    <p>- For detectors employing interference suppression or decorrelation, performance is modeled using eigenvalues of the covariance matrix, as in equations:</p>
    <p>
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msubsup> 
        <mi>
          P 
        </mi> 
        <mrow> 
         <mi>
           R 
         </mi> 
         <mi>
           a 
         </mi> 
         <mi>
           t 
         </mi> 
         <mi>
           e 
         </mi> 
        </mrow> 
        <mrow> 
         <mi>
           I 
         </mi> 
         <mo>
           / 
         </mo> 
         <mi>
           Q 
         </mi> 
        </mrow> 
       </msubsup> 
       <mo>
         = 
       </mo> 
       <munderover> 
        <mstyle mathsize="140%" displaystyle="true"> 
         <mo>
           ∑ 
         </mo> 
        </mstyle> 
        <mrow> 
         <mi>
           i 
         </mi> 
         <mo>
           = 
         </mo> 
         <mn>
           1 
         </mn> 
        </mrow> 
        <mrow> 
         <msub> 
          <mi>
            L 
          </mi> 
          <mi>
            p 
          </mi> 
         </msub> 
        </mrow> 
       </munderover> 
       <mfrac> 
        <mrow> 
         <msub> 
          <mi>
            β 
          </mi> 
          <mi>
            i 
          </mi> 
         </msub> 
        </mrow> 
        <mn>
          2 
        </mn> 
       </mfrac> 
       <mrow> 
        <mo>
          [ 
        </mo> 
        <mrow> 
         <mfrac> 
          <mn>
            1 
          </mn> 
          <mrow> 
           <msqrt> 
            <mrow> 
             <mn>
               1 
             </mn> 
             <mo>
               + 
             </mo> 
             <mfrac> 
              <mrow> 
               <msub> 
                <mi>
                  N 
                </mi> 
                <mn>
                  0 
                </mn> 
               </msub> 
              </mrow> 
              <mrow> 
               <msub> 
                <mi>
                  λ 
                </mi> 
                <mi>
                  i 
                </mi> 
               </msub> 
              </mrow> 
             </mfrac> 
            </mrow> 
           </msqrt> 
          </mrow> 
         </mfrac> 
        </mrow> 
        <mo>
          ] 
        </mo> 
       </mrow> 
       <mo>
         , 
       </mo> 
      </mrow> 
     </math></p>
    <p>and modulation-specific formulas such as:</p>
    <p>
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msubsup> 
        <mi>
          P 
        </mi> 
        <mrow> 
         <mi>
           R 
         </mi> 
         <mi>
           a 
         </mi> 
         <mi>
           t 
         </mi> 
         <mi>
           e 
         </mi> 
        </mrow> 
        <mrow> 
         <mi>
           I 
         </mi> 
         <mo>
           / 
         </mo> 
         <mi>
           Q 
         </mi> 
         <mo>
           , 
         </mo> 
         <mi>
           M 
         </mi> 
         <mo>
           − 
         </mo> 
         <mtext>
           QAM 
         </mtext> 
        </mrow> 
       </msubsup> 
       <mo>
         ≈ 
       </mo> 
       <mn>
         2 
       </mn> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mrow> 
         <mfrac> 
          <mrow> 
           <msqrt> 
            <mi>
              M 
            </mi> 
           </msqrt> 
           <mo>
             − 
           </mo> 
           <mn>
             1 
           </mn> 
          </mrow> 
          <mrow> 
           <msqrt> 
            <mi>
              M 
            </mi> 
           </msqrt> 
          </mrow> 
         </mfrac> 
        </mrow> 
        <mo>
          ) 
        </mo> 
       </mrow> 
       <munderover> 
        <mstyle mathsize="140%" displaystyle="true"> 
         <mo>
           ∏ 
         </mo> 
        </mstyle> 
        <mrow> 
         <mi>
           i 
         </mi> 
         <mo>
           = 
         </mo> 
         <mn>
           1 
         </mn> 
        </mrow> 
        <mi>
          L 
        </mi> 
       </munderover> 
       <mfrac> 
        <mn>
          1 
        </mn> 
        <mrow> 
         <mn>
           2 
         </mn> 
         <msub> 
          <mi>
            γ 
          </mi> 
          <mi>
            i 
          </mi> 
         </msub> 
        </mrow> 
       </mfrac> 
       <mo>
         . 
       </mo> 
      </mrow> 
     </math></p>
    <p>Metrics at this layer quantify overall network performance, balancing reliability and efficiency.</p>
    <p>
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         P 
       </mi> 
       <mi>
         E 
       </mi> 
       <msub> 
        <mi>
          R 
        </mi> 
        <mi>
          k 
        </mi> 
       </msub> 
       <mo>
         = 
       </mo> 
       <mn>
         1 
       </mn> 
       <mo>
         − 
       </mo> 
       <msup> 
        <mrow> 
         <mrow> 
          <mo>
            ( 
          </mo> 
          <mrow> 
           <mn>
             1 
           </mn> 
           <mo>
             − 
           </mo> 
           <mi>
             B 
           </mi> 
           <mi>
             E 
           </mi> 
           <msub> 
            <mi>
              R 
            </mi> 
            <mi>
              k 
            </mi> 
           </msub> 
          </mrow> 
          <mo>
            ) 
          </mo> 
         </mrow> 
        </mrow> 
        <mrow> 
         <msub> 
          <mi>
            N 
          </mi> 
          <mi>
            b 
          </mi> 
         </msub> 
        </mrow> 
       </msup> 
       <mo>
         , 
       </mo> 
      </mrow> 
     </math></p>
    <p>where 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          N 
        </mi> 
        <mi>
          b 
        </mi> 
       </msub> 
      </mrow> 
     </math> is the number of bits in a packet.</p>
    <p>
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         G 
       </mi> 
       <mi>
         o 
       </mi> 
       <mi>
         o 
       </mi> 
       <mi>
         d 
       </mi> 
       <mi>
         p 
       </mi> 
       <mi>
         u 
       </mi> 
       <mi>
         t 
       </mi> 
       <mo>
         = 
       </mo> 
       <munderover> 
        <mstyle mathsize="140%" displaystyle="true"> 
         <mo>
           ∑ 
         </mo> 
        </mstyle> 
        <mrow> 
         <mi>
           k 
         </mi> 
         <mo>
           = 
         </mo> 
         <mn>
           1 
         </mn> 
        </mrow> 
        <mrow> 
         <msub> 
          <mi>
            N 
          </mi> 
          <mrow> 
           <mtext>
             user 
           </mtext> 
          </mrow> 
         </msub> 
        </mrow> 
       </munderover> 
       <mfrac> 
        <mrow> 
         <msub> 
          <mi>
            N 
          </mi> 
          <mrow> 
           <mtext>
             packets 
           </mtext> 
           <mo>
             , 
           </mo> 
           <mi>
             k 
           </mi> 
          </mrow> 
         </msub> 
         <mo>
           − 
         </mo> 
         <msub> 
          <mrow> 
           <mtext>
             Loss 
           </mtext> 
          </mrow> 
          <mi>
            k 
          </mi> 
         </msub> 
        </mrow> 
        <mrow> 
         <msub> 
          <mi>
            t 
          </mi> 
          <mi>
            k 
          </mi> 
         </msub> 
        </mrow> 
       </mfrac> 
       <mo>
         . 
       </mo> 
      </mrow> 
     </math></p>
    <p>
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         D 
       </mi> 
       <mi>
         e 
       </mi> 
       <mi>
         l 
       </mi> 
       <mi>
         a 
       </mi> 
       <mi>
         y 
       </mi> 
       <mo>
         = 
       </mo> 
       <mfrac> 
        <mn>
          1 
        </mn> 
        <mi>
          N 
        </mi> 
       </mfrac> 
       <munderover> 
        <mstyle mathsize="140%" displaystyle="true"> 
         <mo>
           ∑ 
         </mo> 
        </mstyle> 
        <mrow> 
         <mi>
           k 
         </mi> 
         <mo>
           = 
         </mo> 
         <mn>
           1 
         </mn> 
        </mrow> 
        <mrow> 
         <msub> 
          <mi>
            N 
          </mi> 
          <mrow> 
           <mtext>
             user 
           </mtext> 
          </mrow> 
         </msub> 
        </mrow> 
       </munderover> 
       <munderover> 
        <mstyle mathsize="140%" displaystyle="true"> 
         <mo>
           ∑ 
         </mo> 
        </mstyle> 
        <mrow> 
         <msub> 
          <mi>
            l 
          </mi> 
          <mrow> 
           <mtext>
             slot 
           </mtext> 
          </mrow> 
         </msub> 
         <mo>
           = 
         </mo> 
         <mn>
           1 
         </mn> 
        </mrow> 
        <mrow> 
         <msub> 
          <mi>
            N 
          </mi> 
          <mrow> 
           <mtext>
             slot 
           </mtext> 
          </mrow> 
         </msub> 
        </mrow> 
       </munderover> 
       <mtext>
           
       </mtext> 
       <mi>
         δ 
       </mi> 
       <msub> 
        <mi>
          l 
        </mi> 
        <mrow> 
         <msub> 
          <mi>
            l 
          </mi> 
          <mrow> 
           <mtext>
             slot 
           </mtext> 
          </mrow> 
         </msub> 
        </mrow> 
       </msub> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mrow> 
         <msub> 
          <mi>
            L 
          </mi> 
          <mrow> 
           <mi>
             i 
           </mi> 
           <mo>
             , 
           </mo> 
           <mi>
             c 
           </mi> 
          </mrow> 
         </msub> 
         <mi>
           P 
         </mi> 
         <mi>
           E 
         </mi> 
         <msubsup> 
          <mi>
            R 
          </mi> 
          <mrow> 
           <mi>
             i 
           </mi> 
           <mo>
             , 
           </mo> 
           <mi>
             c 
           </mi> 
          </mrow> 
          <mrow> 
           <msub> 
            <mi>
              l 
            </mi> 
            <mrow> 
             <mtext>
               slot 
             </mtext> 
            </mrow> 
           </msub> 
          </mrow> 
         </msubsup> 
        </mrow> 
        <mo>
          ) 
        </mo> 
       </mrow> 
       <mo>
         , 
       </mo> 
      </mrow> 
     </math></p>
    <p>Its analysis is beyond the scope of this study.</p>
    <p>Simulations are performed under various conditions to mimic real-world scenarios, including:</p>
    <p>This methodology provides a comprehensive framework for evaluating VANET performance across diverse and challenging operational conditions.</p>
   </sec>
   <sec id="s4_2">
    <title>4.2. Simulation Scenarios</title>
    <p>To evaluate the performance and scalability of the proposed framework, simula-tions were designed to reflect real-world Vehicular Ad Hoc Network (VANET) conditions while assessing network behavior under varying user loads and mobility patterns. The scenarios are detailed below:</p>
    <p>1) Fixed-to-Mobile Scenario:</p>
    <p>- This scenario models a fixed infrastructure communicating with mobile nodes, replicating typical urban and highway environments.</p>
    <p>- Transmitter speeds of 20 m/s, 30 m/s and 50 m/s (corresponding to 72 km/h, 108 km/h and 180 km/h, respectively) were used to represent diverse mobility patterns. These speeds are indicative of realistic vehicular movement in urban and high-speed freeway settings.</p>
    <p>2) Mobile-to-Mobile Scenario:</p>
    <p>- In this scenario, both the transmitter and receiver are mobile, simulating direct vehicle-to-vehicle (V2V) communication.</p>
    <p>- Relative mobility indices 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          v 
        </mi> 
        <mn>
          1 
        </mn> 
       </msub> 
      </mrow> 
     </math>, 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          v 
        </mi> 
        <mn>
          2 
        </mn> 
       </msub> 
      </mrow> 
     </math> and 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          v 
        </mi> 
        <mn>
          3 
        </mn> 
       </msub> 
      </mrow> 
     </math> were considered, where these indices represent various relative velocities between the communicating nodes. These settings allow for the study of link stability under dynamic movement conditions.</p>
    <p>The simulations were conducted with 15 superframes (150 frames), progressively increasing the number of users from 32 to 256. This variation in network density allows for the evaluation of scalability and load-handling capacity under diverse conditions.</p>
    <p>The load at the central node was assessed using the following formulas, illustrating the impact of multi-rate and single-rate systems on network performance:</p>
    <p>
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msup> 
        <mrow> 
         <mtext>
           Load 
         </mtext> 
        </mrow> 
        <mrow> 
         <mi>
           A 
         </mi> 
         <mi>
           P 
         </mi> 
         <mi>
           G 
         </mi> 
        </mrow> 
       </msup> 
       <mo>
         = 
       </mo> 
       <munderover> 
        <mstyle mathsize="140%" displaystyle="true"> 
         <mo>
           ∑ 
         </mo> 
        </mstyle> 
        <mrow> 
         <mi>
           i 
         </mi> 
         <mo>
           = 
         </mo> 
         <mn>
           1 
         </mn> 
        </mrow> 
        <mi>
          K 
        </mi> 
       </munderover> 
       <mfrac> 
        <mn>
          1 
        </mn> 
        <mrow> 
         <msub> 
          <mi>
            G 
          </mi> 
          <mi>
            t 
          </mi> 
         </msub> 
        </mrow> 
       </mfrac> 
       <mo>
         , 
       </mo> 
       <mtext>
           
       </mtext> 
       <msup> 
        <mrow> 
         <mtext>
           Load 
         </mtext> 
        </mrow> 
        <mrow> 
         <mi>
           M 
         </mi> 
         <mi>
           C 
         </mi> 
        </mrow> 
       </msup> 
       <mo>
         = 
       </mo> 
       <munderover> 
        <mstyle mathsize="140%" displaystyle="true"> 
         <mo>
           ∑ 
         </mo> 
        </mstyle> 
        <mrow> 
         <mi>
           i 
         </mi> 
         <mo>
           = 
         </mo> 
         <mn>
           1 
         </mn> 
        </mrow> 
        <mi>
          K 
        </mi> 
       </munderover> 
       <mfrac> 
        <mrow> 
         <msub> 
          <mi>
            N 
          </mi> 
          <mrow> 
           <msub> 
            <mrow> 
             <mtext>
               code 
             </mtext> 
            </mrow> 
            <mi>
              i 
            </mi> 
           </msub> 
          </mrow> 
         </msub> 
        </mrow> 
        <mrow> 
         <msub> 
          <mi>
            G 
          </mi> 
          <mn>
            0 
          </mn> 
         </msub> 
        </mrow> 
       </mfrac> 
       <mo>
         , 
       </mo> 
       <mtext>
           
       </mtext> 
       <msup> 
        <mrow> 
         <mtext>
           Load 
         </mtext> 
        </mrow> 
        <mrow> 
         <mi>
           M 
         </mi> 
         <mi>
           M 
         </mi> 
        </mrow> 
       </msup> 
       <mo>
         = 
       </mo> 
       <munderover> 
        <mstyle mathsize="140%" displaystyle="true"> 
         <mo>
           ∑ 
         </mo> 
        </mstyle> 
        <mrow> 
         <mi>
           i 
         </mi> 
         <mo>
           = 
         </mo> 
         <mn>
           1 
         </mn> 
        </mrow> 
        <mi>
          K 
        </mi> 
       </munderover> 
       <mfrac> 
        <mrow> 
         <msub> 
          <mrow> 
           <mtext>
             log 
           </mtext> 
          </mrow> 
          <mn>
            2 
          </mn> 
         </msub> 
         <mrow> 
          <mo>
            ( 
          </mo> 
          <mrow> 
           <msub> 
            <mi>
              M 
            </mi> 
            <mi>
              i 
            </mi> 
           </msub> 
          </mrow> 
          <mo>
            ) 
          </mo> 
         </mrow> 
        </mrow> 
        <mrow> 
         <msub> 
          <mi>
            G 
          </mi> 
          <mn>
            0 
          </mn> 
         </msub> 
        </mrow> 
       </mfrac> 
       <mo>
         , 
       </mo> 
      </mrow> 
     </math>(1)</p>
    <p>where:</p>
    <p>This comprehensive simulation setup provides valuable insights into the behavior and scalability of VANETs under realistic and diverse operational scenarios.</p>
   </sec>
   <sec id="s4_3">
    <title>4.3. Key Observations and Results</title>
    <p>1) Impact of transmission parameters:</p>
    <p>- Users with high spreading factors, a large number of parallel codes, or large constellation sizes contribute significantly to receiver load.</p>
    <p>- Rate adaptation generates load variability, changing performance at the data slot level.</p>
    <p>2) Performance of reception methods:</p>
    <p>- The simulated methods include matched filter, successive interference suppression and decorrelation.</p>
    <p>- The results show that the SINR maximization method is optimal to minimize the BER and maximize the useful throughput.</p>
    <p>3) Transmission without guarantee of quality of service:</p>
    <p>- The results of the simulations, although carried out on high user loads, converge towards similar conclusions.</p>
    <p>- Longer simulations would increase complexity without providing significant improvements to the results.</p>
   </sec>
   <sec id="s4_4">
    <title>4.4. Simulation Results</title>
    <p>This section presents the performance evaluation of the enhanced Multi-User Detection MAC (MUD-MAC) protocol, incorporating the conceptual framework, compared to the baseline protocols. The baseline includes the basic MUD-MAC protocol (without prediction) and two additional cases where the cross-layer framework with channel prediction and estimation algorithms is implemented. Monte Carlo simulations were used to assess performance under varying transmission conditions and user mobility.</p>
    <p>The superiority of the basic MUD-MAC protocol over the matched filter receiver, parallel multi-channel protocol and IEEE 802.11 protocol has been established in prior work <xref ref-type="bibr" rid="scirp.140264-17">
      [17]
     </xref>. However, limited studies exist on complete multi-user detection protocols, requiring further comparison. This study evaluates the impact of the proposed conceptual framework on throughput and error rates, aiming to make the protocol more operational.</p>
    <p>Key aspects of the evaluation include:</p>
    <p>
     <xref ref-type="table" rid="table5">
      Table 5
     </xref> outlines the parameters used in the simulations, including bandwidth, transmitter power, code lengths and rates for different transmission techniques. Notable parameters include:</p>
    <table-wrap id="table5">
     <label>
      <xref ref-type="table" rid="table5">
       Table 5
      </xref></label>
     <caption>
      <title>
       <xref ref-type="bibr" rid="scirp.140264-"></xref>Table 5. Parameters used in the simulation.</title>
     </caption>
     <table class="MsoTableGrid custom-table" border="0" cellspacing="0" cellpadding="0"> 
      <tr> 
       <td class="custom-bottom-td aleft" width="22.61%"><p style="text-align:left">Parameter</p></td> 
       <td class="custom-bottom-td aleft" width="22.61%"><p style="text-align:left">Value</p></td> 
      </tr> 
      <tr> 
       <td class="custom-top-td aleft" width="22.61%"><p style="text-align:left">Signal bandwidth</p></td> 
       <td class="custom-top-td aleft" width="22.61%"><p style="text-align:left">2.25 MHz</p></td> 
      </tr> 
      <tr> 
       <td class="aleft" width="22.61%"><p style="text-align:left">Transmitter threshold signal-to-noise ratio</p></td> 
       <td class="aleft" width="22.61%"><p style="text-align:left">20, 25 dB</p></td> 
      </tr> 
      <tr> 
       <td class="aleft" width="22.61%"><p style="text-align:left">Average transmitter power</p></td> 
       <td class="aleft" width="22.61%"><p style="text-align:left">0.1, 0.63 mW</p></td> 
      </tr> 
      <tr> 
       <td class="aleft" width="22.61%"><p style="text-align:left">Code lengths (multi-factor transmission)</p></td> 
       <td class="aleft" width="22.61%"><p style="text-align:left">[2, 4, 16, 32, 64, 128, 256, 512]</p></td> 
      </tr> 
      <tr> 
       <td class="aleft" width="22.61%"><p style="text-align:left">Carrier frequency</p></td> 
       <td class="aleft" width="22.61%"><p style="text-align:left">2.4 GHz</p></td> 
      </tr> 
      <tr> 
       <td class="aleft" width="22.61%"><p style="text-align:left">Channel sampling frequency</p></td> 
       <td class="aleft" width="22.61%"><p style="text-align:left">10<sup>6</sup> Hz</p></td> 
      </tr> 
     </table>
    </table-wrap>
    <p>A detailed summary of the simulated channels and their respective link parame-ters is presented in <xref ref-type="table" rid="table5">
      Table 5
     </xref> focusing on multipath channels and fixed-to-mobile conditions.</p>
    <p>The performance was evaluated by varying the data slot length from 1 to 8 ms and measuring:</p>
    <p>1) Average Reception Rate: The percentage of successfully received packets.</p>
    <p>2) Aggregate Useful Throughput: The total useful data received per unit time.</p>
    <p>These metrics were analyzed under three conditions for channel information acquisition:</p>
   </sec>
   <sec id="s4_5">
    <title>4.5. Results and Analysis</title>
    <p>This section evaluates the performance of the proposed framework through a comprehensive analysis of simulation results under varying user densities and mobility speeds. The results provide critical insights into the interplay between interference, mobility, and network performance, highlighting the advantages of integrating channel prediction algorithms with the MUD-MAC protocol.</p>
    <p>Simulations were conducted under fixed-to-mobile multipath channels with a 25 MHz bandwidth. <xref ref-type="fig" rid="figFigures 4">
      Figures 4
     </xref>-<xref ref-type="bibr" rid="scirp.140264-#f9">
      9
     </xref> illustrate the reception rate and aggregate useful throughput for varying user densities at mobility speeds of 20 m/s, 35 m/s and 50 m/s. Key observations include:</p>
    <fig id="fig4" position="float">
     <label>Figure 4</label>
     <caption>
      <title>Figure 4. Reception rate as a function of the number of connected users, fixed-to-mobile multipath channel 

       <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
         <mi>
          
   v
  
         </mi>
  
         <mo>
          
   =
  
         </mo>
  
         <mn>
          
   20
  
         </mn>
 
        </mrow>

       </math> m/s.</title>
     </caption>
     <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/8104675-rId66.jpeg?20250126040634" />
    </fig>
    <fig id="fig5" position="float">
     <label>Figure 5</label>
     <caption>
      <title>Figure 5. Aggregate useful throughput as a function of the number of connected users, fixed-to-mobile multipath channel 

       <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
         <mi>
          
   v
  
         </mi>
  
         <mo>
          
   =
  
         </mo>
  
         <mn>
          
   20
  
         </mn>
 
        </mrow>

       </math> m/s.</title>
     </caption>
     <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/8104675-rId69.jpeg?20250126040635" />
    </fig>
    <fig id="fig6" position="float">
     <label>Figure 6</label>
     <caption>
      <title>Figure 6. Reception rate as a function of the number of connected users, fixed-to-mobile multipath channel 

       <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
         <mi>
          
   v
  
         </mi>
  
         <mo>
          
   =
  
         </mo>
  
         <mn>
          
   35
  
         </mn>
 
        </mrow>

       </math> m/s.</title>
     </caption>
     <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/8104675-rId72.jpeg?20250126040635" />
    </fig>
    <fig id="fig7" position="float">
     <label>Figure 7</label>
     <caption>
      <title>Figure 7. Aggregated useful throughput as a function of the number of connected users, fixed-to-mobile multipath channel 

       <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
         <mi>
          
   v
  
         </mi>
  
         <mo>
          
   =
  
         </mo>
  
         <mn>
          
   35
  
         </mn>
 
        </mrow>

       </math> m/s.</title>
     </caption>
     <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/8104675-rId75.jpeg?20250126040634" />
    </fig>
    <fig id="fig8" position="float">
     <label>Figure 8</label>
     <caption>
      <title>Figure 8. Packet reception rate as a function of the number of connected users in a fixed-to-mobile multipath channel with 

       <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
         <mi>
          
   v
  
         </mi>
  
         <mo>
          
   =
  
         </mo>
  
         <mn>
          
   50
  
         </mn>
 
        </mrow>

       </math> m/s.</title>
     </caption>
     <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/8104675-rId78.jpeg?20250126040635" />
    </fig>
    <fig id="fig9" position="float">
     <label>Figure 9</label>
     <caption>
      <title>Figure 9. Aggregate useful throughput as a function of the number of connected users, fixed-to-mobile multipath channel at 

       <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
         <mi>
          
   v
  
         </mi>
  
         <mo>
          
   =
  
         </mo>
  
         <mn>
          
   50
  
         </mn>
 
        </mrow>

       </math> m/s.</title>
     </caption>
     <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/8104675-rId81.jpeg?20250126040635" />
    </fig>
    <p>The results highlight the benefits of integrating the conceptual framework with the MUD-MAC protocol, particularly in dynamic environments with varying user densities and mobility speeds. The use of channel prediction algorithms significantly enhances both reception rates and aggregate throughput, demonstrating the operational viability of the enhanced protocol.</p>
   </sec>
  </sec><sec id="s5">
   <title>5. Conclusions</title>
   <p>This study investigated the performance of vehicular ad hoc networks (VANETs) under varying interference and mobility conditions, focusing on the interplay between node mobility, interference intensity and transmission quality. A cross-layer conceptual framework based on channel prediction was proposed, aiming to optimize network resource management in environments characterized by high mobility and significant interference. Detailed simulations revealed critical insights into the limitations and trade-offs of multi-code and multi-modulation schemes in multipath channels, particularly in the presence of complex diversity receivers.</p>
   <p>The results underscore that while receiver diversity is essential for mitigating interference effects, it may also lead to performance degradation under extreme conditions. The proposed framework demonstrated its potential by dynamically managing network resources through channel prediction and meeting Quality of Service (QoS) requirements, offering a robust solution for optimizing VANET performance in complex operational scenarios.</p>
   <sec id="s5_1">
    <title>5.1. Broader Impact</title>
    <p>The proposed framework has significant implications for advancing VANET technology, particularly in applications such as autonomous vehicle communication, intelligent transportation systems and emergency response networks. By addressing the challenges posed by high mobility and intense interference, this approach enhances the reliability and efficiency of vehicular communications, paving the way for safer and more efficient transportation systems.</p>
   </sec>
   <sec id="s5_2">
    <title>5.2. Applications and Implementation Scenarios</title>
    <p>The framework can be implemented in a variety of real-world scenarios, including:</p>
   </sec>
   <sec id="s5_3">
    <title>5.3. Future Directions</title>
    <p>To address the identified limitations and further enhance the framework, the following actionable next steps are proposed:</p>
    <p>To conclude, this research contributes a robust foundation for optimizing VANET systems in challenging scenarios, highlighting the potential for further advancements in vehicular communication technologies to support safer and more efficient mobility in both urban and rural contexts.</p>
   </sec>
  </sec>
 </body><back>
  <ref-list>
   <title>References</title>
   <ref id="scirp.140264-ref1">
    <label>1</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Yousefi, S., Mousavi, M. and Fathy, M. (2006) Vehicular Ad Hoc Networks (VANETs): Challenges and Perspectives. 2006 6th International Conference on ITS Telecommunications, Chengdu, 21-23 June 2006, 761-766. &gt;https://doi.org/10.1109/itst.2006.289012
    </mixed-citation>
   </ref>
   <ref id="scirp.140264-ref2">
    <label>2</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Hui, A.L.C. and Letaief, K.B. (1998) Successive Interference Cancellation for Multiuser Asynchronous DS/CDMA Detectors in Multipath Fading Links. IEEE Transactions on Communications, 46, 384-391. &gt;https://doi.org/10.1109/26.662644
    </mixed-citation>
   </ref>
   <ref id="scirp.140264-ref3">
    <label>3</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Tse, D.N.C. and Hanly, S.V. (1999) Linear Multiuser Receivers: Effective Interference, Effective Bandwidth and User Capacity. IEEE Transactions on Information Theory, 45, 641-657. &gt;https://doi.org/10.1109/18.749008
    </mixed-citation>
   </ref>
   <ref id="scirp.140264-ref4">
    <label>4</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Zhou, L., Zheng, B., Geller, B., Wei, A., Xu, S. and Li, Y. (2008) Cross-Layer Rate Control, Medium Access Control and Routing Design in Cooperative VANET. Computer Communications, 31, 2870-2882. &gt;https://doi.org/10.1016/j.comcom.2007.12.006
    </mixed-citation>
   </ref>
   <ref id="scirp.140264-ref5">
    <label>5</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Setton, E., Yoo, T., Zhu, X.Q., Goldsmith, A. and Girod, B. (2005) Cross-Layer Design of Ad Hoc Networks for Real-Time Video Streaming. IEEE Wireless Communications, 12, 59-65. &gt;https://doi.org/10.1109/mwc.2005.1497859
    </mixed-citation>
   </ref>
   <ref id="scirp.140264-ref6">
    <label>6</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Tse, D.N.C. and Hanly, S.V. (1999) Linear Multiuser Receivers: Effective Interference, Effective Bandwidth and User Capacity. IEEE Transactions on Information Theory, 45, 641-657. 
    </mixed-citation>
   </ref>
   <ref id="scirp.140264-ref7">
    <label>7</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Bhoi, S.K. and Khilar, P.M. (2014) Vehicular Communication: A Survey. IET Networks, 3, 204-217. &gt;https://doi.org/10.1049/iet-net.2013.0065
    </mixed-citation>
   </ref>
   <ref id="scirp.140264-ref8">
    <label>8</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Singh, K.D., Rawat, P. and Bonnin, J. (2014) Cognitive Radio for Vehicular Ad Hoc Networks (CR-VANETs): Approaches and Challenges. EURASIP Journal on Wireless Communications and Networking, 2014, Article No. 49. &gt;https://doi.org/10.1186/1687-1499-2014-49
    </mixed-citation>
   </ref>
   <ref id="scirp.140264-ref9">
    <label>9</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Wang, L., Iida, R. and Wyglinski, A.M. (2019) Vehicular Network Simulation Environment via Discrete Event System Modeling. IEEE Access, 7, 87246-87264. &gt;https://doi.org/10.1109/access.2019.2922766
    </mixed-citation>
   </ref>
   <ref id="scirp.140264-ref10">
    <label>10</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Latva-aho, M. (1998) Bit Error Probability Analysis for FRAMES WCDMA Downlink Receivers. IEEE Transactions on Vehicular Technology, 47, 1119-1133. &gt;https://doi.org/10.1109/25.728482
    </mixed-citation>
   </ref>
   <ref id="scirp.140264-ref11">
    <label>11</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Dharsandiya, A.N. and Patel, R.M. (2016) A Review on MAC Protocols of Vehicular Ad Hoc Networks. 2016 International Conference on Wireless Communications, Signal Processing and Networking (WiSPNET), Chennai, 23-25 March 2016, 1040-1045. &gt;https://doi.org/10.1109/wispnet.2016.7566295
    </mixed-citation>
   </ref>
   <ref id="scirp.140264-ref12">
    <label>12</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Omar, H.A. and Zhuang, W.H. (2014) Time Division Multiple Access for Vehicular Communications. Springer. &gt;https://doi.org/10.1007/978-3-319-09504-2
    </mixed-citation>
   </ref>
   <ref id="scirp.140264-ref13">
    <label>13</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Huang, W., Ding, L., Meng, D., Hwang, J., Xu, Y. and Zhang, W. (2018) QOE-Based Resource Allocation for Heterogeneous Multi-Radio Communication in Software-Defined Vehicle Networks. IEEE Access, 6, 3387-3399. &gt;https://doi.org/10.1109/access.2018.2800036
    </mixed-citation>
   </ref>
   <ref id="scirp.140264-ref14">
    <label>14</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Chrysostomou, C., Djouvas, C. and Lambrinos, L. (2011) Applying Adaptive QoS-Aware Medium Access Control in Priority-Based Vehicular Ad Hoc Networks. 2011 IEEE Symposium on Computers and Communications (ISCC), Kerkyra, 28 June-1 July 2011, 741-747. &gt;https://doi.org/10.1109/iscc.2011.5983928
    </mixed-citation>
   </ref>
   <ref id="scirp.140264-ref15">
    <label>15</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Hossain, M.A., Noor, R.M., Yau, K.A., Azzuhri, S.R., Z'aba, M.R. and Ahmedy, I. (2020) Comprehensive Survey of Machine Learning Approaches in Cognitive Radio-Based Vehicular Ad Hoc Networks. IEEE Access, 8, 78054-78108. &gt;https://doi.org/10.1109/access.2020.2989870
    </mixed-citation>
   </ref>
   <ref id="scirp.140264-ref16">
    <label>16</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Ottosson, T. and Svensson, A. (1995) Multi-Rate Performance in DS/CDMA Systems. CiteSeerX.
    </mixed-citation>
   </ref>
   <ref id="scirp.140264-ref17">
    <label>17</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Zhang, J.F., Dziong, Z., Gagnon, F. and Kadoch, M. (2009) Multiuser Detection Based MAC Design for Ad Hoc Networks. IEEE Transactions on Wireless Communications, 8, 1836-1846. &gt;https://doi.org/10.1109/t-wc.2008.071449
    </mixed-citation>
   </ref>
  </ref-list>
 </back>
</article>