US 12376094 B1Patent grantUnited States

Efficient C-V2X Resource Scheduling

Official patent title

Apparatus and method for spectrum efficient cellular V2X transmission in vehicular networks

Arabic title: جهاز وطريقة لإرسال خلوي V2X عالي الكفاءة الطيفية في شبكات المركبات

Invention

Invention

Problem

Dense C-V2X networks can have more vehicles awaiting transmission than available sub-channels, causing contention, packet collisions, delays, and insufficient prioritization of urgent messages.

Why it matters

Deadline- and interference-aware resource scheduling could help connected-vehicle systems use limited spectrum more effectively, but latency, reliability, safety impact, and standards compatibility require independent network-level validation.

Approach

For each sub-frame, the method ranks vehicles by packet time remaining and predicted transmitter-receiver distance, selects 2N vehicles for N sub-channels, and pairs them to maximize the summed interference distances.

Who may benefit

Potential beneficiaries include connected-vehicle platform developers, cellular network vendors, automotive communication suppliers, intelligent-transportation researchers, road-infrastructure operators, and C-V2X simulation and testing laboratories.

Potential value

The disclosed scheduler combines packet urgency, predicted link geometry, sub-channel reuse, and a defined assignment algorithm rather than allocating resources from only one of those factors.

Background

Background

C-V2X supports direct and network-assisted communication among vehicles, infrastructure, pedestrians, and other entities through a time-frequency resource grid. As vehicle density rises, multiple transmitters compete for a limited number of sub-channels, increasing collision and delay risks. Existing systems may not adequately prioritize packets by delivery urgency while also limiting interference. This is especially relevant to connected and autonomous transport functions that depend on timely message exchange, although the patent publication does not itself establish operational safety or deployment performance.

Technology overview

Technology overview

For a sub-frame containing N frequency sub-channels and M waiting vehicles, with M greater than 2N, processing circuitry calculates each packet's remaining delivery time and estimates its transmitter-receiver distance at the sub-frame end. It selects 2N vehicles using those values and assigns two vehicles to each sub-channel. One embodiment first applies a distance threshold, then selects the smallest remaining times. A Hungarian algorithm can pair vehicles from an interference-distance matrix so the sum of receiver separation distances is maximized.

Potential applications

Potential applications

  1. Potential scheduling at a Mode 3 C-V2X eNodeB.
  2. Potential resource allocation for dense connected-vehicle corridors.
  3. Potential prioritization of packets with short remaining delivery times.
  4. Potential C-V2X interference-management research and simulation.

Evidence-supported advantages

Evidence-supported advantages

  1. Uses remaining packet-delivery time as a scheduling input.
  2. Predicts transmitter-receiver distance at the sub-frame end.
  3. Allows two selected vehicles to reuse each sub-channel.
  4. Defines Hungarian-algorithm pairing from an interference-distance matrix.

Development stage

Development stage

Patent publication; development stage not independently verified.

Commercial opportunity

Commercial opportunity

The scheduler may interest automotive-connectivity, cellular-infrastructure, and intelligent-transportation developers. Evaluation should cover standards mapping, computational load, location and speed uncertainty, channel dynamics, congestion, packet-delivery ratio, latency tails, fairness, cybersecurity, interoperability, hardware-in-the-loop testing, field trials, and safety-case integration before any operational use.

Patent classifications

Patent classifications

WIPO IPC

  • H04W72/0453Wireless communication networks
  • H04W4/40Wireless communication networks

CPC

  • H04W72/40Wireless communication networks
  • H04W4/40Wireless communication networks
  • H04W72/566Wireless communication networks
  • H04W72/0453Wireless communication networks
  • H04W72/121Wireless communication networks

Inventors

Inventors

  • First inventorAbdul Khader Jilani Saudagar
  • InventorMuhammad Awais JAVED
  • InventorAhmad Naseem Alvi
  • InventorHitoun A. Alsagri
  • InventorYazeed Masaud Alkhrijah

Keywords

Keywords

  • C-V2X
  • vehicular network
  • spectrum efficiency
  • sub-channel
  • packet deadline
  • interference distance
  • Hungarian algorithm
  • resource scheduling

Patent document and drawings

Patent document and drawings

The patent publication is mapped to this record. Patent drawings remain within that publication; no separately cleared public media package has been supplied.