Search arXiv⌕ Search

arXiv subjects

Jiandong Li

Publications and source records attributed to Jiandong Li.

At least 19 recordsLinked to original sources
arXiv2026

Network Availability Enhancement in Low-Altitude HetNets: A Cross-Layer Design Perspective

This paper proposes a computing-communication resource interchange method to enhance network availability (NA) in low-altitude heterogeneous networks (LA-HetNets). In these networks, communication resource conflicts and imbalances, caused by extreme heterogeneity (diverse mobility, mixed delays, and hybrid transmission), and cross-regional traffic, reduce reliability and lead to unavailability. Restoring NA requires additional communication resources, yet dynamic cross-regional scheduling is limited, making locally redundant computing resources an alternative to reduce communication resource overhead. While computing resources address medium access control (MAC)-layer unreliability, physical (PHY)-layer functionalities still rely on communication resources. Thus, it remains unclear whether increasing computing resources alone can achieve target NA, especially under greater heterogeneity. We elaborate on the impact of heterogeneity on NA and show that expanding computing resources alone cannot meet target NA under high heterogeneity, as NA degrades sharply due to increased communication capability demands. To overcome this, we propose a cross-layer optimization method enabling computing-communication resource interchange to address both MAC- and PHY-layer unreliability. By reducing processing delays with computing resources while ensuring MAC-layer reliability, our method extends PHY-layer transmission delay and expands communication resources. Simulations demonstrate our approach's superiority in achieving target NA under greater heterogeneity, revealing that computing-communication resource interchange fulfills expanding communication capability demands more effectively than conventional resource overhead reduction.

cs.NI↗
arXiv2026

On Capacity and Delay of Wireless Networks with Node Failures

One key challenge in designing resilient large-scale wireless ad hoc networks is to understand how random node failures affect fundamental network performance. In this work, we show that both network capacity and delay scale as \scalebox{0.65}{$\textstyle Θ\left(\sqrt{\frac{n(1-q)}{\log n}}\right)$}, where $n$ is the total number of nodes and $q$ is the node failure probability. The network capacity degenerates to the classical result given by P. Gupta and P. R. Kumar when $q=0$. Based on these results, we find that even with the same number of non-faulty nodes, a network with $n$ nodes and node failure probability $q$ has lower network capacity than a failure-free network with $n(1-q)$ nodes. To compensate for the network capacity loss caused by random node failures, at least $ε(n,q) nq$ redundant nodes are required, where $ε(n,q)>1$. We further prove that the optimal trade-off between network capacity and delay remains $O(1)$ regardless of node failures, implying that high network capacity and low delay cannot be achieved simultaneously. These results demonstrate robustness against stochastic variations in wireless channels.

cs.IT↗
arXiv2026

Availability of Aerial Heterogeneous Networks for Reliable Emergency Communications

We investigate network availability (NA) in aerial heterogeneous networks (AHetNets) for effective emergency rescue, where diverse delay-constrained communication services must be provided to user equipments (UEs) with varying mobility. The heterogeneity in delay constraints and UE mobility introduces resource allocation conflicts and imbalances, which undermine communication reliability and challenge NA. Although unified resource allocation (URA) can mitigate these issues, it remains unclear whether NA can be sustained under such diverse conditions. To address this, we derive expressions for the lower bound (LB) on NA in AHetNets under URA. Our analysis reveals that extended heterogeneity significantly degrades the LB due to resource limitations-even when the heterogeneity stems from additional services under less stringent delay constraints (LSDC) or from UEs with lower mobility. To overcome this degradation, we formulate and solve a joint optimization problem for the number of UEs sharing time-frequency resources ($K$) and pilot length ($ξ$), aiming to enhance the LB by improving spatial, frequency, and temporal resource efficiency. Simulation results validate our analysis and demonstrate that jointly optimizing $K$ and $ξ$ enables AHetNets to achieve the target NA under greater heterogeneity, outperforming existing resource allocation policies.

eess.SP↗
arXiv2025

Regional Resource Management for Service Provisioning in LEO Satellite Networks: A Topology Feature-Based DRL Approach

