Ad Hoc Networks最新文献_第7页

Capacity and delay analysis of multi-hop wireless networks

IF 4.4 3区计算机科学

Ad Hoc Networks Pub Date : 2025-01-03 DOI: 10.1016/j.adhoc.2024.103750

Jan Laarhuis , Alessandro Chiumento

{"title":"Capacity and delay analysis of multi-hop wireless networks","authors":"Jan Laarhuis , Alessandro Chiumento","doi":"10.1016/j.adhoc.2024.103750","DOIUrl":"10.1016/j.adhoc.2024.103750","url":null,"abstract":"<div><div>The capacity and delay of wireless multi-hop networks are key performance indicators. They are needed in the design of such networks, and are also useful to assess how well applications can run over such networks. However, finding analytical expressions for capacity and delay for a wireless multi-hop network with an arbitrary topology is hard. In this work, a two-step approach is followed to derive expressions for the maximum achievable capacity and the minimum achievable delay in wireless multi-hop networks. These expressions are valid for fixed, conflict-free time-slot scheduling among the nodes, and when each nodes of the network has always packets to send to each of its neighbours. In the first step, expressions for the capacity and delay of the elementary topologies ’string’ and ’star’ are derived, and in the second step, these results are combined to derive the capacity and delay values for a network with an arbitrary topology. This two-step approach is applied to two types of wireless multi-hop networks: those whose nodes have an omni-directional antenna, and those whose nodes have an electronically steerable directional (beam-steering) antenna. Using this approach, we find that the capacity of a path on the network is not a decreasing function of the total number of nodes in the network, as mostly found in literature, but rather a decreasing function of the number of neighbours of the nodes on the path. The results show that the derived maximum value for the capacity (and minimum value for the delay) in networks with beam-steering antennas is larger (lower) than that for networks with omni-directional antennas as more efficient scheduling is possible for the former. The derived analytic expressions for capacity and delay are valuable for the relative comparison of the performance of wireless multi-hop networks.</div></div>","PeriodicalId":55555,"journal":{"name":"Ad Hoc Networks","volume":"169 ","pages":"Article 103750"},"PeriodicalIF":4.4,"publicationDate":"2025-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143137657","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Powering Smart Wireless Implantable Medical Devices: Toward an internet of self-powered intra-body things

IF 4.4 3区计算机科学

Ad Hoc Networks Pub Date : 2025-01-01 DOI: 10.1016/j.adhoc.2024.103748

Raffaele Guida , Tommaso Melodia

{"title":"Powering Smart Wireless Implantable Medical Devices: Toward an internet of self-powered intra-body things","authors":"Raffaele Guida , Tommaso Melodia","doi":"10.1016/j.adhoc.2024.103748","DOIUrl":"10.1016/j.adhoc.2024.103748","url":null,"abstract":"<div><div>A new generation of miniaturized, less invasive, and Smart Wireless Implantable Medical Devices (SW-IMDs), designed for real-time monitoring of biomarkers and with real-time system reconfiguration can now be realized thanks to advances in low-power electronics, sensing, wireless communications, and materials. However, the need for long-term and reliable power supply, together with the need to support innovative functions, impose new powering requirements that cannot be satisfied by traditional batteries. Batteries have in fact a major impact on the size and lifetime of the implant, and often need to be replaced every 5–10 years through a surgical procedure, causing discomfort and risks for the patient.</div><div>This article provides a broad overview of the two main approaches to powering for future medical implants, namely <em>remote energy transfer</em> and <em>energy harvesting</em>. We describe the underlying physical principles that regulate the energy transfer processes and the energy conversion mechanisms used to transform the energy produced by human or environmental sources into electrical energy. We also offer an extended overview of state-of-the-art technologies, leading remote powering methods, harvesters and scavengers. Some of the most recent prototypes and clinically available devices are briefly described as well. For each technology, we discuss advantages and drawbacks; as well as safety exposure limits to the radiating sources. Finally, we outline a number of open research challenges that need to be overcome to enable a new generation of self-powered implantable medical devices.</div></div>","PeriodicalId":55555,"journal":{"name":"Ad Hoc Networks","volume":"169 ","pages":"Article 103748"},"PeriodicalIF":4.4,"publicationDate":"2025-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143138174","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Performance analysis of LoRaWAN underground-to-satellite connectivity: An urban underground pipelines monitoring case study

IF 4.4 3区计算机科学

Ad Hoc Networks Pub Date : 2024-12-31 DOI: 10.1016/j.adhoc.2024.103747

Kaiqiang Lin , Muhammad Asad Ullah , Lei Lei , Hirley Alves , Konstantin Mikhaylov , Tong Hao

{"title":"Performance analysis of LoRaWAN underground-to-satellite connectivity: An urban underground pipelines monitoring case study","authors":"Kaiqiang Lin , Muhammad Asad Ullah , Lei Lei , Hirley Alves , Konstantin Mikhaylov , Tong Hao","doi":"10.1016/j.adhoc.2024.103747","DOIUrl":"10.1016/j.adhoc.2024.103747","url":null,"abstract":"<div><div>Urban underground pipelines (UUPs) serve the cardiovascular system of our society and the cornerstone of various smart city and industrial applications. Although the leakage of UUPs can be effectively detected and localized by utilizing the measurements of different types of sensors, the reliable transmission of sensor data remains challenging in large-scale UUPs monitoring due to the harsh underground conditions and the complex urban environments. Motivated by recent successful integration of LoRaWAN and satellites, we investigate in this study the feasibility of the massive machine-type communication (mMTC) based sensing approach, which utilizes the underground-to-satellite (UtS) connectivity for monitoring large-scale UUPs. Specifically, we consider two alternative network architectures, i.e., underground direct-to-satellite (U-DtS) and underground indirect-to-satellite (U-ItS), and discuss their pros, cons, and trade-offs. To assess the feasibility and performance of U-ItS and UtS in large-scale UUPs monitoring, we develop the Monte Carlo UtS simulator, featuring realistic UUPs deployments, regional LoRaWAN configurations, semi-empirical propagation models, two gateway deployment approaches, and data aggregation for U-ItS. Our results reveal that U-DtS fails to counter underground propagation losses and shadowing effects in urban environments. However, U-ItS is demonstrated as a promising solution for the reliable wireless monitoring of UUPs, whose performance can be further improved by utilizing data aggregation. Finally, we verify that the transmission success probability of U-DtS and U-ItS is strongly affected by the underground parameters, i.e., the burial depth of devices and the volumetric water content of soil.</div></div>","PeriodicalId":55555,"journal":{"name":"Ad Hoc Networks","volume":"169 ","pages":"Article 103747"},"PeriodicalIF":4.4,"publicationDate":"2024-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143138172","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Attack from malicious access points in cell-free massive MIMO systems: Performance analysis and countermeasure

IF 4.4 3区计算机科学

Ad Hoc Networks Pub Date : 2024-12-30 DOI: 10.1016/j.adhoc.2024.103746

Lei Sun, Ruiguang Wang, Weiyang Xu

{"title":"Attack from malicious access points in cell-free massive MIMO systems: Performance analysis and countermeasure","authors":"Lei Sun, Ruiguang Wang, Weiyang Xu","doi":"10.1016/j.adhoc.2024.103746","DOIUrl":"10.1016/j.adhoc.2024.103746","url":null,"abstract":"<div><div>This paper investigates physical-layer security (PLS) in a cell-free massive MIMO network. It has been demonstrated that malicious access points (APs) can significantly compromise the downlink achievable rate by conducting channel estimation during the uplink training phase and transmitting precoded interference signals during the downlink data phase. A performance analysis has been conducted to derive a closed-form expression for the downlink achievable rate. To ensure secure communication, this paper proposes the injection of artificial noise (AN) into the uplink training phase to prevent malicious APs from acquiring channel state information. Due to limitations in degrees of freedom, third-party nodes are proposed to transmit AN. Given the possibility of no null space existing between third-party nodes and legitimate APs, a singular value decomposition-based precoding method is proposed, and an expression of the achievable secrecy rate is obtained. Both analytical and numerical results indicate that the proposed AN-aided scheme can effectively counteract the downlink interference attacks of malicious APs and outperform traditional power allocation methods in maximizing the achievable rate.</div></div>","PeriodicalId":55555,"journal":{"name":"Ad Hoc Networks","volume":"169 ","pages":"Article 103746"},"PeriodicalIF":4.4,"publicationDate":"2024-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143138171","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Distributed Detecting of Critical Nodes for Maximization of Connected Components in Wireless Multi-hop Networks

IF 4.4 3区计算机科学

Ad Hoc Networks Pub Date : 2024-12-24 DOI: 10.1016/j.adhoc.2024.103744

Onur Ugurlu , Nusin Akram , Yesim Aygul , Vahid Khalilpour Akram , Orhan Dagdeviren

{"title":"Distributed Detecting of Critical Nodes for Maximization of Connected Components in Wireless Multi-hop Networks","authors":"Onur Ugurlu , Nusin Akram , Yesim Aygul , Vahid Khalilpour Akram , Orhan Dagdeviren","doi":"10.1016/j.adhoc.2024.103744","DOIUrl":"10.1016/j.adhoc.2024.103744","url":null,"abstract":"<div><div>In Wireless Multi-hop Networks (WMhNs), nodes whose absence significantly weakens network connectivity or partitions the network into disconnected components are called critical nodes. This paper focuses on a critical node problem, the Maximizing the Number of Connected Components (MaxNum) problem, which aims to identify <span><math><mi>k</mi></math></span> critical nodes whose removal maximizes the number of connected components. Although the MaxNum problem is a well-known NP-Hard problem with various real-world applications, no distributed algorithm has been proposed to solve it. To address this gap, we propose an efficient distributed algorithm for the MaxNum problem in WMhNs. The algorithm uses a distributed depth-first search tree to identify <span><math><mi>k</mi></math></span> critical nodes, requiring a bit complexity of <span><math><mrow><mi>O</mi><mrow><mo>(</mo><mi>n</mi><mo>×</mo><mi>k</mi><mo>×</mo><msub><mrow><mo>log</mo></mrow><mrow><mn>2</mn></mrow></msub><mi>n</mi><mo>)</mo></mrow></mrow></math></span> and a space complexity of <span><math><mrow><mi>O</mi><mrow><mo>(</mo><mi>Δ</mi><mo>+</mo><mi>k</mi><mo>)</mo></mrow></mrow></math></span>, where <span><math><mi>Δ</mi></math></span> denotes the maximum node degree. We evaluated the proposed algorithm through simulations and testbed networks, comparing it to the Linear Programming (LP) approach. Our findings show that the proposed distributed algorithm achieves promising outcomes, reaching nearly 90% of the optimal solution while reducing data transmission to half of that required by the centralized LP.</div></div>","PeriodicalId":55555,"journal":{"name":"Ad Hoc Networks","volume":"169 ","pages":"Article 103744"},"PeriodicalIF":4.4,"publicationDate":"2024-12-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143138176","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

A schedulability-aware routing algorithm for time sensitive network based on improved ant colony algorithm

IF 4.4 3区计算机科学

Ad Hoc Networks Pub Date : 2024-12-19 DOI: 10.1016/j.adhoc.2024.103741

Yi Guo, Feng Luo, Zitong Wang, Yingpeng Tong, Yi Ren

{"title":"A schedulability-aware routing algorithm for time sensitive network based on improved ant colony algorithm","authors":"Yi Guo, Feng Luo, Zitong Wang, Yingpeng Tong, Yi Ren","doi":"10.1016/j.adhoc.2024.103741","DOIUrl":"10.1016/j.adhoc.2024.103741","url":null,"abstract":"<div><div>With the rapid development of industrial automation, there are higher requirements for reliable and deterministic communication in industrial networks, including in-vehicle networks, avionics and intelligent transport. Time Sensitive Network offers bounded, low-latency transmission assurance for crucial traffic via the Time Aware Shaper described in the IEEE 802.1Qbv. This standard ensures low jitter and deterministic delay for time-sensitive traffic by employing a pre-calculated circular transmission schedule. Current scheduling algorithms typically use the shortest path algorithm to determine paths for time-triggered flows. However, this approach can lead to an excessive concentration of time-triggered flows traversing the same link, thereby impacting the scheduling feasibility of such flows. In this paper, first, the time-sensitive network topology and time-triggered flows are modeled and the SMT-based no-wait scheduling constraints are proposed. Then, a schedulability-aware routing (SAR) algorithm based on the improved ant colony algorithm is designed to enhance the schedulability of time-triggered flows under the no-wait scheduling problem, thereby improving the ability of the time-sensitive network to accommodate time-triggered flows. Finally, SAR is compared with four routing algorithms including the shortest path routing algorithm (Dijkstra) to evaluate its performance under different network loads. The results show a significant improvement in the scheduling success rate of SAR compared to other routing algorithms. In the original network topology, when the link communication rate is 1000 Mbit/s, SAR achieves scheduling success rates that are 44 %, 62 %, and 56 % higher than Dijkstra for 80, 85, and 90 time-triggered flows, respectively, and 18 %, 8 %, and 10 % higher than LBR.</div></div>","PeriodicalId":55555,"journal":{"name":"Ad Hoc Networks","volume":"169 ","pages":"Article 103741"},"PeriodicalIF":4.4,"publicationDate":"2024-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143138170","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Energy-efficient collaborative task offloading in multi-access edge computing based on deep reinforcement learning

IF 4.4 3区计算机科学

Ad Hoc Networks Pub Date : 2024-12-18 DOI: 10.1016/j.adhoc.2024.103743

Shudong Wang, Shengzhe Zhao, Haiyuan Gui, Xiao He, Zhi Lu, Baoyun Chen, Zixuan Fan, Shanchen Pang

{"title":"Energy-efficient collaborative task offloading in multi-access edge computing based on deep reinforcement learning","authors":"Shudong Wang, Shengzhe Zhao, Haiyuan Gui, Xiao He, Zhi Lu, Baoyun Chen, Zixuan Fan, Shanchen Pang","doi":"10.1016/j.adhoc.2024.103743","DOIUrl":"10.1016/j.adhoc.2024.103743","url":null,"abstract":"<div><div>In the multi-access edge computing (MEC), task offloading through device-to-device (D2D) communication can improve the performance of edge computing by utilizing the computational resources of nearby mobile devices (MDs). However, adapting to the time-varying wireless environment and efficiently and quickly allocating tasks to MEC and other MDs to minimize the energy consumption of MDs is a challenge. First, we constructed a multi-device collaborative task offloading framework, modeling the collaborative task offloading decision problem as a graph state transition problem and utilizing a graph neural network (GNN) to fully explore the potential relationships between MDs and MEC. Then, we proposed a collaborative task offloading algorithm based on graph reinforcement learning and introduced a penalty mechanism that imposes penalties when the tasks of MDs exceed their deadlines. Simulation results show that, compared with other benchmark algorithms, this algorithm reduces energy consumption by approximately 20%, achieves higher task completion rates, and provides a more balanced load distribution.</div></div>","PeriodicalId":55555,"journal":{"name":"Ad Hoc Networks","volume":"169 ","pages":"Article 103743"},"PeriodicalIF":4.4,"publicationDate":"2024-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143138169","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Task offloading and resource allocation in cellular heterogeneous networks for NOMA-based mobile edge computing

IF 4.4 3区计算机科学

Ad Hoc Networks Pub Date : 2024-12-18 DOI: 10.1016/j.adhoc.2024.103742

Guowei Wu, Guifen Chen

{"title":"Task offloading and resource allocation in cellular heterogeneous networks for NOMA-based mobile edge computing","authors":"Guowei Wu, Guifen Chen","doi":"10.1016/j.adhoc.2024.103742","DOIUrl":"10.1016/j.adhoc.2024.103742","url":null,"abstract":"<div><div>Mobile edge computing (MEC) is an effective strategy for real-time data processing and lowering data transmission latency between end devices and the cloud, which can minimize network congestion and improve user experience. This paper examines the problem of system energy consumption minimization in a cellular heterogeneous network (HetNets) MEC architecture with non-orthogonal multiple access (NOMA). The NOMA protocol is used by each base station to serve users within its small cell, and each base station is fitted with an edge computing server. Because of the parameter coupling, energy consumption minimization is a difficult non-convex optimization problem. As a result, the problem is divided into three subproblems, the computational and communication resource allocation subproblem and the task offloading subproblem being optimally solved by their convexity, while the subchannel allocation and power control subproblems are solved by sequential convex programming. Then, for each of the three subproblems, an efficient iterative technique is presented. Simulation results show that the partial offloading strategy under NOMA (PO-NOMA) proposed in this paper outperforms several baseline strategy, including all local computation, complete offloading, random offloading strategy, and greedy offloading strategy, and outperforms Orthogonal Multiple Access (OMA)-based MEC in cellular heterogeneous networks in a cellular heterogeneous network scenario.</div></div>","PeriodicalId":55555,"journal":{"name":"Ad Hoc Networks","volume":"169 ","pages":"Article 103742"},"PeriodicalIF":4.4,"publicationDate":"2024-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143138168","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Data-driven cell-free scheduler

IF 4.4 3区计算机科学

Ad Hoc Networks Pub Date : 2024-12-16 DOI: 10.1016/j.adhoc.2024.103738

Yara Huleihel , Gil Maman , Zion Hadad , Eli Shasha , Haim H. Permuter

{"title":"Data-driven cell-free scheduler","authors":"Yara Huleihel , Gil Maman , Zion Hadad , Eli Shasha , Haim H. Permuter","doi":"10.1016/j.adhoc.2024.103738","DOIUrl":"10.1016/j.adhoc.2024.103738","url":null,"abstract":"<div><div>Efficient scheduling is essential in cell-free (CF) networks, where user equipments (UEs) communicate with multiple distributed transceivers (radio units (RUs)) linked to a centralized base station (BS) that coordinates and processes the received or transmitted signals. Unlike traditional cellular networks, CF networks operate without cell boundaries, allowing UEs to seamlessly connect to multiple RUs, and thus eliminating the conventional necessity for handoffs between transceivers. In this paper, we introduce a novel CF scheduler designed to enhance data quality of service (QoS) parameters, including throughput, and latency. The scheduler employs a neural network (NN) algorithm to autonomously manage interactions with users across a distributed network of transceivers. This approach utilizes both model and data driven methods to optimize user communication. To mitigate the high computational complexity of traditional model-driven algorithms, we propose a supervised NN that learns from the model-driven approach. We assess its performance using simulated data from orthogonal frequency division multiple access (OFDMA) waveforms in frequency, time, space, and polarization (e.g., resource blocks, OFDM symbols, beam ID), within multi-transceiver RU environments. Our results indicate that the model-driven algorithms exhibit competitive performance compared to the exhaustive search method, while the supervised NN demonstrates comparable efficiency after offline learning. Consequently, our NN-based scheduler emerges as a viable, efficient solution for optimizing CF network scheduling.</div></div>","PeriodicalId":55555,"journal":{"name":"Ad Hoc Networks","volume":"169 ","pages":"Article 103738"},"PeriodicalIF":4.4,"publicationDate":"2024-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143138177","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Enhancing real-time intrusion detection system for in-vehicle networks by employing novel feature engineering techniques and lightweight modeling

IF 4.4 3区计算机科学

Ad Hoc Networks Pub Date : 2024-12-12 DOI: 10.1016/j.adhoc.2024.103737

Wael Aljabri, Md. Abdul Hamid, Rayan Mosli

{"title":"Enhancing real-time intrusion detection system for in-vehicle networks by employing novel feature engineering techniques and lightweight modeling","authors":"Wael Aljabri, Md. Abdul Hamid, Rayan Mosli","doi":"10.1016/j.adhoc.2024.103737","DOIUrl":"10.1016/j.adhoc.2024.103737","url":null,"abstract":"<div><div>Autonomous vehicles are built using a variety of electronic control units (ECUs) that communicate over a controller area network (CAN). A CAN enables the communication of data between ECUs to guarantee safety, assist drivers, and perform different functions. Nevertheless, a CAN lacks built-in security measures, which makes it susceptible to cyberattacks. A significant amount of existing research on intrusion detection systems (IDSs) is aimed at enhancing the security of a CAN by identifying and detecting unauthorized packet injections. However, the majority of machine/deep learning-based IDSs have difficulty sufficiently addressing latency. To address this issue, we propose a novel IDS framework that introduces two distinctive features. The first feature is the utility of data entropy, which is dynamically recalculated as new data arrives to capture unpredictable variations in the data payload. The second feature is an anomaly score, combining data entropy and time interval entropy to detect abnormal patterns in CAN communication. We validated the significance of these features using SHapley Additive exPlanations (SHAP) analysis. These features are integrated into a lightweight deep learning-based IDS model, specifically designed for resource-constrained environments. This integration significantly improves detection accuracy and operational efficiency. Our approach is validated using two well-known public datasets, car hacking: attack & defense challenge and car-hacking datasets. It shows significant detection capabilities with accuracies of 0.9946 and 0.9995 and F1 scores of 0.9945 and 0.9995, respectively. Also, our IDS achieves an effectively low inference latency of only 0.17 milliseconds, surpassing the performance of existing machine/deep learning-based IDSs.</div></div>","PeriodicalId":55555,"journal":{"name":"Ad Hoc Networks","volume":"169 ","pages":"Article 103737"},"PeriodicalIF":4.4,"publicationDate":"2024-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143137659","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0