Semi-Centralized Link Scheduling for Wireless Networks
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
As network sizes increase, link scheduling in wireless communication networks becomes complex due to limited connectivity resources, urgent requests, and interference issues, making it difficult for central entities to efficiently manage link activations.
Innovation Solution
A semi-centralized link scheduling system that separates link activation decisions into centralized global parameter-based scheduling and localized, short-term demand-driven modifications by schedulers, allowing for interactive negotiation to adapt to changing network conditions and urgent requests.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If a central entity determines link activation schedule based on network parameters and requests, then scheduling decisions can be made centrally, but processing strain on the central controller increases and efficiency decreases with increasing network size
Solution Approach 1:
The scheduling function is segmented into two parts: a centralized initial schedule determination based on global parameters, and distributed local modifications by individual schedulers based on local parameters. This segmentation reduces the processing load on the central controller while maintaining overall scheduling efficiency.
Solution Approach 2:
The initial schedule acts as an intermediary between centralized control and distributed execution. It provides a baseline scheduling framework that local schedulers can modify, facilitating coordination without requiring the central controller to handle all scheduling decisions directly.
2Adaptability or versatility
If link scheduling is performed to share limited connectivity resources, then resource utilization improves, but complexity increases with increasing network size and multi-hop routing configurations
Solution Approach 1:
The scheduling complexity is segmented between centralized initial schedule determination and distributed local modifications. This allows the system to handle complex multi-hop routing configurations through local schedulers without overwhelming the central controller.
Solution Approach 2:
The scheduling system is made dynamic by allowing local schedulers to modify the initial schedule in real-time based on changing network conditions, urgent requests, and local parameters, enabling adaptability without increasing overall system complexity.
3Adaptability or versatility
If the initial schedule is modified based on local parameters and constraints, then adaptation to localized changes improves, but coordination complexity between multiple schedulers increases
Solution Approach 1:
The initial schedule serves as an intermediary framework that coordinates modifications across multiple schedulers. Each scheduler modifies the schedule independently within defined constraints, and the initial schedule ensures consistency across these modifications without requiring complex inter-scheduler coordination.
Solution Approach 2:
The system manages coordination complexity by focusing parameter changes at the local level (local schedule modifications) rather than requiring global re-scheduling. This allows localized adaptation while maintaining overall system coherence through the initial schedule framework.
4Reliability
If interactive negotiation between schedulers is implemented, then resolution of urgent requests and interference issues improves, but communication overhead increases
Solution Approach 1:
The initial schedule is determined in advance based on global parameters, providing a predefined framework that reduces the need for extensive interactive negotiation later. Urgent requests and interference issues can be resolved through targeted modifications rather than complete re-negotiation, reducing communication overhead.
Data Source
AI summary
A hierarchical link scheduling system and method is provided. A central controller gathers network information, including global parameters and long term demands, and determines an initial schedule for link activation based on these variables. A scheduler receives the initial schedule and modifies the initial schedule based on local parameters, inter-schedule negotiation, or other short term or localized requests. The scheduler activates the links according to the modified schedule. Accordingly, the scheduler can be responsible for modifying the initial schedule provided by central controller with localized or short term requests or demands, and providing the necessary parameters to enable link activation between nodes according to the modified schedule.


