Ad Hoc Research Articles

Blockchain-Enabled Trust Management With Location Privacy Preservation in Vehicular Ad Hoc Networks

Blockchain-Enabled Trust Management With Location Privacy Preservation in Vehicular Ad Hoc Networks

Resilience Analysis of Cooperative Mission Based on Spatio–Temporal Network Dynamics for Flying Ad Hoc Network

Resilience Analysis of Cooperative Mission Based on Spatio–Temporal Network Dynamics for Flying Ad Hoc Network

Decentralized Routing and Radio Resource Allocation in Wireless Ad Hoc Networks via Graph Reinforcement Learning

Decentralized Routing and Radio Resource Allocation in Wireless Ad Hoc Networks via Graph Reinforcement Learning

Energy-Efficiency Optimization With Model Convexification for Wireless Ad Hoc Networks With Multi-Packet Reception Capability

Energy efficiency is a significant requirement of resource management and design optimization in information networks. In this work, we propose an iterative fractional programming framework embedded with a distributed primal-dual extra-gradient projection algorithm, which addresses a wide class of the energy-efficiency optimization problems in wireless ad hoc networks with full-duplex radios and multi-packet reception capability. Specifically, we propose a model convexification mechanism by joining an affine transformation and an exponential transformation into the nonlinear fractional programming, which enables us to deal with the challenge arising from the complexity and non-convex structure of the original problem. With the model convexification, we can map the non-convex power control space into a convex space and equivalently derive a sequence of convex subproblems, which relaxes the convexity assumption widely adopted in the existing literature. We further propose a distributed primal-dual algorithm based on extra-gradient projection to solve the convex subproblem at each iteration of the fractional programming. The convergence of the proposed iterative fractional programming and the distributed optimization method is theoretically proven. Numerical results also verify the proposed method and demonstrate its superior performance over other representative distributed and centralized schemes in terms of achieving global energy efficiency.

Intelligent Routing in Directional Ad Hoc Networks Through Predictive Directional Heat Map From Spatio-Temporal Deep Learning

By applying a simple shortest/minimum-cost routing algorithm, the mobile ad-hoc network (MANET) with heavy data transmissions may be easily congested if multiple routing paths meet at the same relay node. A path may be unable to provide high throughput since some of its path nodes are helping other paths to forward the heavy traffic. Therefore, those busy nodes should be avoided when a new path is to be established. The task of optimal path seeking becomes more challenging when a MANET is equipped with directional antennas that may cause directional interference with neighboring receivers. The motivation of our research is to build an intelligent proactive routing scheme for MANETs with directional antennas. Our directional routing protocol considers not only the global traffic distribution in different areas of the MANET, but also the properties of directional antennas. It uses spatio-temporal deep learning algorithm to predict the next-time snapshot of directional heat map (DHM), which shows the traffic density distribution in each network location as well as the coverage of each directional antenna. Such a DHM will be used to identify the optimal path that can avoid congested areas as well as the interference from all neighboring directional links. Furthermore, an optimization algorithm is designed to perform optimal path selection. It is able to automatically split a single path into multiple ones that later on get converged again into one path, if the path needs to go around a congested area. Therefore, our routing scheme achieves better quality-of-service (QoS) performance than traditional routing mechanisms such as AODV and OLSR.

Dynamic Spectrum Management and Routing Solutions for Multi-Radio Mobile Ad Hoc Networks

Dynamic Spectrum Management and Routing Solutions for Multi-Radio Mobile Ad Hoc Networks

Home Sweet Home: Setting the Best Thriving Conditions for the Ad Hoc Engineered Microbial Consortium in the Zero Mile System

Wastewaters from household appliances, such as dishwashers and washing machines, are an untapped resource of recoverable water and/or nutrients. The Zero Mile system has been developed to reuse/upcycle dishwasher wastewaters through bioremediation activity carried out by an ad hoc engineered phototrophic/heterotrophic microbial consortium. The choice of both suitable microorganisms for engineering consortia and detailed knowledge on their structure, behaviour and interaction are essential to optimising consortium culture conditions and drive the biofilter container design (structure and topology). To these aims, the effect of abiotic conditions (i.e., irradiance, pH and organic load) on the microbial consortium growth and its capability to survive and thrive in different dishwasher wastewater dilutions have been evaluated. At the same time, the crucial interplay between biological and design research has allowed us to define the characteristics of the biofilter container and plan its development for the industrial application of the Zero Mile system, bringing sustainability benefits as it moves household wastewater from a traditional linear model to a more sustainable, circular approach.

