Scheduling Apparatus for Bidirectional Traffic via Physical Layer Network Coding
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
The increasing number of communication terminals and traffic in cellular networks faces limitations due to scarce frequency resources and high interference in peer-to-peer communication, necessitating efficient scheduling methods to optimize resource use and reduce interference.
Innovation Solution
A scheduling method and apparatus that perform physical layer network coding by setting up paths through nodes, requesting information from neighboring nodes, and scheduling sessions based on queue differentials and link rates to maximize resource utilization and minimize interference.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If peer-to-peer communication is used to reduce cellular network load and prevent delay, then communication efficiency is improved, but terminals experience great interference due to overlapping usage of resources
Solution Approach 1:
The patent introduces a scheduling apparatus as an intermediary entity that coordinates resource allocation between communicating terminals. This mediator receives scheduling requests from terminals, determines appropriate resource allocations considering queue differentials and link rates, and assigns resources to minimize interference while maintaining communication efficiency.
Solution Approach 2:
The patent dynamically adjusts resource allocation parameters based on real-time network conditions. Specifically, it calculates queue differentials (difference in packet queues between terminals) and link rates to determine optimal scheduling decisions, thereby adapting resource distribution to current traffic patterns and interference conditions.
2Quantity of substance
If frequency resources are increased to support more terminals and traffic, then communication capacity is improved, but existing frequency resources are overly limited and attempts to improve frequency efficiency have reached a limit
Solution Approach 1:
The patent implements dynamic resource allocation where the scheduling apparatus continuously monitors network conditions including queue differentials and link rates, and adjusts frequency resource assignment in real-time. This dynamic approach allows the system to maximize utilization of existing frequency resources by allocating them based on current traffic demands and channel conditions rather than static allocation.
Solution Approach 2:
The system employs feedback mechanisms where terminals report their queue states and link quality to the scheduling apparatus, which then uses this information to make informed scheduling decisions. This feedback loop enables the system to adapt resource allocation to actual network conditions, improving frequency efficiency without requiring additional frequency resources.
3Productivity
If new optical frequency resources in new frequency bands are developed, then frequency efficiency is improved, but transmission distance is reduced due to severe path loss
Solution Approach 1:
The scheduling apparatus acts as a coordinator that optimizes the use of available frequency resources including new optical frequency bands. By intelligently allocating these resources based on queue differentials and link rates, the system maximizes the effective utilization distance of high-frequency resources while managing their inherent path loss characteristics through coordinated scheduling.
Data Source
AI summary
A scheduling method and a scheduling apparatus based on physical layer network coding for bidirectional traffic are provided. The method includes setting up paths passing through a node to perform the physical layer network coding of the bidirectional traffic of sessions that pass through the node. The method further includes requesting, from neighboring nodes of the node, information to be used to schedule the sessions for the physical layer network coding. The method further includes scheduling the sessions for the physical layer network coding based on a queue differential of each session that is calculated based on the information, and a rate of each link of each session.