Ad Hoc Networks最新文献

{"title":"SRST: A secure and resilient synchronization of time for WSNs in IoT applications","authors":"Amin Saiah ,&nbsp;Chafika Benzaid ,&nbsp;Mohamed Younis ,&nbsp;Nadjib Badache","doi":"10.1016/j.adhoc.2024.103749","DOIUrl":"10.1016/j.adhoc.2024.103749","url":null,"abstract":"<div><div>Many applications of Wireless Sensor Networks (WSNs) in internet of things require accurate time synchronization for the successful realization. In a hostile environment, protecting time synchronization against faulty timestamps injection attacks is paramount. Malicious nodes (MNs) could broadcast faulty timestamps to decrease the accuracy of the whole network. The Receiver-Only (RO)-based synchronization methodology achieves high accuracy while reducing the number of timing messages compared to other methodologies. However, RO is vulnerable to node failure and supports only a single reference, which makes it inaccurate in the presence of MNs. To address these limitations, we propose SRST, a secure and resilient synchronization of time for WSNs. SRST employs a novel time synchronization model that extends RO to allow synchronizing sensor nodes to multiple mutually-synchronized references, which enhances robustness against node failure and malicious behavior. SRST optimizes convergence time by synchronizing the RO node with its synchronized 1-hop and 2-hop neighbors. RO node applies a new delay threshold-based detection technique to identify reference nodes as MNs through detection of faulty timestamps. SRST is topology-independent and can be applied to multi-tier, cluster-based and flat topologies. We validated SRST through simulations and prototype experiments, comparing its performance with several state-of-the-art protocols. The results demonstrate that SRST outperforms existing protocols in accuracy, achieving synchronization within less than <span><math><mrow><mn>1</mn><mspace></mspace><mi>μ</mi><mi>s</mi></mrow></math></span>, and accelerates convergence time by a factor of 31.25 compared to the best-known protocol. SRST has also been shown to be more effective in mitigating faulty timestamp injection attacks, successfully detecting errors of <span><math><mrow><mn>6</mn><mspace></mspace><mi>μ</mi><mi>s</mi></mrow></math></span> with a 100% success rate and ensuring that the clocks of any two nodes do not deviate by more than <span><math><mrow><mn>6</mn><mspace></mspace><mi>μ</mi><mi>s</mi></mrow></math></span>. Furthermore, the results indicate that SRST imposes little communication overhead.</div></div>","PeriodicalId":55555,"journal":{"name":"Ad Hoc Networks","volume":"169 ","pages":"Article 103749"},"PeriodicalIF":4.4,"publicationDate":"2025-01-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143138178","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":"Distributed topology control of multiple ISAC-UAVs for mobile search teams in unknown 3-D terrains","authors":"Xijian Luo,&nbsp;Jun Xie,&nbsp;Liqin Xiong,&nbsp;Yaqun Liu,&nbsp;Yuan He","doi":"10.1016/j.adhoc.2025.103753","DOIUrl":"10.1016/j.adhoc.2025.103753","url":null,"abstract":"<div><div>In emergency communication scenarios, the deployment of multiple unmanned aerial vehicles (UAVs) can rapidly provide communication coverage and restore network connectivity. Though existing research has paid attention to the issue of maintaining connectivity in multi-UAV networks, there are still some problems that have not been fully addressed. This paper investigates the scenario of deploying multiple UAVs with integrated sensing and communications (ISAC) abilities to provide data collection and communication coverage services for ground mobile users in a search mission. The aim is to maximize the sum of data collected from all users and minimize the adjustment cost of the UAV network while ensuring Backbone network connectivity during the search. By modeling the effect of 3-D terrains, the simulation environment presented in this paper is more realistic. Moreover, this paper assumes that the terrain within the search area is unknown, thus the search trajectory of the mobile user is also unknown. As a consequence, centralized methods are infeasible. Accordingly, this paper proposes a distributed dynamic adjustment scheme, named QoS-Connectivity-Guaranteed Distributed Adjustment (QCDA), to ensure both quality of service and network connectivity. The efficiency of the proposed scheme is validated through simulations, and its performance in terms of data collection, communication satisfaction ratio, the number of active UAVs as well as the adjustment cost of the UAV network is better than the baselines.</div></div>","PeriodicalId":55555,"journal":{"name":"Ad Hoc Networks","volume":"169 ","pages":"Article 103753"},"PeriodicalIF":4.4,"publicationDate":"2025-01-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143138175","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 intelligent forecasting system in Internet of Agriculture Things sensor network","authors":"Rashmita Sahu,&nbsp;Priyanka Tripathi","doi":"10.1016/j.adhoc.2024.103752","DOIUrl":"10.1016/j.adhoc.2024.103752","url":null,"abstract":"<div><div>Irrigation refers to the process of supplying water to the soil via pumps and spraying water across the field. In conventional agriculture, the installation and operation of an irrigation system depend exclusively on the farmers' knowledge. The Food and Agriculture Organisation (FAO) has forecasted that by 2030, emerging nations will increase their irrigated areas by 34 %, although water use will rise by only 14 %. Thus, the necessity of constantly monitoring water flow and volume, rather than depending on people's approximations, is highlighted by this variation. Therefore, this research proposes an efficient prediction system for intelligent irrigation in the Internet of Agriculture Things (IoAT) sensor network. In the initial phase of the suggested approach, agricultural sensor data is transmitted to the total variation regularisation in the alternate direction method of multipliers (ADMM) way to mitigate the adverse effects caused by noisy samples. Subsequently, probabilistic clustering is utilised to address the missing entries. During the second phase of the suggested algorithm, the Lagrangian L1 point is extracted from the sensory data, which is followed by the extraction of the maximum plausible row used for forecasting. The experimental evaluation is conducted on the massive amount of agriculture sensor data sets and cross-validation using several matrices proves its efficacy over competing approaches.</div></div>","PeriodicalId":55555,"journal":{"name":"Ad Hoc Networks","volume":"169 ","pages":"Article 103752"},"PeriodicalIF":4.4,"publicationDate":"2025-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143138173","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":"Capacity and delay analysis of multi-hop wireless networks","authors":"Jan Laarhuis ,&nbsp;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}

{"title":"Powering Smart Wireless Implantable Medical Devices: Toward an internet of self-powered intra-body things","authors":"Raffaele Guida ,&nbsp;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}

{"title":"Performance analysis of LoRaWAN underground-to-satellite connectivity: An urban underground pipelines monitoring case study","authors":"Kaiqiang Lin ,&nbsp;Muhammad Asad Ullah ,&nbsp;Lei Lei ,&nbsp;Hirley Alves ,&nbsp;Konstantin Mikhaylov ,&nbsp;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}

{"title":"Attack from malicious access points in cell-free massive MIMO systems: Performance analysis and countermeasure","authors":"Lei Sun,&nbsp;Ruiguang Wang,&nbsp;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}

{"title":"Distributed Detecting of Critical Nodes for Maximization of Connected Components in Wireless Multi-hop Networks","authors":"Onur Ugurlu ,&nbsp;Nusin Akram ,&nbsp;Yesim Aygul ,&nbsp;Vahid Khalilpour Akram ,&nbsp;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}

{"title":"A schedulability-aware routing algorithm for time sensitive network based on improved ant colony algorithm","authors":"Yi Guo,&nbsp;Feng Luo,&nbsp;Zitong Wang,&nbsp;Yingpeng Tong,&nbsp;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}

{"title":"Energy-efficient collaborative task offloading in multi-access edge computing based on deep reinforcement learning","authors":"Shudong Wang,&nbsp;Shengzhe Zhao,&nbsp;Haiyuan Gui,&nbsp;Xiao He,&nbsp;Zhi Lu,&nbsp;Baoyun Chen,&nbsp;Zixuan Fan,&nbsp;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}