By separating the forwarding and control planes, Software-Defined Networking (SDN) facilitates flexible traffic routing and network management for a service network. Because of the impact of controller deployment on message transmission distances and network latency, controller placement problems have drawn many researchers' attention. However, assumptions in most existing research that all control packets are either transmitted in the service network (i.e., in-band control) or through predetermined control-service connection (i.e., out-of-band control) are not reasonable due to bandwidth resources occupation on the service network or high construction costs. In this paper, we are the first to jointly discuss the controller placement and control-service connection problem for latency minimization in the hybrid-band control mode, which is essentially a bi-level programming optimization problem. Specifically, we introduce auxiliary variables to simplify the above NP-hard problem. Next, Generalized Benders decomposition is used to obtain an optimal solution in theory. In addition, we propose a time-efficient fireworks algorithm with a little latency increment for large-scale networks. Extensive evaluations show that the two proposed algorithms accomplish the desired objectives and respectively achieve up to 35% and 25% latency decrement than greedy algorithms.
Efficient task offloading in UAV-assisted heterogeneous mobile edge computing (MEC) networks is increasingly challenged by the co-existence of operationally distinct workload scenarios—including high-demand bursts, resource-constrained periods, and balanced operational states—each demanding fundamentally different assignment strategies. In such networks, mobile executor nodes (e.g., UAVs or vehicle-mounted edge servers) must be dispatched to the vicinity of geographically distributed tasks, making assignment decisions jointly dependent on node mobility, the quality of sensing data, and dynamic resource availability. Conventional approaches based on combinatorial optimization with fixed parameters or greedy heuristics fail to adapt to these varying conditions, leading to resource depletion under sequential workloads or underutilization under high-demand bursts. To address these limitations, this paper proposes SAGE (Scene-Adaptive Graph-Enhanced offloading), a task-offloading framework that combines a heterogeneous graph neural network (HeteroGNN) with a dueling double DQN meta-controller and a mixed-integer linear programming (MILP) solver. At the state-representation level, a heterogeneous bipartite graph is constructed over mobile executor nodes and tasks, with type-specific projection layers encoding the semantic features of each node type and three-dimensional edge features—comprising task success probability, normalized service distance, and link quality—integrated via edge-gated message passing. At the decision level, the meta-controller perceives the current workload scenario through a seven-dimensional situational state vector fused with the graph embedding, selects an appropriate offloading strategy from a learned discrete action space, and drives the MILP solver to perform task-chain assignment under the selected configuration. Experiments on 60 fixed evaluation episodes spanning three representative workload scenarios demonstrate that SAGE achieves an overall reward improvement of 15.9% over the best fixed-strategy baseline, reduces the resource depletion rate to 16.7%, and maintains a high-priority task completion rate of 84.7%. Particularly under resource-constrained conditions, SAGE reduces the reward deficit by 72.3% relative to the best fixed strategy (from to ), demonstrating strong scene-adaptive decision-making capability.
Multi-UAV cooperative search is important for applications such as target reconnaissance, environmental monitoring, and emergency response. In practice, communication is often spatially heterogeneous due to terrain occlusion and environmental interference, which may delay information sharing and weaken coordination efficiency when UAVs traverse communication-blocked areas. To address this issue, we propose an Age of Information (AoI)- and Dempster–Shafer (DS)-enhanced cooperative search framework for multi-UAV systems under spatially structured communication constraints. Specifically, a DS belief map is introduced to fuse uncertain observations, while AoI is used to characterize the freshness of delayed information. An AoI-aware update mechanism further integrates buffered observations into the global belief map after communication recovery. The search process is then formulated as a communication-aware multi-agent sequential decision-making problem and solved using reinforcement learning. To demonstrate the generality of the proposed framework, we instantiate it with Proximal Policy Optimization (PPO), Multi-Agent Proximal Policy Optimization (MAPPO), and Q-value Mixing Network (QMIX). Experimental results show that the proposed framework consistently outperforms the baseline methods under heterogeneous environments and different communication conditions. Among all variants, AoI-DS-MAPPO achieves the best overall performance, improving average reward, success rate, and the number of detected targets by 26.13%, 24.32%, and 3.65%, respectively, while reducing episode length by 31.96% relative to the strongest baseline.
Recent advances in large language models (LLMs) have driven substantial progress in knowledge base question answering (KBQA), particularly under few-shot settings. However, symbolic program generation remains challenging due to its strict structural constraints and high sensitivity to generation errors. Existing few-shot methods often rely on multi-turn strategies, such as rule-based step-by-step reasoning or iterative self-correction, which introduce additional latency and exacerbate error propagation. We present CBR2, a case-based reasoning framework with dual retrieval guidance for single-pass symbolic program generation. Instead of generating programs interactively, CBR2 constructs a unified structure-aware prompt that integrates two complementary types of retrieval: (1) structured knowledge from ontologies and factual triples, and (2) reasoning exemplars retrieved via semantic and function-level similarity. A lightweight similarity model is trained to retrieve structurally aligned programs, enabling effective transfer of abstract reasoning patterns. Experiments on KQA Pro and MetaQA demonstrate that CBR2 achieves significant improvements in both accuracy and syntactic robustness. Specifically on KQA Pro, it boosts Hits@1 from 72.70% to 82.13% and reduces syntax errors by 25%, surpassing the previous few-shot state-of-the-art.