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]

Processing queries in wireless sensor networks causes quality of service challenges such as data latency and validity. In fact, this paper is going to shed light on identifying the right trade‐off between latency and the freshness of the data. For this purpose, a fuzzy logic‐based decision‐making system that assigns incoming queries either to the sensor network, where the queries are waiting to be processed into a queue, or a central database which provides stored and potentially stale data or to a cache server which in turn provides acceptable latency and recent data, is provided. Thus, a new rule‐based system decision is introduced, that minimizes the request latency and returns the most recent data. In addition, a comparison between the approach and other work that is restricted to the database server and sensor network with no focus on the caching server is provided. This paper is going to carry on with the theory of Markov Chain which is more complicated compared to the fuzzy logic system. This approach is confirmed in the basis of an experience is developed with python. [ABSTRACT FROM AUTHOR]

Ad hoc networks are a new perspective of wireless communication for versatile hosts. Security is a colossal worry for ad hoc networks, especially for those security-touchy applications. The huge highlights of ad hoc networks cause both difficulties and openings in accomplishing security objectives. One such aim is to consider the assaults from within the system by compromised nodes correspondingly as to consider harmful assaults propelled from outside the system. Designing an Intrusion Detection System (IDS) that suits the security needs and characteristics of ad hoc networks for viable and proficient performance against intrusions is one potential solution to vanquish vulnerabilities. This paper examines a genuine and hurtful attack called, "Malicious Packet Dropping Attack" in the network layer. To secure against this attack, a novel methodology utilizing game theory is proposed. The proposed system monitors the conduct of the neighbor nodes and conquers the demerits such as false positives present in traditional IDS, thereby providing secure correspondence between nodes that communicate with one another to course the traffic from source to destination. With the existence of malicious nodes, the proposed system has accomplished a 42% increase in the packet delivery ratio. [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]

This paper proposes a novel scalable reinforcement learning approach for simultaneous routing and spectrum access in wireless ad-hoc networks. In most previous works on reinforcement learning for network optimization, the network topology is assumed to be fixed, and a different agent is trained for each transmission node—this limits scalability and generalizability. Further, routing and spectrum access are typically treated as separate tasks. Moreover, the optimization objective is usually a cumulative metric along the route, e.g., number of hops or delay. In this paper, we account for the physical-layer signal-to-interference-plus-noise ratio (SINR) in a wireless network and further show that bottleneck objective such as the minimum SINR along the route can also be optimized effectively using reinforcement learning. Specifically, we propose a scalable approach in which a single agent is associated with each flow and makes routing and spectrum access decisions as it moves along the frontier nodes. The agent is trained according to the physical-layer characteristics of the environment using a novel rewarding scheme based on the Monte Carlo estimation of the future bottleneck SINR. It learns to avoid interference by intelligently making joint routing and spectrum allocation decisions based on the geographical location information of the neighbouring nodes. [ABSTRACT FROM AUTHOR]

The Ad Hoc networks solves the problem of quickly establishing a temporary Ad Hoc network without the need for fixed facilities. However, problems such as network performance degradation, delay increase, and link interruption are endless. Aiming at the problem of shortening the survival time of Ad Hoc networks nodes, this paper proposes an improved AODV routing algorithm EC-MAODV (Energy Consumption-Modification AODV) based on energy consumption. EC-MAODV takes energy as the starting point, determines the time extension based on the residual energy of the current node, balance the power consumption of each node, and extends the networks lifetime. The effectiveness of EC-MAODV routing algorithm is proved by network simulator NS-3. The simulation results show that compared with the AODV routing protocol, the algorithm in this paper has more than 7% improvement and 19% increase in average delay and node lifetime. It can effectively prolong the life of the network, reduce the number of dead nodes, effectively solve the energy consumption problem of the wireless Ad Hoc network, and improve the overall performance of the network. [ABSTRACT FROM AUTHOR]

Conflict-Free Replicated Data Types (CRDTs) are data types that can be used in distributed systems when optimistic replication is tolerable. Replicas can be updated locally, without coordination, and consistency is obtained eventually by asynchronously propagating updates among replicas. Because CRDTs can tolerate asynchronous transmissions, they can serve as software elements in opportunistic networks (OppNets), where the dissemination of information is dependent on unplanned transient radio contacts between mobile nodes. In this paper we investigate the problem of implementing operation-based, state-based, and delta-state-based CRDTs in OppNets. A contact-driven synchronization algorithm is proposed for each kind of CRDT, and experiments based on realistic tracesets are conducted in order to compare how these algorithms can perform in an OppNet. Experimental results show that delta-state-based CRDTs globally outperforms operation-based and pure state-based CRDTs, especially when considering the number of messages required to ensure the synchronization of replicas. [ABSTRACT FROM AUTHOR]

