Ad Hoc Networks最新文献

{"title":"Deep learning with synthetic data for wireless NLOS positioning with a single base station","authors":"","doi":"10.1016/j.adhoc.2024.103696","DOIUrl":"10.1016/j.adhoc.2024.103696","url":null,"abstract":"<div><div>Traditional wireless positioning methods exhibit limitations in the face of signal distortions prevalent in non-line-of-sight (NLOS) conditions, especially in the case of a single base station (BS). Moreover, the adoption of deep learning (DL) methodologies has lagged behind, largely due to the challenges associated with generating real-world datasets. In this paper, we present a comprehensive approach leveraging DL over large-scale synthetic wireless datasets (the recent WAIR-D in this case, which was co-produced by Huawei) to overcome such challenges and address the case of single-BS NLOS positioning. The aim of the paper is to practically explore the extent to which synthetic wireless datasets can help to achieve the positioning objectives. Towards this direction, we develop a map-based representation of a radio link, demonstrating its synergistic effect with feature-based representations in MLPs. Furthermore, we introduce a UNet-based neural model which incorporates input maps and radio link representations and generates as output a heatmap of potential device positions. This model achieves an 11.3-meter RMSE and 76.5% prediction accuracy on NLOS examples (1.5-meter, 99.9% for LOS) assuming perfect information, surpassing the MLP baseline by 47%. Finally, we provide further insights into the model’s ability to predict top device positions, the characteristics of predicted heatmaps as indicators of confidence, and the crucial role of map availability and radio path angles in model performance, thus revealing an unconventional perspective on incorrect predictions.</div></div>","PeriodicalId":55555,"journal":{"name":"Ad Hoc Networks","volume":null,"pages":null},"PeriodicalIF":4.4,"publicationDate":"2024-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142593051","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":"Transitive reasoning: A high-performance computing model for significant pattern discovery in cognitive IoT sensor network","authors":"","doi":"10.1016/j.adhoc.2024.103700","DOIUrl":"10.1016/j.adhoc.2024.103700","url":null,"abstract":"<div><div>Current research on the Internet of Things (IoT) has given rise to a new field of study called cognitive IoT (CIoT), which aims to incorporate cognition into the designs of IoT systems. Consequently, the CIoT inherits specific attributes and challenges from IoT. The CIoT applications generate vast, diverse, constantly changing, and time-dependent data due to the billions of devices involved. The efficient operation of these CIoT systems requires the extraction of valuable insights from vast data sources in a computationally efficient manner. Therefore, this study proposes transitive reasoning to glean significant concepts and patterns from a 21.25-year environmental dataset. To reduce the effects of missing entries, the proposed methodology includes a grouping of data using probabilistic clustering and applying total variance regularization in the alternate direction method of multipliers (ADMM) to regularize the sensory data. As a result, noisy entries will be less conspicuous. Afterward, it calculates the transitional plausibility value for each cluster using the transited value and then turns it into binary data to create concept lattices. In addition, each concept that is formed is assigned a weight, and the concept with the largest transitive strength value is chosen, followed by calculating the mean value. Therefore, this pattern is seen as significant. Experimental results on 21.25-year environmental data show an accuracy of over 99.5%, outperforming competing methods, as shown by cross-validation using multiple metrics.</div></div>","PeriodicalId":55555,"journal":{"name":"Ad Hoc Networks","volume":null,"pages":null},"PeriodicalIF":4.4,"publicationDate":"2024-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142577912","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":"BLE-based sensors for privacy-enabled contagious disease monitoring with zero trust architecture","authors":"","doi":"10.1016/j.adhoc.2024.103693","DOIUrl":"10.1016/j.adhoc.2024.103693","url":null,"abstract":"<div><div>Digital contact tracing is an important technique to stop the spread of infectious diseases. Due to data integrity, and privacy problems, smartphone apps suffer from low adoption rates. Also, these apps excessively drain batteries and sometimes give false alarms. They are also not able to detect <em>fomite-based</em> contacts or <em>indirect</em> contacts. BEacon-based Contact Tracing or BECT is a contact tracing framework that uses Bluetooth beacon sensors that periodically broadcast “tokens” to close users. Users who are positively diagnosed voluntarily provide their tokens to the health authority-maintained server for tracing contacts. We target environments like campuses like companies, colleges, and prisons, where use can be mandated thus mitigating low adoption rate issues. This approach detects indirect contacts and preserves the device’s battery. We create a simulation to examine the proposed framework’s performance in detecting indirect contacts and compare it with the existing apps’ framework. We also analyze the cost and power consumption for our technique and assess the placement strategies for beacons. Incorporating Zero Trust Architecture enhances the framework’s security and privacy.</div></div>","PeriodicalId":55555,"journal":{"name":"Ad Hoc Networks","volume":null,"pages":null},"PeriodicalIF":4.4,"publicationDate":"2024-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142577911","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":"ADRP-DQL: An adaptive distributed routing protocol for underwater acoustic sensor networks using deep Q-learning","authors":"","doi":"10.1016/j.adhoc.2024.103692","DOIUrl":"10.1016/j.adhoc.2024.103692","url":null,"abstract":"<div><div>Underwater Wireless Sensor Networks (UWSNs) face unique constraints due to their unstructured and dynamic underwater environment. Data gathering from these networks is crucial as energy resources are limited. In this regard, efficient routing protocols are needed to optimize energy consumption, increase the network lifetime, and enhance data delivery in these networks. In this work, we develop an Adaptive Distributed Routing Protocol for UWSNs using Deep Q-Learning (ADRP-DQL). This protocol employs the ability of reinforcement learning to dynamically learn the best routing decisions based on the network’s state and action-value estimates. It allows nodes to make intelligent routing decisions, considering residual energy, depth and node degree. A Deep Q-Network (DQN) is employed as the function approximator to estimate action values and choose the optimal routing decisions. The DQN is trained using off-policy and on-policy strategies and the neural network model. Simulation results demonstrate that ADRP-DQL performs well regarding energy efficiency (EE), data delivery ratio, and network lifetime. The results highlight the proposed protocol’s effectiveness and adaptability to UWSNs. The ADRP-DQL protocol contributes to intelligent routing for UWSNs, offering a promising approach to enhance performance and optimize energy utilization in these demanding environments.</div></div>","PeriodicalId":55555,"journal":{"name":"Ad Hoc Networks","volume":null,"pages":null},"PeriodicalIF":4.4,"publicationDate":"2024-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142573352","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 context-aware zero trust-based hybrid approach to IoT-based self-driving vehicles security","authors":"","doi":"10.1016/j.adhoc.2024.103694","DOIUrl":"10.1016/j.adhoc.2024.103694","url":null,"abstract":"<div><div>With the speedy progression and adoption of IoT devices in modern self-driving vehicles (SDVs), autonomous driving industry is gradually reforming its capabilities to provide better transportation services. However, this domain faces enormous security and privacy challenges and thus has become an attractive target for attackers due to its rapid growth and market worth. Furthermore, the rapid transformation in technological tools in transport industry and speedy evolution of cyber-attacks paved the way for designing efficient IDSs. Motivated by these challenges, we put forward a new secure and efficient IDS approach for the security of SDVs. The propose approach utilizes an emerging strategy to mitigate security vulnerabilities and cyber attacks detection using zero trust (ZT) model. Through this work, we put forward a context-aware zero trust security framework for IoT-based SDVs. The proposed framework utilizes a context-aware design to evaluate the trustworthiness of the devices using multi-source trust and reputation model. Then, to make the framework more effective and reliable, we introduce crawler system into the context of the IoT-devices in SDVs to make the system unbiased. Additionally, an observer module is developed that employs state-of-the-art machine learning algorithm to detect malicious actions. Empirical results on two standard benchmark datasets (i.e., Car Hacking and ToN_IoT) validate the practicality and robustness of propose framework in real-world transport systems with enhanced security and trust management against evolving cyber-threats. Detection results demonstrate that the proposed framework secured the best performance by achieving 99.43% and 99.52% accuracy for Car Hacking and ToN_IoT, respectively. The findings of this study will help the security professionals and researchers to comprehend the importance of ZT architecture in developing effective and robust security solutions for modern IoT-based SDVs.</div></div>","PeriodicalId":55555,"journal":{"name":"Ad Hoc Networks","volume":null,"pages":null},"PeriodicalIF":4.4,"publicationDate":"2024-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142573353","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":"Indoor localization algorithms based on Angle of Arrival with a benchmark comparison","authors":"","doi":"10.1016/j.adhoc.2024.103691","DOIUrl":"10.1016/j.adhoc.2024.103691","url":null,"abstract":"<div><div>Indoor localization is crucial for developing intelligent environments capable of understanding user contexts and adapting to environmental changes. Bluetooth 5.1 Direction Finding is a recent specification that leverages the angle of departure (AoD) and angle of arrival (AoA) of radio signals to locate objects or people indoors. This paper presents a set of algorithms that estimate user positions using AoA values and the concept of the Confidence Region (CR), which defines the expected position uncertainty and helps to remove outlier measurements, thereby improving performance compared to traditional triangulation algorithms. We validate the algorithms with a publicly available dataset, and analyze the impact of body orientation relative to receiving units. The experimental results highlight the limitations and potential of the proposed solutions. From our experiments, we observe that the Conditional All-in algorithm presented in this work, achieves the best performance across all configuration settings in both line-of-sight and non-line-of-sight conditions.</div></div>","PeriodicalId":55555,"journal":{"name":"Ad Hoc Networks","volume":null,"pages":null},"PeriodicalIF":4.4,"publicationDate":"2024-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142553422","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":"A general task offloading and resources allocation strategy for multi-RSUs with load unbalance and priority awareness","authors":"","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":null,"pages":null},"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":"","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":null,"pages":null},"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":"","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":null,"pages":null},"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":"EDRP-GTDQN: An adaptive routing protocol for energy and delay optimization in wireless sensor networks using game theory and deep reinforcement learning","authors":"","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":null,"pages":null},"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}