Dynamic Spectrum Sharing via Credit-Based Bidding
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional wireless communication systems face inefficiencies in spectrum utilization due to variability in traffic demand, leading to suboptimal resource allocation and potential collisions between networks sharing the same frequency band.
Innovation Solution
A wireless communication system that employs a bidding process using a finite pool of bidding credits, where each operator generates a power spectrum matrix based on its needs and allocates resources dynamically, leveraging machine learning to predict latency tolerance and optimize spectrum access, thereby avoiding collisions and improving overall spectrum utilization.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If conventional wireless networks use fixed frequency band allocation, then each network has dedicated spectrum access, but spectrum utilization efficiency deteriorates due to variability in traffic demand
Solution Approach 1:
The patent implements dynamic spectrum sharing where networks transition from static frequency allocation to dynamic access based on real-time traffic conditions. The shared radio frequency channel allows spectrum resources to be dynamically allocated to different networks according to their instantaneous demand, resolving the contradiction between guaranteed access and utilization efficiency.
Solution Approach 2:
The system changes the parameter of spectrum allocation from fixed to variable by introducing a bidding mechanism where networks bid for spectrum access rights using credits. This parameter change enables spectrum resources to be reallocated based on changing traffic conditions, improving overall utilization while maintaining reliable access through the bidding process.
2Productivity
If multiple wireless networks share the same frequency band, then spectrum utilization efficiency improves, but collision probability increases between networks
Solution Approach 1:
The patent employs a feedback mechanism where networks receive information about spectrum occupancy and collision conditions, then adjust their bidding strategies accordingly. The system provides feedback on spectrum usage patterns and collision events, enabling networks to optimize their channel access decisions and reduce collisions while maintaining high spectrum utilization.
Solution Approach 2:
The bidding process serves as a preliminary action that resolves spectrum access rights before actual data transmission occurs. Networks submit bids in advance using their credit pools, and the system determines channel access priorities before potential collisions can occur, preventing conflicts rather than resolving them after they happen.
3Reliability
If a common RAN Scheduler is used for all networks, then coordination and collision avoidance improve, but system complexity increases
Solution Approach 1:
The patent introduces a spectrum sharing coordinator as an intermediary that manages spectrum allocation without requiring a common RAN Scheduler. This mediator receives bids from multiple networks, determines allocation decisions, and provides feedback to participants, achieving coordinated spectrum access while maintaining the independence of individual network RANs and avoiding the complexity of a unified scheduling system.
4Productivity
If unlimited spectrum access is allowed, then each network can meet its traffic demand, but interference and collisions between networks increase
Solution Approach 1:
The system changes the parameter of spectrum access from unlimited to controlled by introducing a credit-based bidding mechanism. Networks have finite credit pools that constrain their spectrum access requests, preventing unlimited simultaneous transmissions that would cause interference. The credit consumption and replenishment mechanism dynamically regulates access levels to balance demand satisfaction with interference control.
Data Source
Figure 1
Figure 2
Figure 3
AI summary
Devices, systems, and methods for channel access in dynamic spectrum sharing. In one embodiment, a server includes a communication interface, a memory, and an electronic processor configured to receive an allotment of bidding credits, determine an amount of available spectrum, generate a power spectrum matrix, generate a bid based on a need for spectrum access and a portion of the allotment of bidding credits, control the communication interface to transmit the power spectrum matrix and the bid to the one or more servers, receive an external power spectrum matrix and an associated bid from each of the one or more servers, compare the bid to the associated bid to determine a winning bid, and control all of the one or more radio nodes to use the spectrum that is associated with the power spectrum matrix in response to determining that the bid is the winning bid.