Vehicular ad hoc networks consist of self-organizing nodes using multi-hop wireless links for communication without any infrastructure support. Traditionally, ad hoc routing protocols use the minimum hop count for their routing metric since a smaller number of transmissions is typically equivalent to a higher throughput, lower delay, and minimal power consumption. However, with the muti-rate capability of emerging radio interfaces, e.g., 802.11ax/be standards, the min-hop metric no longer results in high throughput. For instance, if the higher data rate links are selected for the route, it could result in a higher throughput even if the route takes more hop counts. In this paper, we propose a high throughput routing scheme, called MARV, which makes two key contributions. MARV searches for high throughput paths using an on-demand route searching algorithm so that the routing overhead is smaller compared to other multi-rate-aware routing schemes. MARV also searches for multiple paths to maintain both min-hop and high-throughput paths to select the adequate path depending on the data packet size. We conduct simulations to demonstrate that MARV outperforms not only min-hop path metrics but also previously proposed high-throughput metrics. [ABSTRACT FROM AUTHOR]

Summary The cluster networking protocols are the roots that embed intelligent decision‐making and enhance the lifespan of wireless sensor networks (WSNs). Wireless sensors with limited capabilities face several challenges due to the heterogeneous application environments. Especially, the mobility‐incorporated sensors in most situations trouble the cluster network's robustness. Many cluster networking protocols have been presented in the past to enhance the network lifespan and data delivery ratio. However, they lack a dedicated and efficient mechanism for mobility assistance, an adequate cluster management process and cluster head selection criteria. To overcome these issues and for the uniform energy load distribution, we propose a mobility‐compatible cache controlled cluster networking protocol (MC‐CCCNP) in this paper. It is an energy‐efficient cluster networking protocol that supports sensor movement. Network resource management and routing are controlled distributively by an optimal number of cache nodes. It defines a new strategy for cache node deployment based on neighbour density as well as a weight formula for cluster head selection and cluster formation based on the residual energy, the distance to the base station and the node velocity. It also includes techniques for detaching and reconnecting a mobile node to an appropriate cluster cache if it crosses the cluster boundary. We simulate and compare the performance of our protocol with the centralised energy‐efficient clustering routing, energy‐efficient mobility‐based cluster head selection protocol and dual tier cluster‐based routing protocols over different network configurations with varying mobility, scalability and heterogeneity. The MC‐CCCNP showed remarkable improvements in energy utilisation uniformity and energy consumption. With the improved network lifespan, it also maintains a higher data throughput rate of 95% or more in almost all network configurations. [ABSTRACT FROM AUTHOR]

Hop count distribution (HCD), generally formulated as a discrete probability distribution of the hop count, constitutes an attractive tool for performance analysis and algorithm design. This paper devotes to deriving an analytical HCD expression for a finite ad hoc network under the minimum hop-count routing protocols. Formulating the node distribution with binomial point process, the network is provided as a bounded area with all nodes randomly and uniformly distributed. Considering an arbitrary pair of source node (SN) and destination node, an innovative and straightforward definition is presented for HCD. In order to derive HCD out, an original mathematical framework, named as the equivalent area replacement method (EARM), is proposed and verified. Under the EARM, HCD is derived by first considering the special case where SN locates at the network center and then extending to the general case where SN is randomly distributed. For each case, the accuracy of our HCD model is evaluated by simulation comparison. Results show that our model matches well with the simulation results over a wide range of parameters. Particularly, the derived HCD outperforms the existing formulations in terms of the Kullback Leibler divergence, especially when SN is randomly distributed. [ABSTRACT FROM AUTHOR]

Millimeter-wave (mmWave) communications are highly promising to improve the capacity of modern wireless networks, while the physical layer security (PLS) techniques hold great potential to enhance the critical secrecy performance therein. By carefully exploiting the significant signal difference between the Non-Light-of-Sight (NLoS) and Line-of-Sight (LoS) mmWave links, this paper proposes a Sight-based Cooperative Jamming (SCJ) scheme to improve the PLS performance of mmWave ad hoc communications. In this scheme, each potential jammer that has no LoS link to its nearest receiver but may have LoS links to eavesdroppers is selected with a certain probability to generate artificial noise such that channel advantages at legitimate receivers can be achieved. For performance modeling of the new jamming scheme, novel and efficient theoretical approximation approaches are firstly developed to enable the challenging issue of interference distribution modeling to be tackled, and then a theoretical framework based on stochastic geometry is proposed to capture the secrecy transmission capacity behavior under the SCJ scheme. Finally, extensive numerical results are provided to illustrate the SCJ scheme under various network scenarios. [ABSTRACT FROM AUTHOR]

The increasing demand for Internet of Things (IoT) applications has resulted in vast amounts of data, requiring the utilization of big data analytics. The integration of big data analytics in IoT-based smart cities can greatly benefit from the development of wireless communication protocols, among which the Thread protocol has emerged as a promising option. Thread is IEEE 802.15.4 based and has advanced capabilities like mesh networking, IPv6 support, and multiple gateways providing no single point of failure. This paper presents the design and evaluation of a low-cost mesh network using Raspberry Pi, nRF52840 dongle, and OpenThread 1.2 (i.e., an open-source software implementation of the Thread protocol stack). The research elaborates on the hardware and software solutions used, as well as the network topologies adopted. To evaluate the performance of the developed system, extensive real-time tests are performed, considering parameters, such as jitter, packet loss, and round trip time. These tests effectively demonstrate the effectiveness of the Thread network. Furthermore, the impact of varying payload size and bitrate on the network is analyzed to understand its influence. The behavior of the multi-hop network is also examined under link failure scenarios, providing insights into the network's robustness. Our findings provide valuable insights for researchers interested in designing low-cost and efficient mesh networks for various IoT applications, including home automation, building/campus monitoring systems, distributed industrial IoT applications, and smart city infrastructure. [ABSTRACT FROM AUTHOR]

