Ad Hoc Networks最新文献

筛选
英文 中文
Scheduling and routing strategies for executing task graphs on ad hoc switched networks 在自组织交换网络上执行任务图的调度和路由策略
IF 4.8 3区 计算机科学
Ad Hoc Networks Pub Date : 2026-03-01 Epub Date: 2025-11-13 DOI: 10.1016/j.adhoc.2025.104084
Chhavi Chaudhary , Rudrajyoti Roy , Rajesh Devaraj , Arnab Sarkar
{"title":"Scheduling and routing strategies for executing task graphs on ad hoc switched networks","authors":"Chhavi Chaudhary ,&nbsp;Rudrajyoti Roy ,&nbsp;Rajesh Devaraj ,&nbsp;Arnab Sarkar","doi":"10.1016/j.adhoc.2025.104084","DOIUrl":"10.1016/j.adhoc.2025.104084","url":null,"abstract":"<div><div>Modern Cyber–Physical Systems (<em>CPSs</em>) rely on sophisticated software applications, often modeled as Dependency-constrained Task Graphs (DTGs), to capture the intricate inter-dependencies among their functional components. Efficient scheduling of tasks and routing of inter-task messages over ad hoc switched network platforms remain significant challenges due to task precedence constraints, processing heterogeneity, and communication contention. To the best of our knowledge, no prior work in the literature has addressed the integrated scheduling of computation and communication for DTG-structured applications on ad hoc switched network platforms. This paper addresses this research gap by introducing a contention-aware task-message co-scheduling framework for heterogeneous ad hoc switched networks, offering a generic and scalable offline scheduling strategy. The proposed strategy, termed <em>DSHSN</em> (<em>DTG Scheduler on Heterogeneous Switched Networks</em>), is a list-based heuristic that jointly optimizes task allocation on heterogeneous end stations and message routing through intermediate switches while ensuring precedence preservation and contention-free communication. Extensive simulations using benchmark DTGs on diverse network topologies demonstrate that <em>DSHSN</em> consistently achieves up to <span><math><mo>∼</mo></math></span>20% reduction in makespan in the best case (and <span><math><mo>∼</mo></math></span>12% on average) compared to baseline strategies, validating its effectiveness and scalability for modern distributed embedded platforms such as Network-on-Chips (NoCs) and Time-Sensitive Networking (TSN).</div></div>","PeriodicalId":55555,"journal":{"name":"Ad Hoc Networks","volume":"182 ","pages":"Article 104084"},"PeriodicalIF":4.8,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145529373","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
Co-Task: Collaborative Task Execution for UAV-as-a-Service using Stackelberg game 协同任务:使用Stackelberg游戏的无人机即服务协同任务执行
IF 4.8 3区 计算机科学
Ad Hoc Networks Pub Date : 2026-03-01 Epub Date: 2025-11-25 DOI: 10.1016/j.adhoc.2025.104099
Prince Kumar, Arijit Roy
{"title":"Co-Task: Collaborative Task Execution for UAV-as-a-Service using Stackelberg game","authors":"Prince Kumar,&nbsp;Arijit Roy","doi":"10.1016/j.adhoc.2025.104099","DOIUrl":"10.1016/j.adhoc.2025.104099","url":null,"abstract":"<div><div>This work proposes a Collaborative Task Execution (Co-Task) scheme for the UAV-as-a-Service (UaaS) platform. The UaaS platform enables multiple Unmanned Aerial Vehicles (UAVs) to collaboratively serve diverse Internet of Things (IoT) applications, thereby enhancing resource utilization, reducing energy consumption, and improving overall task efficiency and system reliability. However, effective collaboration among UAVs remains challenging due to task transfer delays, execution costs, and the presence of multiple UAV owners with competing economic interests. The problem becomes more challenging in the presence of multiple UAV owners and their competition to participate in the platform to earn monetary benefits. To address these challenges, Co-Task scheme ensures collaborative task execution among UAVs, even when they belong to different owners. We apply Stackelberg’s game-theoretic approach to design collaborative task execution in the UaaS platform, where a UAV with limited computational capacity (the leader) offloads a portion of its task to another UAV (the follower) with available resources. The leader and follower jointly optimize resource allocation and pricing to achieve efficient task execution and fair incentive distribution. Using gradient descent optimization and Nash equilibrium, we derive the optimal resource allocation and pricing strategies that ensure stable and efficient collaboration, where no UAV has an incentive to deviate unilaterally. To evaluate the effectiveness of Co-Task, we conducted extensive simulations and compared its performance with state-of-the-art approaches, – Gradient-based Iterative Search Algorithm (GISA), Game Theory Pricing Strategy (GTPS), and Heuristic with Learning Placement (HLP). The results demonstrate that Co-Task improves the leader’s utility by 7.51%.</div></div>","PeriodicalId":55555,"journal":{"name":"Ad Hoc Networks","volume":"182 ","pages":"Article 104099"},"PeriodicalIF":4.8,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145624179","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
Robust attribute-based access control protocol over data-centric IoT–NDN networking 基于数据中心IoT-NDN网络的鲁棒属性访问控制协议
IF 4.8 3区 计算机科学
Ad Hoc Networks Pub Date : 2026-03-01 Epub Date: 2025-11-06 DOI: 10.1016/j.adhoc.2025.104087
Ferhat Mecerhed , Youcef Imine , Antoine Gallais , Stefan Fischer , Mohamed Ahmed Hail
{"title":"Robust attribute-based access control protocol over data-centric IoT–NDN networking","authors":"Ferhat Mecerhed ,&nbsp;Youcef Imine ,&nbsp;Antoine Gallais ,&nbsp;Stefan Fischer ,&nbsp;Mohamed Ahmed Hail","doi":"10.1016/j.adhoc.2025.104087","DOIUrl":"10.1016/j.adhoc.2025.104087","url":null,"abstract":"<div><div>Named Data Networking (NDN) is an emerging content-centric communication paradigm envisioned for future IoT architectures. Its features, including in-network caching, multicast forwarding, and data-centric security, make it a promising network protocol for resource-constrained devices. However, the data-centric nature of NDN introduces confidentiality concerns, as the decoupling of data from its source and distributed caching prevent the producer from directly controlling access to the data after injecting it in the network. However, the current literature still does not accommodate NDN’s communication model in heterogeneous IoT environments. Moreover, existing solutions often lack support for fine-grained, cross-domain access control and efficient revocation mechanisms.</div><div>To overcome these challenges, we propose a novel decentralized, fine-grained access control protocol for IoT–NDN networks. Our protocol leverages multi-authority ciphertext-policy attribute-based encryption to ensure robust cryptographic access control to data, and is adapted to support data streaming scenarios. Additionally, it provides an efficient revocation mechanism that enables immediate attribute revocation without requiring re-keying. This mechanism is coupled with an optimization strategy to reduce the cost of cryptographic operations during revocation in streaming contexts. Our protocol also integrates a symmetric key exchange and derivation mechanism that ensures fast data access. Finally, we evaluate the performance of our scheme through NS-3 simulations using ndnSIM, complemented by a computational analysis of the cryptographic algorithms on IoT devices. The results demonstrate that our protocol achieves low overhead in both latency and energy consumption.</div></div>","PeriodicalId":55555,"journal":{"name":"Ad Hoc Networks","volume":"182 ","pages":"Article 104087"},"PeriodicalIF":4.8,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145479358","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
An efficient Corona ring based data collection scheme using wireless sensor networks with Internet of Things for aeration control in smart shrimp aquaculture 一种基于电晕环的无线传感器网络与物联网数据采集方案,用于智能对虾养殖中的曝气控制
IF 4.8 3区 计算机科学
Ad Hoc Networks Pub Date : 2026-03-01 Epub Date: 2025-11-15 DOI: 10.1016/j.adhoc.2025.104091
Ram Prasath Sivarajaboopathy , Sivasankari Krishnakumar
{"title":"An efficient Corona ring based data collection scheme using wireless sensor networks with Internet of Things for aeration control in smart shrimp aquaculture","authors":"Ram Prasath Sivarajaboopathy ,&nbsp;Sivasankari Krishnakumar","doi":"10.1016/j.adhoc.2025.104091","DOIUrl":"10.1016/j.adhoc.2025.104091","url":null,"abstract":"<div><div>Energy efficiency is a very crucial requirement in battery-operated wireless sensor networks. The Cluster and Corona Ring-based Data Collection (CCRDC) scheme is proposed to prolong the network lifetime. The waiting-time-dependent Cluster Head (CH) awareness message is applied in the proposed cluster head selection and cluster formation. Also, the Corona ring based routing is formed depending on the Corona ring ID, node ID, residual energy, and distance from the Base Station (BS). The proposed data collection scheme mitigates the excessive use of control packet exchange and energy consumption. Based on the simulation outcomes, it is observed that the suggested method achieves a high performance than other existing protocols in terms of average energy consumption, average end-to-end delay, packet delivery ratio, and average control packets. In the proposed work, the last node expiry is occurred in the network at 1634th round whereas in the existing works EERPMS, EDCGRP, and DCBSRP the last node expiry in the network is at 1285th, 1107th and 1026th round respectively. The proposed data collection and routing scheme is implemented and deployed to supervise the quality of the shrimp cultivation pond water in real time, in which the major parameters like pH level, dissolved oxygen (DO) and temperature are gathered by using appropriate sensors. The gathered data are transmitted to the cloud via BS. In shrimp ponds, Dissolved Oxygen (DO) level is a key metric for reducing stress and mortality. The oxygen level in the water is reduced due to many factors including high temperature, high nutrients levels, excessive plant growth, food wastes, etc. Several methods have currently been investigated to raise the DO level in the shrimp ponds. Many studies suggest that the aeration improves the water quality and cost effectiveness. The automatic ON/OFF control of the aerator is the most effective method to improve the DO concentration level in the ponds, although it is not entirely dependable. In this work, the automatic ON/OFF control of the aerator is implemented by using fuzzy logic with the input of pH level, dissolved oxygen and temperature.</div></div>","PeriodicalId":55555,"journal":{"name":"Ad Hoc Networks","volume":"182 ","pages":"Article 104091"},"PeriodicalIF":4.8,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145624182","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
BER vs SINR: Selection of a metric for physical interference models for flooding messaging and WSN recovery BER vs SINR:为泛洪消息传递和WSN恢复的物理干扰模型选择度量
IF 4.8 3区 计算机科学
Ad Hoc Networks Pub Date : 2026-03-01 Epub Date: 2025-11-11 DOI: 10.1016/j.adhoc.2025.104092
Vladimir Fedorenko , Irina Samoylenko , Vladimir Samoylenko
{"title":"BER vs SINR: Selection of a metric for physical interference models for flooding messaging and WSN recovery","authors":"Vladimir Fedorenko ,&nbsp;Irina Samoylenko ,&nbsp;Vladimir Samoylenko","doi":"10.1016/j.adhoc.2025.104092","DOIUrl":"10.1016/j.adhoc.2025.104092","url":null,"abstract":"<div><div>Ensuring the reliable delivery of alarm messages under emergency conditions is a critical challenge in wireless sensor networks (WSNs), particularly when employing flood transmission mode, as the simultaneous, unsynchronized broadcasting by multiple transmitters leads to mutual interference in channels. In the existing literature, the physical communication channel is typically evaluated using either the Signal-to-Interference-plus-Noise Ratio (SINR) or the Bit Error Rate (BER). However, the cumulative nature of SINR makes it impossible to discern the individual contribution of each node to the aggregate interference, while estimating BER through bit error counting requires significant time and computational resources. This article presents an analysis of the impact of mutual interference on both BER and SINR functions, aiming to facilitate their rational integration for optimizing message routing strategies. The proposed analytical model describes BER as a function of environmental parameters, including Signal-to-Noise Ratio (SNR), Interference-to-Noise Ratio (INR), Signal and Interference Orthogonality Coefficient (SIOC) and the Rician K-factor as signal fading depth. The algorithm for constructing rapid data routing with minimal relay nodes is based on estimates of packet loss rates with erroneous bits. Meanwhile, route segment lengths correspond to retransmission frequency thresholds—specifically, no more than two packet requests per segment. An optimized algorithm for the accelerated selection of backup node locations relies on branch-and-bound method. This methodology reduces the initial set of solution options by a factor of 3.5 in the presented example. For a priori uncertainty conditions regarding the Rician K-factor, we propose to select the backup node channel with the minimal BER based on indirect estimates of SNR and INR. The research significantly contributes to the development and application of interference-resistant WSNs in critical applications, such as emergency response and industrial monitoring systems.</div></div>","PeriodicalId":55555,"journal":{"name":"Ad Hoc Networks","volume":"182 ","pages":"Article 104092"},"PeriodicalIF":4.8,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145580098","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
Dynamic deployment of UAVs for temporary networks using multi-criteria decision-making 基于多准则决策的临时网络无人机动态部署
IF 4.8 3区 计算机科学
Ad Hoc Networks Pub Date : 2026-03-01 Epub Date: 2025-11-26 DOI: 10.1016/j.adhoc.2025.104096
Flávio Henry Ferreira , Fabrício J.B. Barros , Miércio C.A. Neto , Arun Narayanan , Pedro H.J. Nardelli , Jasmine P.L. Araújo
{"title":"Dynamic deployment of UAVs for temporary networks using multi-criteria decision-making","authors":"Flávio Henry Ferreira ,&nbsp;Fabrício J.B. Barros ,&nbsp;Miércio C.A. Neto ,&nbsp;Arun Narayanan ,&nbsp;Pedro H.J. Nardelli ,&nbsp;Jasmine P.L. Araújo","doi":"10.1016/j.adhoc.2025.104096","DOIUrl":"10.1016/j.adhoc.2025.104096","url":null,"abstract":"<div><div>Unmanned Aerial Vehicle Base Stations (UAV-BSs) are effective to support mobile wireless systems in situations where an unusually high density of users require enhanced coverage and capacity such as in large sport events or music festivals. However, the joint deployment problem of UAV-BSs is NP-hard, and the optimization methods used to solve such a class of problems are often too slow for (quasi-)real-time applications when the density of users and the number of UAV-BS are high. This inefficiency creates a need for more adaptable methods to solve the UAV-BS positioning problem. This paper proposes a solution by transforming the UAV-BSs’ placement problem into a decision-making process using the Analytic Hierarchy Process (AHP) method. Our solution considers that all UAV-BSs move along scanning points with a predetermined path, each with a minimal distance from one another. The proposed algorithm, named UAV-AHP, efficiently determines the UAV-BSs’ positions, thereby improving the network performance based on (quasi-) real-time acquisition of user signals at scanning points. For the high-density scenarios under investigation, our numerical results demonstrate that UAV-AHP outperforms commonly used heuristics that sub-optimally solve NP-hard problems, namely, cuckoo search (CS), particle swarm optimization (PSO), and a genetic algorithm (NSGA-II). The proposed method for UAV-BS deployment requires considerably lower running times to find satisfactory solutions than CS, PSO, and NSGA-II.</div></div>","PeriodicalId":55555,"journal":{"name":"Ad Hoc Networks","volume":"182 ","pages":"Article 104096"},"PeriodicalIF":4.8,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145624178","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
Next-generation MIMO empowered mobile edge computing: A comprehensive survey toward 6G systems 下一代MIMO支持移动边缘计算:对6G系统的全面调查
IF 4.8 3区 计算机科学
Ad Hoc Networks Pub Date : 2026-03-01 Epub Date: 2025-11-12 DOI: 10.1016/j.adhoc.2025.104095
Tien V. Thai , Mai T.P. Le , Hieu V. Nguyen , Oh-Soon Shin , Maria-Gabriella Di Benedetto
{"title":"Next-generation MIMO empowered mobile edge computing: A comprehensive survey toward 6G systems","authors":"Tien V. Thai ,&nbsp;Mai T.P. Le ,&nbsp;Hieu V. Nguyen ,&nbsp;Oh-Soon Shin ,&nbsp;Maria-Gabriella Di Benedetto","doi":"10.1016/j.adhoc.2025.104095","DOIUrl":"10.1016/j.adhoc.2025.104095","url":null,"abstract":"<div><div>The integration of Mobile Edge Computing (MEC) with Next-Generation Multiple-Input Multiple-Output (NG-MIMO) technologies has emerged as a cornerstone of next-generation wireless networks, enabling low-latency, high-bandwidth, and computationally efficient applications.This survey offers a comprehensive, structured analysis of recent advancements, key applications, and pressing challenges at the MEC–NG-MIMO interface. We emphasize performance optimization—resource allocation, spectral and energy efficiency, latency, fairness, and scalability in MEC-aided NG-MIMO systems, and examine a spectrum of architectures including massive MIMO (mMIMO), cell-free mMIMO (CF-mMIMO)/user-centric CF-mMIMO, extremely large-scale MIMO (XL-MIMO), holographic MIMO (H-MIMO), and movable antennas (MA). Beyond fundamentals, we introduce architectural patterns (centralized, distributed, and hybrid) to clarify orchestration and control/data-plane design, and deepen the discussion of RIS-aided systems (phase optimization, CSI overhead) and XL-MIMO (near-field propagation, visibility regions). We further review the convergence with emerging technologies including UAVs, RIS, NOMA, SWIPT, energy harvesting, and AI/ML-driven optimization, highlighting joint communication-computation strategies that enhance coverage, efficiency, and robustness. Practical relevance is reinforced through empirical deployment insights and KPI–use-case mappings, including references to key standards and environmental/implementation constraints (synchronization, hardware impairments, power/cooling/backhaul). Finally, we identify open problems and research directions that are critical to realizing intelligent, adaptive, and energy-efficient MEC-aided NG-MIMO networks on the path to 6G.</div></div>","PeriodicalId":55555,"journal":{"name":"Ad Hoc Networks","volume":"182 ","pages":"Article 104095"},"PeriodicalIF":4.8,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145580101","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
Blockchain for message dissemination in VANETs based on approval voting 区块链用于在vanet中基于批准投票的消息传播
IF 4.8 3区 计算机科学
Ad Hoc Networks Pub Date : 2026-03-01 Epub Date: 2025-11-11 DOI: 10.1016/j.adhoc.2025.104093
Zhiqiang Du , Siqi Zheng , Mengze Sun , Muhong Huang , Yanfang Fu , Xiaopeng Zhang , Wendong Zhang , Alwyn Hoffman
{"title":"Blockchain for message dissemination in VANETs based on approval voting","authors":"Zhiqiang Du ,&nbsp;Siqi Zheng ,&nbsp;Mengze Sun ,&nbsp;Muhong Huang ,&nbsp;Yanfang Fu ,&nbsp;Xiaopeng Zhang ,&nbsp;Wendong Zhang ,&nbsp;Alwyn Hoffman","doi":"10.1016/j.adhoc.2025.104093","DOIUrl":"10.1016/j.adhoc.2025.104093","url":null,"abstract":"<div><div>With the increasing deployment of Vehicular Ad Hoc Networks(VANETs) in intelligent transportation systems, the efficient dissemination of emergency event messages has become a critical issue for enhancing traffic safety and emergency response capabilities. This paper proposes an emergency message dissemination approach based on an approval voting mechanism, aiming to improve the efficiency and reliability of message propagation through multi-hop transmission and relay node selection strategies. Furthermore, the proposed scheme quantifies the behavioral credibility of nodes through a reputation incentive mechanism, which can effectively enhance the reliability of information dissemination. Experiments comparing the proposed scheme to traditional reputation-based relay node selection methods show it outperforms classic methods in message delivery success, propagation latency, and network stability, achieving a minimum propagation delay of 183 ms with 100 nodes. The paper shows that different relay node strategies have varying impacts on information dissemination, with the satisfaction-based approach capable of improving efficiency.</div></div>","PeriodicalId":55555,"journal":{"name":"Ad Hoc Networks","volume":"182 ","pages":"Article 104093"},"PeriodicalIF":4.8,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145529375","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
An attention-enhanced LSTM model for efficient network slicing in beyond 5G networks 一种用于超5G网络中高效网络切片的注意力增强LSTM模型
IF 4.8 3区 计算机科学
Ad Hoc Networks Pub Date : 2026-03-01 Epub Date: 2025-11-01 DOI: 10.1016/j.adhoc.2025.104070
Anjali Rajak, Rakesh Tripathi
{"title":"An attention-enhanced LSTM model for efficient network slicing in beyond 5G networks","authors":"Anjali Rajak,&nbsp;Rakesh Tripathi","doi":"10.1016/j.adhoc.2025.104070","DOIUrl":"10.1016/j.adhoc.2025.104070","url":null,"abstract":"<div><div>Beyond 5G (B5G) networks are designed to significantly enhance network capacity and reduce latency by utilizing higher frequency spectrum bands. These networks rely on effective network slicing—the partitioning of physical infrastructure into independent logical networks, each optimized for specific service requirements to support a wide range of emerging application. However, B5G networks face substantial challenges due to massive data generation and stringent Service-Level Agreements (SLAs). This study introduces a Network Slice Framework (NSFrame) that addresses these challenges through a novel approach combining feature selection techniques with deep learning for efficient slice classification. NSFrame integrates Mutual Information, Shapley values from cooperative game theory, and Borda Count rank aggregation to overcome high dimensionality by selecting the most relevant features. These features are then processed by a multi-head attention enhanced long short-term memory model. Evaluated on the Unicauca IP Flow Version2 and 5G-SliciNdd datasets, NSFrame achieved classification accuracies of 99.79% and 98.67%, respectively, with strong generalization confirmed through 10-fold cross-validation. The proposed approach significantly outperforms existing methods, enhancing both quality of service and quality of experience, while enabling service providers to meet strict SLAs in B5G environments where softwarization and virtualization are essential for customized service delivery.</div></div>","PeriodicalId":55555,"journal":{"name":"Ad Hoc Networks","volume":"182 ","pages":"Article 104070"},"PeriodicalIF":4.8,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145529372","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 literature review on sinkhole attack detection for Internet of Things 物联网天坑攻击检测的文献综述
IF 4.8 3区 计算机科学
Ad Hoc Networks Pub Date : 2026-03-01 Epub Date: 2025-11-15 DOI: 10.1016/j.adhoc.2025.104081
Mohammad Nadim, John Rhed Eugenio, Anitha Chennamaneni
{"title":"A literature review on sinkhole attack detection for Internet of Things","authors":"Mohammad Nadim,&nbsp;John Rhed Eugenio,&nbsp;Anitha Chennamaneni","doi":"10.1016/j.adhoc.2025.104081","DOIUrl":"10.1016/j.adhoc.2025.104081","url":null,"abstract":"<div><div>The growth of the Internet of Things (IoT), driven by Wireless Sensor Networks (WSNs) and Low-Power and Lossy Networks (LLNs), has raised significant security concerns, particularly regarding sinkhole attacks. These attacks compromise data integrity by redirecting traffic through malicious nodes. This paper reviews existing detection methods for sinkhole attacks in IoT and WSNs, analyzing their effectiveness, limitations, and current research gaps. Key challenges include the lack of benchmark datasets, limited real-world validation, and issues with scalability and protocol dependence. The study highlights future research directions to enhance the security and resilience of IoT systems.</div></div>","PeriodicalId":55555,"journal":{"name":"Ad Hoc Networks","volume":"182 ","pages":"Article 104081"},"PeriodicalIF":4.8,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145580100","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
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书