Search

Delay tolerant networks (DTNs) is a network evolved from mobile networks. Differing from the traditional network, which has a stable end‐to‐end transmission path, DTNs are sparse and intermittently connected mobile ad hoc network, which are widely used in harsh environments, such as battlefields, seabed, space communication networks, and so on. In DTNs, intermittent connectivity, partitioned network, long delays and node mobility characteristics make the network fail to communicate frequently, therefore, how to successfully forward the message is of extreme importance. Up to now, almost all the traditional models in DTNs use the store‐carry‐forward method. This paper proposes a novel clustered DTN routing model based on sensing node relationship strength. The routing mechanism takes advantage of the number of other nodes encountered by the nodes in the process of movement and the changes in the number of nodes to calculate the strength of the relationship between nodes, and clusters DTN routing according to the strength of the relationship between nodes. Moreover, the relationship between nodes in a cluster and other clusters is used to transmit messages between clusters, and messages are transmitted within clusters according to the strength of the relationship between nodes. Simulation results show that the routing mechanism not only increases the success rate of message transmission, but also reduces the transmission delay of messages and improves network performance. [ABSTRACT FROM AUTHOR]

In unmanned aerial vehicle ad‐hoc network (UANET), the node speed of unmanned aerial vehicles (UAVs) may reach up to 400 km/h. The fast or slow movement of UAV nodes leads to different speeds of topology change of the nodes. Traditional optimized link state routing (OLSR) protocol cannot adaptively adjust the routing update period when the network topology changes, which may lead to the nodes calculating incorrect routing tables. This increases the average end‐to‐end delay and packet loss rate for packet transmission. To enhance the adaptability of OLSR routing protocol to network topology changes, this paper proposes a multi‐agent independent deep deterministic policy gradient‐OLSR (MA‐IDDPG‐OLSR) routing protocol based on distributed multi‐agent reinforcement learning. The protocol deploys DDPG algorithm on each UAV node, and each UAV node adaptively adjusts the Hello and TC message sending intervals, according to the one‐hop neighbouring nodes as well as its own state. Simulation results show that the proposed protocol is able to improve the throughput and reduce the packet loss rate as compared to traditional AODV, GRP, OLSR, and distributed multiple‐agent independent proximal policy optimization‐OLSR (MA‐IPPO‐OLSR), distributed multiple‐agent independent twin delayed deep deterministic policy gradient‐OLSR (MA‐ITD3‐OLSR) routing protocols. Since MA‐IDDPG‐OLSR relies only on local information, there is a minor performance degradation in MA‐IDDPG‐OLSR compared to centralized single‐agent DQN‐OLSR routing protocol. But it is more suitable to a completely distributed UAV network without a centralized node. [ABSTRACT FROM AUTHOR]

Ultraviolet technology has a wide range of applications in military and civilian fields, such as space detection, ultraviolet light guidance, ultraviolet interference, corona discharge detection and military communications. Starting from the single and multiple scattering of ultraviolet light, this paper first introduces the progress of ultraviolet optical communication at home and abroad. Then it analyzes the different links in ultraviolet optical communication. Next, it discusses the pulse broadening effect and atmospheric turbulence of ultraviolet communication in non-direct link ultraviolet communication. Finally, the paper summarizes the ultraviolet Ad Hoc network, and shows the trend of the development of ultraviolet optical communication. [ABSTRACT FROM AUTHOR]

Quality of Service (QoS) is a crucial aspect of Mobile Ad Hoc Networks (MANET) that needs examination to demonstrate optimal performance. The scientific community is increasingly concerned with the challenge of developing an energy-aware clustering method for MANETs. This is owing to the fact that the battery-operated sensor devices that form the backbone of these wireless networks cannot be recharged. The selection of a cluster's leader is a difficult problem in MANET. Additionally, the research focuses on Optimal Route Selection (ORS) within the MANET context, acknowledging the significance of establishing efficient communication paths between cluster heads and member nodes. Through the integration of a reliability pair factor and node energy considerations, the proposed ORS algorithm generates optimal paths based on maximizing energy efficiency while minimizing the sum of hops between nodes. The study suggests a new algorithm based on the way waterwheel plants move and change their places as they explore and exploit new territory in the quest for food. The suggested method is named Binary Waterwheel Plant Algorithm (BWPA). In this method, a novel model is used to represent both the binary search space and the mapping from continuous to discrete spaces. Particularly, mathematical models of the fitness and cost functions used by the algorithm are constructed. Through the use of a reliability pair factor and node energy, the proposed research paper on Optimal Route Selection (ORS) generates the optimal path between the cluster head and member node and establishes the path based on the maximum energy and sum of hops among the nodes. By fusing the reactive power of differential evolution with the exhaustive search efficiency of the BWPA, the proposed method extends the life of networks. The recommended method increases node lifetime by compounding the dynamic capabilities of discrepancy evolution with the high effectiveness of search. [ABSTRACT FROM AUTHOR]

