Search Results (138)

To overcome the limitations of current link prediction methods in effectively leveraging topological information and node importance, this paper introduces a new model called AMPS (Adaptive Multi-scale Potential-enhanced Path Similarity). The model is built on a hierarchical structure that captures both global network topology and local interaction patterns, with full compatibility for directed and undirected networks. This is achieved through a process that quantifies node potential fields, enhances multi-scale similarity, and fuses information across scales. Specifically, we define three types of potential field models, global, local, and k-hop, to flexibly measure node importance. We also introduce two complementary prediction modules: an enhanced common neighbor matrix (PCN), which uses potential fields to refine local structural details, and a feature-weighted generalized path similarity (GLP), which integrates node importance into path evaluation. The final similarity score is obtained by adaptively combining the outputs of PCN and GLP. Experiments on 12 undirected datasets and 9 directed datasets demonstrate that AMPS significantly outperforms other mainstream algorithms in terms of the AUC metric. It also exhibits strong robustness under varying training set ratios, maintaining stable advantages in both directed and undirected scenarios. This framework provides a physically intuitive, topology-aware, and high-precision solution for link prediction across various types of networks. Full article

Multi-hop relaying can solve the problems of limited single-hop wireless communication distance, poor signal quality, or the inability to communicate directly by “relaying” data transmission through multiple intermediate nodes. It serves as the cornerstone for building large-scale, highly reliable, and self-adapting wireless networks, especially for the Internet of Things (IoT) and future 6G. This paper focuses on a decode-and-forward (DF) multi-hop relay network that employs simultaneous wireless information and power transfer (SWIPT) technology, with relays operating in a passive state. We first investigate the optimization of the power splitting (PS) ratio at each relay, given the source node transmit power, to maximize end-to-end network throughput. Subsequently, we jointly optimized the PS ratios and the source transmit power to minimize the source transmit power while satisfying the system’s minimum quality of service (QoS) requirement. Although both problems are non-convex, they can be reformulated as convex optimization problems. Closed-form optimal solutions are then derived based on the Karush–Kuhn–Tucker (KKT) conditions and a recursive method, respectively. Moreover, we find that the closed-form optimal solutions for the PS ratios corresponding to the two problems are identical. Through simulations, we validate that the performance of the two proposed schemes based on the closed-form solutions is optimal, while also demonstrating their extremely fast algorithm execution speeds, thereby proving the deployment value of the two proposed schemes in practical communication scenarios. Full article

The Internet of Vehicles (IoV) can transmit the status information of vehicles and roads through single-hop or multi-hop broadcast communication, which is a key technology for building intelligent transportation systems and enhancing road safety. However, in dense traffic environments, broadcasting Emergency messages via vehicles can easily trigger massive forwarding redundancy, leading to channel resource selection conflicts between vehicles and affecting the reliability of inter-vehicle communication. This paper analyzes the forwarding near the single-hop transmission radius boundary of the sending node in a probability-based inter-vehicle multi-hop forwarding scheme, pointing out the existence of the boundary forwarding redundancy problem. To address this problem, this paper proposes two probability-based schemes with boundary optimization: (1) By optimizing the forwarding probability distribution outside the transmission radius boundary of the sending node, the forwarding nodes outside the boundary can be effectively utilized while effectively reducing the forwarding redundancy they bring. (2) Additional forwarding backoff timers are allocated to nodes outside the transmission radius boundary of the sending node based on the distance to further reduce the forwarding redundancy outside the boundary. Experimental results show that, compared with the reference schemes without boundary forwarding probability optimization, the proposed schemes significantly reduce forwarding redundancy of Emergency messages while maintaining good single-hop and multi-hop transmission performance. When the reference transmission radius is 300 m and the vehicle density is 0.18 veh/m, compared with the probability-based forwarding scheme without boundary optimization, the proposed schemes (1) and (2) improve the single-hop packet delivery ratio by an average of about 5.41% and 11.83% and reduce the multi-hop forwarding ratio by about 18.07% and 36.07%, respectively. Full article