In this paper, we derive closed-form expressions for significant statistical properties of the link signal-to-noise ratio (SNR) and the separation distance in mobile ad hoc networks subject to Ornstein-Uhlenbeck (OU) mobility and Rayleigh fading. In these systems, the SNR is a critical parameter as it directly influences link performance. In the absence of signal fading, the distribution of the link SNR depends exclusively on the squared distance between nodes, which is governed by the mobility model. In our analysis, nodes move randomly according to an Ornstein-Uhlenbeck process, using one tuning parameter to control the temporal dependency in the mobility pattern. We derive a complete statistical description of the squared distance and show that it forms a stationary Markov process. Then, we compute closed-form expressions for the probability density function (pdf), the cumulative distribution function (cdf), the bivariate pdf, and the bivariate cdf of the link SNR. Next, we introduce small-scale fading, modeled by a Rayleigh random variable, and evaluate the pdf of the link SNR for rational path loss exponents. The validity of our theoretical analysis is verified by extensive simulation studies. The results presented in this work can be used to quantify link uncertainty and evaluate stability in mobile ad hoc wireless systems. [ABSTRACT FROM AUTHOR]

For Intrusion Detection Systems (IDSs) in Vehicular Ad Hoc Networks (VANETs), single-objective optimization algorithm has inherited limitations for the feature selection problem with the multiple objectives. Moreover, the imbalanced problem commonly exists in various datasets. Thus, in this paper, a feature selection algorithm based on a many-objective optimization algorithm (FS-MOEA) is proposed for IDSs in VANETs, in which Adaptive Non-dominant Sorting Genetic (A-NSGA-III) serves as the many-objective optimization algorithm. Two improvements, called Bias and Weighted (B&W) niche-preservation and Information Gain (IG)-Analytic Hierarchy Process (AHP) prioritizing, are further designed in FS-MOEA. The former is used to counterbalance the imbalanced problem in datasets by assigning rare classes higher priorities, while the latter is employed to search the optimal feature subset for FS-MOEA. In IG-AHP prioritizing, a more distinct measurement, i.e. average IG, is used as the dominant factor to guide the decision analysis of AHP. Experimental results show that the proposed FS-MOEA can not only improve the performance of IDSs in VANETs but also alleviate the negative impact of the imbalanced problem. [ABSTRACT FROM AUTHOR]

In Mobile ad hoc Networks (MANETs), the packet scheduling process is considered the major challenge because of error-prone connectivity among mobile nodes that introduces intolerable delay and insufficient throughput with high packet loss. In this paper, a Modified Firefly Optimization Algorithm improved Fuzzy Scheduler-based Packet Scheduling (MFPA-FSPS) Mechanism is proposed for sustaining Quality of Service (QoS) in the network. This MFPA-FSPS mechanism included a Fuzzy-based priority scheduler by inheriting the merits of the Sugeno Fuzzy inference system that potentially and adaptively estimated packets' priority for guaranteeing optimal network performance. It further used the modified Firefly Optimization Algorithm to optimize the rules utilized by the fuzzy inference engine to achieve the potential packet scheduling process. This adoption of a fuzzy inference engine used dynamic optimization that guaranteed excellent scheduling of the necessitated packets at an appropriate time with minimized waiting time. The statistical validation of the proposed MFPAFSPS conducted using a one-way Analysis of Variance (ANOVA) test confirmed its predominance over the benchmarked schemes used for investigation. [ABSTRACT FROM AUTHOR]

Mobile ad hoc networks (MANETs) are now key in today's new world. They are critically needed in many situations when it is crucial to form a network on the fly while not having the luxury of time or resources to configure devices, build infrastructure, or even have human interventions. Ad hoc networks have many applications. For instance, they can be used in battlefields, education, rescue missions, and many other applications. Such networks are characterized by high mobility, low resources of power, storage, and processing. They are infrastructure-less; this means that they don't use infrastructure equipment for communication. These networks rely instead on each other for routing and communication. MANETs use a hopping mechanism where each node in a network finds another node within its communication range and use it as a hop for delivering the message through another node and so on. In standard networks, there is dedicated equipment for specific functions such as routers, servers, firewalls, etc., while in ad hoc networks, every node performs multiple functions. For example, the routing function is performed by nodes. Hence, they are more vulnerable to attacks than standard networks. The main goal of this paper is to propose a solution for detecting black hole attacks using anomaly detection based on a support vector machine (SVM). This detection system aims at analyzing the traffic of the network and identifying anomalies by checking node behaviors. In the case of black hole attacks, the attacking nodes have some behavioral characteristics that are different from normal nodes. These characteristics can be effectively detected using our lightweight detection system. To experiment with the effectiveness of this solution, an OMNET++ simulator is used to generate traffic under a black hole attack. The traffic is then classified into malicious and non-malicious based on which the malicious node is identified. The results of the proposed solution showed very high accuracy in detecting black hole attacks. [ABSTRACT FROM AUTHOR]