Damage tolerance analysis of double strap joints with composite adherends

ABSTRACT Damages in composite structures are typically repaired using external bonded patches. In this work, the damage tolerance within external patches is studied using double strap joint (DSJ) with carbon fibre reinforced plastic (CFRP) specimens. The damage tolerance in this work refers to bond-line manufacturing-related defects such as debond or dry area. Both intact and pre-cracked DSJ specimens are numerically analysed using experiments for comparisons. DSJ specimens’ adherends were CFRP laminates with AS4/3501–6 plies and bonded using adhesive film FM 300–2. The pre-cracked specimens are monitored during experiments using high-speed digital image correlation to visualize damage propagation. The unsymmetric pre-crack influences in a clear way as shown by experiments. The numerical analyses reveal the effect of failure mechanisms on final failure and the maximum force during a test. The included parametric sensitivity analysis is performed using statistical methods. The normally distributed parameters are sampled using separate distributions for each analysed interface and fracture mode. UNCLASSIFIED Based on Foreground Information under EDA Contract No B.PRJ.RT.670 covering the Ad Hoc Project entitled ”PATCHBOND II”.

Equivalencies Between Ad Hoc Strategies and Multivariate Models for Meta-Analysis of Dependent Effect Sizes

Meta-analyses of educational research findings frequently involve statistically dependent effect size estimates. Meta-analysts have often addressed dependence issues using ad hoc approaches that involve modifying the data to conform to the assumptions of models for independent effect size estimates, such as by aggregating estimates to obtain one summary estimate per study, conducting separate analyses of distinct subgroups of estimates, or combinations thereof. We show that these ad hoc approaches correspond exactly to certain multivariate models for dependent effect sizes. Specifically, we describe classes of multivariate random effects models that have likelihoods equivalent to those of models for effect sizes that have been averaged by study, classified into subgroups, or both. The equivalencies also apply to robust variance estimation methods.

Blockchain-Based Trust Management Model for Vehicular Ad Hoc Networks

Blockchain-Based Trust Management Model for Vehicular Ad Hoc Networks

A Review of Power Management Approaches for Mobile Ad Hoc Networks

A Review of Power Management Approaches for Mobile Ad Hoc Networks

A Reliable Transmission on Cluster Based Wireless Ad Hoc Network with Adaptive Negotiations Using Vector Assisted Energy Efficient Dynamic Opportunistic Routing Mechanism

A Reliable Transmission on Cluster Based Wireless Ad Hoc Network with Adaptive Negotiations Using Vector Assisted Energy Efficient Dynamic Opportunistic Routing Mechanism

Ad Hoc Transactions through the Looking Glass: An Empirical Study of Application-Level Transactions in Web Applications

Many transactions in web applications are constructed ad hoc in the application code. For example, developers might explicitly use locking primitives or validation procedures to coordinate critical code fragments. We refer to database operations coordinated by application code as ad hoc transactions . Until now, little is known about them. This paper presents the first comprehensive study on ad hoc transactions. By studying 91 ad hoc transactions among eight popular open-source web applications, we found that (i) every studied application uses ad hoc transactions (up to 16 per application), 71 of which play critical roles; (ii) compared with database transactions, concurrency control of ad hoc transactions is much more flexible; (iii) ad hoc transactions are error-prone—53 of them have correctness issues, and 33 of them are confirmed by developers; and (iv) ad hoc transactions have the potential for improving performance in contentious workloads by utilizing application semantics such as access patterns. Based on these findings, we discuss the implications of ad hoc transactions to the database research community.

Optimizing Multichannel Path Scheduling in Cognitive Radio Ad Hoc Networks using Differential Evolution