The field of wireless communication has undergone revolutionary changes driven by technological advancements in recent years. Central to this evolution is wireless ad hoc networks, which are characterized by their decentralized nature and have introduced numerous possibilities and challenges for researchers. Moreover, most of the existing Internet of Things (IoT) networks are based on ad hoc networks. This study focuses on the exploration of interference management and Medium Access Control (MAC) schemes. Through statistical derivations and systematic simulations, we evaluate the efficacy of guard zone-based MAC protocols under Rayleigh fading channel conditions. By establishing a link between network parameters, interference patterns, and MAC effectiveness, this work contributes to optimizing network performance. A key aspect of this study is the investigation of optimal guard zone parameters, which are crucial for interference mitigation. The adaptive guard zone scheme demonstrates superior performance compared to the widely recognized Carrier Sense Multiple Access (CSMA) and the system-wide fixed guard zone protocol under fading channel conditions that mimic real-world scenarios. Additionally, simulations reveal the interactions between network variables such as node density, path loss exponent, outage probability, and spreading gain, providing insights into their impact on aggregated interference and guard zone effectiveness. [ABSTRACT FROM AUTHOR]

In the contemporary environment, mobile ad hoc networks (MANETs) have become necessary. They are absolutely vital in a variety of situations, where setting up a network quickly is required; however, this is infeasible due to low resources. Ad hoc networks have many applications: education, on the front lines of battle, rescue missions, etc. These networks are distinguished by high mobility and constrained computing, storage, and energy capabilities. The main aim of this research is to create a method for identifying blackhole attacks through anomaly detection techniques utilizing Support Vector Machines (SVM). Our detection system looks at node activity to scan network traffic for irregularities. In blackhole scenarios, the attackers exhibit distinct behavioral characteristics that distinguish them from other nodes. This can be efficiently detected by the proposed SVM-based detection system. The proposed detection system is designed to analyze network traffic and identify anomalies by examining node behaviors. Specifically, in the context of blackhole threats, it distinguishes the attackers from normal nodes based on behavioral characteristics. Using this approach, the system effectively detects blackhole attacks. The results demonstrate a very high level of accuracy in detecting blackhole attacks, confirming its efficacy in ensuring the security of mobile ad hoc networks (MANETs) by identifying and isolating malicious nodes. This solution is particularly valuable in scenarios like military operations and disaster management where a reliable communication system is crucial. Furthermore, the proposed detection method, ADS-SVM, was compared to two other methods (J48 classifier and NB classifier) from different researchers. The results indicate that ADS-SVM outperforms the other methods with a detection accuracy of 99.96%, surpassing the 99.2% achieved by J48 classifier and the 96.5% achieved by NB classifier. The results indicate that ADS-SVM is a highly efficient approach for identifying blackhole attacks in MANETs, potentially offering superior accuracy compared to other related methods. [ABSTRACT FROM AUTHOR]

One of the significant challenges of the Radio over fibre (RoF) Medium Access Control (MAC) protocol is the propagation delay. This delay can lead to serious issues, such as higher propagation delay resulting in collisions and unnecessary retransmissions. Quantum entanglement is an excellent candidate to overcome the propagation delay of the RoF MAC protocol. A new quantum MAC protocol is proposed, named the Quantum Entanglement‐based MAC protocol (QE‐MAC), in which Quantum Teleportation is utilised to address the propagation delay. Four entanglement states are employed to represent the control packets of the classical MAC protocol, and data is transmitted over the classical channel. Instead of using control packets such as acknowledgement, request to send, and Clear to send, state transitions are employed. This approach avoids the delay and collision issues associated with control packets, resulting in a significant improvement in network performance. The delay, duty cycle (DC), and power consumption of the proposed QE‐MAC protocol are formulated and derived. The protocol is evaluated in terms of delay, DC, and power consumption, demonstrating superior performance compared to the classical RoF MAC protocol. In comparison to published works, our proposed approach has successfully reduced both delay and power consumption by 35%. [ABSTRACT FROM AUTHOR]

