Unlock instant, AI-driven research and patent intelligence for your innovation.

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

Active Publication Date: 2019-10-01
CHONGQING UNIV OF POSTS & TELECOMM +1
View PDF4 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0004] Communication resource scheduling technology is the most core technology in industrial wireless communication. At present, the main research hotspot of communication resource scheduling algorithm is multi-channel data communication, that is, maximizing the reuse rate of time slot space. However, most of the current resource scheduling algorithms still use Fixed allocation release is the main method, the control overhead is relatively large, the complexity of the industrial wireless network is not fully considered, there is a high algorithm complexity, and there is little consideration for the difference and dynamic changes of the network link load

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • A Resource Scheduling Algorithm Applicable to wia-pa Industrial Wireless Network
  • A Resource Scheduling Algorithm Applicable to wia-pa Industrial Wireless Network
  • A Resource Scheduling Algorithm Applicable to wia-pa Industrial Wireless Network

Examples

Experimental program
Comparison scheme
Effect test

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...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The invention relates to a resource scheduling algorithm suitable for WIA-PA industrial wireless networks, belonging to the technical field of industrial wireless networks. The algorithm includes an inter-cluster resource scheduling stage and an intra-cluster resource scheduling stage. The inter-cluster resource scheduling stage uses a graph vertex coloring resource scheduling algorithm to minimize the length of a superframe and improve network throughput; the intra-cluster resource scheduling stage The time slot lower limit value analysis method is used to allocate the mutual communication between the cluster head and the cluster members, and the channel negotiation resource scheduling algorithm is also included to allocate different channels for all neighbor nodes to avoid conflicts. The present invention realizes effective data transmission between WIA-PA network application and industrial site, minimizes the length of the super frame, improves the throughput of the data transmission network, reasonably allocates resources in the cluster, and improves the reliability of network data transmission .

Description

technical field [0001] The invention belongs to the technical field of industrial wireless networks, and relates to a resource scheduling algorithm suitable for WIA-PA industrial wireless networks. Background technique [0002] WIA-PA industrial wireless network is a wireless data transmission solution for process automation. Applying WIA-PA wireless technology to industrial sites has the advantages of low cost, easy maintenance, high flexibility, and easy expansion, but it also brings such as: data Problems such as low transmission reliability and low network throughput. [0003] In order to realize the real-time and reliable data transmission of the industrial WIA-PA network, and meet the high-throughput requirements of the industrial site for a large amount of data transmission, it is necessary to separate the time slot and channel resources in the inter-cluster and intra-cluster communication segments of the WIA-PA network. Reasonable scheduling allocation. Based on th...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
Patent Type & Authority Patents(China)
IPC IPC(8): H04W72/04H04W72/12
CPCH04W72/0446H04W72/52H04W72/53H04W72/20
Inventor 谢昊飞胡静宜李勇杨宏龙祎张晖韩丽卓兰
Owner CHONGQING UNIV OF POSTS & TELECOMM