Wireless sensor networks (WSNs) consist of distributed nodes to monitor various physical and environmental parameters. The sensor nodes (SNs) are usually resource constrained such as power source, communication, and computation capacity. In WSN, energy consumption varies depending on the distance between sender and receiver SNs. Communication among SNs having long distance requires significantly additional energy that negatively affects network longevity. To address these issues, WSNs are deployed using multi-hop routing. Using multi-hop routing solves various problems like reduced communication and communication cost but finding an optimal cluster head (CH) and route remain an issue. An optimal CH reduces energy consumption and maintains reliable data transmission throughout the network. To improve the performance of multi-hop routing in WSN, we propose a model that combines Multi-Objective Particle Swarm Optimization (MOPSO) and a Decision Tree for dynamic CH selection. The proposed model consists of two phases, namely, the offline phase and the online phase. In the offline phase, various network scenarios with node densities, initial energy levels, and BS positions are simulated, required features are collected, and MOPSO is applied to the collected features to generate a Pareto front of optimal CH nodes to optimize energy efficiency, coverage, and load balancing. Each node is labeled as selected CH or not by the MOPSO, and the labelled dataset is then used to train a Decision Tree classifier, which generates a lightweight and interpretable model for CH prediction. In the online phase, the trained model is used in the deployed network to quickly and adaptively select CHs using features of each node and classifying them as a CH or non-CH. The predicted nodes broadcast the information and manage the intra-cluster communication, data aggregation, and routing to the base station. CH selection is re-initiated based on residual energy drop below a threshold, load saturation, and coverage degradation. The simulation results demonstrate that the proposed model outperforms protocols such as LEACH, HEED, and standard PSO regarding energy efficiency and network lifetime, making it highly suitable for applications in green computing, environmental monitoring, precision agriculture, healthcare, and industrial IoT. Full article

In wireless communication, information security, and anti-interference technology, modulation recognition of frequency-hopping signals has always been a key technique. Its widespread application in satellite communications, military communications, and drone communications holds broad prospects. Traditional modulation recognition techniques often rely on expert experience to construct likelihood functions or manually extract relevant features, involving cumbersome steps and low efficiency. In contrast, deep learning-based modulation recognition replaces manual feature extraction with an end-to-end feature extraction and recognition integrated architecture, where neural networks automatically extract signal features, significantly enhancing recognition efficiency. Current deep learning-based modulation recognition research primarily focuses on conventional fixed-frequency signals, leaving gaps in intelligent modulation recognition for frequency-hopping signals. This paper aims to summarise the current research progress in intelligent modulation recognition for frequency-hopping signals. It categorises intelligent modulation recognition for frequency-hopping signals into two mainstream approaches, analyses them in conjunction with the development of intelligent modulation recognition, and explores the close relationship between intelligent modulation recognition and parameter estimation for frequency-hopping signals. Finally, the paper summarises and outlines future research directions and challenges in the field of intelligent modulation recognition for frequency-hopping signals. Full article

Graph Convolutional Networks (GCNs) have become a widely used framework for learning from graph-structured data due to their efficiency and performance in tasks such as node classification and link prediction. However, conventional GCNs are limited by a small receptive field, typically restricted to 1–2 hops, which prevents them from capturing long-range dependencies. Graph diffusion methods address this limitation by integrating multi-hop information, but they often introduce high computational costs and over-smoothing issues. To overcome these challenges, we propose a Simplified and Adjustable Graph Diffusion model. Our method employs a predefined diffusion stage and introduces two adaptive parameters: a distance parameter that specifies the diffusion depth and a diffusion control parameter that dynamically adjusts edge weights based on inter-node distances. This approach reduces computational overhead while enabling more effective information propagation. Extensive experiments on benchmark datasets demonstrate that our model achieved an average improvement of 1.9 percentage points in AUC for link prediction and 2.2 percentage points in accuracy for semi-supervised classification tasks. The improvements are particularly significant when leveraging structural information from distant nodes. The proposed framework strikes a balance between accuracy and efficiency, offering a practical alternative for scalable graph learning applications. Full article

To overcome the obstacles of maintaining covert transmissions in wireless networks employing collaborative wardens, we develop a reinforcement learning framework that jointly optimizes cooperative jamming strategies and relay selection mechanisms. The study focuses on a multi-relay-assisted two-hop network, where potential relays dynamically act as information relays or cooperative jammers to enhance covertness. A reinforcement learning-based relay selection scheme (RLRS) is employed to dynamically select optimal relays for signal forwarding and jamming; the framework simultaneously maximizes covert throughput and guarantees warden detection failure probability, subject to rigorous power budgets. Numerical simulations reveal that the developed reinforcement learning approach outperforms conventional random relay selection (RRS) across multiple performance metrics, achieving (i) higher peak covert transmission rates, (ii) lower outage probabilities, and (iii) superior adaptability to dynamic network parameters including relay density, power allocation variations, and additive white Gaussian noise (AWGN) fluctuations. These findings validate the effectiveness of reinforcement learning in optimizing relay and jammer selection for secure covert communications under colluding warden scenarios. Full article

