Network Node Scheduling via Fair Access Weighting
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In shared networks, existing methods like TDMA do not effectively account for bandwidth requirements, leading to collisions and inefficient data transmission due to lack of consideration for nodes' varying data needs.
Innovation Solution
A method that determines node weight values based on bandwidth values, using a fair access technique like NAMA, to prioritize nodes with higher data needs, ensuring collision-free scheduling by adjusting transmission timeslots based on calculated node weights.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If TDMA is used to divide frequency into timeslots, then collisions are reduced, but bandwidth requirements of nodes are not effectively accounted for
Solution Approach 1:
The patent changes the parameter of transmission timing by introducing node weight values that modify the standard TDMA timeslot assignment. Nodes with higher bandwidth needs receive adjusted timing parameters that prioritize their transmissions, transforming the rigid TDMA structure into an adaptive system that responds to varying bandwidth requirements while maintaining collision avoidance
Solution Approach 2:
The system transitions from static TDMA timeslot allocation to dynamic scheduling where node weight values are calculated based on current network conditions and bandwidth requirements. The scheduler continuously adapts transmission timeslots according to changing node priorities, making the system flexible while preserving the fundamental collision-free property of TDMA
2Ease of manufacture
If equal timeslot allocation is used, then implementation is simple, but nodes with higher data needs are not prioritized
Solution Approach 1:
The patent applies local quality by assigning different weight values to different nodes based on their individual bandwidth requirements and data needs. Instead of uniform treatment, each node receives customized scheduling priority proportional to its local requirements, optimizing overall network productivity while maintaining relatively simple implementation through localized weight calculations
3Adaptability or versatility
If centralized scheduling is used to optimize bandwidth allocation, then bandwidth requirements are met, but system complexity increases
Solution Approach 1:
The patent implements self-service by enabling nodes to autonomously calculate their own weight values based on their bandwidth requirements and network conditions. Each node independently determines its priority level without requiring complex centralized control, achieving optimized bandwidth allocation through distributed self-assessment while keeping system complexity manageable
Data Source
AI summary
In one aspect, a method to schedule network communications in a network having nodes connected by links includes sending a bandwidth value of a first node for each link connected to the first node to neighbors of the first node, receiving bandwidth values from the neighbors of the first node; and determining node weight values of the first node and the neighbors of the first node based on the bandwidth values received from the neighbors of the first node and the bandwidth value of the first node. The method also includes sending the node weight values of the first node to the neighbors of the first node, receiving the node weight values from the neighbors of the first node, determining access values for each node based on a fair access technique and determining network scheduling based on the access values and the node weight values.