The escalating issue of forest fires poses severe risks to ecosystems and human habitats, primarily due to the greenhouse effect and sudden climate changes. These fires, mostly occurring naturally, necessitate prompt detection and control. Addressing this, the authors introduce the Forest Fire Detection, Prediction, and Behaviour Analysis (FDPA) system, an innovative Internet of Things (IoT) solution. The FDPA system leverages a wireless sensor network to efficiently detect and analyse fire behaviour, providing real‐time data on fire spread, speed, and direction. Uniquely, it can anticipate natural fires hours before they occur by monitoring ecological parameters such as humidity, temperature, and using the Chandler Burning Index (CBI) for quantifying fire danger. Designed for the challenging forest environment, the FDPA system prioritises minimal power usage and simple components, crucial in areas with limited power resources. Its resilient design ensures the wireless sensor network and sensor nodes withstand harsh weather and fire conditions, maintaining functionality and reliability. Field tests of the FDPA system in various Jordanian forest locations, including Burgish–Ajloun, have demonstrated its effectiveness. The trials revealed the system's capability in early fire detection, low latency response, predicting fire behaviour, and determining fire spread direction. Continuous monitoring of the forest ecosystem and rapid detection allow authorities to act swiftly, preventing potential fires from escalating. Furthermore, the system tracks ecological changes within the forest, offering insights into imminent natural fires. This feature enables proactive measures to mitigate fire spread, safeguarding the environment and nearby communities. The strategic placement of sensor nodes and the use of durable yet straightforward components reduce the risk of system damage due to environmental extremities. Overall, the FDPA system emerges as a promising tool for forest fire management. Its ability to detect, predict, and analyse forest fires in real‐time positions it as a vital asset in minimising the detrimental impacts of forest fires on the environment and human settlements. [ABSTRACT FROM AUTHOR]

Clustering algorithm is the primary technology used in target clustering and group status analysis which are key features of the Unmanned Aerial Vehicles (UAVs) control system. Due to variable application environment, the stability of the algorithm in the UAVs control system needs to be considered. K‐means clustering is a widely used method in intelligent systems. However, K‐means algorithm is susceptible to the local optimum due to the influence of the initial centroid. For this problem, the predecessors have proposed various effective solutions. These algorithms perform better on real and large‐scale datasets, but they are unable to achieve optimum results with unbalanced datasets. Herein, a simpler and more effective algorithm for seed initialization is proposed, it has a better accuracy rate than the alternative algorithms.Moreover, after running tests multiple times with each algorithm independently, it has the highest stability and the lowest overall volatility. With unbalanced datasets, the proposed algorithm performs significantly better than several other algorithms and therefore can solve the problems that other algorithms have with unbalanced datasets. [ABSTRACT FROM AUTHOR]

Poisson multi‐Bernoulli Mixture (PMBM) filter has been known as an available or practical point and multiple extended target tracking (METT) method. The authors present an improved PMBM filter with adaptive detection probability and adaptive newborn distributions, accompanying with an associated distributed fusion strategy for the tracking extended multiple targets. First, the augmented state of unknown and changing target detection probability is assumed as Gamma (GAM) distribution. Second, extended states are described by Inverse Wishart (IW) distribution based on this augmented state, accompanying with dynamic states presented by Gaussian distribution. And then, an adaptive newborn distribution is adopted to describe the newborn targets appearing arbitrarily. Consequently, the closed‐form solutions of the proposed filter can be derived by approximating the intensity of newborn and potential targets to the Gamma Gaussian Inverse Wishart (GGIW) form. Moreover, the fused means that Generalised Covariance Intersection (GCI) is performed in such a large‐scale aquaculture sensor network. Experiments are presented to verify the availability of the GCI‐GGIW‐PMBM method, and comparisons with other METT filters also demonstrate that tracking behaviours are improved largely. [ABSTRACT FROM AUTHOR]

We consider the problem of meeting deadline constraints in wireless communication networks. Fulfilling deadlines depends heavily on the routing algorithm used. We study this dependence generically for a broad class of routing algorithms. For analyzing the impact of routing decisions on deadline fulfillment, we adopt a stochastic model from operations research to capture the source-to-destination delay distribution and the corresponding probability of successfully delivering data before a given deadline. Based on this model, we propose a decentralized algorithm that operates locally at each node and exchanges information solely with direct neighbors in order to determine the probabilities of achieving deadlines. A modified version of the algorithm also improves routing tables iteratively to progressively increase the deadline achievement probabilities. This modified algorithm is shown to deliver routing tables that maximize the deadline achievement probabilities for all nodes in a given network. We tested the approach by simulation and compared it with routing strategies based on established metrics, specifically the average delay, minimum hop count, and expected transmission count. Our evaluations encompass different channel quality and small-scale fading conditions, as well as various traffic load scenarios. Notably, our solution consistently outperforms the other approaches in all tested scenarios. [ABSTRACT FROM AUTHOR]

The OSI model used to be a common network model for years. In the case of ad hoc networks with dynamic topology and difficult radio communications conditions, gradual departure is happening from the classical kind of OSI network model with a clear delineation of layers (physical, channel, network, transport, application) to the cross-layer approach. The layers of the network model in ad hoc networks strongly influence each other. Thus, the cross-layer approach can improve the performance of an ad hoc network by jointly developing protocols using interaction and collaborative optimization of multiple layers. The existing cross-layer methods classification is too complicated because it is based on the whole manifold of network model layer combinations, regardless of their importance. In this work, we review ad hoc network cross-layer methods, propose a new useful classification of cross-layer methods, and show future research directions in the development of ad hoc network cross-layer methods. The proposed classification can help to simplify the goal-oriented cross-layer protocol development. [ABSTRACT FROM AUTHOR]