Satellite networks with wide coverage are considered natural extensions to terrestrial networks for their long-distance end-to-end (E2E) service provisioning. However, the inherent topology dynamics of low earth orbit satellite networks and the uncertain network scales bring an inevitable requirement that resource chains for E2E service provisioning must be efficiently re-planned. Therefore, achieving highly adaptive resource management is of great significance in practical deployment applications. This paper first designs a regional resource management (RRM) mode and further formulates the RRM problem that can provide a unified decision space independent of the network scale. Subsequently, leveraging the RRM mode and deep reinforcement learning framework, we develop a topology feature-based dynamic and adaptive resource management algorithm to combat the varying network scales. The proposed algorithm successfully takes into account the fixed output dimension of the neural network and the changing resource chains for E2E service provisioning. The matched design of the service orientation information and phased reward function effectively improves the service performance of the algorithm under the RRM mode. The numerical results demonstrate that the proposed algorithm with the best convergence performance and fastest convergence rate significantly improves service performance for varying network scales, with gains over compared algorithms of more than 2.7%, 11.9%, and 10.2%, respectively.

cs.NI↗
arXiv2025

3C Resources Joint Allocation for Time-Deterministic Remote Sensing Image Backhaul in the Space-Ground Integrated Network

Low-Earth-orbit (LEO) satellites assist observation satellites (OSs) to compress and backhaul more time-determined images (TDI) has become a new paradigm, which is used to enhance the timeout caused by the limited computing resources of OSs. However, how to capture the time-varying and dynamic characteristics of multi-dimensional resources is challenging for efficient collaborative scheduling. Motivated by this factor, we design a highly succinct multi-dimensional resource time-expanded graph (MDR-TEG) modell. Specifically, by employing a slots division mechanism and introducing an external virtual node, the time-varying communication, caching, and computing (3C) resources are depicted in low complexity by the link weights within, between, and outside the slots. Based on the MDR-TEG, the maximizing successful transmission ratio of TDI (MSTR-TDI) is modeled as a mixed integer linear programming (MILP) problem. Which further relaxed decomposed into two tractable sub-problems: maximizing the successful transmission rate of images (MSTRI) and ensuring the timeliness problem (ETP). Subsequently, an efficient subgradient of relaxation computing constraint (SRCC) algorithm is proposed. The upper and lower bounds of MSTR-TDI are obtained by solving the two subproblems and the dual problem (DP), and the direction of the next iteration is obtained by feedback. Furthermore, arranging the sending sequences of images to improve the quality of the solution. The approximate optimal solution of MSTR-TDI is eventually obtained through repeated iterations. The simulation results verify the superiority of the proposed MDR-TEG model and the effectiveness of the SRCC.

eess.SY↗
arXiv2025

A Model-Data Dual-Driven Resource Allocation Scheme for IREE Oriented 6G Networks

The rapid and substantial fluctuations in wireless network capacity and traffic demand, driven by the emergence of 6G technologies, have exacerbated the issue of traffic-capacity mismatch, raising concerns about wireless network energy consumption. To address this challenge, we propose a model-data dual-driven resource allocation (MDDRA) algorithm aimed at maximizing the integrated relative energy efficiency (IREE) metric under dynamic traffic conditions. Unlike conventional model-driven or data-driven schemes, the proposed MDDRA framework employs a model-driven Lyapunov queue to accumulate long-term historical mismatch information and a data-driven Graph Radial bAsis Fourier (GRAF) network to predict the traffic variations under incomplete data, and hence eliminates the reliance on high-precision models and complete spatial-temporal traffic data. We establish the universal approximation property of the proposed GRAF network and provide convergence and complexity analysis for the MDDRA algorithm. Numerical experiments validate the performance gains achieved through the data-driven and model-driven components. By analyzing IREE and EE curves under diverse traffic conditions, we recommend that network operators shall spend more efforts to balance the traffic demand and the network capacity distribution to ensure the network performance, particularly in scenarios with large speed limits and higher driving visibility.

cs.NI↗
arXiv2025

Rethinking Regularization Methods for Knowledge Graph Completion

Knowledge graph completion (KGC) has attracted considerable attention in recent years because it is critical to improving the quality of knowledge graphs. Researchers have continuously explored various models. However, most previous efforts have neglected to take advantage of regularization from a deeper perspective and therefore have not been used to their full potential. This paper rethinks the application of regularization methods in KGC. Through extensive empirical studies on various KGC models, we find that carefully designed regularization not only alleviates overfitting and reduces variance but also enables these models to break through the upper bounds of their original performance. Furthermore, we introduce a novel sparse-regularization method that embeds the concept of rank-based selective sparsity into the KGC regularizer. The core idea is to selectively penalize those components with significant features in the embedding vector, thus effectively ignoring many components that contribute little and may only represent noise. Various comparative experiments on multiple datasets and multiple models show that the SPR regularization method is better than other regularization methods and can enable the KGC model to further break through the performance margin.

cs.LG↗
arXiv2025

A Unified QoS-Aware Multiplexing Framework for Next Generation Immersive Communication with Legacy Wireless Applications

