YWYu Wu

Yu Wu

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Yu Wu has a total of 4 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Residual-Corrected Variable-Interval Kalman Filtering for Channel Load Estimation in SPMA-Based Multi-Hop UAV Ad Hoc Networks

    by Yu Wu, Byung-Seo Kim

    In multi-hop UAV ad hoc networks, three-dimensional high mobility, strong line-of-sight interference and a hard saturation constraint on control-plane broadcasting distinguish the channel load estimation problem from its terrestrial counterpart: the HELLO broadcast interval cannot be shortened arbitrarily, so the channel occupancy statistics (COS) required by the statistical priority-based multiple access (SPMA) protocol must be inferred from observations that are asynchronous and separated by long idle gaps. The existing SMA-KF filtering method adopts a first-order random-walk prediction model and lacks trend-tracking capability, and thus easily produces systematic lag when the channel load changes with a trend; directly introducing data-driven compensation, in turn, brings the risk of closed-loop estimation divergence under long gaps. To this end, this paper proposes a residual-corrected variable-interval Kalman filtering (RC-VKF) method for channel load estimation. The method builds a closed-loop recursive framework with the variable-interval Kalman filter while retaining the capability to quantify state uncertainty; it constructs residual labels only from the node’s local packet observations and adopts recursive least squares to perform incremental online training of the corrector, without any offline ground-truth dataset; it designs a confidence gating mechanism driven by the gap duration, under which the correction term gradually withdraws when the gap is extra long and the algorithm automatically degenerates into a covariance-bounded Kalman filter, thereby guaranteeing the stability of the closed-loop estimation at the architectural level. Closed-loop simulation results of a multi-hop network show that, compared with SMA-KF, the proposed RC-VKF method achieves a consistent improvement in estimation accuracy under different traffic intensities and HELLO broadcast periods; meanwhile, it can effectively suppress the large estimation errors in the 95th-percentile tail and improve the reliability of the SPMA transmission decision; when observations become extremely sparse, the correction term is withdrawn by the confidence gate and the estimator degrades gracefully to the filtering kernel; within the bounded gap range assumed in the stability analysis, its accuracy is essentially that of the filtering kernel, and beyond that range, the estimate reduces to the hold-based prediction instead of diverging.

  • Open Access

    Probabilistic Admission Control with Dual-Window Channel Occupancy Statistics for Statistical Priority-Based Multiple Access

    by Yu Wu, Byung-Seo Kim

    Statistical priority-based multiple access (SPMA) provides differentiated channel access for multi-priority traffic by comparing the channel occupancy statistic (COS) with hierarchical thresholds. However, existing threshold-setting methods ignore the inherent fluctuation in the COS caused by random traffic arrivals, so that a large fraction of time slots are incorrectly blocked and the channel performance degrades sharply under overload. To address this issue, this paper proposes DW-PA-SPMA, a dual-window probabilistic admission SPMA protocol. Its core idea is to move traffic management from post-hoc threshold interception at the transmission time slot to probabilistic admission at the packet generation instant: based on a capacity budget that relates the available channel capacity to the traffic demand of each priority, excess packets are truncated at the source following the principle of “highest priority first, remaining capacity for lower priorities”, so that no queue buffers or channel contention resources are wasted. A dual-window statistic separates instantaneous fluctuation from the steady-state trend, and a dual-EWMA difference method estimates the load variation time scale online, allowing the long window length to adapt to traffic variations without prior load information. Simulation results under a six-segment time-varying load show that the protocol keeps the highest-priority end-to-end completion rate above the 90% target from light load to full load and remains stable under 2.0× overload, whereas existing threshold-based protocols degrade sharply in the heavy-load segment, demonstrating the advantages of the proposed protocol in dynamic traffic scenarios.

  • Open Access

    Spatial Correlation-Aided Multi-Source Asynchronous Kalman Filter for SPMA Channel Occupancy Statistics Estimation in Multi-Hop UAV Ad Hoc Networks

    by Yu Wu, Byung-Seo Kim

    In multi-hop UAV ad hoc networks employing the Statistical Priority-based Multiple Access (SPMA) protocol, the HELLO broadcast interval cannot be arbitrarily shortened due to the inherent upper bound on the per-slot transmission probability of each node in saturated networks, which fundamentally limits the estimation accuracy of Channel Occupancy Statistics (COS). To address this problem, this paper proposes a spatial correlation-aided multi-source asynchronous Kalman filtering method, abbreviated as SMA-KF. On the basis of conventional COS broadcasting, SMA-KF introduces two complementary observation sources: COS measurements piggybacked on data packets, and spatially correlated observations from common neighbors compensated by historical biases. These three types of observations are integrated into a unified Kalman filtering framework, and a state-space model suitable for asynchronous intermittent observations is constructed. Theoretical analysis verifies the convergence of the algorithm. Simulation results demonstrate that the proposed algorithm significantly outperforms the EWMA and TW algorithms across all test scenarios, and achieves overall lower error than BiLSTM. Under the extremely sparse observation condition with a HELLO broadcast interval of 600 slots, the Normalized Root Mean Square Error (NRMSE) of SMA-KF is 28.28%, which is 32.8% and 26.2% lower than those of EWMA (42.11%) and TW (38.33%), respectively. In the heavy-traffic scenario with an average data packet arrival interval of 20 slots, the NRMSE of SMA-KF is as low as 4.80%, whereas those of EWMA and TW are 17.49% and 15.40%, respectively, corresponding to reductions of 72.6% and 68.8%. In comparison with BiLSTM, SMA-KF achieves lower NRMSE in five out of seven traffic configurations, while BiLSTM exhibits only marginal and statistically insignificant advantages in the remaining two configurations. Link interruption experiments show that SMA-KF maintains NRMSE between 5.68% and 10.40% across the entire meaningful interruption coverage range of 0% to 53%, consistently outperforming all benchmark algorithms. Moreover, SMA-KF consistently achieves the lowest estimation error under varying node mobility speeds. Parameter sensitivity analysis confirms that SMA-KF maintains stable performance across a wide range of parameter values. These results validate the effectiveness of multi-source observation fusion and spatial cooperative estimation in improving both the accuracy and robustness of COS estimation.


  • Open Access

    MA-SPMA: A Multi-Hop Adaptive MAC Protocol for Flying Ad Hoc Networks Based on Two-Dimensional Queueing and Dual-Round Decision

    by Yu Wu, Xianghua Zeng, Byung-Seo Kim

    Aiming at the problems of the traditional Statistical Priority-Based Multiple Access (SPMA) protocol in multi-hop Flying Ad Hoc Networks (FANETs), such as single-dimensional queueing only according to priority, unreasonable First-In-First-Out (FIFO) scheduling, high timeout dropping probability of multi-hop forwarding packets, and insufficient utilization of channel opportunities, this paper proposes a multi-hop adaptive SPMA protocol (MA-SPMA) suitable for dynamic multi-hop scenarios. The protocol adopts the Neighbor-Priority Two-Dimensional Queueing (NPTQ) mechanism to store packets jointly according to the next-hop neighbor and priority. A Priority-Utility Dual-round Decision (PUDD) mechanism is designed: in the first round, candidate queues that meet channel load conditions are selected in parallel; in the second round, a utility function constructed by normalized delay, priority, and the end-to-end transmission success rate is used to select the optimal packet for transmission. Theoretical analysis shows that the time and space complexity of MA-SPMA are linearly related to the number of neighbor nodes, with controllable overhead, which is suitable for resource-constrained Unmanned Aerial Vehicle (UAV) platforms. In the MATLAB simulation environment, the Reference Point Group Mobility (RPGM) model is used to construct a multi-hop topology, and comparisons are conducted with two typical improved protocols for multi-hop networks: DCLS-SPMA and BiLSTM-SPMA. The results show that the proposed protocol can significantly improve the end-to-end transmission success rate and network throughput, with more obvious advantages in scenarios with a high proportion of multi-hop services. This paper provides an effective solution for Medium Access Control (MAC) protocol design in FANETs.

  • Open Access

    Joint Clustering and Power Optimization for the SPMA Protocol in UAV Swarm Communication in Frequency-Constrained Scenarios

    by Yu Wu, Changheun Oh, Hongshan Nie, Byung-Seo Kim

    Unmanned aerial vehicle (UAV) swarms face significant performance degradation when operating on a single-frequency channel, as the Statistical Priority-based Multiple Access (SPMA) protocol suffers from intensified contention conflicts due to scarce frequency resources. To address this issue, this paper proposes a joint clustering and power optimization method for the SPMA protocol in frequency-constrained scenarios. First, a utility function centered on the end-to-end transmission success rate is constructed, and the optimal clustering scheme selection is formulated as a constrained combinatorial optimization problem. Second, a three-stage heuristic algorithm is designed; all iterations are executed virtually at network initialization. K-means is used to perform initial clustering and determine the minimum power required for intra-cluster services, GPSR is used to establish multi-hop routes for inter-cluster services, and the ant colony algorithm refines the transmission power of forwarding nodes, achieving joint optimization of cluster structure and power configuration. Simulation results show that, compared with the standalone SPMA protocol and the typical clustering algorithm ICW, the proposed algorithm reduces transmission power by 90.4% relative to SPMA (with slightly higher power than ICW) and achieves a comprehensive improvement over both benchmarks. Specifically, the success rate is improved by 63.5% compared with SPMA and 162.3% compared with ICW under high traffic loads, thus achieving a well-balanced compromise between power consumption and transmission reliability. This verifies the feasibility and effectiveness of the proposed optimization method in frequency-constrained scenarios.