Mobile Base Station Scheduling for Demand-Adaptive Coverage
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing wireless communication networks face challenges in optimizing the utilization of base stations (BSs) due to fixed installations that do not adapt to varying network demands throughout the day, leading to underutilization in some areas and congestion in others, especially in densely populated urban environments.
Innovation Solution
A method and system for base station scheduling that involves acquiring and analyzing BS location and traffic information to generate scheduling instructions for migrating BSs between areas, allowing them to autonomously relocate to optimize resource utilization and respond to demand fluctuations.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If base stations are fixed-installed according to peak network demand, then network coverage is ensured during high-demand periods, but resource utilization is low during off-peak periods
Solution Approach 1:
The patent applies the dynamics principle by enabling base stations to physically migrate between different geographical locations based on real-time network demand. Instead of fixed installations, base stations become mobile entities that can relocate to serve areas with peak demand, thereby maintaining reliable network coverage while optimizing resource utilization across different time periods
Solution Approach 2:
The patent implements parameter changes by dynamically adjusting the location parameter of base stations according to network traffic patterns. The scheduling system monitors demand parameters and triggers migration when thresholds are exceeded, allowing the network to adapt its physical configuration to match varying operational requirements
2Productivity
If more base stations are deployed to meet peak demand, then network capacity is sufficient during high-traffic periods, but construction and maintenance costs increase
Solution Approach 1:
The patent applies universality by designing base stations that can serve multiple locations sequentially through migration. A single base station can fulfill the role of multiple fixed stations by moving to different areas based on demand, thereby reducing the total number of stations needed while maintaining adequate network capacity across the entire service region
Solution Approach 2:
The patent implements discarding and recovering by temporarily deploying base stations to areas with peak demand and then relocating them when demand subsides. This allows the network to scale capacity dynamically without permanently committing resources to all potential high-demand locations, reducing overall infrastructure requirements
3Ease of manufacture
If base stations remain stationary, then deployment is simple and cost-effective, but the system cannot adapt to varying network demands in different areas
Solution Approach 1:
The patent transforms the static nature of traditional base stations into dynamic, mobile units that can relocate autonomously or under centralized control. This dynamic capability enables the system to adapt to varying network demands across different geographical areas while maintaining relatively simple deployment procedures through standardized migration protocols
Data Source
AI summary
A method for base station scheduling, a device for scheduling, a communication base station, a scheduling system, an apparatus for scheduling, a computer-readable storage medium, and a computer program product. The method may include: acquiring BS information, where the BS information comprises BS location information and BS traffic information; and generating a scheduling instruction according to the BS information for migrating a BS from a first area to a second area.