Wireless Network Resource Allocation for Video Transmission Based on Non-Orthogonal Multiple Access

Rongzhen Li, Lei Xu, Yinke Song, Ping Wang, Wanli Liu, Zhicheng CaiResearch Square 2024 · DOI

TL;DR

This paper proposes a novel resource allocation framework for video transmission in 5G/6G networks by combining Non-Orthogonal Multiple Access (NOMA) with Scalable Video Coding (SVC). By decomposing a complex optimization problem into three manageable sub-problems—user grouping, power allocation, and video layer selection—the authors significantly improve the Quality of Experience (QoE) for users while maintaining strict real-time and reliability constraints.

What Problem Does This Paper Address?

As video traffic is projected to account for over 80% of mobile data, current wireless networks face a "spectrum crunch." Traditional Orthogonal Multiple Access (OMA) schemes, like OFDM, limit efficiency because each resource block is dedicated to a single user.

The authors tackle the challenge of delivering high-quality video to multiple users simultaneously under limited power and bandwidth. They specifically look at the downlink scenario where a base station must decide:

  1. Which users should share the same sub-channel?
  2. How much power should be allocated to each user to ensure signals can be decoded correctly?
  3. How many video layers (quality levels) should be sent to each user to maximize their experience without missing real-time deadlines?

This creates a "Mixed-Integer Nonlinear Programming" (MINLP) problem—a mathematical nightmare that is notoriously difficult to solve optimally in real-time.

Methods

To solve the MINLP, the researchers broke the problem into a three-stage pipeline:

  1. User Grouping (Auction-based): Instead of a brute-force search, they used Auction Theory. Sub-channels act as "goods," and users "bid" based on the potential transmission rate they can achieve. This efficiently assigns users to groups that can share a NOMA sub-channel.
  2. Power Allocation (SCA + Lagrangian): NOMA relies on Successive Interference Cancellation (SIC), which makes the math non-convex (messy). The authors used Successive Convex Approximation (SCA) to linearize the problem and then applied Lagrangian dual decomposition to find the optimal power distribution among users in a group.
  3. Video Layer Allocation (Greedy Strategy): Using Scalable Video Coding (SVC), video is split into a base layer (essential) and enhancement layers (extra quality). The authors developed a greedy algorithm that allocates as many enhancement layers as possible to a user, provided the allocated power and bandwidth can support the data rate required to meet the transmission deadline.

Datasets

The paper does not use a pre-existing external dataset. Instead, the authors conducted numerical simulations using Python (PyCharm 2018). The simulation environment modeled a 5G/6G cell with:

  • Cell Radius: 30m to 500m.
  • Users: 20 users distributed evenly.
  • Channel Model: Rayleigh distribution (to simulate multipath fading) with a path loss coefficient of 2.
  • Video Parameters: 5 layers per video, with a layer size of 10,000 bits and a transmission time limit of 0.002s.

Key Insights and Ideas

  • The NOMA-SVC Synergy: The most elegant idea here is the pairing of NOMA’s power-domain multiplexing with SVC’s layered quality. NOMA naturally creates different "tiers" of service within a single frequency; SVC allows the network to fill those tiers with appropriate levels of video detail.
  • Reliability via SINR: Rather than just looking at raw speed, the authors integrated an "interruption probability" constraint. They used the Signal-to-Interference-plus-Noise Ratio (SINR) to ensure that even with the interference inherent in NOMA, the probability of a transmission failure remains below a strict threshold (e.g., 5%).
  • Decoupling Complexity: The paper demonstrates that a seemingly unsolvable MINLP can be handled effectively by treating grouping, power, and application-layer quality as sequential, interdependent steps rather than one giant equation.

Key Results

The proposed algorithm was compared against the Fast Greedy Algorithm (FGA) and a distance-based NOMA scheme (noma_nt):

  • Higher QoE: The proposed method consistently delivered higher Quality of Experience scores across all tested video layer counts and power levels.
  • Superior Throughput: In total rate vs. bandwidth tests, the proposed algorithm outperformed competitors, especially as bandwidth increased, showing better scalability.
  • Stability: The proposed algorithm reached a "QoE plateau" faster than others, meaning it finds a high-quality stable state at lower power levels (around 0.15W) compared to other methods that struggle to optimize the allocation.

Limitations and Future Work

  • Simplified Delay Model: The authors explicitly state they only considered transmission delay and ignored queue delay. In a real-world congested network, queueing at the base station could significantly impact the real-time performance of the greedy layer allocation.
  • Downlink Only: The study focuses entirely on the downlink. As user-generated content (streaming from phones) grows, an uplink version of this resource allocation model would be necessary.
  • Static Users: The simulation assumes users are evenly distributed and relatively static. Future work could explore how high mobility (e.g., users in a moving vehicle) affects the auction-based grouping and SIC decoding stability.

Summary updated

Abstract

<title>Abstract</title> In wireless networks, we study the downlink scenario of a non-orthogonal multiple access (NOMA) network based on scalable video coding techniques. The resource allocation problem based on wireless NOMA network is modeled as a mixed-integer nonlinear programming problem, which is subject to video coding characteristics, sub-channel capacity, system available power, and real-time requirements of wireless network. In order to solve the resource allocation problem of wireless NOMA network, three sub-problems are proposed, e.g., user grouping sub-problem, power allocation sub-problem, and video layer allocation sub-problem. Firstly, we propose an auction-based solution for the user grouping sub-problem. Then, for the power allocation sub-problem, we choose successive convex approximation and Lagrangian dual decomposition method. Finally, for the video layer allocation sub-problem, we propose a greedy strategy. Simulation experiments show that our proposed algorithms ensure the real-time and reliability requirements of the wireless network and also improve the quality of the video experience.
BibTeX
@inproceedings{li2024wireless,
  author = {Rongzhen Li and Lei Xu and Yinke Song and Ping Wang and Wanli Liu and Zhicheng Cai},
  title = {{Wireless Network Resource Allocation for Video Transmission Based on Non-Orthogonal Multiple Access}},
  booktitle = {Research Square},
  year = {2024},
  doi = {10.21203/rs.3.rs-3865805/v1},
}
Figure