One important area of study in cognitive radio ad hoc networks is multi-channel path scheduling. Cognitive radio networks have trouble communicating and using the spectrum effectively because of weather and dispersion. Optimizing multichannel path scheduling enhances network performance and reliability in a cognitive radio ad hoc net. The Optimizing Multichannel Path Scheduling (OMPS) model methodically tackles various scheduling problems. For the OMPS model, this domain is new. It effectively resolves multichannel path scheduling. The computer method used in the study is called Differential Evolution. During optimization, several factors are carefully considered, including Channel Fade Margin, Cross-Correlation and Coherence Time, Spectral Efficiency, Interference Level, Power Consumption, Retransmission Rate, Access Probability, and Propagation Delay. To increase the scheduling efficiency of the DE algorithm, many steps are meticulously planned: initialization, mutation, crossover, fitness evaluation, selection for iteration evolution, and termination. Latency, Packet Delivery Ratio (PDR), Spectrum Utilization, Interference Level, Energy Efficiency, and Established Path Success Rate are all assessed by the OMPS model. These indicators assess the effectiveness and dependability of the network. OMPS performs better in crucial simulations than the existing model. The demonstration demonstrates decreased latency for real-time applications, greater packet delivery ratios (PDRs), improved spectrum efficiency, channel interference, energy efficiency, and connection formation odds, as well as increased throughput that enhances network resource utilization. To do this, a variety of multichannel path scheduling situations are simulated.

2023 Acknowledgment of Journal of Virology Ad Hoc Reviewers.

2023 Acknowledgment of Journal of Virology Ad Hoc Reviewers.

An Ideal Concept of Ad Hoc General Election Supervisors to Handle The Code of Ethics

It is crucial to establish a code of ethics for ad hoc General Election observers in order to guarantee the integrity, fairness, and transparency of the democratic process. The objective of this research is to identify and examine the optimal approach for addressing infractions of the Code of Ethics for Ad Hoc General Voter Supervisors. The research employed normative legal research methodology, specifically utilizing a statutory and conceptual approach. An effective approach to addressing violations of the code of ethics for ad hoc general voter supervisors is to withdraw the authority of The General Election Supervisory Agency in handling such violations. This is in accordance with Article 10 of DKPP Regulation Number 3 of 2017, which has been recently amended through Election Organizer Ethics Council (DKPP) Regulation Number 1 of 2021. The amendment establishes a Regional Audit Team at the Regency/City level to conduct inspections and address code of ethics violations committed by ad hoc general voter supervisors.

Centralized multicasting AODV routing protocol optimized for intermittent cognitive radio ad hoc networks

The advancement of wireless technology is affected by Spectrum scarcity and the overcrowding of free spectrum. Cognitive Radio Ad Hoc Networks (CRAHNs) have emerged as a possible solution to both the scarcity and overcrowding challenges of the spectrum. The CRAHNs ensure that the Secondary Users (SUs) do co-exist with Primary Users (PUs) in a non-interfering manner. The SUs access the licensed spectrum opportunistically when they are idle. CRAHNs have many use cases which include intermittent networks here referred to as intermittent CRAHNs (ICRAHNs). For example, the Military (MCRAHNs). MCRAHN is complex and characterized by a dynamic topology which is subject to frequent partitioning and route breakages due to attacks and destruction in combat. This study optimizes the routing protocols for intermittent networks such as the MCRAHNs. ICRAHN routing is a challenge due to the network’s intermittent attribute, which is subject to destruction in the case of MCRAHN which is characterized by frequent link breakages. To better understand the routing in this network scenario, this paper presents two analytic models for the AODV and MAODV protocols based on queuing theory. The analytic models simulate unicast and multicast AODV in terms of factors such as queuing delay, throughput, and network scalability. Numerical analysis shows that MAODV outperforms AODV. Furthermore, the suggested routing protocols' performance was tested using network simulations utilizing the following metrics: throughput, Routing Path delay, Node Relay delay, and Spectrum Mobility delay. The simulation findings suggest that the MAODV protocol outperforms the AODV protocol.

The study of DDPG based spatiotemporal dynamic deployment optimization of Air-Ground ad hoc network for disaster emergency response