Ad hoc networks are temporary networks, created mainly for applications that are infrastructure-less. Such networks and network nodes demand special characteristics like mobile nodes having dynamic topology, wireless medium, heterogeneous deployment environment, and reactive or proactive routing depending on the nature of the network which includes network parameters such as node placement, mobility model, number of participants in the network, patterns of mobility, etc. Due to these characteristics and the mobility of network nodes, the process of routing is quite challenging in the ad hoc environment, especially when the node mobility is high. Bio-inspired routing can be an effective solution to meet all the design requirements and deal with the issues of tactical ad hoc networks. Different types of nature-inspired routing mechanisms are possible to use for tactical networks. This paper proposes the design of a novel Ant Colony Optimization-based routing strategy for ad hoc networks. Ant-based algorithms are dynamic and have adaptive behavior. Hence, they are competent for routing in ad hoc networks. Our proposed routing scheme is evaluated based on the network's performance by varying different parameters. The performance of our proposed ACO-based routing approach is also compared to some existing ad hoc routing mechanisms. Different metrics in different deployment scenarios that can affect the efficiency of our proposed protocol are taken into consideration to evaluate the performance. [ABSTRACT FROM AUTHOR]

In this paper, we address the problem of implementing distributed slice allocation algorithms for tactical networks deployed in regions lacking a communication infrastructure. We propose a multi-agent game implementation in which Application Slice Agents (ASAs) compete for shared computational and bandwidth resources in the network. We prove that the game can be implemented as a two stage potential game, with the first stage ensuring the selection of computational servers with load balancing, and the second stage improving connectivity and network throughput by promoting inter-slice cooperation. Our proposed analysis framework also incorporates a theoretical model to capture the impact of mitigation methods for timing channel leaks for the shared resources for different slices, and proposes a theoretical framework that allows for a security-delay tradeoff analysis. [ABSTRACT FROM AUTHOR]

Delay-tolerant networks (DTNs) are networks where there is no immediate connection between the source and the destination. Instead, nodes in these networks use a store–carry–forward method to route traffic. However, approaches that rely on flooding the network with unlimited copies of messages may not be effective if network resources are limited. On the other hand, quota-based approaches are more resource-efficient but can have low delivery rates and high delivery delays. This paper introduces the Enhanced Message Replication Technique (EMRT), which dynamically adjusts the number of message replicas based on a node's ability to quickly disseminate the message. This decision is based on factors such as current connections, encounter history, buffer size history, time-to-live values, and energy. The EMRT is applied to three different quota-based protocols: Spray and Wait, Encounter-Based Routing (EBR), and the Destination-Based Routing Protocol (DBRP). The simulation results show that applying the EMRT to these protocols improves the delivery ratio, overhead ratio, and latency average. For example, when combined with Spray and Wait, EBR, and DBRP, the delivery probability is improved by 13%, 8%, and 10%, respectively, while the latency average is reduced by 51%, 14%, and 13%, respectively. [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]

Various routing protocols have been proposed for ad hoc networks such as the Internet of Things (IoT). Most of the routing protocols introduced for IoT are specific to applications and networks. In the current literature, it is essential to configure all the network nodes with a single proposed protocol. Moreover, it is also possible for a single IoT network to consist of different kinds of nodes. Two or more IoT networks can also be connected to create a bigger heterogeneous network. Such networks may need various routing protocols with some gateway nodes installed. The role of gateway nodes should not be limited to the interconnection of different nodes. In this paper, a multi-mode hybrid routing mechanism is proposed that can be installed on all or a limited number of nodes in a heterogenous IoT network. The nodes configured with the proposed protocols are termed smart nodes. These nodes can be used to connect multiple IoT networks into one. Furthermore, a game-theory-based model is proposed that is used for intercommunication among the smart nodes to gain optimal efficiency. Various performance matrices are assessed under different network scenarios. The simulation results show that the proposed mechanism outperforms in broader heterogeneous IoT networks with diverse nodes. [ABSTRACT FROM AUTHOR]

