Network Node Communication Scheduling via Cluster Coefficient
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In shared networks with multiple users, collisions occur when multiple users transmit data simultaneously, leading to data corruption, and existing methods like TDMA do not effectively account for bandwidth requirements and dynamic channel conditions.
Innovation Solution
A method that schedules network communications using a fair access technique combined with bandwidth weighting, where nodes determine their transmission times based on pseudo-random numbers and adjust cluster coefficients to implement updated bandwidth values, ensuring collision-free transmission by prioritizing nodes with higher bandwidth needs.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If TDMA is used to divide frequency into timeslots, then collisions are reduced, but bandwidth requirements and dynamic channel conditions are not effectively accounted for
Solution Approach 1:
The patent implements dynamic timeslot allocation where timeslot lengths and assignments are not fixed but adapt based on real-time bandwidth requirements and channel conditions. Each node calculates its bandwidth needs and the system dynamically adjusts the timeslot structure to accommodate changing conditions, resolving the contradiction between maintaining collision-free transmission and adapting to varying bandwidth requirements.
Solution Approach 2:
The system changes key parameters such as timeslot duration, start times, and node assignments based on measured bandwidth requirements and channel conditions. By making these parameters variable rather than fixed, the system maintains reliable collision-free operation while adapting to different bandwidth needs and dynamic environmental conditions.
2Productivity
If fixed timeslot allocation is used, then network scheduling is simple, but network efficiency decreases in dynamic environments
Solution Approach 1:
Each node in the network autonomously calculates its own bandwidth requirements and participates in the timeslot allocation process. Nodes self-report their needs and the scheduling algorithm automatically adjusts allocations based on aggregated node information, eliminating the need for complex centralized control while improving network efficiency through adaptive resource distribution.
Solution Approach 2:
The system implements feedback mechanisms where nodes continuously report their bandwidth requirements and channel conditions to the scheduling algorithm. This feedback loop enables the system to dynamically adjust timeslot allocations in response to changing network conditions, improving productivity while keeping scheduling complexity manageable through iterative optimization.
3Productivity
If uniform timeslot allocation is used, then fairness is maintained, but nodes with higher bandwidth needs do not receive priority
Solution Approach 1:
The patent applies different timeslot allocation strategies to different nodes based on their specific bandwidth requirements. Rather than uniform allocation, each node receives timeslots proportionate to its actual needs, with high-bandwidth nodes receiving longer or more frequent slots. This localized customization maintains fairness by matching allocation to actual requirements rather than applying blanket uniformity.
Solution Approach 2:
The system dynamically changes timeslot parameters such as duration and frequency of allocation based on measured bandwidth requirements. Nodes with higher needs receive adjusted parameters that provide greater bandwidth access, while nodes with lower needs receive proportionate allocation, maintaining fairness through need-based rather than uniform distribution.
Data Source
AI summary
In one aspect, a method includes scheduling network communications in a network comprising nodes connected by links, receiving at a first node updated bandwidth values from the other nodes, determining a cluster coefficient based on a number of one-hop neighbors of the first node and a number of neighbors N-hops and less of the first node, adjusting the cluster coefficient to form an adjusted cluster coefficient and determining a wait period based on the adjusted cluster coefficient. The method also includes implementing the updated bandwidth values received to determine updated node weight values of the other nodes after the wait period has expired.