Integrated sensing and communication (ISAC) has emerged as a transformative technology for intelligent transportation systems. Index modulation (IM), recognized for its high robustness and energy efficiency (EE), has been successfully incorporated into ISAC systems. However, most existing IM-based ISAC schemes overlook the spatial multiplexing potential of millimeter-wave channels and remain confined to single-hop vehicle-to-vehicle (V2V) setups, failing to address the challenges of energy consumption and noise accumulation in real-world multi-hop V2V networks with complex road topologies. To bridge this gap, we propose a spatial scattering modulation-based ISAC (ISAC-SSM) scheme and introduce it to multi-hop V2V networks. The proposed scheme leverages the sensed positioning information to select maximum signal-to-noise ratio relay vehicles and employs a detect-amplify-and-forward (DAF) protocol to mitigate noise propagation, while utilizing sensed angle data for Doppler compensation to enhance communication reliability. At each hop, the transmitter modulates index bits on the angular-domain spatial directions of scattering clusters, achieving higher EE. We initially derive a closed-form bit error rate expression and Chernoff upper bound for the proposed DAF ISAC-SSM under multi-hop V2V networks. Both theoretical analyses and Monte Carlo simulations have been made and demonstrate the superiority of DAF ISAC-SSM over existing alternatives in terms of EE and error performance. Specifically, in a two-hop network with 12 scattering clusters, compared with DAF ISAC-conventional spatial multiplexing, DAF ISAC-maximum beamforming, and DAF ISAC-random beamforming, the proposed DAF ISAC-SSM scheme can achieve a coding gain of 1.5 dB, 2 dB, and 4 dB, respectively. Moreover, it shows robust performance with less than a 1.5 dB error degradation under 0.018 Doppler shifts, thereby verifying its superiority in practical vehicular environments. Full article

This paper investigates physical layer security (PHY-security) for multi-hop transmission in underlay cognitive radio networks under various eavesdropping attacks. To enhance secrecy performance, we propose two opportunistic scheduling schemes. The first scheme, called the minimal node selection (MNS) scheme, selects the node in each cluster that minimizes the eavesdropper’s channel capacity. The second scheme, named the optimal node selection (ONS) scheme, chooses the node that maximizes secrecy capacity by using both the main and eavesdropper channel information. To reveal the relationship between network parameters and secrecy performance, we derive closed-form expressions for the secrecy outage probability (SOP) under different scheduling schemes and eavesdropping scenarios. Numerical results show that the ONS scheme provides the most robust secrecy performance among the considered schemes. Furthermore, we analyze the impact of key network parameters on secrecy performance. In detail, although the proposed ONS scheme requires more channel information than the MNS scheme, under a 20 dB interference threshold, the secrecy performance of the ONS scheme is 15% more robust than that of the MNS scheme. Full article

Two hybrid, entropy-guided node metrics are proposed for the k-hop environment: Entropy-Weighted Redundancy (EWR) and Normalized Entropy Density (NED). The central idea is to couple local Shannon entropy with neighborhood density/redundancy so that structural heterogeneity around a vertex is captured even when classical indices (e.g., degree or clustering) are similar. The metrics are formally defined and shown to be bounded, isomorphism-invariant, and stable under small edge edits. Their behavior is assessed on representative topologies (Erdős–Rényi, Barabási–Albert, Watts–Strogatz, random geometric graphs, and the Zephyr quantum architecture). Across these settings, EWR and NED display predominantly negative correlation with degree and provide information largely orthogonal to standard centralities; vertices with identical degree can differ by factors of two to three in the proposed scores, revealing bridges and heterogeneous regions. These properties indicate utility for vulnerability assessment, topology-aware optimization, and layout heuristics in engineered and quantum networks. Full article

The main purpose of this paper is to explore the benefits of combining two radio interfaces onboard an unmanned aerial vehicle (UAV) to communicate with a ground control station (GCS) and other UAVs inside a swarm. The goals are to use the IEEE 802.11ah standard (Wi-Fi HaLow) combined with the IEEE 802.11ax specification (Wi-Fi 6/6E) to enable real-time video transmission from UAVs to the GCS. While airport runway inspection serves as the proof-of-concept use case, the proposed multi-hop architectures apply to other medium-range UAV operations (i.e., a few kilometers) requiring real-time video transmission, such as natural disaster relief and agricultural monitoring. Several scenarios in which a UAV swarm performs infrastructure inspection are emulated. During the missions, UAVs have to send real-time video to the GCS through a multi-hop network when some damage in the infrastructure is found. The different scenarios are studied by means of emulation. Emulated scenarios are defined using different network architectures and radio technologies. Once the emulations finish, different performance metrics related to time, energy and the multi-hop video transmission network are analyzed. The capacity of a multi-hop network is a limiting factor for the transmission of high-quality video. As a first contribution, an expression to find this capacity from distances between UAVs in the emulated scenario is found using the NS-3 simulator. Then, this expression is applied in the algorithms in charge of composing the multi-hop network to offer on-demand quality video. However, the main contribution of this work lies in the development of efficient mechanisms for exchanging control information between UAVs and the GCS, and for forming a multi-hop network to transmit video. Full article