Immersive communication, including emerging augmented reality, virtual reality, and holographic telepresence, has been identified as a key service for enabling next-generation wireless applications. To align with legacy wireless applications, such as enhanced mobile broadband or ultra-reliable low-latency communication, network slicing has been widely adopted. However, attempting to statistically isolate the above types of wireless applications through different network slices may lead to throughput degradation and increased queue backlog. To address these challenges, we establish a unified QoS-aware framework that supports immersive communication and legacy wireless applications simultaneously. Based on the Lyapunov drift theorem, we transform the original long-term throughput maximization problem into an equivalent short-term throughput maximization weighted by virtual queue length. Moreover, to cope with the challenges introduced by the interaction between large-timescale network slicing and short-timescale resource allocation, we propose an adaptive adversarial slicing (Ad2S) scheme for networks with invarying channel statistics. To track the network channel variations, we also propose a measurement extrapolation-Kalman filter (ME-KF)-based method and refine our scheme into Ad2S-non-stationary refinement (Ad2S-NR). Through extended numerical examples, we demonstrate that our proposed schemes achieve 3.86 Mbps throughput improvement and 63.96% latency reduction with 24.36% convergence time reduction. Within our framework, the trade-off between total throughput and user service experience can be achieved by tuning systematic parameters.

cs.NI↗
arXiv2024

Machine learning disentangles bias causes of shortwave cloud radiative effect in a climate model

Large bias exists in shortwave cloud radiative effect (SWCRE) of general circulation models (GCMs), attributed mainly to the combined effect of cloud fraction and water contents, whose representations in models remain challenging. Here we show an effective machine-learning approach to dissect the individual bias of relevant cloud parameters determining SWCRE. A surrogate model for calculating SWCRE was developed based on random forest using observations and FGOALS-f3-L simulation data of cloud fraction (CFR), cloud-solar concurrence ratio (CSC), cloud liquid and ice water paths (LWP and IWP), TOA upward clear-sky solar flux (SUC), and solar zenith angle. The model, which achieves high determination coefficient > 0.96 in the validation phase, was then used to quantify SWCRE bias associated with these parameters following the partial radiation perturbation method. The global-mean SWCRE bias (in W m-2) is contributed by CFR (+5.11), LWP (-6.58), IWP (-1.67), and CSC (+4.38), while SUC plays a minor role; the large CSC contribution highlights the importance of cloud diurnal variation. Regionally, the relative importance varies according to climate regimes. In Tropics, overestimated LWP and IWP exist over lands, while oceans exhibit underestimated CFR and CSC. In contrast, the extratropical lands and oceans have, respectively, too-small CSC and the 'too few, too bright' low-level clouds. We thus suggest that machine learning, in addition for developing GCM physical parameterizations, can also be utilized for diagnosing and understanding complex cloud-climate interactions.

physics.ao-ph↗
arXiv2024

Cooperative Tri-Point Model-Based Ground-to-Air Coverage Extension in Beyond 5G Networks

The utilization of existing terrestrial infrastructures to provide coverage for aerial users is a potentially low-cost solution. However, the already deployed terrestrial base stations (TBSs) result in weak ground-to-air (G2A) coverage due to the down-tilted antennas. Furthermore, achieving optimal coverage across the entire airspace through antenna adjustment is challenging due to the complex signal coverage requirements in three-dimensional space, especially in the vertical direction. In this paper, we propose a cooperative tri-point (CoTP) model-based method that utilizes cooperative beams to enhance the G2A coverage extension. To utilize existing TBSs for establishing effective cooperation, we prove that the cooperation among three TBSs can ensure G2A coverage with a minimum coverage overlap, and design the CoTP model to analyze the G2A coverage extension. Using the model, a cooperative coverage structure based on Delaunay triangulation is designed to divide triangular prism-shaped subspaces and corresponding TBS cooperation sets. To enable TBSs in the cooperation set to cover different height subspaces while maintaining ground coverage, we design a cooperative beam generation algorithm to maximize the coverage in the triangular prism-shaped airspace. The simulation results and field trials demonstrate that the proposed method can efficiently enhance the G2A coverage extension while guaranteeing ground coverage.

cs.IT↗
arXiv2023

Energy-Efficient Power Control for Multiple-Task Split Inference in UAVs: A Tiny Learning-Based Approach