In situations where natural disasters damage public communication networks, self-organized emergency communication networks play a vital role as important resources for disaster monitoring and emergency response. Geographical conditions, communication capacity, power availability, terminals’ position changes during disasters, and data volume, on the other hand, have a direct impact on emergency terminals’ effectiveness in disaster monitoring and data processing. As a result, the ability to detect calamities quickly and give real-time reactions suffers. To ensure effective emergency communication coverage when public networks are disrupted, intelligent, rapid and reliable optimization of the spatiotemporal dynamic deployment of Ad Hoc Network (ANET) is crucial for disaster monitoring and emergency response. The Deep Deterministic Policy Gradient (DDPG) method is used in this study to assist the spatiotemporal dynamic deployment of air-ground ANET (AGANET) nodes, including unmanned aerial vehicle (UAV) ANET nodes and ground-based ANET nodes. Its goal is to develop a reliable model for ensuring the deployment of AGANET nodes for multi-terminal disaster monitoring. The paper describes the spatiotemporal dynamic deployment of AGANET nodes and develops a reinforcement learning model. Subsequently, it describes a DDPG reinforcement-based optimization method for the spatiotemporal dynamic deployment of AGANET nodes. Specifically, this method includes a greedy matching strategy based on real-time environmental information of AGANET nodes and ground-based sensing terminals, a DDPG AGANET node three-dimensional initialization algorithm, and a DDPG dynamic solution algorithm for spatiotemporal dynamic deployment reinforcement learning model of AGANET. AGANET nodes and ground-based sensing terminals can all work together in this way to provide high-quality emergency AGANET services. When compared to traditional methods, it offers better communication dependability, enhanced efficiency, and cheaper costs associated with building emergency networks. It is also crucial for emergency response in instances where the public network fails.

Dead Past, Ad hocness, and Zombies

Dead Past, Ad hocness, and Zombies

Selecting Optimal Path in Multiple-Path Routing for MANETs Using Fuzzy Cost

Background/ Objectives: Mobile Ad Hoc Networks (MANETs) consists of a set of nodes, where the nodes tend to change their positions time to time because of their infrastructure less characteristic. In MANETs, the protocol that is considered to be the appropriate for constructing an efficient route is AODV. Broadcast storm is another approach that can be used for establishing a path between the sender and receiver. Due to the concerns related to contention and collision, broadcast is not considered as an efficient mechanism for path selection. Though the aim of broadcasting is to minimize the flooding other issues like bandwidth consumption, collision and contention cannot be controlled. Since MANETs are associated with inadequate bandwidth, the approach of broadcasting is not efficient. Multipath routing approach permits in constructing multiple paths between the communicating nodes (sender and receiver). This approach is complicated due to the problem of node mobility in MANETs. The other paths available are not reliable because of the ad hoc nature of MANETs. The intention is to design a fuzzy controller that assists in reducing the reconstruction of paths using fuzzy cost assigned to each node in the network. Methods: The concept of this paper is to establish an optimal path from sender node to the receiver node from the available multiple paths in MANETs. The path established in this approach uses fuzzy cost. Fuzzy measure is the criteria used for establishing a path. The concept ImRMR used in this paper has been included with few improvements. The basic functionality of ImRMR is that paths are classified based on rank fitness. The proposal is to classify the paths based on its fuzzy cost. This fuzzy cost classifies the paths fitness. Findings: The proposed fuzzy cost approach discussed in this study is compared with On-Demand Multicast Routing Protocol (ODMRP). The result exhibits that the proposed method works better under differing conditions like traffic load, transmission range between nodes and also considers node mobility. The proposed mechanism with inclusion of fuzzy cost shows 5% energy efficiency, reduces the collisions by about 35% and throughput is enhanced by 30%. There has been a considerable decrease in the number of queries by 23%. The simulation results indicate that ODMRP with fuzzy cost is more useful and significant. Hence, consideration of fuzzy cost as a means for selecting an effective route is assumed to be the best. Novelty: This method contributes in reducing the drawbacks of routing approaches whether it is unipath and multi-path approach. The proposed approach changes the value of the attributes for a given route with fuzzy cost. A threshold value will be considered initially and the route having a cost more than the initialized threshold would be advised as the best route. This route would be considered as the efficient route for transmission between the sender and the receiver. Keywords: Uni­path, multiple paths, Fuzzy cost, Fuzzy fitness, Rank fitness