A Resource Scheduling Algorithm Applicable to wia-pa Industrial Wireless Network
An industrial wireless network and resource scheduling technology, applied in the field of resource scheduling algorithms, can solve the problems of high control overhead, high algorithm complexity, and less consideration of dynamic changes in network link load differences, so as to improve throughput and reliability. The effect of reducing the length of the superframe
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0040] The preferred embodiments of the present invention will be described in detail below with reference to the accompanying drawings.
[0041] combine figure 1 , that is, the overall frame diagram of the present invention, the present invention mainly includes three algorithms: an inter-cluster resource scheduling algorithm based on graph vertex coloring, an intra-cluster communication time slot lower limit analysis method, and an intra-cluster communication resource scheduling algorithm based on channel negotiation .
[0042] 1. Inter-cluster resource scheduling algorithm based on graph vertex coloring
[0043] STEP 1: Build a conflict graph: The link information obtained from the WIA-PA management information base needs to be converted into a link conflict graph. What needs to be done is to obtain the link ID (Link ID), The sending end of the link (Link Send), the receiving end of the link (Link Receive) and the time slot requirement on the link (Link Slot Num), build a...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 