Routing in flying ad hoc networks (FANETs) is hindered by high mobility, trajectory-induced topology dynamics, and energy constraints. Conventional topology-based or position-based protocols often fail due to stale link information and limited neighbor awareness. This paper proposes a trajectory-informed routing protocol enhanced by Q-learning: Traj-Q-GPSR, tailored for mission-oriented UAV swarm networks. By leveraging mission-planned flight trajectories, the protocol builds time-aware two-hop neighbor tables, enabling routing decisions based on both current connectivity and predicted link availability. This spatiotemporal information is integrated into a reinforcement learning framework that dynamically optimizes next-hop selection based on link stability, queue length, and node mobility patterns. To further enhance adaptability, the learning parameters are adjusted in real time according to network dynamics. Additionally, a delay-aware queuing model is introduced to forecast optimal transmission timing, thereby reducing buffering overhead and mitigating redundant retransmissions. Extensive ns-3 simulations across diverse mobility, density, and CBR connections demonstrate that the proposed protocol consistently outperforms GPSR, achieving up to 23% lower packet loss, over 80% reduction in average end-to-end delay, and improvements of up to 37% and 52% in throughput and routing efficiency, respectively. Full article

Timely status updates are essential for Internet of Things (IoT) services. The freshness of these updates can be quantified using Age of Information (AoI). The worst-case behavior of AoI is evaluated by peak AoI (PAoI), denoting the maximum AoI just before each successful update. To characterize the time-averaged evolution of the PAoI over a long time horizon, we adopt the average PAoI as a performance metric. In this paper, we consider a two-hop status update system in IoT monitoring networks, where sensors periodically transmit short status packets to a remote edge server via a sink node. The sink node encodes status packets received from multiple sensors into a single longer packet to enhance the transmission reliability of short-packet communications. Here, we analyze the average PAoI in this setup as a function of system parameters and minimize this function by jointly optimizing three key parameters: (i) the number of status packets for joint coding at the sink node, (ii) the blocklength of a status packet in the first hop, and (iii) the blocklength of a coded packet in the second hop. Through numerical studies, we demonstrate the effectiveness of the proposed optimization in reducing the average PAoI. Full article

Optimal path planning algorithms offer substantial benefits in high-density storage (HDS) systems in modern smart manufacturing. However, traditional algorithms may encounter significant optimization challenges due to intricate architectural configurations and traffic constraints of the HDS system. This paper addresses these issues by introducing a two-step novel path planning method: (1) the mesh-tree grid map topological representation and the (2) Lattice-Hopping (LH) algorithm. The proposed method first converts the layout of an HDS system into a mesh-tree grid hierarchical structure by capturing and simplifying the spatial and geometrical information as well as the traffic constraints of the HDS system. Then, the LH algorithm is proposed to find optimal shipping path by leveraging the global connectivity of main tracks (main track priority) and the ‘jumping’ mechanism of sub-tracks. The main track priority and the ‘jumping’ mechanism work together to save computational complexity and enhance the feasibility and optimality of the proposed method. Numerical and case studies are performed to demonstrate the superiorities of our method to properly modified benchmark algorithms. Algorithm scalability, robustness, and operational feasibility for industrial production in modern smart manufacturing are also displayed and emphasized. Full article

We investigate the entanglement dynamics of two giant atoms coupled to a one-dimensional photonic lattice with synthetic chirality. The atoms are connected to multiple lattice sites in a braided configuration and interact with a structured photonic reservoir featuring direction-dependent hopping phases. By tuning the atomic detuning and the synthetic gauge phase, we identify distinct dynamical regimes characterized by decoherence-free population exchange, damped oscillations, long-lived revivals, and excitation trapping. Using a combination of time-domain simulations and resolvent-based analysis, we show how interference and band structure effects lead to the emergence of bound states, quasi-bound states, and phase-dependent entanglement dynamics. We compare the initial states with localized and delocalized atomic excitations, demonstrating that pre-existing entanglement can enhance the robustness against decoherence or accelerate its loss, depending on the system parameters. These results highlight the utility of synthetic photonic lattices and nonlocal emitter configurations in tailoring quantum coherence, entanglement, and information flows in structured environments. Full article