CN107528798A - Optimization Scheduling based on RS485 bus systems - Google Patents
Optimization Scheduling based on RS485 bus systems Download PDFInfo
- Publication number
- CN107528798A CN107528798A CN201610473621.0A CN201610473621A CN107528798A CN 107528798 A CN107528798 A CN 107528798A CN 201610473621 A CN201610473621 A CN 201610473621A CN 107528798 A CN107528798 A CN 107528798A
- Authority
- CN
- China
- Prior art keywords
- node unit
- priority
- node
- signal
- code
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 238000005457 optimization Methods 0.000 title claims abstract description 18
- 238000012545 processing Methods 0.000 claims abstract description 5
- 230000005540 biological transmission Effects 0.000 claims description 32
- 238000012546 transfer Methods 0.000 claims description 14
- 230000000977 initiatory effect Effects 0.000 claims description 6
- 238000004891 communication Methods 0.000 abstract description 13
- 238000000034 method Methods 0.000 abstract description 9
- 230000007547 defect Effects 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 238000001514 detection method Methods 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000036039 immunity Effects 0.000 description 1
- 238000009434 installation Methods 0.000 description 1
- 230000003993 interaction Effects 0.000 description 1
- 238000012360 testing method Methods 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/70—Admission control; Resource allocation
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/70—Admission control; Resource allocation
- H04L47/80—Actions related to the user profile or the type of traffic
- H04L47/805—QOS or priority aware
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/70—Admission control; Resource allocation
- H04L47/82—Miscellaneous aspects
- H04L47/821—Prioritising resource allocation or reservation requests
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Bus Control (AREA)
- Computer And Data Communications (AREA)
Abstract
The present invention provides a kind of Optimization Scheduling based on RS485 bus systems, and the detecting system connects host computer and multiple node units with control signal wire by RS485 buses, and host computer uses DSP, and node unit uses PLC, and the system can realize distributed AC servo system.The system is directed to the difference of node communication urgency level, proposes the dispatching method of dynamic competition policy update node unit priority, and adjust automatically takes the priority of bus, and reasonable distribution takes bus time.The system can play the host computer mass data quickly advantage of processing and node unit high reliability, and have and debug the characteristics of simple.
Description
Technical field
The present invention relates to a kind of Optimization Scheduling based on RS485 bus systems.
Background technology
RS485 is driven total as a kind of standard for serial communication by the way of using balance drive and differential received
Line, there is the advantages that communication distance is remote, and transmission speed is fast, and noise immunity is good.Because RS485 can be applied to multistation interconnection,
One transmitter can connect multiple load equipments, be widely used in various fields.The communication mode of RS485 networks point
2 kinds of master-slave mode and bus type.Easily built from formula RS485 communication networks on bus communication protocol, there is good extension
Property and versatility, in Industry Control typically use master-slave mode communication mode.But in multistation connection, section often occurs
The problem of point communication blocks, therefore, the Optimization Scheduling of the RS485 bus systems of one efficient stable of necessary design.
Optimization currently for RS485 bus systems has been studied, and Chinese invention patent is announced " a kind of to be based on RS485
The control method of distributed bus system " (application number CN201510625106.5) carries out data interaction using bus free.Hair
A kind of bright patent " poll means of communication based on RS485 " (application number：CN201510302444.5) led to by the method for inquiry
News, these methods, which exist, to be considered not enough, for needing the data of emergent management should prioritised transmission emergence message.Pin of the present invention
The defects of to prior art, a kind of new Optimization Scheduling based on RS485 bus systems is proposed, this method considers that information passes
Defeated urgency level, realize the information communication of master-slave system.
The content of the invention
In view of the above the shortcomings that prior art, the present invention provides a kind of Optimized Operation based on RS485 bus systems
Method, system are made up of host computer and multiple node units, pass through RS485 buses and control between host computer and each node unit
Signal wire connects, and control signal wire includes request to send signal, signal priority and chip selection signal, the Optimization Scheduling
It is characterised by, it comprises the following steps：
1）Height is required according to real-time property, formulates data transport priority；
2）The task that host computer needs to complete according to each node unit, passes sequentially through chip selection signal and chooses node unit, pass through
The corresponding initiation parameter of RS485 bus transfers, is initialized to each node unit；
3）Host computer sends task initiation command to each node unit, each node unit is worked, each node unit completes task
Afterwards, data transmission request signal and signal priority are sent to host computer；
4）Host computer inquires about the data transmission request signal and signal priority of each node unit, determines each node unit to upper
Machine sends the priority height of data；
5）Host computer selectes step 4）Node unit corresponding to the limit priority of determination, by its data receiver, and handle；
6）Host computer inquires about the data transmission request signal and signal priority of each node unit again, using dynamic competition strategy
Update node unit priority；
7）Host computer selectes node unit transmission data, and handle, return to step 6 according to new priority）, until all sections
Dot element task is completed.
Wherein step 6）Using dynamic competition policy update node unit priority, distribute priority for each node unit and compile
Code, precedence level code include the preferential level segment of node unit and competition code segment, and the preferential level segment of node unit is sent out by node unit
The signal priority sent obtains, and the signal priority that node unit is sent is true according to the data transport priority formulated in advance
It is fixed.Competing code segment includes competition code of number section and node unit request signal order code segment two parts.Precedence level code
Specifically comprise the following steps：
A, whether host computer has data transmission request signal to carry out first round inquiry to each node unit successively, has number by each
1 is put according to the competition code of number section of transfer request signal node unit, request signal order code segment number consecutively obtains competing
Strive code segment；
B, and then the signal priority with data transmission request signal node unit is read, obtains the preferential level segment of node unit,
The preferential level segment of node unit and above-mentioned competition code segment are combined, obtain node unit precedence level code；
C, precedence level code highest node unit is selected, transmits data, respective nodes unit requests send signal removal.Then
Host computer is inquired about the wheel of uncoded node unit progress second successively, and is asked each in the second wheel inquiry with data transfer
The competition code of number section of signal node unit is asked to put 1, by request signal order code segment number consecutively, and after first round coding
But the competition code of number section of untreated node unit puts 2, the preferential level segment of node unit and above-mentioned competition code segment are combined,
Obtain node unit precedence level code；
D, precedence level code highest node unit is selected, transmits data, respective nodes unit requests send signal removal.Then
Three-wheel inquiry is carried out again, and by that analogy, the competition code of number section of untreated node unit adds 1 after often wheel inquiry, until institute
The data transmission request signal processing for having node unit to send is completed；
Preferably, the Optimization Scheduling based on RS485 bus systems, it is characterised in that：When node unit competition time
When number exceedes 2 times of node unit number, the preferential level segment of node unit, the priority treatment node unit are adjusted.
Using above-mentioned Optimization Scheduling each node unit can be made to transmit testing number to host computer according to different priority
According to, can so avoid the occurrence of bus system and endless loop occur, ensure that the communication resources of bus system are fully used, simultaneously should
Method can also priority treatment need the data of emergency transmissions.In addition section is can adjust in data in the case where waiting number long
Dot element priority, increase the flexibility of system, make system more reliable.The system is communicated using RS485 buses
Connection, which also has, debugs the advantages of simple.
Brief description of the drawings
Fig. 1 is the block diagram of the Optimization Scheduling embodiment of the invention based on RS485 bus systems.
Fig. 2 is the flow chart of the Optimization Scheduling of the invention based on RS485 bus systems.
Fig. 3 is the precedence level code figure of node unit of the present invention.
Fig. 4 is the precedence level code figure of node unit of the embodiment of the present invention.
Embodiment
Illustrate embodiments of the present invention below by way of specific instantiation, those skilled in the art can be by this specification
Disclosed content is implemented easily.
As shown in figure 1, the present invention is based on RS485 bus systems, it includes：One host computer 1 and several node units 2, section
Dot element 2 is connected by RS485 buses and control signal wire with host computer, and control signal wire includes request to send signal, preferential
Level signal and chip selection signal connection.Each node unit request to send signal is connected by a port with host computer, low level
Effectively.Each node unit priority is connected by a port with host computer, and low level represents that data transfer is urgent, high level table
Show that data transfer is not urgent, and the whether urgent of data determines according to the data transport priority formulated in advance.Chip selection signal is
Host computer is used for choosing node unit, enables node unit transmission data, and low level is effective.Host computer 1 can be to each node unit 2
Initialize installation is carried out, and receives the data that each node unit 2 feeds back.
Host computer can use DSP Processor, be connected after external MAX485 chips with 485 buses, node unit 2 can be adopted
With PLC, PLC free end can be directly connected to RS485 buses, very convenient, and such system can play DSP, and quickly processing is big
Measure the ability of data and the advantage of PLC high stabilities.The detecting system can increase node unit according to being actually needed.This is
System is communicatively coupled also to have using RS485 buses debugs the advantages of simple.
Within the system, host computer 1 is communicatively coupled with node unit 2 by RS485 buses, can only be had every time
One node unit sends data.And the time that data transmission request signal is sent due to node unit 2 is also different, it is
Guarantee each node unit can obtain the bus right to use, and the feelings of endless loop occur when not appearing in bus arbitration
Condition, as shown in Fig. 2 the invention discloses a kind of Optimization Scheduling based on RS485 bus systems, this method includes following step
Suddenly：
1）Height is required according to real-time property, formulates data transport priority；
2）The task that host computer needs to complete according to each node unit, passes sequentially through chip selection signal and chooses node unit, pass through
The corresponding initiation parameter of RS485 bus transfers, is initialized to each node unit；
3）Host computer sends task initiation command to each node unit, each node unit is worked, each node unit completes task
Afterwards, data transmission request signal and signal priority are sent to host computer；
4）Host computer inquires about the data transmission request signal and signal priority of each node unit, determines each node unit to upper
Machine sends the priority height of data；
5）Host computer selectes step 4）Node unit corresponding to the limit priority of determination, by its data receiver, and handle；
6）Host computer inquires about the data transmission request signal and signal priority of each node unit again, using dynamic competition strategy
Update node unit priority；
7）Host computer selectes node unit transmission data, and handle, return to step 6 according to new priority）, until all sections
Dot element task is completed.
Wherein step 6）Using dynamic competition policy update node unit priority, distribute priority for each node unit and compile
Code, precedence level code include the preferential level segment of node unit and competition code segment, and the preferential level segment of node unit is sent out by node unit
The signal priority sent obtains, and the signal priority that node unit is sent is true according to the data transport priority formulated in advance
It is fixed.Competing code segment includes competition code of number section and node unit request signal order code segment two parts.Precedence level code
Each segment length can be according to actual adjustment.Precedence level code specifically comprises the following steps：
First, whether host computer has data transmission request signal to carry out first round inquiry to each node unit successively, by each tool
The competition code of number section for having data transmission request signal node unit puts 1, as shown in figure 3, code of number section will be competed
B3B2B1B0 puts 1, according to inquiry order by request signal order code segment C3C2C1C0 number consecutivelies, obtains competing code segment.
Secondly, the signal priority with data transmission request signal node unit is read, obtains node unit priority
Section A1A0, as shown in figure 3, flash request, which sends signal, represents that not flash request signal is represented with 00, and node unit is excellent with 11
First level segment and the combination of above-mentioned competition code segment, obtain node unit precedence level code.
Then, precedence level code highest node unit is selected, transmits data, it is clear that respective nodes unit requests send signal
Remove.Then host computer carries out the second wheel inquiry to uncoded node unit successively, and has number by each in the second wheel inquiry
1 is put according to the competition code of number section B3B2B1B0 of transfer request signal node unit, request signal order code segment is compiled successively
Number C3C2C1C0, and after first round coding but the competition code of number section of untreated node unit puts 2, node unit is preferential
Level segment and the combination of above-mentioned competition code segment, obtain node unit precedence level code.Coding is bigger, and priority is higher.
Finally, precedence level code highest node unit is selected, transmits data, it is clear that respective nodes unit requests send signal
Remove.Then three-wheel inquiry is carried out again, by that analogy, the competition code of number section of untreated node unit adds 1 after often wheel inquiry,
Until the data transmission request signal processing that all node units are sent is completed.When node unit competition number exceedes node unit
At 2 times of number, the preferential level segment of node unit, the priority treatment node unit are adjusted.
For a further understanding of the Optimization Scheduling of above-mentioned priority, done further below according to a specific embodiment
Description：Assuming that host computer 1 is connected with 4 node units 2 in the system.As shown in figure 4, the precedence level code interior joint unit is excellent
First level segment accounts for two A1A0, and competition code segment includes competition code of number section B3B2B1B0 and node unit request signal order generation
Code section C3C2C1C0.
When carrying out first round inquiry, host computer is inquired about according to No. 1, No. 2, No. 3, No. 4 node unit order, has been inquired
1st, No. 3 node units have data transmission request signal, then inquire about the signal priority of 1, No. 3 node unit, find No. 3 nodes
The signal priority of unit is low level, and the signal priority of No. 1 node unit is high level, and now No. 1 node unit is excellent
The precedence level code that first level is encoded to 0000010001, No. 3 node units is 1100010002.It is excellent due to No. 3 node units
First level coding is more than the precedence level code of No. 1 node unit, therefore host computer chooses No. 3 node units, No. 3 sections by chip selection signal
The data transfer of dot element, while the data request signal of No. 3 node units is removed, and the priority of No. 3 node units is compiled
Code is deleted.
When carrying out the second wheel inquiry, host computer is inquired about according to No. 2, No. 3, No. 4 node unit order, has inquired 2,3
Number node unit has data transmission request signal, then inquires about the signal priority of 2, No. 3 node units, finds No. 3 node lists
The signal priority of member is low level, and the signal priority of No. 1 node unit is high level, and now No. 2 node units is preferential
The precedence level code that level is encoded to 0000010001, No. 3 node units is compiled for the priority of 1100010002, No. 1 node unit
Code is 0000100002.Because the precedence level code of No. 3 node units is more than No. 1 node unit and the precedence level code of No. 2, therefore
Host computer chooses No. 3 node units, the data transfer of No. 3 node units, while No. 3 node units of removing by chip selection signal
Data request signal, and the precedence level code of No. 3 node units is deleted.
When carrying out third round inquiry, host computer is inquired about according to No. 3, No. 4 node unit order, has inquired No. 3, No. 4
Node unit has data transmission request signal, then inquires about the signal priority of 2, No. 3 node units, No. 3, No. 4 node units
Signal priority be high level, now the precedence level code of No. 3 node units is 0000010001, No. 4 node units
Precedence level code is that the precedence level code of 0000000002, No. 1 node unit is the preferential of 0000110002, No. 2 node units
Level is encoded to 0000100002.Because in the precedence level code of 4 node units, No. 1 node unit precedence level code is maximum, therefore
Host computer chooses No. 1 node unit, the data transfer of No. 1 node unit, while No. 1 node unit of removing by chip selection signal
Data request signal, and the precedence level code of No. 1 node unit is deleted.
By that analogy, execution priority coding is circulated, until whole communication tasks are completed.Assuming that No. 1 node unit competition
Number is more than 8 (4 nodes of this example, so taking 2 × 4=8), its preferential level segment can be directly revised as into 10, so both improved
The priority of No. 1 node unit, while do not interfere with the demand of emergency data transmissions yet.
In summary, using above-mentioned priority scheduling optimization method each node unit can be made upward according to different priority
Position machine transmission detection data, can so avoid the occurrence of bus system and endless loop occur, ensure that the communication resources of bus system obtain
Make full use of, while consider the data transfer urgency level of node unit, and according to number lifting priority is waited, increase
The flexibility of system, reasonable distribution take bus time, improve the real-time performance of system, make system more reliable.This
Invention effectively overcomes various shortcoming of the prior art and has high industrial utilization.
Claims (2)
1. a kind of Optimization Scheduling based on RS485 bus systems, system is made up of host computer and multiple node units, upper
Connected between machine and each node unit by RS485 buses with control signal wire, control signal wire includes request to send signal, excellent
First level signal and chip selection signal, the Optimization Scheduling are characterised by that it comprises the following steps：
1) height is required according to real-time property, formulates data transport priority；
2) task that host computer needs to complete according to each node unit, passes sequentially through chip selection signal and chooses node unit, pass through
The corresponding initiation parameter of RS485 bus transfers, is initialized to each node unit；
3) host computer sends task initiation command to each node unit, each node unit is worked, each node unit completes task
Afterwards, data transmission request signal and signal priority are sent to host computer；
4) host computer inquires about the data transmission request signal and signal priority of each node unit, determines each node unit to upper
Machine sends the priority height of data；
5) node unit corresponding to the limit priority that the selected step 4) of host computer determines, by its data receiver, and is handled；
6) host computer inquires about the data transmission request signal and signal priority of each node unit again, using dynamic competition strategy
Update node unit priority；
7) host computer selectes node unit transmission data, and handle, return to step 6 according to new priority), until all sections
Dot element task is completed；
Wherein step 6) uses dynamic competition policy update node unit priority, and precedence level code is distributed for each node unit,
Precedence level code includes the preferential level segment of node unit and competition code segment, and the preferential level segment of node unit is sent by node unit
Signal priority obtains, and the signal priority that node unit is sent determines according to the data transport priority formulated in advance；
Competing code segment includes competition code of number section and node unit request signal order code segment two parts, precedence level code
Specifically comprise the following steps：
A, whether host computer has data transmission request signal to carry out first round inquiry to each node unit successively, has number by each
1 is put according to the competition code of number section of transfer request signal node unit, request signal order code segment number consecutively obtains competing
Strive code segment；
B, and then the signal priority with data transmission request signal node unit is read, obtains the preferential level segment of node unit,
The preferential level segment of node unit and above-mentioned competition code segment are combined, obtain node unit precedence level code；
C, precedence level code highest node unit is selected, transmits data, respective nodes unit requests send signal removal.Then
Host computer is inquired about the wheel of uncoded node unit progress second successively, and is asked each in the second wheel inquiry with data transfer
The competition code of number section of signal node unit is asked to put 1, by request signal order code segment number consecutively, and after first round coding
But the competition code of number section of untreated node unit puts 2, the preferential level segment of node unit and above-mentioned competition code segment are combined,
Obtain node unit precedence level code；
D, precedence level code highest node unit is selected, transmits data, respective nodes unit requests send signal removal.Then
Three-wheel inquiry is carried out again, by that analogy, the competition code of number section of untreated node unit adds 1 after often wheel inquiry,
Until the data transmission request signal processing that all node units are sent is completed.
2. the Optimization Scheduling according to claim 1 based on RS485 bus systems, it is characterised in that：When node list
When member competition number exceedes 2 times of node unit number, the preferential level segment of node unit, the priority treatment node unit are adjusted.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610473621.0A CN107528798B (en) | 2016-06-22 | 2016-06-22 | RS485 bus system-based optimal scheduling method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610473621.0A CN107528798B (en) | 2016-06-22 | 2016-06-22 | RS485 bus system-based optimal scheduling method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN107528798A true CN107528798A (en) | 2017-12-29 |
| CN107528798B CN107528798B (en) | 2020-09-08 |
Family
ID=60735590
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610473621.0A Expired - Fee Related CN107528798B (en) | 2016-06-22 | 2016-06-22 | RS485 bus system-based optimal scheduling method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107528798B (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108390807A (en) * | 2018-02-11 | 2018-08-10 | 宁波工程学院 | A kind of SCM Based multi computer communication method |
| CN109413217A (en) * | 2018-12-31 | 2019-03-01 | 宁波工程学院 | A kind of agricultural internet of things data means of communication |
| CN115378758A (en) * | 2022-07-27 | 2022-11-22 | 中国船舶重工集团公司第七二四研究所 | Multi-node SRIO bus self-adaptive flow control method based on priority strategy |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101547149A (en) * | 2009-04-20 | 2009-09-30 | 浙江大学 | Dynamic scheduling method for OSEK COM messages based on CAN network |
| WO2012012961A1 (en) * | 2010-07-30 | 2012-02-02 | 中兴通讯股份有限公司 | Method and device for scheduling buses |
| CN105007209A (en) * | 2015-06-04 | 2015-10-28 | 烟台东方威思顿电气股份有限公司 | RS485-based polling communication method |
| CN105354159A (en) * | 2015-09-28 | 2016-02-24 | 上海海视电子有限公司 | RS485 distributed bus system based control method |
-
2016
- 2016-06-22 CN CN201610473621.0A patent/CN107528798B/en not_active Expired - Fee Related
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101547149A (en) * | 2009-04-20 | 2009-09-30 | 浙江大学 | Dynamic scheduling method for OSEK COM messages based on CAN network |
| WO2012012961A1 (en) * | 2010-07-30 | 2012-02-02 | 中兴通讯股份有限公司 | Method and device for scheduling buses |
| CN105007209A (en) * | 2015-06-04 | 2015-10-28 | 烟台东方威思顿电气股份有限公司 | RS485-based polling communication method |
| CN105354159A (en) * | 2015-09-28 | 2016-02-24 | 上海海视电子有限公司 | RS485 distributed bus system based control method |
Non-Patent Citations (1)
| Title |
|---|
| 宋晓伟等: "基于新型485总线的分布式数据采集控制系统", 《机电一体化》 * |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108390807A (en) * | 2018-02-11 | 2018-08-10 | 宁波工程学院 | A kind of SCM Based multi computer communication method |
| CN108390807B (en) * | 2018-02-11 | 2020-12-15 | 宁波工程学院 | Multi-machine communication method based on single chip microcomputer |
| CN109413217A (en) * | 2018-12-31 | 2019-03-01 | 宁波工程学院 | A kind of agricultural internet of things data means of communication |
| CN115378758A (en) * | 2022-07-27 | 2022-11-22 | 中国船舶重工集团公司第七二四研究所 | Multi-node SRIO bus self-adaptive flow control method based on priority strategy |
| CN115378758B (en) * | 2022-07-27 | 2023-09-26 | 中国船舶集团有限公司第七二四研究所 | Multi-node SRIO bus self-adaptive flow control method based on priority strategy |
Also Published As
| Publication number | Publication date |
|---|---|
| CN107528798B (en) | 2020-09-08 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10349485B2 (en) | Efficient control assembly and control method | |
| CN101232425B (en) | Bus type distributed control system master-salve station opposite terminal control method | |
| CN100525233C (en) | CAN bus based signal real-time processing method | |
| CN101741766B (en) | Conversion device from CAN network to ethernet network | |
| CN107528798A (en) | Optimization Scheduling based on RS485 bus systems | |
| US10200290B2 (en) | Station and method for serial data transmission using dynamic reprioritizing of data frames | |
| CN206719141U (en) | A kind of electric tractor and communication device with two-way CAN | |
| CN104009976A (en) | Real-time communication method and equipment used among multiple main station systems | |
| CN108809949A (en) | The method converted and dispatched between profinet, FF H1, CAN and profibus agreements | |
| CN110391960A (en) | Bus transfer control device and method | |
| CA2653257A1 (en) | Bandwidth allocation method, optical line terminator, optical network unit, communication system, and recording medium recording program of device | |
| CN113965307A (en) | Full-duplex SPI communication method based on arbitration line | |
| CN103823775A (en) | Serial port and Internet port smart converter | |
| CN113905104B (en) | Communication method and protocol conversion system for elevator intelligent networking | |
| CN102346454B (en) | Programmable controller and bus converter | |
| CN109067631B (en) | Multi-node automobile electric control method based on real-time Ethernet communication protocol architecture | |
| CN210093253U (en) | System for fusing PLC control system and control system of DALI protocol | |
| CN1976288A (en) | Network system | |
| CN110673511B (en) | Control system | |
| CN210274135U (en) | Remote connection system | |
| CN109963356B (en) | System for seamless switching of multiple wireless transmission modes | |
| CN107710691B (en) | Transmission of telegrams over a common medium | |
| CN115190128B (en) | Computing power perception and computing task distribution system based on embedded edge gateway | |
| CN107966970A (en) | A kind of control system for flexible manufacturing system | |
| CN208722010U (en) | A kind of CAN bus based high-speed pulse output device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20200908 |