With innovative applications of unmanned aerial vehicle (UAV) ad hoc networks in various areas, their demands on broad bandwidth, large capacity and low latency become prominent. The combination of millimeter wave, directional antenna and time division multiple access techniques, which enables concurrent transmissions, is promising to deal with it. In this paper, we study the resource allocation problem in UAV ad hoc networks. Specifically, the slot assignment, antenna boresight and transmit power are jointly optimized to promote the network capacity. First, we formulate the optimization problem as the maximization of the fairness-weighted network capacity, subject to the constraint on priority guarantee. Then, because the formulated problem is a mixed integer non-linear programming problem (MINLP), which is NP-hard, two algorithms called dual-based iterative search algorithm (DISA) and sequential exhausted allocation algorithm (SEAA) are respectively proposed to efficiently solve it with acceptable complexity. DISA slacks the MINLP into a continuous-variable optimization problem and solves it with the Lagrangian dual method in an iterative manner. As a heuristic method, SEAA schedules links sequentially, i.e., from high-priority to low-priority ones. Numerical results demonstrate that both DISA and SEAA can efficiently allocate resources for UAVs, while guaranteeing the fairness and priority of links. [ABSTRACT FROM AUTHOR]

Efficient and correct operation of an IoT network requires the presence of a failure detector and membership protocol amongst the IoT nodes. This paper presents a new failure detector for IoT settings wherein nodes are connected via a wireless ad-hoc network. Our failure detector, named Medley, is fully decentralized, allows IoT nodes to maintain a local membership list of other alive nodes, detects failures quickly (and updates the membership list), and incurs low communication overhead. We adapt a failure detector originally proposed for datacenters (SWIM), for the IoT environment. This adaptation is non-trivial. In Medley each node picks a medley of ping targets in a randomized and skewed manner, preferring nearer nodes. We also provide optimizations to achieve time-bounded detection, as well as to reduce tail detection times. Via analysis, simulation, and Raspberry Pi deployments, we show that Medley can simultaneously optimize detection time and communication traffic. [ABSTRACT FROM AUTHOR]

Mobile Ad hoc Networks (MANETs) are intended to work without a fixed framework and provide dependable interchanges to ground vehicles, boats, airplanes, or people and structure a self-mending process that will empower persistent correspondences in any event, when at least one of its nodes are debilitated or briefly expelled from the system. Notwithstanding, MANETs demonstrate themselves to be progressively harder to create for enormous systems with hundreds or thousands more nodes than initially envisioned. In our proposed technique, the node switches its communication mode depending on the connectivity of the adjacent nodes. The transmission power of each node will be calculated with the help of two major scenarios i.e., tree scenario and zone scenario. The autonomous clustering of the nodes among the tree and the zone scenario will be channelized by a comparison of the transmission power (residual energy) among the nodes. The inter and the intra communication of the node is also discussed in the paper. The result will be carried out by the simulation work in various perspectives, such as checking the percentage level of malicious nodes, traffic density, transmission power, and the longevity of nodes. [ABSTRACT FROM AUTHOR]

Summary: The main aim of this paper is to address the problem of redundant broadcast packets using the extension of rough set concept. In general, a rough set is a mathematical tool for dealing with issues of uncertainty. In MANET, mobile nodes are moving from one place to another place in a simulation environment; hence, it creates uncertainty issues. Due to the fast mobility of mobile nodes, network metrics such as bandwidth and hop count vary. The findings were useful in identifying and improving the network's performance. The proposed NRS‐based route selection approach has been compared with conventional techniques such as rough set, covering rough set (CRS). The reduced control packets are obtained using pruning concept based on selection of one‐hop and two‐hop nodes. Eventually, the proposed approach proved that it attains a higher throughput (85%), reducing the route request packets (3406) and delay of data transmission (0.02274 s). Also, two well‐known ad hoc routing protocols were used such as Dynamic Source Routing (DSR) and Ad Hoc On‐Demand Distance Vector (AODV) protocols. [ABSTRACT FROM AUTHOR]

Aeronautical Ad-hoc Networks (AANETs) have been proposed as the promising complement to terrestrial networks for promoting the global interconnection to provide in-flight network service, emergency communication, vessel traffic service, etc. However, the large network scale of AANETs may induce severe synchronization overhead when the traditional topology-based networking algorithms are adopted. Moreover, the high-dynamic topology and changeable flight routes make the existing position-based routing algorithms suffer loop routing and forwarding failure. Motivated by these problems, this paper aims at developing efficient and low-cost networking and routing algorithms relying on the concept of dynamic virtual topology which organizes the disordered topology of AANETs into a structural and simplified one. The basic idea is that each connected aircraft is assigned with a unique and sequentially increased Virtual Identifier (VID) and thus all the connected aircrafts are organized into a virtual cluster consisting of one trunk and several branches. An event-driven synchronization mechanism is leveraged for maintaining the virtual topology as well as relieving the communication burden imposed by periodical broadcasting. By jointly considering the geographic locations and the virtual locations of aircrafts, we formulate the routing problem in AANETs as a weighted distance minimization problem, and further propose a novel routing algorithm, namely Trunk-Branch Cooperation aided Routing (TBCR) algorithm. Specifically, TBCR employs the geographic greedy forwarding strategy for enhancing its flexibility and boosts the routing efficiency by adopting the loop-free virtual topology based local forwarding. For extending the networking and routing algorithms to the global range, a multi-domain routing solution is also provided. Extensive experimental results show that the proposed Virtual Topology based Networking (VTN) cooperated with TBCR can reduce at least 30% average end-to-end transmission delay in large-scale AANETs and provide more than 90% lower synchronization overhead than the existing solutions. [ABSTRACT FROM AUTHOR]