The limited energy and computing resources of unmanned aerial vehicles (UAVs) hinder the application of aerial artificial intelligence. The utilization of split inference in UAVs garners significant attention due to its effectiveness in mitigating computing and energy requirements. However, achieving energy-efficient split inference in UAVs remains complex considering of various crucial parameters such as energy level and delay constraints, especially involving multiple tasks. In this paper, we present a two-timescale approach for energy minimization in split inference, where discrete and continuous variables are segregated into two timescales to reduce the size of action space and computational complexity. This segregation enables the utilization of tiny reinforcement learning (TRL) for selecting discrete transmission modes for sequential tasks. Moreover, optimization programming (OP) is embedded between TRL's output and reward function to optimize the continuous transmit power. Specifically, we replace the optimization of transmit power with that of transmission time to decrease the computational complexity of OP since we reveal that energy consumption monotonically decreases with increasing transmission time. The replacement significantly reduces the feasible region and enables a fast solution according to the closed-form expression for optimal transmit power. Simulation results show that the proposed algorithm can achieve a higher probability of successful task completion with lower energy consumption.

cs.LG↗
arXiv2023

Robust TOA-based Localization with Inaccurate Anchors for MANET

Accurate node localization is vital for mobile ad hoc networks (MANETs). Current methods like Time of Arrival (TOA) can estimate node positions using imprecise baseplates and achieve the Cramér-Rao lower bound (CRLB) accuracy. In multi-hop MANETs, some nodes lack direct links to base anchors, depending on neighbor nodes as dynamic anchors for chain localization. However, the dynamic nature of MANETs challenges TOA's robustness due to the availability and accuracy of base anchors, coupled with ranging errors. To address the issue of cascading positioning error divergence, we first derive the CRLB for any primary node in MANETs as a metric to tackle localization error in cascading scenarios. Second, we propose an advanced two-step TOA method based on CRLB which is able to approximate target node's CRLB with only local neighbor information. Finally, simulation results confirm the robustness of our algorithm, achieving CRLB-level accuracy for small ranging errors and maintaining precision for larger errors compared to existing TOA methods.

cs.NI↗
arXiv2023

High Throughput Inter-Layer Connecting Strategy for Multi-Layer Ultra-Dense Satellite Networks

Multi-layer ultra-dense satellite networks (MLUDSNs) have soared this meteoric to provide vast throughputd for globally diverse services. Differing from traditional monolayer constellations, MLUDSNs emphasize the spatial integration among layers, and its throughput may not be simply the sum of throughput of each layer. The hop-count of cross-layer communication paths can be reduced by deploying inter-layer connections (ILCs), augmenting MLUDSN's throughput. Therefore, it remains an open issue how to deploy ILCs to optimize the dynamic MLUDSN topology to dramatically raise throughput gains under multi-layer collaboration. This paper designs an ILC deployment strategy to enhance throughput by revealing the impacts of ILC distribution on reducing hop-count. Since deploying ILCs burdens the satellite with extra communication resource consumption, we model the ILC deployment problem as minimizing the average hop with limited ILCs, to maximize throughput. The proposed problem is a typical integer linear programming (ILP) problem, of which computational complexity is exponential as the satellite scale expands and the time evolves. Based on the symmetrical topology of each layer, we propose a two-phase deployment scheme to halve the problem scale and prioritize stable ILCs to reduce handover-count, which decreases the exponential complexity to a polynomial one, with 1% estimation error: Simulation results based on realistic megaconstellation information confirm that the optimal number of ILCs is less than P.S/2, where P and S are orbits and satellites per orbit. Besides, these ILCs deploy uniformly in each layer, which raises over 1.55x throughput than isolated layers.

cs.NI↗
arXiv2023

Inter-domain Resource Collaboration in Satellite Networks: An Intelligent Scheduling Approach Towards Hybrid Missions

Since the next-generation satellite network consisting of various service function domains, such as communication, observation, navigation, etc., is moving towards large-scale, using single-domain resources is difficult to provide satisfied and timely service guarantees for the rapidly increasing mission demands of each domain. Breaking the barriers of independence of resources in each domain, and realizing the cross-domain transmission of missions to efficiently collaborate inter-domain resources is a promising solution. However, the hybrid scheduling of different missions and the continuous increase in the number of service domains have strengthened the differences and dynamics of mission demands, making it challenging for an efficient cross-domain mission scheduling (CMS). To this end, this paper first accurately characterizes the communication resource state of inter-satellite in real-time exploiting the sparse resource representation scheme, and systematically characterizes the differentiation of mission demands by conducting the mission priority model. Based on the information of resources and missions, we construct the top- and bottom-layer mission scheduling models of reward association exploiting the correlation of intra- and inter-domain mission scheduling and formulate the Markov decision process-based hierarchical CMS problem. Further, to achieve higher adaptability and autonomy of CMS and efficiently mitigate the impact of network scale, a hierarchical intelligent CMS algorithm is developed to dynamically adjust and efficiently match the CMS policy according to different mission demands. Simulation results demonstrate that the proposed algorithm has significant performance gain compared with independent domains and the existing CMS algorithms, and can still guarantee high service performance under different network scales.

