Cyclic Wireless Data Packet Scheduling Coordination

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

In communication systems adhering to 3GPP standards, uplink and downlink wireless data transfers operate independently, lacking information exchange between their schedulers, which limits effective scheduling for cyclic wireless communication, particularly for time-critical applications.

Innovation Solution

A method and computing unit for scheduling data packets in cyclic wireless communication systems, where the scheduling of one data packet is influenced by cycle information and channel information from both communication channels, enabling coordinated prioritization and resource allocation across uplink and downlink channels.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Productivity

If uplink and downlink schedulers operate independently according to 3GPP standards, then each scheduler can manage its own channel resources, but the scheduling efficiency for cyclic wireless communication deteriorates due to lack of coordination between channels

Engineering Contradiction:
Improvescheduling efficiencyVSAvoidscheduler coordination complexity
Core Design Contradiction:
ProductivityVSDevice complexity

Solution Approach 1:

The patent merges the uplink and downlink scheduling functions into a unified scheduling entity that considers both channels simultaneously. The scheduling entity determines uplink scheduling decisions based on downlink channel status and vice versa, creating a coordinated scheduling mechanism that improves cyclic communication efficiency while managing complexity through integrated design

Inventive Principle:
Principle #5Merging (Combining)

2Reliability

If adaptive scheduling is used to meet quality of service requirements, then resource allocation optimizes for current channel conditions, but the reliability for time-critical cyclic communication deteriorates due to lack of cycle-aware prioritization

Engineering Contradiction:
Improvetime-critical application reliabilityVSAvoidresource allocation efficiency
Core Design Contradiction:
ReliabilityVSProductivity

Solution Approach 1:

The patent implements preliminary action by having the scheduling entity proactively identify and prioritize data packets belonging to cyclic communication patterns before transmission. The system pre-determines scheduling decisions for cyclic traffic based on cycle information and channel conditions, ensuring time-critical packets receive appropriate resource allocation in advance, thereby improving reliability without sacrificing overall efficiency

Inventive Principle:
Principle #10Preliminary action

3Measurement precision

If channel information is not exchanged between uplink and downlink schedulers, then each scheduler operates with simpler information processing, but the scheduling accuracy for cyclic communication deteriorates

Engineering Contradiction:
Improvescheduling accuracyVSAvoidchannel status information exchange
Core Design Contradiction:
Measurement precisionVSLoss of information

Solution Approach 1:

The patent implements feedback mechanisms where the scheduling entity continuously exchanges channel status information between uplink and downlink scheduling decisions. The system uses feedback from downlink channel conditions to adjust uplink scheduling and vice versa, creating a closed-loop information flow that improves scheduling accuracy for cyclic communication while managing information exchange through structured feedback protocols

Inventive Principle:
Principle #23Feedback

Data Source

PatentUS20240251434A1Method for scheduling a data packet
Publication Date: 2024.07.25 ROBERT BOSCH GMBH
  • US20240251434A1 patent drawing
  • US20240251434A1 patent drawing
  • US20240251434A1 patent drawing

AI summary

The invention relates to a method for scheduling a data packet (fu1, fu2, fd1, fd2) for a cyclical wireless communication in a communication system, whereinone cycle of the communication comprises transferring a first data packet (fu1, fu2) on a first communication channel (38, 42) from a first end point (24, 26) to a second end point (20, 22) and transferring a second data packet (fd1, fd2) on a second communication channel (40, 44) from the second end point (20, 22) to the first or a third end point (24, 26) andthe second data packet (fd1, fd2) is scheduled on the basis of the cycle information relating to the cycle and first channel information relating to the first communication channel (38, 42) and/orthe first data packet (fu1, fu2) is scheduled on the basis of the cycle information and second channel information relating to the second communication channel (40, 44).