OFDM-based spatial data focusing (OFDM-SDF) is proposed as a novel means of performing wireless physical layer geocasting, i.e. spatially confined broadcasting. It is shown that this approach overcomes beamforming and directional modulation (DM) limitations by exhibiting higher spatial precision with a reduced number of antennas and offering uncoupled range-angle-dependent focusing. This paper describes the OFDM-SDF system model for multipath channels, including multipath robust equalization, design rules for steering phases and sidelobe mitigation, analytical geocast delivery zone derivation, and optimized symbol mapping. Using density-based clustering of the spatial bit error rate distribution, a procedure for identifying a practical geocast delivery zone and evaluating its precision and connectivity is proposed. OFDM-SDF’s performance and multipath robustness are evaluated through Rice channel simulations as a function of the Rice factor. In particular, it is shown that a 2-antenna OFDM-SDF array matches the radial and angular precision of, respectively, a 6 and 12-antenna DM array in recent literature, while robustness is ensured for 5G small cell channels. [ABSTRACT FROM AUTHOR]

An efficient and reliable route is the backbone of a Mobile Ad hoc Network (MANET). nodes can move around freely, due to the dynamic nature of MANETs, and there is no fixed topology. Thus, route selection becomes a very critical issue, as many factors affect the communication between mobile nodes. Limited battery life and moving nodes lead to frequent route changes, and increase in hops and delays cause rapid battery consumption. Mobility is a critical factor that affects the communication between nodes of a wireless ad hoc network. Conventional algorithms consider hop count as the only parameter during selection of a route from source to destination and other significant QoS parameters like battery, mobility, end-to-end delay are ignored. As a consequence, these approaches do not attain the desired packet delivery ratio levels needed for a highly dynamic network. This paper proposes a QoS aware AHP based Cognitive Route selection in MANETs (QACRM). It is an Analytic Hierarchy Process-Simple Additive Weighing (AHP-SAW) based cognitive approach for optimal route selection. In this work, routes are ranked based on hop count, battery, mobility, and end-to-end delay. The importance of QoS parameters is decided based on human expert judgement provided to the system. The route which is ranked highest is selected for transmission. This approach identifies reliable and optimal routes for communication between the nodes. Results attest that the proposed technique (QACRM) performs better when compared with AODV and other existing methods for packet delivery ratio, consumption of energy, size of network, and changing least number of routes in a dynamic environment. [ABSTRACT FROM AUTHOR]

In this paper, the outage performance of wireless networks with unstructured topologies is investigated. The network reliability perspective of graph theory is used to obtain the network outage polynomial of generalized wireless networks for both uncorrelated and correlated wireless channels. A relationship is established between the max-flow min-cut theorem and key communication performance indicators. The diversity order is equal to the size of the minimum cut-set between source and destination, and the coding gain is the number of cut-sets with size equal to the minimum cut. An ergodic capacity analysis of arbitrary network topologies based on the network outage polynomial is also presented. Numerical results are used to illustrate the technical definitions and verify the derivations. [ABSTRACT FROM AUTHOR]

Wireless Ad Hoc Networks (WANETs) are predicted to be prevalent networks in coming future because of their infrastructure-less characteristics that result in self-organization, self-healing, and self-configuration of such networks. Routing means the process of selecting a path along which data can be transferred from source to destination that plays a significant role in the performance of ad hoc networks. There are many routing protocols developed for wireless ad hoc networks. One of such protocols, developed by C. E. Perkins, is Ad Hoc On-demand Distance Vector (AODV) routing protocol, which is a reactive routing protocol, AODV is used to establish route(s) between source node(s) and destination node(s) as and when routes are required. Performance of AODV routing protocol depends heavily on choice of values of a set of predefined attributes. One of such attributes of AODV is Node Traversal Time (NTT) which is supposed to play significant role in establishing route(s) between source node(s) and destination node(s). In this paper, we have investigated the performance of AODV in a linear wireless ad hoc network using different values of NTT using as well as without using Hello messages. The performance of the network has been measured using several metrics like Route Error Overhead, Routing Overhead, Normalized Routing Load, Average Hop Count, Total Number of Received Data Packets, Packet Delivery Ratio, Average End-to-End Delay and Throughput. It is observed that choice of value of NTT has a significant effect on establishment of route(s) between source node(s) and destination node(s) that eventually affects the performance of the linear wireless ad hoc network under consideration. The insights gained through this work could be useful in analysis of more realistic and complex networks. [ABSTRACT FROM AUTHOR]

