Goal-Oriented Wireless Communication Resource Allocation for Cyber-Physical Systems

Cheng Feng, Kedi Zheng, Yi Wang, Kaibin Huang, Qixin Chen

TL;DR

This paper proposes a "goal-oriented" framework for wireless resource allocation in Cyber-Physical Systems (CPS), such as smart grids and autonomous vehicle networks. Instead of simply maximizing raw throughput, the framework prioritizes data transmissions based on their "information utility"—how much a specific piece of data actually helps achieve the system's end goal (e.g., minimizing control error or training loss).

What Problem Does This Paper Address?

In modern industrial applications, the "last-mile" wireless link is often the bottleneck. Traditionally, wireless engineers focus on Shannon’s paradigm: maximizing bits per second (throughput) or minimizing bit error rates. However, for a CPS operator, not all bits are created equal. A sensor reading during a power grid failure is infinitely more valuable than a routine status update, even if both are the same size.

Current CPS operations often treat wireless networks as unpredictable "black boxes," leading to overly conservative and inefficient designs. Conversely, standard communication protocols ignore the semantics (meaning) and significance of the data they carry. The authors address this gap by creating a mathematical bridge between communication resources (bandwidth) and physical system performance.

Methods

The authors formulate a bandwidth allocation problem aimed at maximizing the Information Utility Gain. Because this is a large-scale combinatorial problem (NP-hard), they introduce a three-step solution:

  1. Divide-and-Conquer: They leverage the submodular property (the law of diminishing returns) of most CPS goal functions. This allows them to decompose a complex global objective into "marginal utility gains" for each individual device.
  2. Knapsack Reformulation: The bandwidth allocation is transformed into a version of the "Knapsack Problem," where the "weight" is the required radio resource blocks and the "value" is the marginal utility of a device's data.
  3. Greedy Algorithm: They propose a fast, greedy solution with a complexity of $O(J \log J)$, making it suitable for real-time execution on edge servers. It includes a "Hybrid" rule that factors in both the importance of the data and the quality of the wireless channel.

To solve the "Causality Problem" (not knowing how useful data is until you've already received it), they suggest two strategies: for large payloads (like images), devices upload a tiny "utility value" first; for small payloads, the server predicts utility based on historical trends.

Datasets

The researchers evaluated their framework across four distinct application scenarios using a mix of real-world and synthetic data:

  • MNIST Dataset: Used for the Edge Learning and Federated Learning simulations to classify handwritten digits.
  • Smart Grid Simulation: A synthetic scenario involving 15,000 devices for emergency demand response (load shedding).
  • Vehicle Routing: Simulated real-time travel time data for urban navigation.
  • System Identification: A distributed optimization task where 10 devices collaboratively estimate a large ($100 \times 100$) matrix.

Key Insights and Ideas

  • Semantics > Shannon: The core "aha moment" is that communication should be a servant to the application's goal. By ignoring "irrelevant" data, the system can achieve better physical performance even with less bandwidth.
  • The Hybrid Advantage: Purely "utility-based" allocation ignores channel conditions (it might waste resources trying to reach a device with a terrible signal). Purely "channel-based" allocation ignores data importance. The Hybrid RBA (Resource Block Allocation) finds the sweet spot, prioritizing "high-value, low-cost" transmissions.
  • Mathematical Unified Framework: The paper provides a "recipe book" (Table II) for calculating marginal utility across four very different tasks: decision-making, edge training, federated learning, and distributed optimization.

Key Results

The proposed "Hybrid" goal-oriented approach consistently outperformed standard channel-based methods:

  • Decision Making: Reduced decision costs by approximately 50% compared to traditional channel-based policies under the same communication budget.
  • Edge Learning: Reached 95% accuracy in roughly half the time (50% fewer data collection phases) compared to standard methods.
  • Federated Learning: Achieved target accuracy with a 30% reduction in total training time.
  • Distributed Optimization: Reached the optimality gap ($10^{-3}$) 30% faster by prioritizing devices whose local variables were changing the most (indicating they had the most "news" to share with the consensus).

Limitations and Future Work

  • Simplified Channel Model: The current study omits small-scale fading effects to simplify the allocation logic. Future work could integrate more realistic, fast-fading channel models.
  • Co-Design: The authors suggest that even greater gains could be found by "co-designing" the physical control laws and the communication protocols simultaneously, rather than just optimizing the communication to fit a pre-set control goal.
  • Latency vs. Utility: While the paper focuses on utility, some CPS tasks have "hard" real-time deadlines where latency is the only metric that matters. Integrating these hard constraints into the utility framework is a potential next step.

Summary updated

Abstract

The proliferation of novel industrial applications at the wireless edge, such as smart grids and vehicle networks, demands the advancement of cyber-physical systems (CPSs). The performance of CPSs is closely linked to the last-mile wireless communication networks, which often become bottlenecks due to their inherent limited resources. Current CPS operations often treat wireless communication networks as unpredictable and uncontrollable variables, ignoring the potential adaptability of wireless networks, which results in inefficient and overly conservative CPS operations. Meanwhile, current wireless communications often focus more on throughput and other transmission-related metrics instead of CPS goals. In this study, we introduce the framework of goal-oriented wireless communication resource allocations, accounting for the semantics and significance of data for CPS operation goals. This guarantees optimal CPS performance from a cybernetic standpoint. We formulate a bandwidth allocation problem aimed at maximizing the information utility gain of transmitted data brought to CPS operation goals. Since the goal-oriented bandwidth allocation problem is a large-scale combinational problem, we propose a divide-and-conquer and greedy solution algorithm. The information utility gain is first approximately decomposed into marginal utility information gains and computed in a parallel manner. Subsequently, the bandwidth allocation problem is reformulated as a knapsack problem, which can be further solved greedily with a guaranteed sub-optimality gap. We further demonstrate how our proposed goal-oriented bandwidth allocation algorithm can be applied in four potential CPS applications, including data-driven decision-making, edge learning, federated learning, and distributed optimization. Through simulations, we confirm the effectiveness of our proposed goal-oriented bandwidth allocation framework in meeting CPS goals.
BibTeX
@article{feng2024goal,
  author = {Cheng Feng and Kedi Zheng and Yi Wang and Kaibin Huang and Qixin Chen},
  title = {{Goal-Oriented Wireless Communication Resource Allocation for Cyber-Physical Systems}},
  journal = {IEEE Transactions on Wireless Communications},
  year = {2024},
  doi = {10.1109/twc.2024.3432918},
}
Figure