eess.SY↗
arXiv2023

Coordinated Intra- and Inter-system Interference Management in Integrated Satellite Terrestrial Networks

Leveraging the advantage of satellite and terrestrial networks, the integrated satellite terrestrial networks (ISTNs) can help to achieve seamless global access and eliminate the digital divide. However, the dense deployment and frequent handover of satellites aggravate intra- and inter-system interference, resulting in a decrease in downlink sum rate. To address this issue, we propose a coordinated intra- and inter-system interference management algorithm for ISTN. This algorithm coordinates multidimensional interference through a joint design of inter-satellite handover and resource allocation method. On the one hand, we take inter-system interference between low earth orbit (LEO) and geostationary orbit (GEO) satellites as a constraint, and reduce interference to GEO satellite ground stations (GEO-GS) while ensuring system capacity through inter-satellite handover. On the other hand, satellite and terrestrial resource allocation schemes are designed based on the matching idea, and channel gain and interference to other channels are considered during the matching process to coordinate co-channel interference. In order to avoid too many unnecessary handovers, we consider handover scenarios related to service capabilities and service time to determine the optimal handover target satellite. Numerical results show that the gap between the results on the system sum rate obtained by the proposed method and the upper bound is reduced as the user density increases, and the handover frequency can be significantly reduced.

cs.NI↗
arXiv2022

Joint OAM Radar-Communication Systems: Target Recognition and Beam Optimization

Orbital angular momentum (OAM) radars are able to estimate the azimuth angle and the rotation velocity of multiple targets without relative motion or beam scanning. Moreover, OAM wireless communications can achieve high spectral efficiency (SE) by utilizing a set of information-bearing modes on the same frequency channel. Benefitting from the above advantages, in this paper, we design a novel radar-centric joint OAM radar-communication (RadCom) scheme based on uniform circular arrays (UCAs), which modulates information signals on the existing OAM radar waveform. In details, we first propose an OAM-based three-dimensional (3-D) super-resolution position estimation and rotation velocity detection method, which can accurately estimate the 3-D position and rotation velocity of multiple targets. Then, we derive the posterior Cramer-Rao bound (PCRB) of the OAM-based estimates and, finally, we analyze the transmission rate of the integrated communication system. To achieve the best trade-off between imaging and communication, the transmitted integrated OAM beams are optimized by means of an exhaustive search method. Both mathematical analysis and simulation results show that the proposed radar-centric joint OAM RadCom scheme can accurately estimate the 3-D position and rotation velocity of multiple targets while ensuring the transmission rate of the communication receiver, which can be regarded as an effective supplement to existing joint RadCom schemes.

eess.SP↗
arXiv2021

Radio-Frequency Multi-Mode OAM Detection Based on UCA Samples Learning

Orbital angular momentum (OAM) at radio-frequency provides a novel approach of multiplexing a set of orthogonal modes on the same frequency channel to achieve high spectral efficiencies. However, classical phase gradient-based OAM mode detection methods require perfect alignment of transmit and receive antennas, which greatly challenges the practical application of OAM communications. In this paper, we first show the effect of non-parallel misalignment on the OAM phase structure, and then propose the OAM mode detection method based on uniform circular array (UCA) samples learning for the more general alignment or non-parallel misalignment case. Specifically, we applied three classifiers: K-nearest neighbor (KNN), support vector machine (SVM), and back-propagation neural network (BPNN) to both single-mode and multi-mode OAM detection. The simulation results validate that the proposed learning-based OAM mode detection methods are robust to misalignment errors and especially BPNN classifier has the best generalization performance.

eess.SP↗
arXiv2021

AoA Estimation for OAM Communication Systems With Mode-Frequency Multi-Time ESPRIT Method

Radio orbital angular momentum (OAM) communications require accurate alignment between the transmit and receive beam directions. Accordingly, a key feature of OAM receivers is the ability to reliably estimate the angle of arrival (AoA) of multi-mode OAM beams. Considering the limitations of existing AoA estimation techniques, in this paper, we propose an easier-to-implement AoA estimation method based on applying multiple times the estimating signal parameters via rotational invariance techniques (ESPRIT) algorithm to the received training signals in OAM mode and frequency domains, which is denoted as the mode-frequency (M-F) multi-time (MT)-ESPRIT algorithm. With this method, the misalignment error of real OAM channels can be greatly reduced and the performance approaches that of ideally aligned OAM channels.

eess.SP↗