In this paper, we propose a joint transceiver beamforming design method for hybrid full-duplex (FD) and half-duplex (HD) ad-hoc networks to cancel co-channel interference, thereby to improve system spectral efficiency. To characterize network performances, we derive a general expression of transmission capacity upper bound (TC-UB) plus its two compact versions by using a stochastic geometry model. Due to the proposed beamforming design and hybrid-duplex consideration, the exact TC and conventional methods to obtain TC-UBs are not applicable. This motivates us to exploit the UB of the largest eigenvalue of desired signals, Alzer’s inequality for the incomplete gamma function, and dominating interference region to formulate one general TC-UB and two of its compact versions. The numerical results show that the proposed beamforming method outperforms the existing beamforming strategies in terms of exact TC, especially when the number of transmit antennas is larger than the number of receiver antennas per node pair. In addition, the derived general TC-UB can provide relatively close TC performance as the exact ones, and its two compact versions can at least give order-wise TC performance. Moreover, we find the break-even points, where FD outperforms HD with different system configurations. [ABSTRACT FROM AUTHOR]

Previous work has demonstrated the feasibility of Bluetooth Low Energy (BLE) as an alternative technology for data transfers in inter-vehicular communication (IVC) scenarios. Bluetooth 5.x core specifications enhance the trade-off between energy requirements, communication range and flexibility. In this paper, we aim to analyse the potential of Bluetooth 5 features for VANET applications, proposing a connectionless communication system. By means of field experiments, we evaluate long range and 2 × speed features, defining a set of communication scenarios. This allows us to test both Bluetooth 5.x range and application throughput. The evaluation includes experiments of V2I communications carried out under real highway traffic conditions. The experiments conducted demonstrate that communication ranges up to 300 m may be achieved depending on the communications scenario. The results also show how throughput degrades as the distance between devices increases. The results obtained are used to discuss future work, aimed at deeper analysing Bluetooth 5 features for VANET applications, completing the development of our prototype and evaluating VANET connectionless communications with the features included in the latest Bluetooth 5.2 specification. [ABSTRACT FROM AUTHOR]

Emergence of various types of wireless applications has brought about fast growing and diversified traffic in cellular networks. To gain a comprehensive understanding of the influences caused by the differentiated and dynamic traffic is vital for the design of the next-generation wireless networks. In this paper, we develop a mathematical framework for meta-distribution analysis by utilizing queueing theory and stochastic geometry to capture the spatial (geographical location) and temporal randomness (queue status) of traffic. We derive the ${k}$ -th moment of the conditional successful transmission probability (STP) and the closed-form expressions of the meta distribution for the cell-center users (CCUs) and the cell-edge users (CEUs), respectively. The results are further extended to obtain the analytical expression of the meta distribution by taking the temporal random arrival of traffic into consideration. Moreover, the mean local delays for the CCUs and CEUs are derived. Finally, the impact of key network parameters on the meta distribution and the corresponding mean local delay is investigated. [ABSTRACT FROM AUTHOR]

Shannon showed that to achieve perfect secrecy in point-to-point communication, the message rate cannot exceed the shared secret key rate giving rise to the simple one-time pad encryption scheme. In this paper, we extend this work from point-to-point to networks. We consider a connected network with pairwise communication between the nodes and assume that each node is provided with a certain amount of secret bits before communication commences. An eavesdropper with unlimited computing power has access to all communication and can hack a subset of the nodes not known to the rest of the nodes. We investigate the limits on information-theoretic secure communication with end-to-end encryption for this network. We establish a tradeoff between the secure channel rate (for a node pair) and the secure network rate (sum over all node pair rates) and show that information-theoretic secrecy can be achieved asymptotically if and only if the sum rate of any subset of unhacked channels does not exceed the shared unhacked-secret-bit rate of these channels. We also propose a practical scheme that achieves a good balance of network and channel rates with information-theoretic secrecy guarantee. This work has a wide range of potential applications for which strong secrecy is desired, such as cyber-physical systems, distributed-control systems, and ad-hoc networks. [ABSTRACT FROM AUTHOR]

This paper considers the time evolution of a queue that is embedded in a Poisson point process of moving wireless interferers. The queue is driven by an external arrival process and is subject to a time-varying service process that is a function of the SINR that it sees. Static configurations of interferers result in an infinite queue workload with positive probability. In contrast, a generic stability condition is established for the queue in the case where interferers possess any non-zero mobility that results in displacements that are both independent across interferers and oblivious to interferer positions. The proof leverages the mixing property of the Poisson point process. The effect of an increase in mobility on queuing metrics is also studied. Convex ordering tools are used to establish that faster moving interferers result in a queue workload that is smaller for the increasing-convex stochastic order. As a corollary, mean workload and mean delay decrease as network mobility increases. This stochastic ordering as a function of mobility is explained by establishing positive correlations between SINR level-crossing events at different time points, and by determining the autocorrelation function for interference and observing that it decreases with increasing mobility. System behaviour is empirically analyzed using discrete-event simulation and the performance of various mobility models is evaluated using heavy-traffic approximations. [ABSTRACT FROM AUTHOR]

