[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
You seem to have javascript disabled. Please note that many of the page functionalities won't work as expected without javascript enabled.
 
 
Sign in to use this feature.

Years

Between: -

Subjects

remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline

Journals

remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline

Article Types

Countries / Regions

remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline

Search Results (1,155)

Search Parameters:
Keywords = ad-hoc network

Order results
Result details
Results per page
Select all
Export citation of selected articles as:
32 pages, 11555 KiB  
Article
Damage Identification Using Measured and Simulated Guided Wave Damage Interaction Coefficients Predicted Ad Hoc by Deep Neural Networks
by Christoph Humer, Simon Höll and Martin Schagerl
Sensors 2025, 25(6), 1681; https://doi.org/10.3390/s25061681 (registering DOI) - 8 Mar 2025
Viewed by 42
Abstract
Thin-walled structures are widely used in aeronautical and aerospace engineering due to their light weight and high structural performance. Ensuring their integrity is crucial for safety and reliability, which is why structural health monitoring (SHM) methods, such as guided wave-based techniques, have been [...] Read more.
Thin-walled structures are widely used in aeronautical and aerospace engineering due to their light weight and high structural performance. Ensuring their integrity is crucial for safety and reliability, which is why structural health monitoring (SHM) methods, such as guided wave-based techniques, have been developed to detect and characterize damage in such components. This study presents a novel damage identification procedure for guided wave-based SHM using deep neural networks (DNNs) trained with experimental data. This technique employs the so-called wave damage interaction coefficients (WDICs) as highly sensitive damage features that describe the unique scattering pattern around possible damage. The DNNs learn intricate relationships between damage characteristics, e.g., size or orientation, and corresponding WDIC patterns from only a limited number of damage cases. An experimental training data set is used, where the WDICs of a selected damage type are extracted from measurements using a scanning laser Doppler vibrometer. Surface-bonded artificial damages are selected herein for demonstration purposes. It is demonstrated that smart DNN interpolations can replicate WDIC patterns even when trained on noisy measurement data, and their generalization capabilities allow for precise predictions for damages with arbitrary properties within the range of trained damage characteristics. These WDIC predictions are readily available, i.e., ad hoc, and can be compared to measurement data from an unknown damage for damage characterization. Furthermore, the fully trained DNN allows for predicting WDICs specifically for the sensing angles requested during inspection. Additionally, an anglewise principal component analysis is proposed to efficiently reduce the feature dimensionality on average by more than 90% while accounting for the angular dependencies of the WDICs. The proposed damage identification methodology is investigated under challenging conditions using experimental data from only three sensors of a damage case not contained in the training data sets. Detailed statistical analyses indicate excellent performance and high recognition accuracy for this experimental data-based approach. This study also analyzes differences between simulated and experimental WDIC patterns. Therefore, an existing DNN trained on simulated data is also employed. The differences between the simulations and experiments affect the identification performance, and the resulting limitations of the simulation-based approach are clearly explained. This highlights the potential of the proposed experimental data-based DNN methodology for practical applications of guided wave-based SHM. Full article
29 pages, 6184 KiB  
Article
MANET Routing Protocols’ Performance Assessment Under Dynamic Network Conditions
by Ibrahim Mohsen Selim, Naglaa Sayed Abdelrehem, Walaa M. Alayed, Hesham M. Elbadawy and Rowayda A. Sadek
Appl. Sci. 2025, 15(6), 2891; https://doi.org/10.3390/app15062891 - 7 Mar 2025
Viewed by 43
Abstract
Mobile Ad Hoc Networks (MANETs) are decentralized wireless networks characterized by dynamic topologies and the absence of fixed infrastructure. These unique features make MANETs critical for applications such as disaster recovery, military operations, and IoT systems. However, they also pose significant challenges for [...] Read more.
Mobile Ad Hoc Networks (MANETs) are decentralized wireless networks characterized by dynamic topologies and the absence of fixed infrastructure. These unique features make MANETs critical for applications such as disaster recovery, military operations, and IoT systems. However, they also pose significant challenges for efficient and effective routing. This study evaluates the performance of eight MANET routing protocols: Optimized Link State Routing (OLSR), Destination-Sequenced Distance Vector (DSDV), Ad Hoc On-Demand Distance Vector (AODV), Dynamic Source Routing (DSR), Ad Hoc On-Demand Multipath Distance Vector (AOMDV), Temporally Ordered Routing Algorithm (TORA), Zone Routing Protocol (ZRP), and Geographic Routing Protocol (GRP). Using a custom simulation environment in OMNeT++ 6.0.1 with INET-4.5.0, the protocols were tested under four scenarios with varying node densities (20, 80, 200, and 500 nodes). The simulations utilized the Random Waypoint Mobility model to mimic dynamic node movement and evaluated key performance metrics, including network load, throughput, delay, energy consumption, jitter, packet loss rate, and packet delivery ratio. The results reveal that proactive protocols like OLSR are ideal for stable, low-density environments, while reactive protocols such as AOMDV and TORA excel in dynamic, high-mobility scenarios. Hybrid protocols, particularly GRP, demonstrate a balanced approach; achieving superior overall performance with up to 30% lower energy consumption and higher packet delivery ratios compared to reactive protocols. These findings provide practical insights into the optimal selection and deployment of MANET routing protocols for diverse applications, emphasizing the potential of hybrid protocols for modern networks like IoT and emergency response systems. Full article
(This article belongs to the Special Issue Applications of Wireless and Mobile Communications)
Show Figures

Figure 1

Figure 1
<p>Network Load across the Four Scenarios.</p>
Full article ">Figure 2
<p>Throughput across the Four Scenarios.</p>
Full article ">Figure 3
<p>Simulation Time across the Four Scenarios.</p>
Full article ">Figure 4
<p>Average Delay across the Four Scenarios.</p>
Full article ">Figure 5
<p>Energy Consumption across the Four Scenarios.</p>
Full article ">Figure 6
<p>Jitter Across the Four Scenarios.</p>
Full article ">Figure 7
<p>Packet Loss Rate across the Four Scenarios.</p>
Full article ">Figure 8
<p>Packet Delivery Ratio across the Four Scenarios.</p>
Full article ">Figure 9
<p>Performance Metrics for All Categories in 20 Mobile Nodes.</p>
Full article ">Figure 10
<p>Performance Metrics for All Categories in 80 Mobile Nodes.</p>
Full article ">Figure 11
<p>Performance Metrics for All Categories in 200 Mobile Nodes.</p>
Full article ">Figure 12
<p>Performance Metrics for All Categories in 500 Mobile Nodes.</p>
Full article ">Figure 13
<p>Performance Metrics for All Categories in 10 Mobile and 10 Fixed Nodes.</p>
Full article ">Figure 14
<p>Performance Metrics for All Categories in 40 Mobile and 40 Fixed Nodes.</p>
Full article ">Figure 15
<p>Performance Metrics for All Categories in 100 Mobile and 100 Fixed Nodes.</p>
Full article ">Figure 16
<p>Performance Metrics for All Categories in 250 Mobile and 250 Fixed Nodes.</p>
Full article ">
23 pages, 1454 KiB  
Article
Slot Allocation Protocol for UAV Swarm Ad Hoc Networks: A Distributed Coalition Formation Game Approach
by Liubin Song and Daoxing Guo
Entropy 2025, 27(3), 256; https://doi.org/10.3390/e27030256 - 28 Feb 2025
Viewed by 252
Abstract
With the rapid development of unmanned aerial vehicle (UAV) manufacturing technology, large-scale UAV swarm ad hoc networks are becoming widely used in military and civilian spheres. UAV swarms equipped with ad hoc networks and satellite networks are being developed for 6G heterogeneous networks, [...] Read more.
With the rapid development of unmanned aerial vehicle (UAV) manufacturing technology, large-scale UAV swarm ad hoc networks are becoming widely used in military and civilian spheres. UAV swarms equipped with ad hoc networks and satellite networks are being developed for 6G heterogeneous networks, especially in offshore and remote areas. A key operational aspect in large-scale UAV swarm networks is slot allocation for large capacity and a low probability of conflict. Traditional methods typically form coalitions among UAVs that are in close spatial proximity to reduce internal network interference, thereby achieving greater throughput. However, significant internal interference still persists. Given that UAV networks are required to transmit a substantial amount of safety-related control information, any packet loss due to internal interference can easily pose potential risks. In this paper, we propose a distributed time coalition formation game algorithm that ensures the absence of internal interference and collisions while sharing time slot resources, thereby enhancing the network’s throughput performance. Instead of forming a coalition from UAVs within a contiguous block area as used in prior studies, UAV nodes with no interference from each other form a coalition that can be called a time coalition. UAVs belonging to one coalition share their transmitting slots with each other, and thus, every UAV node achieves the whole transmitting slots of coalition members. They can transmit data packets simultaneously with no interference. In addition, a distributed coalition formation game-based TDMA (DCFG-TDMA) protocol based on the distributed time coalition formation algorithm is designed for UAV swarm ad hoc networks. Our simulation results verify that the proposed algorithm can significantly improve the UAV throughput compared with that of the conventional TDMA protocol. Full article
(This article belongs to the Special Issue Space-Air-Ground-Sea Integrated Communication Networks)
Show Figures

Figure 1

Figure 1
<p>An illustration of the multi-UAV network, showing the interference of UAV communication slots.</p>
Full article ">Figure 2
<p>An illustration of communication distance and interference distance.</p>
Full article ">Figure 3
<p>FSM of our proposed scheme.</p>
Full article ">Figure 4
<p>Time frame structure.</p>
Full article ">Figure 5
<p>Grid topology involving 100 UAV nodes.</p>
Full article ">Figure 6
<p>The final coalition structure for the 100-UAV-node grid topology.</p>
Full article ">Figure 7
<p>The number of members in each coalition.</p>
Full article ">Figure 8
<p>The utilities of every UAV node.</p>
Full article ">Figure 9
<p>The utilities vs. iteration steps.</p>
Full article ">Figure 10
<p>Convergence speed vs. network size.</p>
Full article ">Figure 11
<p>UAV positions after 1800 s.</p>
Full article ">Figure 12
<p>The utilities of the 5 UAV nodes in a dynamic topology environment.</p>
Full article ">Figure 13
<p>Network throughput in a dynamic topology environment.</p>
Full article ">
24 pages, 1168 KiB  
Article
Adaptive Extended Kalman Prediction-Based SDN-FANET Segmented Hybrid Routing Scheme
by Ke Sun, Mingyong Liu, Chuan Yin and Qian Wang
Sensors 2025, 25(5), 1417; https://doi.org/10.3390/s25051417 - 26 Feb 2025
Viewed by 153
Abstract
Recently, with the advantages of easy deployment, flexibility, diverse functions, and low cost, flying ad hoc network (FANET) has captured great attention for its huge potential in military and civilian applications, whereas the high-speed movement and limited node energy of unmanned aerial vehicles [...] Read more.
Recently, with the advantages of easy deployment, flexibility, diverse functions, and low cost, flying ad hoc network (FANET) has captured great attention for its huge potential in military and civilian applications, whereas the high-speed movement and limited node energy of unmanned aerial vehicles (UAVs) leads to high dynamic topology and high packet loss rate in FANET. Thus, we introduce the software-defined networking (SDN) architecture into FANET and investigate routing scheme in an SDN-FANET to harvest the advantages of SDN centralized control. Firstly, a FANET segmented routing scheme based on the hybrid SDN architecture is proposed, where inter-segment conducts energy-balanced routing and intra-segment adopts three-dimensional (3D) greedy perimeter stateless routing (GPSR). Specifically, we design the specific process of message interaction between SDN controller and UAV nodes to ensure the execution of the inter-segment routing based on energy balance. Further, to reduce the packet loss rate in high-speed motion scenes, an adaptive extended Kalman prediction algorithm is also proposed to track and predict the 3D movement of UAVs. Simulations verify the effectiveness of the proposed routing scheme in terms of end-to-end delay and packet delivery ratio. Full article
(This article belongs to the Section Sensor Networks)
Show Figures

Figure 1

Figure 1
<p>The system model of FANET.</p>
Full article ">Figure 2
<p>SDN-FANET segmented hybrid routing design based on A-EKF.</p>
Full article ">Figure 3
<p>The packet format of Hello.</p>
Full article ">Figure 4
<p>The first round of Hello packet exchange in the SDN-FANET. * indicates the initial state in the neighbor list, i.e., there is no neighbor information yet.</p>
Full article ">Figure 5
<p>The second round of Hello packet exchange in the SDN-FANET. * indicates the initial state in the neighbor list, i.e., there is no neighbor information yet.</p>
Full article ">Figure 6
<p>Data forwarding based on segmented source routing in FANET.</p>
Full article ">Figure 7
<p>The packet format of SDN_request.</p>
Full article ">Figure 8
<p>The packet format of SDN_SR list.</p>
Full article ">Figure 9
<p>The packet format of SDN_data.</p>
Full article ">Figure 10
<p>The packet format of SDN_cancel.</p>
Full article ">Figure 11
<p>The packet format of RREQ.</p>
Full article ">Figure 12
<p>The packet format of RREP.</p>
Full article ">Figure 13
<p>Node layer model of UAV.</p>
Full article ">Figure 14
<p>Node layer model of SDN controller.</p>
Full article ">Figure 15
<p>Route module process in UAV.</p>
Full article ">Figure 16
<p>Route module process in SDN controller.</p>
Full article ">Figure 17
<p>Adaptive extended Kalman prediction for position of UAV node.</p>
Full article ">Figure 18
<p>Adaptive extended Kalman prediction for speed of UAV node.</p>
Full article ">Figure 19
<p>End-to-end delay of different routing schemes (v = 20 m/s).</p>
Full article ">Figure 20
<p>End-to-end delay of the proposed routing scheme at different speeds.</p>
Full article ">Figure 21
<p>Packet delivery ratio of different routing schemes (v = 20 m/s).</p>
Full article ">Figure 22
<p>Packet delivery ratio of the proposed routing scheme at different speed.</p>
Full article ">
21 pages, 11212 KiB  
Article
A Dynamic Shortest Travel Time Path Planning Algorithm with an Overtaking Function Based on VANET
by Chunxiao Li, Changhao Fan, Mu Wang, Jiajun Shen and Jiang Liu
Symmetry 2025, 17(3), 345; https://doi.org/10.3390/sym17030345 - 25 Feb 2025
Viewed by 229
Abstract
With the rapid development of the economy, urban road congestion has become more serious. The travel times for vehicles are becoming more uncontrollable, making it challenging to reach destinations on time. In order to find an optimal route and arrive at the destination [...] Read more.
With the rapid development of the economy, urban road congestion has become more serious. The travel times for vehicles are becoming more uncontrollable, making it challenging to reach destinations on time. In order to find an optimal route and arrive at the destination with the shortest travel time, this paper proposes a dynamic shortest travel time path planning algorithm with an overtaking function (DSTTPP-OF) based on a vehicular ad hoc network (VANET) environment. Considering the uncertainty of driving vehicles, the target vehicle (vehicle for special tasks) is influenced by surrounding vehicles, leading to possible deadlock or congestion situations that extend travel time. Therefore, overtaking planning should be conducted through V2V communication, enabling surrounding vehicles to coordinate with the target vehicle to avoid deadlock and congestion through lane changing and overtaking. In the proposed DSTTPP-OF, vehicles may queue up at intersections, so we take into account the impact of traffic signals. We classify road segments into congested and non-congested sections, calculating travel times for each section separately. Subsequently, in front of each intersection, the improved Dijkstra algorithm is employed to find the shortest travel time path to the destination, and the overtaking function is used to prevent the target vehicle from entering a deadlocked state. The real-time traffic data essential for dynamic path planning were collected through a VANET of symmetrically deployed roadside units (RSUs) along the roadway. Finally, simulations were conducted using the SUMO simulator. Under different traffic flows, the proposed DSTTPP-OF demonstrates good performance; the target vehicle can travel smoothly without significant interruptions and experiences the fewest stops, thanks to the proposed algorithm. Compared to the shortest distance path planning (SDPP) algorithm, the travel time is reduced by approximately 36.9%, and the waiting time is reduced by about 83.2%. Compared to the dynamic minimum time path planning (DMTPP) algorithm, the travel time is reduced by around 18.2%, and the waiting time is reduced by approximately 65.6%. Full article
(This article belongs to the Section Engineering and Materials)
Show Figures

Figure 1

Figure 1
<p>A VANET scenario.</p>
Full article ">Figure 2
<p>VANET-based traffic information transmission.</p>
Full article ">Figure 3
<p>Two different road regions around the intersection.</p>
Full article ">Figure 4
<p>Traffic conditions at the intersection.</p>
Full article ">Figure 5
<p>Dynamic shortest travel time route: (<b>a</b>) Traffic road network. (<b>b</b>) Original travel path. (<b>c</b>) Traffic congestion occurred in <math display="inline"><semantics> <msub> <mi>e</mi> <mn>67</mn> </msub> </semantics></math> and re-planned a new path from point <math display="inline"><semantics> <msub> <mi>n</mi> <mn>6</mn> </msub> </semantics></math>. (<b>d</b>) Traffic congestion occurred in <math display="inline"><semantics> <msub> <mi>e</mi> <mn>1112</mn> </msub> </semantics></math> and re-planned a new path from point <math display="inline"><semantics> <msub> <mi>n</mi> <mn>11</mn> </msub> </semantics></math>.</p>
Full article ">Figure 6
<p>The weighted graph of <a href="#symmetry-17-00345-f005" class="html-fig">Figure 5</a>: (<b>a</b>) is the weighted graph of <a href="#symmetry-17-00345-f005" class="html-fig">Figure 5</a>b; (<b>b</b>) is the weighted graph of <a href="#symmetry-17-00345-f005" class="html-fig">Figure 5</a>c; (<b>c</b>) is the weighted graph of <a href="#symmetry-17-00345-f005" class="html-fig">Figure 5</a>d.</p>
Full article ">Figure 7
<p>The situations regarding the front car, adjacent front car, and adjacent rear car for the target vehicle are as follows: (<b>a</b>) Presence of a front car and an adjacent rear car, with no adjacent front car. (<b>b</b>) Presence of two adjacent front cars, without a front car and adjacent rear car. (<b>c</b>) Presence of a front car and an adjacent front car, with no adjacent rear car.</p>
Full article ">Figure 8
<p>Overtaking process, <math display="inline"><semantics> <msub> <mi>d</mi> <mi>F</mi> </msub> </semantics></math>, <math display="inline"><semantics> <msub> <mi>d</mi> <mrow> <mi>N</mi> <mi>F</mi> </mrow> </msub> </semantics></math>, and <math display="inline"><semantics> <msub> <mi>d</mi> <mrow> <mi>N</mi> <mi>R</mi> </mrow> </msub> </semantics></math> are distances between vehicles, and <math display="inline"><semantics> <mi>α</mi> </semantics></math>, <math display="inline"><semantics> <mi>β</mi> </semantics></math>, and <math display="inline"><semantics> <mi>γ</mi> </semantics></math> are thresholds for distance comparison. (<b>a</b>) <math display="inline"><semantics> <mrow> <msub> <mi>d</mi> <mrow> <mi>N</mi> <mi>F</mi> </mrow> </msub> <mo>&gt;</mo> <msub> <mi>d</mi> <mi>F</mi> </msub> </mrow> </semantics></math>, <math display="inline"><semantics> <mrow> <msub> <mi>d</mi> <mi>F</mi> </msub> <mo>&lt;</mo> <mi>α</mi> </mrow> </semantics></math> and <math display="inline"><semantics> <mrow> <msub> <mi>d</mi> <mrow> <mi>N</mi> <mi>F</mi> </mrow> </msub> <mo>&lt;</mo> <mi>β</mi> </mrow> </semantics></math>, the target vehicle (red vehicle) is trapped by the front car and adjacent front car and prepares to overtake. (<b>b</b>) <math display="inline"><semantics> <mrow> <msub> <mi>d</mi> <mrow> <mi>N</mi> <mi>R</mi> </mrow> </msub> <mo>&gt;</mo> <mi>γ</mi> </mrow> </semantics></math>, the red vehicle can safely change to lane 2. (<b>c</b>) <math display="inline"><semantics> <mrow> <msub> <mi>d</mi> <mi>F</mi> </msub> <mo>&gt;</mo> <mi>α</mi> </mrow> </semantics></math>, the red vehicle continues to follow the front car. (<b>d</b>) <math display="inline"><semantics> <mrow> <msub> <mi>d</mi> <mi>F</mi> </msub> <mo>≤</mo> <mi>α</mi> </mrow> </semantics></math> and <math display="inline"><semantics> <mrow> <msub> <mi>d</mi> <mrow> <mi>N</mi> <mi>R</mi> </mrow> </msub> <mo>≤</mo> <mi>γ</mi> </mrow> </semantics></math>, the red vehicle prepares to overtake. (<b>e</b>) <math display="inline"><semantics> <mrow> <msub> <mi>d</mi> <mrow> <mi>N</mi> <mi>R</mi> </mrow> </msub> <mo>&gt;</mo> <mi>γ</mi> </mrow> </semantics></math>, the red vehicle can safely change to lane 1. (<b>f</b>) The red vehicle drives normally.</p>
Full article ">Figure 9
<p>Simulation road network.</p>
Full article ">Figure 10
<p>Signal phases.</p>
Full article ">Figure 11
<p>Travel times under different traffic flows.</p>
Full article ">Figure 12
<p>Waiting time under different traffic flows.</p>
Full article ">Figure 13
<p>Actual driving time under different traffic flows.</p>
Full article ">Figure 14
<p>Driving distance.</p>
Full article ">Figure 15
<p>Speed of the target vehicle under different algorithms. (<b>a</b>) The shortest distance path planning algorithm. (<b>b</b>) Dynamic minimum time path planning algorithm. (<b>c</b>) The proposed path planning algorithm. (<b>d</b>) The average speed of the three algorithms.</p>
Full article ">Figure 16
<p>Number of stops under different traffic flows.</p>
Full article ">
22 pages, 2122 KiB  
Article
VehiCast: Real-Time Highway Traffic Incident Forecasting System Using Federated Learning and Vehicular Ad Hoc Network
by Hani Alnami and Muhammad Mohzary
Electronics 2025, 14(5), 900; https://doi.org/10.3390/electronics14050900 - 25 Feb 2025
Viewed by 209
Abstract
Road safety is a critical concern, as accidents happen globally. Despite efforts to enhance roads and enforce stricter driving rules, the number of accidents remains high. These issues arise from distracted driving, speeding, and driving under the influence. In the United States, fatal [...] Read more.
Road safety is a critical concern, as accidents happen globally. Despite efforts to enhance roads and enforce stricter driving rules, the number of accidents remains high. These issues arise from distracted driving, speeding, and driving under the influence. In the United States, fatal accidents increased by 16% from 2018 to 2022. The number of deaths rose from 36,835 in 2018 to 42,795 in 2022. This trend reveals a critical need for new solutions to reduce traffic incidents and improve road safety. Machine learning (ML) can help make roads safer and reduce traffic-related deaths. This paper presents an ML-based real-time highway traffic incident forecasting system named “VehiCast”. VehiCast utilizes vehicular ad hoc networks (VANETs) and federated learning (FL) to collect real-time traffic data, such as average delay, average speed, and the total number of vehicles across several highway zones, to enhance traffic incident prediction accuracy in real-time. Our extensive experimental results showcase that VehiCast reaches an impressive prediction accuracy of 91%, highlighting the power of innovation and determination. Full article
Show Figures

Figure 1

Figure 1
<p>An overview of VehiCast real-time highway traffic incident forecasting system using federated learning (FL) and vehicular ad hoc network (VANET).</p>
Full article ">Figure 2
<p>Proposed VehiCast system architecture and workflow.</p>
Full article ">Figure 3
<p>The proportional breakdown of injuries that occurred in 2014 and 2015.</p>
Full article ">Figure 4
<p>Florida’s distribution of accidents across cities in Florida’s I-95 highway.</p>
Full article ">Figure 5
<p>The distribution of weather conditions at the time of accidents.</p>
Full article ">Figure 6
<p>Distribution of Average Delay.</p>
Full article ">Figure 7
<p>Distribution of Average Travel Time.</p>
Full article ">Figure 8
<p>Distribution of Total Volume.</p>
Full article ">Figure 9
<p>Distribution of Average Occupancy.</p>
Full article ">Figure 10
<p>Distribution of Average Speed.</p>
Full article ">Figure 11
<p>Relationship between input variables and Average Speed: (<b>a</b>) relationship between Average Delay and Average Speed, (<b>b</b>) relationship between Average Travel Time (TVT) and Average Speed, (<b>c</b>) relationship between Total Volume and Average Speed, and (<b>d</b>) relationship between Average Occupancy and Average Speed.</p>
Full article ">Figure 12
<p>VehiCast deep learning model architecture.</p>
Full article ">Figure 13
<p>Performance metrics across federated learning rounds.</p>
Full article ">Figure 14
<p>Loss across federated learning rounds.</p>
Full article ">
26 pages, 18654 KiB  
Article
A Study of MANET Routing Protocols in Heterogeneous Networks: A Review and Performance Comparison
by Nurul I. Sarkar and Md Jahan Ali
Electronics 2025, 14(5), 872; https://doi.org/10.3390/electronics14050872 - 23 Feb 2025
Viewed by 327
Abstract
Mobile ad hoc networks (MANETs) are becoming a popular networking technology as they can easily be set up and provide communication support on the go. These networks can be used in application areas, such as battlefields and disaster relief operations, where infrastructure networks [...] Read more.
Mobile ad hoc networks (MANETs) are becoming a popular networking technology as they can easily be set up and provide communication support on the go. These networks can be used in application areas, such as battlefields and disaster relief operations, where infrastructure networks are not available. Like media access control protocols, MANET routing protocols can also play an important role in determining network capacity and system performance. Research on the impact of heterogeneous nodes in terms of MANET performance is required for proper deployment of such systems. While MANET routing protocols have been studied and reported extensively in the networking literature, the performance of heterogeneous nodes/devices in terms of system performance has not been fully explored yet. The main objective of this paper is to review and compare the performance of four selected MANET routing protocols (AODV, OLSR, BATMAN and DYMO) in a heterogeneous MANET setting. We consider three different types of nodes in the MANET routing performance study, namely PDAs (fixed nodes with no mobility), laptops (low-mobility nodes) and mobile phones (high-mobility nodes). We measure the QoS metrics, such as the end-to-end delays, throughput, and packet delivery ratios, using the OMNeT++-network simulator. The findings reported in this paper provide some insights into MANET routing performance issues and challenges that can help network researchers and engineers to contribute further toward developing next-generation wireless networks capable of operating under heterogeneous networking constraints. Full article
(This article belongs to the Special Issue Multimedia in Radio Communication and Teleinformatics)
Show Figures

Figure 1

Figure 1
<p>Classification of MANET routing protocols.</p>
Full article ">Figure 2
<p>The network model comprises PDAs, laptops, and mobile phones.</p>
Full article ">Figure 3
<p>End-to-end delays for the AODV routing protocol.</p>
Full article ">Figure 4
<p>End-to-end delays for the BATMAN routing protocol.</p>
Full article ">Figure 5
<p>End-to-end delays for the DYMO routing protocol.</p>
Full article ">Figure 6
<p>End-to-end delays for the OLSR routing protocol.</p>
Full article ">Figure 7
<p>AODV’s throughput for laptop nodes.</p>
Full article ">Figure 8
<p>AODV’s throughput for mobile nodes.</p>
Full article ">Figure 9
<p>AODV’s throughput for fixed nodes.</p>
Full article ">Figure 10
<p>BATMAN’s throughput for laptop nodes (low mobility).</p>
Full article ">Figure 11
<p>BATMAN’s throughput for fixed nodes.</p>
Full article ">Figure 12
<p>BATMAN’s throughput for mobile nodes.</p>
Full article ">Figure 13
<p>DYMO’s throughput for laptop nodes.</p>
Full article ">Figure 14
<p>DYMO’s throughput for mobile nodes.</p>
Full article ">Figure 15
<p>DYMO’s throughput for fixed nodes.</p>
Full article ">Figure 16
<p>OLSR’s throughput for laptop nodes.</p>
Full article ">Figure 17
<p>OLSR’s throughput for fixed nodes.</p>
Full article ">Figure 18
<p>OLSR’s throughput for mobile nodes.</p>
Full article ">Figure 19
<p>Packet delivery ratio for AODV.</p>
Full article ">Figure 20
<p>Packet delivery ratio for BATMAN.</p>
Full article ">Figure 21
<p>Packet delivery ratio for DYMO.</p>
Full article ">Figure 22
<p>Packet delivery ratio for OLSR.</p>
Full article ">
25 pages, 2389 KiB  
Review
A Critical Analysis of Cooperative Caching in Ad Hoc Wireless Communication Technologies: Current Challenges and Future Directions
by Muhammad Ali Naeem, Rehmat Ullah, Sushank Chudhary and Yahui Meng
Sensors 2025, 25(4), 1258; https://doi.org/10.3390/s25041258 - 19 Feb 2025
Viewed by 274
Abstract
The exponential growth of wireless traffic has imposed new technical challenges on the Internet and defined new approaches to dealing with its intensive use. Caching, especially cooperative caching, has become a revolutionary paradigm shift to advance environments based on wireless technologies to enable [...] Read more.
The exponential growth of wireless traffic has imposed new technical challenges on the Internet and defined new approaches to dealing with its intensive use. Caching, especially cooperative caching, has become a revolutionary paradigm shift to advance environments based on wireless technologies to enable efficient data distribution and support the mobility, scalability, and manageability of wireless networks. Mobile ad hoc networks (MANETs), wireless mesh networks (WMNs), Wireless Sensor Networks (WSNs), and Vehicular ad hoc Networks (VANETs) have adopted caching practices to overcome these hurdles progressively. In this paper, we discuss the problems and issues in the current wireless ad hoc paradigms as well as spotlight versatile cooperative caching as the potential solution to the increasing complications in ad hoc networks. We classify and discuss multiple cooperative caching schemes in distinct wireless communication contexts and highlight the advantages of applicability. Moreover, we identify research directions to further study and enhance caching mechanisms concerning new challenges in wireless networks. This extensive review offers useful findings on the design of sound caching strategies in the pursuit of enhancing next-generation wireless networks. Full article
(This article belongs to the Section Sensor Networks)
Show Figures

Figure 1

Figure 1
<p>Cooperative versus non-cooperative caching.</p>
Full article ">Figure 2
<p>Cooperative Caching in Mobile ad hoc Network.</p>
Full article ">Figure 3
<p>Cooperative Caching in Wireless Mesh Network.</p>
Full article ">Figure 4
<p>Cooperative Caching in Wireless Sensor Network.</p>
Full article ">Figure 5
<p>Cooperative Caching in Vehicular Ad hoc Network.</p>
Full article ">Figure 6
<p>Cooperative Caching in Vehicle to Vehicle Wireless Network.</p>
Full article ">
26 pages, 1143 KiB  
Article
Securing UAV Flying Ad Hoc Wireless Networks: Authentication Development for Robust Communications
by Muhammet A. Sen, Saba Al-Rubaye and Antonios Tsourdos
Sensors 2025, 25(4), 1194; https://doi.org/10.3390/s25041194 - 15 Feb 2025
Viewed by 370
Abstract
Unmanned Aerial Vehicles (UAVs) have revolutionized numerous domains by introducing exceptional capabilities and efficiencies. As UAVs become increasingly integrated into critical operations, ensuring the security of their communication channels emerges as a paramount concern. This paper investigates the importance of safeguarding UAV communication [...] Read more.
Unmanned Aerial Vehicles (UAVs) have revolutionized numerous domains by introducing exceptional capabilities and efficiencies. As UAVs become increasingly integrated into critical operations, ensuring the security of their communication channels emerges as a paramount concern. This paper investigates the importance of safeguarding UAV communication against cyber threats, considering both intra-UAV and UAV–ground station interactions in the scope of the Flying Ad Hoc Networks (FANETs). To leverage the advancements in security methodologies, particularly focusing on Physical Unclonable Functions (PUFs), this paper proposes a novel authentication framework tailored for UAV networking systems. Investigating the existing literature, we categorize related studies into authentication strategies, illuminating the evolving landscape of UAV security. The proposed framework demonstrated a high level of security with lower communication and computation costs in comparison with selected studies with similar types of attacks. This paper highlights the urgent need for strong security measures to mitigate the increasing threats that UAVs encounter and ensure their sustained effectiveness in a variety of applications. The results indicate that the proposed protocol is sufficiently secure and, in terms of communication cost, achieves an 18% improvement compared to the best protocol in the referenced studies. Full article
(This article belongs to the Special Issue Security, Privacy and Trust in Wireless Sensor Networks)
Show Figures

Figure 1

Figure 1
<p>PUFs in UAV authentication: fundamental operational mechanism.</p>
Full article ">Figure 2
<p>Characteristics of PUFs.</p>
Full article ">Figure 3
<p>FANET Architectures. (<b>a</b>) Basic FANET model, (<b>b</b>) Multi-Group FANET, (<b>c</b>) Multi-Layer FANET.</p>
Full article ">Figure 4
<p>Security flaws in UAV system.</p>
Full article ">Figure 5
<p>Authentication process between UAV and GS.</p>
Full article ">Figure 6
<p>The authentication process between UAVs through the GS.</p>
Full article ">Figure 7
<p>Logical proof of the protocol.</p>
Full article ">Figure 8
<p>Comparison of communication costs in similar protocols [<a href="#B14-sensors-25-01194" class="html-bibr">14</a>,<a href="#B28-sensors-25-01194" class="html-bibr">28</a>,<a href="#B44-sensors-25-01194" class="html-bibr">44</a>,<a href="#B45-sensors-25-01194" class="html-bibr">45</a>,<a href="#B46-sensors-25-01194" class="html-bibr">46</a>].</p>
Full article ">
25 pages, 5328 KiB  
Article
Hybrid Trust Model for Node-Centric Misbehavior Detection in Dynamic Behavior-Homogeneous Clusters
by Xiaoya Xu, Weijie Zhu, Xiufeng Fu, Guang Yang, Longlong Jin, Wanting Yu and Lingfei You
Appl. Sci. 2025, 15(4), 2020; https://doi.org/10.3390/app15042020 - 14 Feb 2025
Viewed by 341
Abstract
In vehicular ad hoc networks (VANETs), the presence of untrustworthy nodes poses a significant threat, impacting the network’s reliability. This has led to the emergence of node-centric misbehavior detection as a crucial aspect of VANET security, focusing on the behavior of vehicles rather [...] Read more.
In vehicular ad hoc networks (VANETs), the presence of untrustworthy nodes poses a significant threat, impacting the network’s reliability. This has led to the emergence of node-centric misbehavior detection as a crucial aspect of VANET security, focusing on the behavior of vehicles rather than the content of their interactions. While the trust model is a popular approach, the computational complexity of trust computations and management in VANETs is attributed to the intricate relationships among vehicles and the dynamic autonomous movement of nodes. To tackle these challenges, we developed a hybrid trust model scheme for node-centric misbehavior detection. Our method represents complex vehicular relationships using a hyper-graph within a dynamic behavior-homogeneous cluster. The model incorporates direct and indirect trust in a multi-layered hybrid trust framework, enabling accurate computation of the aggregate trust level for each cluster member vehicle. Experimental results demonstrate the effectiveness of our scheme, particularly in high-density vehicle cooperation scenarios, highlighting its promising ability to detect misbehaving nodes. Full article
Show Figures

Figure 1

Figure 1
<p>VANETs Environment.</p>
Full article ">Figure 2
<p>Hierarchical trust model based on dynamic behavior-homogeneous clusters.</p>
Full article ">Figure 3
<p>Dynamic behavior-homogeneous vehicle clusters.</p>
Full article ">Figure 4
<p>Schematic diagram of dynamic vehicle clusters based on the hypergraph model.</p>
Full article ">Figure 5
<p>Distribution mechanism of basic safety-related information in vehicular networks.</p>
Full article ">Figure 6
<p>Direct trust value computation based on node speed.</p>
Full article ">Figure 7
<p>Traffic simulation scenario in OSM simulation map.</p>
Full article ">Figure 8
<p>Communication simulation scenario for vehicle trust value assessment.</p>
Full article ">Figure 9
<p>Vehicle node layer simulation result.</p>
Full article ">Figure 10
<p>Alerted vehicles in different density scenarios.</p>
Full article ">Figure 11
<p>The impact of information interaction on the average trust value of vehicles at a traffic density of 0.25.</p>
Full article ">Figure 12
<p>The impact of information interaction on the average trust value of vehicles at a traffic density of 0.35.</p>
Full article ">
15 pages, 3315 KiB  
Article
Transmission Control Protocol (TCP)-Based Delay Tolerant Networking for Space-Vehicle Communications in Cislunar Domain: An Experimental Approach
by Ding Wang and Ruhai Wang
Sensors 2025, 25(4), 1136; https://doi.org/10.3390/s25041136 - 13 Feb 2025
Viewed by 315
Abstract
The integrated heterogeneous 7G/8G networks may face multiple challenges for reliable data delivery such as link disruption, intermittent link availability, long latency and a highly lossy channel. Delay tolerant networking (DTN) was proposed as a highly reliable networking technology for space networks that [...] Read more.
The integrated heterogeneous 7G/8G networks may face multiple challenges for reliable data delivery such as link disruption, intermittent link availability, long latency and a highly lossy channel. Delay tolerant networking (DTN) was proposed as a highly reliable networking technology for space networks that will be part of future 7G/8G networks. In this paper, an experimental evaluation of transmission control protocol (TCP)-based DTN (i.e., running TCP at the transport layer of DTN) for space-vehicle communications in the cislunar domain is presented. The impact of link disruption is also considered. The evaluation was conducted using the DTN protocol suites over a realistic experimental testbed. The study results show that TCP-based DTN works effectively for space-vehicle communications in cislunar domain in the presence of a link disruption event. However, a roughly exponential goodput decrease is observed with a linear increase in link delay from 1250 ms to 5 s. Full article
Show Figures

Figure 1

Figure 1
<p>An example of BP-based DTN protocol stack with various protocols running at transport layer.</p>
Full article ">Figure 2
<p>Goodput of TCP-based DTN with respect to the variations of link delay and channel quality (BER).</p>
Full article ">Figure 3
<p>Goodput comparison between TCP-based DTN and BP/LTP/UDP with respect to the variations of link delay and channel quality. (<b>a</b>) BER = 0. (<b>b</b>) BER = 10<sup>−6</sup>. (<b>c</b>) BER = 10<sup>−5</sup>.</p>
Full article ">Figure 4
<p>Typical traffic pattern of TCP-based DTN with a link delay of 2000 ms and error-free channel. (<b>a</b>) Segments transmission in a cluster. (<b>b</b>) Details of a single cluster.</p>
Full article ">Figure 5
<p>Transmission comparison of TCP-based DTN transmissions between link delay of 2000 ms and link delay of 4000 ms for a BER of 10<sup>−5</sup>. (<b>a</b>) Round-trip time (RTT) traces. (<b>b</b>) Goodput traces.</p>
Full article ">Figure 6
<p>Goodput comparison of TCP-based DTN with respect to the variations of link delay and disruption length. (<b>a</b>) BER = 0. (<b>b</b>) BER = 10<sup>−6</sup>. (<b>c</b>) BER = 10<sup>−5</sup>.</p>
Full article ">Figure 7
<p>Goodput traces of TCP-based DTN for transmission with link delay of 2000 ms, a BER of 10<sup>−5</sup> and three disruption events. (<b>a</b>) Disruption of 0 s. (<b>b</b>) Disruption of 60 s. (<b>c</b>) Disruption of 120 s.</p>
Full article ">Figure 8
<p>TCP-based DTN transmission have link delay of 2000 ms and a disruption event of 120 s at a BER of 10<sup>−6</sup>. (<b>a</b>) RTT trace. (<b>b</b>) Goodput trace.</p>
Full article ">Figure 9
<p>TCP-based DTN transmission having link delay of 4000 ms and a disruption event of 120 s at a BER of 10<sup>−6</sup>. (<b>a</b>) RTT trace. (<b>b</b>) Goodput trace.</p>
Full article ">Figure 10
<p>Retransmission attempts of TCP-based DTN transmissions with different link disruptions versus link delays at BER of 10<sup>−5</sup>.</p>
Full article ">
18 pages, 7977 KiB  
Article
Active RFID Wake-Up Receiver Subsystem for Freight Wagon Localization Devices
by Łukasz Krzak and Cezary Worek
Sensors 2025, 25(4), 1124; https://doi.org/10.3390/s25041124 - 13 Feb 2025
Viewed by 396
Abstract
This paper presents the concept, design, and performance analysis of an active radio wake-up and radio identification subsystem as part of an advanced localization device intended to operate within a large-scale freight wagon localization system. The system provides an efficient and cost-effective way [...] Read more.
This paper presents the concept, design, and performance analysis of an active radio wake-up and radio identification subsystem as part of an advanced localization device intended to operate within a large-scale freight wagon localization system. The system provides an efficient and cost-effective way to localize freight carriages, which, in the majority of cases, are currently not tracked. The localization device is battery-powered and uses an ultra-low-power radio interface for detecting wake-on-radio signals from nearby operator devices. The same interface is also used for communication within an ad-hoc wireless mesh network, which allows the localization devices to select the best device to send out localization information from the whole cluster through a cellular connection in order to minimize overall battery energy usage. The article presents the overall system architecture construction of the radio interface, including the wake-up subsystem, as well as the results of performance measurements. Full article
(This article belongs to the Special Issue RFID-Enabled Sensor Design and Applications)
Show Figures

Figure 1

Figure 1
<p>Illustration of the freight wagon localization system functionalities, featuring additional low rate wireless personal area network (LR-WPAN) radio interface.</p>
Full article ">Figure 2
<p>Block diagram of the localization device.</p>
Full article ">Figure 3
<p>VSWR plot of the custom antenna designed for the localization device.</p>
Full article ">Figure 4
<p>Pictures of the electronic part of the localization devices. The rounded top-mounted PCB includes the whole RF subsystem, including a custom antenna.</p>
Full article ">Figure 5
<p>Pictures of the localization devices: (<b>a</b>) 3D model of the enclosure that holds the electronics, battery, and antenna, (<b>b</b>) 3D model of the steel pocket that is welded to the wagon side, (<b>c</b>) view of the localization device being mounted on a coal transportation wagon.</p>
Full article ">Figure 6
<p>Illustration of the RFID features that are based on the wake-up radio subsystem. The red arrows show the wake-up signal path from various external devices, such as sensors on board of the wagon, stationary access points and handheld mobile terminals to the localization device.</p>
Full article ">Figure 7
<p>Channel plan for 865–868 MHz frequency band, according to ETSI EN 302 208 V3.3.1:2020.</p>
Full article ">Figure 8
<p>Illustration of the wake-up subsystem architecture. The top part presents an external device with a wake-up signal transmitter, capable of generating the wake-up signal (red and orange signal path) as well as transmitting and receiving data (green and orange signal path) once the localization device is woken up and the session is established. Red power values indicate power levels of the wake-up signal and green power values indicate power levels of the RF signal produced by the ISM radio module. An important aspect of the design is the RF power splitter, which has 20 dB isolation so that the wake-up signal leaking into the ISM module is at an acceptable level. The lower part of the diagram presents the components responsible for processing the received wake-up signal (red and orange signal path) and those that take part in regular data exchange (green and orange signal path) once the localization device is woken up and the session is established.</p>
Full article ">Figure 9
<p>Illustration of the communication scheme between wake-up signal transmitter and woken up localization device. Green periods indicate state of radio listening, orange periods indicate state of radio transmission, grey periods indicate state of sleep and pink periods mark the activation of the wake-up signal detection algorithm.</p>
Full article ">Figure 10
<p>Results of sensitivity measurements.</p>
Full article ">Figure 11
<p>Results of range measurements.</p>
Full article ">Figure 12
<p>Results of selectivity measurements show the voltage amplification factor in the wake-up detector signal chain as a function of modulation frequency.</p>
Full article ">Figure A1
<p></p>
Full article ">
40 pages, 3190 KiB  
Review
Intelligence-Based Strategies with Vehicle-to-Everything Network: A Review
by Navdeep Bohra, Ashish Kumari, Vikash Kumar Mishra, Pramod Kumar Soni and Vipin Balyan
Future Internet 2025, 17(2), 79; https://doi.org/10.3390/fi17020079 - 10 Feb 2025
Viewed by 411
Abstract
Advancements in intelligent vehicular networks and computing systems have created new possibilities for innovative approaches that enhance traffic safety, comfort, and transportation performance. Machine Learning (ML) has become widely employed for boosting conventional data-driven methodologies in various scientific study domains. The integration of [...] Read more.
Advancements in intelligent vehicular networks and computing systems have created new possibilities for innovative approaches that enhance traffic safety, comfort, and transportation performance. Machine Learning (ML) has become widely employed for boosting conventional data-driven methodologies in various scientific study domains. The integration of a Vehicle-to-Everything (V2X) system with ML enables the acquisition of knowledge from multiple places, enhances the operator’s awareness, and predicts future crashes to prevent them. The information serves multiple functions, such as determining the most efficient route, increasing the driver’s knowledge, forecasting movement strategy to avoid risky circumstances, and eventually improving user convenience, security, and overall highway experiences. This article thoroughly examines Artificial Intelligence (AI) and ML methods that are now investigated through different study endeavors in vehicular ad hoc networks (VANETs). Furthermore, it examines the benefits and drawbacks accompanying such intelligent methods in the context of the VANETs system and simulation tools. Ultimately, this study pinpoints prospective domains for vehicular network development that can utilize the capabilities of AI and ML. Full article
Show Figures

Figure 1

Figure 1
<p>Types of VANET communications.</p>
Full article ">Figure 2
<p>The structure of the complete section.</p>
Full article ">Figure 3
<p>DSRC feature invention.</p>
Full article ">Figure 4
<p>Wireless communication links.</p>
Full article ">Figure 5
<p>The Reinforcement Learning framework.</p>
Full article ">Figure 6
<p>AI and ML approaches for vehicular ad hoc network.</p>
Full article ">
11 pages, 653 KiB  
Article
Routing Protocols Performance on 6LoWPAN IoT Networks
by Pei Siang Chia, Noor Hisham Kamis, Siti Fatimah Abdul Razak, Sumendra Yogarayan, Warusia Yassin and Mohd Faizal Abdollah
IoT 2025, 6(1), 12; https://doi.org/10.3390/iot6010012 - 10 Feb 2025
Viewed by 463
Abstract
IPv6 over Low-Power Wireless Personal Area Networks (6LoWPAN) are specifically designed for applications that require lower data rates and reduced power consumption in wireless internet connectivity. In the context of 6LoWPAN, Internet of Things (IoT) devices with limited resources can now seamlessly connect [...] Read more.
IPv6 over Low-Power Wireless Personal Area Networks (6LoWPAN) are specifically designed for applications that require lower data rates and reduced power consumption in wireless internet connectivity. In the context of 6LoWPAN, Internet of Things (IoT) devices with limited resources can now seamlessly connect to the network using IPv6. This study focuses on examining the performance and power consumption of routing protocols in the context of 6LoWPAN, drawing insights from prior research and utilizing simulation techniques. The simulation involves the application of routing protocols, namely Routing Protocol for Low-power and Lossy (RPL) Networks, Ad hoc On-demand Distance Vector (AODV), Lightweight On-demand Ad hoc Distance-vector Next Generation (LOADng), implemented through the Cooja simulator. The simulation also runs in different network topologies to gain an insight into the performance of the protocols in the specific topology including random, linear, and eclipse topology. The raw data gathered from the tools including Powertrace and Collect-View were then analyzed with Python code to transfer into useful information and visualize the graph. The results demonstrate that the power consumption, specifically CPU power, Listen Power, and Total Consumption Power, will increase with the incremental of motes. The result also shows that RPL is the most power-efficient protocol among the scenarios compared to LOADng and AODV. The result is helpful because it brings insights into the performance, specifically power consumption in the 6LoWPAN network. This result is valuable to further implement these protocols in the testbed as well as provide an idea of the algorithmic enhancements. Full article
Show Figures

Figure 1

Figure 1
<p>Mean power consumption for different scenarios.</p>
Full article ">Figure 2
<p>Pair plot of different power types.</p>
Full article ">
22 pages, 6807 KiB  
Article
High-Performance Data Throughput Analysis in Wireless Ad Hoc Networks for Smart Vehicle Interconnection
by Alaa Kamal Yousif Dafhalla, Amira Elsir Tayfour Ahmed, Nada Mohamed Osman Sid Ahmed, Ameni Filali, Lutfieh S. Alhomed, Fawzia Awad Elhassan Ali, Asma Ibrahim Gamar Eldeen, Mohamed Elshaikh Elobaid and Tijjani Adam
Computers 2025, 14(2), 56; https://doi.org/10.3390/computers14020056 - 10 Feb 2025
Viewed by 418
Abstract
Vehicular Ad Hoc Networks play a crucial role in enabling Smart City applications by facilitating seamless communication between vehicles and infrastructure. This study evaluates the throughput performance of different routing protocols, specifically AODV, AODV:TOM, AODV:DEM, GPSR, GPSR:TOM, and GPSR:DEM, under various city and [...] Read more.
Vehicular Ad Hoc Networks play a crucial role in enabling Smart City applications by facilitating seamless communication between vehicles and infrastructure. This study evaluates the throughput performance of different routing protocols, specifically AODV, AODV:TOM, AODV:DEM, GPSR, GPSR:TOM, and GPSR:DEM, under various city and highway scenarios in complex networks. The analysis covers key parameters including traffic generation, packet sizes, mobility speeds, and pause times. Results indicate that TOM and DEM profiles significantly improve throughput compared to traditional AODV and GPSR protocols. GPSR:TOM achieves the highest throughput across most scenarios, making it a promising solution for high-performance data transmission in Smart Cities. For instance, GPSR:TOM achieves an average throughput of 3.2 Mbps in city scenarios compared to 2.8 Mbps for GPSR, while in highway scenarios, the throughput increases to 3.6 Mbps. Additionally, AODV:DEM records a throughput of 3.4 Mbps for high traffic generation, outperforming AODV:TOM at 3.1 Mbps and baseline AODV at 2.7 Mbps. The findings highlight the importance of optimizing data throughput to ensure reliability and efficiency in complex vehicle interconnection systems, which are critical for traffic management, accident prevention, and real-time communication in smart urban environments. Full article
Show Figures

Figure 1

Figure 1
<p>Vehicle interconnection architecture.</p>
Full article ">Figure 2
<p>Parameters optimization process flowchart.</p>
Full article ">Figure 3
<p>CM flowchart.</p>
Full article ">Figure 4
<p>CM-Routing mechanism overall process flow diagram.</p>
Full article ">Figure 5
<p>Optimization Control Message structure.</p>
Full article ">Figure 6
<p>Pseudocode of the receive OCM message in the OBU.</p>
Full article ">Figure 7
<p>Receive profile process pseudocode in the OBU.</p>
Full article ">Figure 8
<p>Process for optimization implementation in the Road-Side Unit (RSU).</p>
Full article ">Figure 9
<p>Throughput and variation comparison between AODV, AODV:TOM, and AODV:DEM in city and highway scenarios.</p>
Full article ">Figure 10
<p>Throughput and variation comparison between GPSR, GPSR:TOM, and GPSR:DEM in city and highway scenarios.</p>
Full article ">Figure 11
<p>Throughput and variation comparison between AODV, AODV:TOM, and AODV:DEM in city and highway scenarios for different packet sizes.</p>
Full article ">Figure 12
<p>Throughput and variation comparison between GPSR, GPSR:TOM, and GPSR:DEM in city and highway scenarios for different packet sizes.</p>
Full article ">Figure 13
<p>Throughput and variation comparison between AODV, AODV:TOM, and AODV:DEM in city and highway scenarios for different mobility speeds.</p>
Full article ">Figure 14
<p>Throughput and variation comparison between GPSR, GPSR:TOM, and GPSR:DEM in city and highway scenarios for different mobility speeds.</p>
Full article ">Figure 15
<p>Throughput and variation comparison between AODV, AODV:TOM, and AODV:DEM in city and highway scenarios for different pause times.</p>
Full article ">Figure 16
<p>Throughput and variation comparison between GPSR, GPSR:TOM, and GPSR:DEM in city and highway scenarios for different pause times.</p>
Full article ">Figure 17
<p>Throughput comparison between (<b>a</b>) AODV, GPSR, CM-AODV, and (<b>b</b>) CM-GPSR for different packet sizes.</p>
Full article ">
Back to TopTop