Ad Hoc Networks最新文献

{"title":"A general task offloading and resources allocation strategy for multi-RSUs with load unbalance and priority awareness","authors":"Dun Cao ,&nbsp;WenQian Wang ,&nbsp;Meihua Wu ,&nbsp;Shuo Cai ,&nbsp;Fayez Alqahtani ,&nbsp;Jin Wang","doi":"10.1016/j.adhoc.2024.103690","DOIUrl":"10.1016/j.adhoc.2024.103690","url":null,"abstract":"<div><div>Vehicular Edge Computing is a new computing paradigm that enables real-time response to vehicular applications and servers by performing data processing on edge computing devices near the vehicle. However, on the one hand, the random distribution and the mobility of vehicles may lead to load unbalance among different Roadside Units (RSUs), and some tasks may not be able to get timely response due to inadequate computing resources and communication resources in the high-load RSU areas. On the other hand, considering the different urgency of the tasks, the service quality of the system will be seriously affected if these tasks are not treated indistinguishably. To address the above challenges, this paper constructs a priority-aware task offloading and computing&amp;communication resources allocation problem in a general scenario of unbalanced load among multi-RSUs, aiming at minimising the average delay. In the problem, considering the absence of communication resources, the relay vehicle is used to offload the subtasks of splittable tasks to the RSUs that are in the neighbouring and low-load. Moreover, to take full advantage of computing resources, the task can be reasonably split into at most four parts and processed in parallel on a relay vehicle, a current RSU, a neighbouring RSU and a local vehicle. To solve the problem, a Split-Hop Offloading and Resources Allocation Strategy (SHORAS) based on an improved particle swarm optimisation algorithm is proposed, which uses a penalty function to incline resources towards high priority tasks. Simulation results show that SHORAS improves 24% in terms of the total system delay and effectively reduces the processing delay in the high-load areas compared to other strategies, while ensuring the delay requirements of high priority tasks.</div></div>","PeriodicalId":55555,"journal":{"name":"Ad Hoc Networks","volume":"167 ","pages":"Article 103690"},"PeriodicalIF":4.4,"publicationDate":"2024-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142573351","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}

{"title":"Enhanced reinforcement learning-based two-way transmit-receive directional antennas neighbor discovery in wireless ad hoc networks","authors":"Zongheng Wei ,&nbsp;Huakun Wu ,&nbsp;Zhiyong Lin ,&nbsp;Qingji Wen ,&nbsp;Lili Zheng ,&nbsp;Jianfeng Wen ,&nbsp;Hai Liu","doi":"10.1016/j.adhoc.2024.103689","DOIUrl":"10.1016/j.adhoc.2024.103689","url":null,"abstract":"<div><div>The utilization of directional antennas for neighbor discovery in wireless ad hoc networks brings notable benefits, such as extended transmission range, reduced transmission interference, and enhanced antenna gain. However, when nodes use directional antennas for neighbor discovery, the communication range is limited, resulting in a lack of knowledge of potential neighbors. Hence, it is necessary to design a special antenna direction switching strategy for neighbor discovery based on directional antennas. Traditional methods of switching antenna directions are often random or follow predefined sequences, overlooking the historical knowledge of sector exploration for antenna directions. In contrast, existing machine learning approaches aim to leverage observed historical knowledge to adjust antenna directions for faster neighbor discovery. Nonetheless, the latency of neighbor discovery is still high because the node cannot fully utilize the observed historical knowledge (<em>i.e.</em>., only using the knowledge observed by the node in transmission mode, ignoring the knowledge observed by the node in reception mode). Meanwhile, the corresponding reward and penalty mechanisms are still not detailed enough (<em>i.e.</em>., these reward and penalty mechanisms only consider the sectors of discovered and undiscovered neighboring nodes, ignoring the scenario of sectors that have been rewarded). In this paper, the neighbor discovery process is modeled as a reinforcement learning-based learning automaton. We propose an enhanced reinforcement learning-based two-way transmit-receive directional antennas neighbor discovery algorithm, called ERTTND. The algorithm consists of a two-way transmit-receive reinforcement learning mechanism (TTRL) and an enhanced reward-and-penalty mechanism (ERAP). This algorithm leverages insights from nodes in transmission and reception modes to refine their tactical decisions. Then, through an enriched reward-and-penalty framework, nodes optimize their strategies, thus expediting neighbor discovery based on directional antennas in wireless ad hoc networks. Simulation results demonstrate that compared to existing representative algorithms, the proposed ERTTND algorithm can achieve over 30% savings in terms of average discovery delay and energy consumption.</div></div>","PeriodicalId":55555,"journal":{"name":"Ad Hoc Networks","volume":"167 ","pages":"Article 103689"},"PeriodicalIF":4.4,"publicationDate":"2024-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142586555","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}

{"title":"A weighted hybrid indoor positioning method based on path loss exponent estimation","authors":"Yiting Wang,&nbsp;Jingqi Fu,&nbsp;Yifan Cao","doi":"10.1016/j.adhoc.2024.103684","DOIUrl":"10.1016/j.adhoc.2024.103684","url":null,"abstract":"<div><div>With the rapid development of the Internet of Things (IoT), location-based services (LBS) have gained significant attention due to their widespread applications in daily life. This paper addresses the indoor target positioning problem in wireless sensor networks (WSNs). A weighted constrained linear least squares algorithm based on path loss exponent estimation (PLE-WCLLS) with received signal strength (RSS) and angle of arrival (AoA) hybrid measurements is proposed. To address the challenges of unknown transmission power and path loss exponent (PLE), the proposed method employs a linear least squares (LLS) estimation approach based on the ranging maximum likelihood (ML) estimation model to estimate both parameters. Subsequently, a confidence weight adjustment strategy is designed to reduce positioning errors. To handle the highly non-convex and nonlinear nature of the RSS/AoA hybrid optimization model, a linearization method based on Taylor series expansion is presented. Accurate target position estimation is achieved by solving a constrained quadratic programming problem. The effectiveness of the proposed algorithm is validated through numerical simulations and experimental evaluation in a real indoor environment. Compared to traditional positioning methods, the PLE-WCLLS algorithm improves positioning accuracy by 13.2%, and it performs exceptionally well even in scenarios with fewer sensor nodes. This gives it broad application prospects in areas such as IoT device management, personnel tracking in smart buildings, and asset localization in industrial automation.</div></div>","PeriodicalId":55555,"journal":{"name":"Ad Hoc Networks","volume":"166 ","pages":"Article 103684"},"PeriodicalIF":4.4,"publicationDate":"2024-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142533788","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}

{"title":"An energy efficient prediction based protocol for target tracking in wireless sensor networks","authors":"Nadia Khiadani ,&nbsp;Faramarz Hendessi","doi":"10.1016/j.adhoc.2024.103688","DOIUrl":"10.1016/j.adhoc.2024.103688","url":null,"abstract":"<div><div>Target tracking is one of the most attractive applications of wireless sensor networks, used for estimating the moving target's position accurately. A primary challenge in this domain is achieving precise target path estimation while conserving energy resources. This paper introduces an energy-efficient target tracking protocol in wireless sensor networks, considering both accuracy and reduced energy consumption. The protocol uses the Kalman filter to estimate the target's position and predict the subsequent step of its path. In each step of target tracking, a selected sensor, named the ‘leader’ performs computations for position estimation and path prediction, while two other sensors, known as ‘assistants’ help the leader in the tracking process. Leader selection within the protocol is performed in two phases: an initial phase occurring upon the target's entry to the network and a subsequent phase named the forced handoff phase. The forced handoff phase performs the selection of a new leader when either the target exits the sensing range of the current leader or the leader's energy decreases significantly. Although the proposed protocol is a new work, it can be considered as an improvement of the PPCP protocol by adding several changes and also replacing the binary variational filter with the Kalman filter. The efficiency of the proposed protocol is evaluated through simulations in Matlab. Results demonstrate the protocol's ability to achieve high-precision target tracking while maintaining low energy consumption. Comparative analysis shows its energy efficiency, which significantly increases the network lifetime.</div></div>","PeriodicalId":55555,"journal":{"name":"Ad Hoc Networks","volume":"167 ","pages":"Article 103688"},"PeriodicalIF":4.4,"publicationDate":"2024-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142656958","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}

{"title":"EDRP-GTDQN: An adaptive routing protocol for energy and delay optimization in wireless sensor networks using game theory and deep reinforcement learning","authors":"Ning Liu,&nbsp;Jun Wang,&nbsp;Fazhan Tao,&nbsp;Zhumu Fu,&nbsp;Bo Liu","doi":"10.1016/j.adhoc.2024.103687","DOIUrl":"10.1016/j.adhoc.2024.103687","url":null,"abstract":"<div><div>Routing protocols, as a crucial component of the internet of things (IoT), play a significant role in data collection and environmental monitoring tasks. However, existing clustering routing protocols suffer from issues such as uneven network energy consumption, high communication delays, and inadequate adaptation to topology changes. To address these issues, this study proposes an adaptive routing algorithm to balance energy consumption and delay using game theory and deep Q-network (DQN) algorithms (EDRP-GTDQN). Specifically, EDRP-GTDQN evaluates the importance of node positions using node centrality and integrates a game-theoretic-based approach to select optimal cluster heads in terms of node centrality and residual energy. Moreover, graph convolutional networks (GCN) and DQN are incorporated to construct transmission paths for cluster heads, adapt to network topology changes, and balance energy consumption and performance. Furthermore, a cluster rotation mechanism is employed to optimize overall network energy consumption and prevent the formation of hotspots. Experimental results demonstrate that EDRP-GTDQN achieves average performance improvements of 19.76%, 30.04%, 44.2%, and 61.42% in average energy consumption, network lifetime, and average end-to-end delay compared to conventional routing protocols such as EECRAIFA, MRP-GTCO, DEEC, and MH-LEACH. Therefore, EDRP-GTDQN is undoubtedly an effective solution to reduce energy consumption and enhance service quality in wireless sensor networks.</div></div>","PeriodicalId":55555,"journal":{"name":"Ad Hoc Networks","volume":"166 ","pages":"Article 103687"},"PeriodicalIF":4.4,"publicationDate":"2024-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142533786","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}

{"title":"Growth-adaptive distillation compressed fusion model for network traffic identification based on IoT cloud–edge collaboration","authors":"Yang Yang,&nbsp;Chengwen Fan,&nbsp;Shaoyin Chen,&nbsp;Zhipeng Gao,&nbsp;Lanlan Rui","doi":"10.1016/j.adhoc.2024.103676","DOIUrl":"10.1016/j.adhoc.2024.103676","url":null,"abstract":"<div><div>The development of the Internet of Things (IoT) has led to the rapid growth of the types and number of connected devices and has generated large amounts of complex and diverse traffic data. Traffic identification on edge servers solves the real-time and privacy requirements of IoT management and has attracted much attention, but still faces several problems: (1) traditional machine learning (ML) models rely on artificially constructed features, and the existing deep learning (DL) traffic identification models have reached their performance limit; and (2) insufficient computing resources of edge servers limit the possible improvement in the performance of deep learning models by increasing the number of parameters and structural complexity. To address these issues, we propose a lightweight fusion model. First, the Network-in-Network (NiN) model and Random Forest (RF) model are used on the cloud server to construct a traffic identification fusion model. The excellent representation extraction capability of the NiN compensates for the RF’s dependence on manual feature extraction, and its modular structure is suitable for the subsequent model compression operations. Then, the NiN was distilled. We propose Growth-Adaptive Distillation to lightweight the NiN model, which can reduce the operation of manually adjusting the structure of the student model and ensure the efficiency and low power consumption of the fusion model deployment. In addition, both the RF in the cloud and the distilled NiN are deployed on the edge server. Comparisons with multiple algorithms on two network traffic datasets show that the proposed model achieves state-of-the-art performance while ensuring the use of minimal computational resources.</div></div>","PeriodicalId":55555,"journal":{"name":"Ad Hoc Networks","volume":"167 ","pages":"Article 103676"},"PeriodicalIF":4.4,"publicationDate":"2024-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142573350","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}

{"title":"Approximation schemes for age of information minimization in UAV grid patrols","authors":"Weiqi Wang ,&nbsp;Jin Xu","doi":"10.1016/j.adhoc.2024.103686","DOIUrl":"10.1016/j.adhoc.2024.103686","url":null,"abstract":"<div><div>Motivated by the critical need for unmanned aerial vehicles (UAVs) to patrol grid systems in hazardous and dynamically changing environments, this study addresses a routing problem aimed at minimizing the time-average Age of Information (AoI) for edges in general graphs. We establish a lower bound for all feasible patrol policies and demonstrate that this bound is tight when the graph contains an Eulerian cycle. For graphs without Eulerian cycles, it becomes challenging to identify the optimal patrol strategy due to the extensive range of feasible options. Our analysis shows that restricting the strategy to periodic sequences still results in an exponentially large number of possible strategies. To address this complexity, we introduce two polynomial-time approximation schemes, each involving a two-step process: constructing multigraphs first and then embedding Eulerian cycles within these multigraphs. We prove that both schemes achieve an approximation ratio of 2. Further, both analytical and numerical results suggest that evenly and sparsely distributing edge visits within a periodic route significantly reduces the average AoI compared to strategies that merely minimize the route travel distance. Building on this insight, we propose a heuristic method that not only maintains the approximation ratio of 2 but also ensures robust performance across varying random graphs.</div></div>","PeriodicalId":55555,"journal":{"name":"Ad Hoc Networks","volume":"166 ","pages":"Article 103686"},"PeriodicalIF":4.4,"publicationDate":"2024-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142533785","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}

{"title":"Requester mobility for mobile crowdsensing system: A dynamic alliance-based incentive mechanism","authors":"Zhilin Xu ,&nbsp;Hao Sun ,&nbsp;Panfei Sun ,&nbsp;Qianqian Kong","doi":"10.1016/j.adhoc.2024.103680","DOIUrl":"10.1016/j.adhoc.2024.103680","url":null,"abstract":"<div><div>In the Mobile Crowdsensing (MCS) system, due to the heterogeneity of requesters, they are in mobile which means requesters will join or leave the MCS system at different times and their data demands are time-varying. The uncertainty of requesters caused by requester mobility will generate the instability of the match between requesters and participants which means the established matching algorithm cannot be completed due to the dissatisfaction of requesters and participants caused by the changes in the intensity of competition. For requester mobility, we design a dynamic alliance-based incentive mechanism where requesters can leave, join the MCS system separately, and change their data needs. To the instability, we divide the dynamic mechanism into different stages and will update the matching rules in each stage. A unique algorithm based on the dynamic Stackelberg game and the corresponding updated algorithm is proposed to analyze the matching strategies of requesters and participants to make an optimal match. By proving the stability of the updated rules, we guarantee the stability of the match with requester mobility. Through numerical analysis, alliance formation can significantly reduce weak requesters’ costs by at most 90%. Besides, in our mechanism any requester participates in the game at most twice, the chosen rate can be up to 100%.</div></div>","PeriodicalId":55555,"journal":{"name":"Ad Hoc Networks","volume":"166 ","pages":"Article 103680"},"PeriodicalIF":4.4,"publicationDate":"2024-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142533787","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}

{"title":"FLAV: Federated Learning for Autonomous Vehicle privacy protection","authors":"Yingchun Cui ,&nbsp;Jinghua Zhu ,&nbsp;Jinbao Li","doi":"10.1016/j.adhoc.2024.103685","DOIUrl":"10.1016/j.adhoc.2024.103685","url":null,"abstract":"<div><div>Autonomous Vehicle Systems are committed to safer, more efficient and more convenient transportation on the roads of the future. However, concerns about vehicle data privacy and security remain significant. Federated Learning, as a decentralized machine learning approach, allows multiple devices or data sources to collaboratively train models without sharing raw data, providing essential privacy protection. In this paper, we propose a privacy-preserving framework for autonomous vehicles, named FLAV. First, we use a multi-chain parallel aggregation strategy to transmit model parameters and design a model parameter filtering mechanism, which reduces communication overhead by filtering out the local model parameters of certain vehicles, thereby alleviating bandwidth pressure. Second, we introduce a dynamic adjustment mechanism that automatically adjusts regularization strength by comparing each vehicle’s local parameters with the cumulative parameters of preceding vehicles in the chain. This mechanism balances local training with global consistency, ensuring the model’s adaptability to local data while improving coordination between vehicles in the chain. Experimental results demonstrate that our proposed method reduces communication costs while improving model accuracy and privacy protection level, effectively ensuring the security of autonomous driving data.</div></div>","PeriodicalId":55555,"journal":{"name":"Ad Hoc Networks","volume":"166 ","pages":"Article 103685"},"PeriodicalIF":4.4,"publicationDate":"2024-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142533687","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}

{"title":"A distributed intrusion detection framework for vehicular Ad Hoc networks via federated learning and Blockchain","authors":"Fedwa Mansouri ,&nbsp;Mounira Tarhouni ,&nbsp;Bechir Alaya ,&nbsp;Salah Zidi","doi":"10.1016/j.adhoc.2024.103677","DOIUrl":"10.1016/j.adhoc.2024.103677","url":null,"abstract":"<div><div>The emergence of connected vehicles via Vehicular Ad Hoc Networks (VANETs) has revolutionized transportation but has also brought forth challenges in security and privacy due to their open architecture. Early detection of intrusions within VANETs is paramount for ensuring safe communication. This research presents an intelligent distributed approach that leverages federated learning (FL) and blockchain for intrusion detection in VANETs. Through FL, various neural network models were implemented to distribute model training among vehicles, thus preserving privacy. Quantitative evaluation metrics demonstrate the effectiveness of the proposed framework. For example, compared to a traditionally trained Stochastic Gradient Descent (SGD) model, the Federated Trained Model achieved higher precision across various attack types, ranging from 68 % to 94 %, and consistently outperformed in terms of recall, with rates ranging from 57 % to 88 %. These results highlight FL's superiority in detecting intrusions, evidenced by gains in accuracy, recall, and precision. Integration of FL with blockchain further strengthened security and privacy protection, ensuring data integrity during collaborative FL training across decentralized nodes. This novel framework addresses VANET vulnerabilities by facilitating privacy-preserving, collaborative anomaly monitoring in a trustworthy manner. Evaluations validate the performance advantages of FL for intrusion identification, supporting wider adoption of vehicular technologies. The study underscores the potential of combining FL and blockchain to enable robust, cooperative abnormality recognition crucial for maintaining reliability, safety, and trust in VANET operations<strong>.</strong></div></div>","PeriodicalId":55555,"journal":{"name":"Ad Hoc Networks","volume":"167 ","pages":"Article 103677"},"PeriodicalIF":4.4,"publicationDate":"2024-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142656954","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}