Routing is a fundamental problem and has been extensively studied in various networks. However, in highly dynamic networks (e.g., wireless ad hoc networks), nodes have limited transmission opportunities due to high mobility, noise and interference, where traditional routing is often not the best approach. Opportunistic routing (OR), on the other hand, can effectively minimize the routing cost (e.g., the number of hops) and improve the success of routing by utilizing link metrics. However, the link metrics are usually unknown in advance and changing. In this paper, we design an adaptive algorithm called Thompson sampling-based opportunistic routing (TSOR) motivated by the distributed Bellman-Ford algorithms. TSOR is able to learn the link metrics and route packets simultaneously to reduce the overall cost. Theoretically, we show a lower bound and an upper bound of the cumulative regret (i.e., performance gap) between TSOR and the optimal routing algorithm that knows all link metrics in advance. The regret increases sublinearly with respect to the number of packets, and has a lower order in terms of the network size than the best-known results. Furthermore, we compare TSOR with the state-of-the-art algorithms, and the evaluation results show that TSOR has a lower regret and a faster convergence rate to the optimal policy than the state-of-the-art algorithms. [ABSTRACT FROM AUTHOR]

The object of research is the military radio communication system. Effective operation of routing protocols is possible only if there is reliable information about the network topology for network nodes, given that the mobility of individual nodes is insignificant in special purpose wireless networks. Because nodes in the network demonstrate the mobility property of the node groups. This paper solves the problem of the analysis (decomposition) of methods of protocols efficiency increase of dynamic routing in telecommunication networks with a possibility to self-organization. In the course of the research, the authors used the main provisions of the queuing theory, the theory of automation, the theory of complex technical systems and general scientific methods of cognition, namely analysis and synthesis. This research analyzes various methods to increase the efficiency of dynamic routing protocols. Energy efficiency methods focus on three main components in energy management: battery management, transmission energy management and system energy management methods. Reliable multicast has become indispensable for the successful deployment of special purpose wireless networks, such as in tactical military operations and emergency operations. The results of the research will be useful in: – development of new routing algorithms; – substantiation of recommendations for improving the efficiency of the route selection process in networks with the possibility of self-organization; – analysis of the electronic situation during hostilities (operations); – while creating promising technologies to increase the efficiency of mobile radio networks. Areas of further research will focus on the development of a methodology for the operational management of interference protection of intelligent military radio communication systems. [ABSTRACT FROM AUTHOR]

This paper presents $\mathit {wChain}$ , a blockchain protocol specifically designed for multihop wireless networks that deeply integrates wireless communication properties and blockchain technologies under the realistic SINR model. We adopt a hierarchical spanner as the communication backbone to address medium contention and achieve fast data aggregation within $O(\log N\log \Gamma)$ slots where $N$ is the network size and $\Gamma $ refers to the ratio of the maximum distance to the minimum distance between any two nodes. Besides, $\mathit {wChain}$ employs data aggregation and reaggregation as well as node recovery mechanisms to ensure efficiency, fault tolerance, persistence, and liveness. The worst-case runtime of $\mathit {wChain}$ is upper bounded by $O(f\log N\log \Gamma)$ , where $f=\lfloor \frac {N}{2} \rfloor $ is the upper bound of the number of faulty nodes. To validate our design, we conduct both theoretical analysis and simulation studies. The results not only demonstrate the nice properties of $\mathit {wChain}$ , but also point to a large new space for the exploration of blockchain protocols in wireless networks. [ABSTRACT FROM AUTHOR]

Summary: A routing protocol for cognitive radio ad hoc networks (CRAHNs), namely, primary user supported routing (PSR) is demonstrated in this research. Unlike existing routing protocols for CRAHN, where routing of cognitive users (CUs) is accomplished within CUs, in this proposed protocol, some of the primary users (PUs) support CUs to communicate, by forwarding CU packets. This service provided by PU is of voluntary nature. However, such assistance shall be provided by the PUs, only when they are idle, thereby, preserving the principles of cognitive radio networks (CRNs), which indicates that the operation of PU should not be disturbed by the CU activities. The proposed work is compared with cognitive ad hoc on‐demand distance vector (CAODV) protocol. The performance parameters considered are routing overhead, rate of loss of packets, and e2e packet delay. PSR outperforms CAODV in all these performance parameters. There has been on average 26.25% improvement in routing overhead, 34.12% decrease in loss, and 27.01% improvement in e2e delivery in the proposed PSR. [ABSTRACT FROM AUTHOR]

This paper proposes an evolved wireless ad hoc network (WANET) in which user equipment (UE) can manage radio resources by itself without the control by infrastructure. There are two independent channels in the proposed WANET, one is a data channel, the other is a tone channel for resource management. UEs allocate, occupy, and return resources by using tones in the tone channel. Although UEs do not exchange channel information with each other, they are able to occupy a clear one-hop area without a hidden node problem by setting the data communication area and the tone communication area differently. A UE occupying a resource performs a real time collision check on the occupied resource, and if a collision is detected, it is able to re-occupy a resource without collision. In this paper, we present the operating principle of the proposed WANET, and design its communication area, and analyze the average resource occupation time. Since the proposed WANET operates in a general communication environment that is not limited to special assumptions, it supports periodic and aperiodic communication and broadcast links and unicast links without hidden node problem, and could be utilized to various communication fields such as drones, vehicles, ships, and smartphones.

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]

Abstract 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 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.

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]

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]

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]

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]