CN105591857B - A kind of method and apparatus of 485 multi-host communication - Google Patents
A kind of method and apparatus of 485 multi-host communication Download PDFInfo
- Publication number
- CN105591857B CN105591857B CN201510093094.6A CN201510093094A CN105591857B CN 105591857 B CN105591857 B CN 105591857B CN 201510093094 A CN201510093094 A CN 201510093094A CN 105591857 B CN105591857 B CN 105591857B
- Authority
- CN
- China
- Prior art keywords
- node
- data
- time
- waiting time
- idle waiting
- 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.)
- Active
Links
Abstract
An embodiment of the present invention provides a kind of method and apparatus of 485 multi-host communication, are related to field of communication technology, to long, the low problem of communication efficiency that solves in existing 485 communication system single host communication poll time.The method of 485 multi-host communication includes that first node determines the idle waiting time, and the idle waiting time, the no data from bus was transferred to the time that transmission data waits for by the first node；Whether detection has data transmission within the idle waiting time in the bus；If no, first node transmission data when the idle waiting time expires.
Description
Technical field
The present invention relates to field of communication technology more particularly to a kind of method and apparatus of 485 multi-host communication.
Background technology
485 communication networks are a kind of digital multi-drop systems transmitted using differential balance formula, are generally adopted by principal and subordinate
Communication mode, i.e. the multiple slaves of host tape, meanwhile, between host and multiple slaves use semiduplex communication pattern,
Therefore, 485 communication networks are used widely with its low cost, the simple advantage of design.
Currently, in 485 communication networks in such a way that half-duplex operation technology can only use host inquiry slave response, i.e.,
The slave of host poll bus one by one, slave responds host according to polling mechanism, to avoid multiple main bodys in 485 communication networks
The conflict of signal in bus is caused in transmission state simultaneously.
But when the slave of individual host mounting is more, poll time can be caused long using polling mechanism, communication speed
Slowly, the fast exchange of data is cannot be satisfied, so that communication efficiency is low.
Invention content
The embodiment of the present invention provides a kind of method and apparatus of 485 multi-host communication, to solve existing 485 communication system
Middle single host communication poll time is long, the low problem of communication efficiency.
In order to achieve the above objectives, the embodiment of the present invention adopts the following technical scheme that：
An embodiment of the present invention provides a kind of methods of 485 multi-host communication, including：
First node determines that idle waiting time, the idle waiting time are first node no data from bus
It is transferred to the time that transmission data is waited for；
Whether detection has data transmission within the idle waiting time in the bus；
If no, first node transmission data when the idle waiting time expires.
The embodiment of the present invention additionally provides a kind of device of 485 multi-host communication, including：
First determination unit, for determining the idle waiting time, the idle waiting time is the first node from total
No data is transferred to the time that transmission data is waited on line；
Whether detection unit has data transmission within the idle waiting time for detecting in the bus；
Transmission unit detects within the idle waiting time no data in the bus for working as the detection unit
It transmits, then the transmission data when the idle waiting time expires.
An embodiment of the present invention provides a kind of method and apparatus of 485 multi-host communication, by the free time for determining first node
Stand-by period, and detect whether have data transmission on the idle waiting time internal bus of first node；If no, first segment
Point transmission data when the idle waiting time of first node expires.In this way, regarding each node in 485 buses as first
Node, no master-slave relationship, by the idle waiting time for calculating first node so that first node is in its idle waiting time
Transmission data when full, without as in the prior art by the way of host computer polls into row data communication, solving single host communication wheel
Ask overlong time, the low problem of communication efficiency.
Description of the drawings
In order to illustrate the technical solution of the embodiments of the present invention more clearly, below will be in embodiment or description of the prior art
Required attached drawing is briefly described, it should be apparent that, the accompanying drawings in the following description is only some realities of the present invention
Example is applied, it for those of ordinary skill in the art, without creative efforts, can also be according to these attached drawings
Obtain other attached drawings.
Fig. 1 is a kind of method schematic diagram of 485 multi-host communication provided in an embodiment of the present invention；
Fig. 2 is the method schematic diagram of another 485 multi-host communication provided in an embodiment of the present invention；
Fig. 3 is the method schematic diagram of another collision detection provided in an embodiment of the present invention；
Fig. 4 is a kind of schematic device of 485 multi-host communication provided in an embodiment of the present invention；
Fig. 5 is the schematic device of another 485 multi-host communication provided in an embodiment of the present invention；
Fig. 6 is the schematic device of another 485 multi-host communication provided in an embodiment of the present invention.
Specific implementation mode
Following will be combined with the drawings in the embodiments of the present invention, and technical solution in the embodiment of the present invention carries out clear, complete
Site preparation describes, it is clear that described embodiments are only a part of the embodiments of the present invention, instead of all the embodiments.It is based on
Embodiment in the present invention, those of ordinary skill in the art are obtained every other without creative efforts
Embodiment shall fall within the protection scope of the present invention.
An embodiment of the present invention provides a kind of method of 485 multi-host communication, this method is applied in 485 communication network of standard
Each node, each node in 485 communication network of standard can be used as first node, and be not necessarily to other external interfaces, with
Realize that data are sent.Specifically, as shown in Figure 1, this method includes：
Step 101, first node determine the idle waiting time, which is that first node is countless from bus
The time waited for according to transmission data is transferred to.
Specifically, when no data transmits in bus, the node for occupying bus is needed, that is, needs the node of transmission data true
The fixed respective idle waiting time, due between each node in bus without master-slave relationship, each of be connected in bus
Node can be used as first node.
Wherein, first node determines that the idle waiting time of itself specifically includes：
A1, the random attribute information for obtaining first node, the random attribute information of first node includes the ground of first node
The hardware parameter of first node, and/or any random number in 0-255 in location information, and/or current environment.
A2, summation operation is carried out to the random attribute information of first node, obtains the first reference value.
A3, the idle waiting time that first node is determined according to the first formula, the first formula are：T1=M1mod N1+t1；
Wherein, T1For the idle waiting time of first node, M1For the first reference value, t1For Lothrus apterus minimum latency, N1It is first
Modulus value.
It is exemplary, it is assumed that 100 machines to be connected in bus, each machine is a node, the address of this 100 machines
According to 01,02 ..., 100 number consecutivelies.When no data transmits in bus, all nodes are required for transmission data to account for
With bus, then each node calculates the respective idle waiting time.By taking first node is the machine that address is 62 as an example, to the section
The idle waiting time of point is calculated, specifically, the random attribute information of the first node obtained includes the ground of first node
The environment temperature that location information is 62, first node is presently in is 20 degree, and the random number obtained from (0-255) is 89, that
, the first reference value M1Equal to 171, i.e. M1=62+20+89；If the first modulus value is 32, Lothrus apterus minimum latency t1For
25ms, then the idle waiting time that first node is obtained according to the first formula are 36ms.
Whether step 102, detection have data transmission on idle waiting time internal bus.
Since the idle waiting time of the first node calculated according to the method for step 101 will be different,
Need to judge whether there are data to be transmitted in bus within the idle waiting time of first node, if no data transmits in bus,
Then follow the steps 103；If there is data transmission in bus, after needing the node data end of transmission until sending the data,
It reappears according to step 101 computation-free stand-by period, such repetitive cycling.
Exemplary, on the basis of step 101 is exemplified, whether first node detection has data hair on 36ms internal bus
It send.If no data transmits in bus, 103 are thened follow the steps；If the idle waiting time for the machine that address is 60 is 30ms, when
When free time reaches 30ms in bus, the machine that address is 60 starts transmission data, at this point, the machine that address is 62 may be
Being detected when 36ms has data transmission in bus, then the machine data that machine need that address is 62 etc. to address are 60 is whole
After being sent completely, then again according to step 101 computation-free stand-by period, such repetitive cycling.
If step 103 does not have, first node transmission data when the idle waiting time expires.
Wherein, the format for the data that first node is sent can use standard serial port data format, can also use nonstandard
Quasi- serial data format.
An embodiment of the present invention provides a kind of method of 485 multi-host communication, when idle waiting by determining first node
Between, and detect whether have data transmission on the idle waiting time internal bus of first node；If no, first node is
Transmission data when the idle waiting time of one node expires.In this way, it regard each node in 485 buses as first node,
Without master-slave relationship, by the idle waiting time for calculating first node so that first node is when its idle waiting time expires
Transmission data, without to when in the prior art using host computer polls by the way of into row data communication, solving single host and communicating poll
Between long, the low problem of communication efficiency.
Further, as shown in Fig. 2, while executing step 103, this method further includes：
Step 104 determines whether the data sent clash according to collision detection method.
In embodiments of the present invention, due between each node on 485 communication bus without master-slave relationship, when
When one node occupies bus transmission data, first node also will receive the data transmitted by itself, then, first node is according to certainly
Data that body is sent and reception, judge whether the data sent send conflict, and conflict described herein is when other nodes and the
It, can be in synchronization transmission data, at this point, the data in bus will be because all occupying when the free time ordinary time of one node is identical
Bus and clash.
Wherein, as shown in figure 3, first node determines whether the data sent clash specifically according to collision detection method
Including：
B1, first node determine whether the parity check bit of the data sent is correct.
If first node determines that the parity check bit of the data sent is correct, b2 is thened follow the steps；If first node determines
The even-odd check bit-errors of the data of transmission, then follow the steps b6.
If b2, first node determine that the parity check bit of the data sent is correct, first node determines the data sent
Whether length is correct.
If first node determines that the data length sent is correct, b3 is thened follow the steps；If first node determines the number sent
According to size error, b6 is thened follow the steps.
If b3, first node determine that the data length occurred is correct, first node determines the stop position of the data sent
It is whether correct.
If first node determines that the stop position of the data sent is correct, b4 is thened follow the steps；It is sent if first node determines
Data stopping bit-errors, then follow the steps b6.
If b4, first node determine that the stop position of the data sent is correct, first node determines the number of the data sent
It is whether correct according to frame.
If first node determines that the stop position of the data sent is correct, b5 is thened follow the steps；It is sent if first node determines
Data stopping bit-errors, then follow the steps b6.
If b5, first node determine that the data frame of the data sent is correct, first node determines that the data sent are not sent out
Raw conflict.
B6, first node determine that the data sent clash.
The sequence of above-mentioned steps b1, b2, b3, b4 can be adjusted, the present invention is only shown with one such
Example explanation.Meanwhile for described in the parity check bit described in step b1, the data length described in step b2, step b3
Stop position, the data frame described in step b4 can be configured according to method in the prior art, this is repeated no more.
According to described in step 104, when first node determines that the data sent do not clash, 105 are thened follow the steps；
When first node determines that the data sent clash, 106 are thened follow the steps.
Step 105, if it is determined that send data do not clash, then continue transmission data.
Certainly, it can judge whether the data sent clash in real time during follow-up transmission data, until number
According to being sent.
Step 106, if it is determined that send data transmission collision, then detect conflict number whether reach it is preset conflict time
Number.
It is exemplary, it is assumed that preset conflict number be 4 times, when address be 62 machine send data clash, then
The conflict number for the machine that address is 62 is added 1, conflict number reaches 4 times after adding 1, thens follow the steps 107；If plus 1 it
Conflict number is also not up to 4 times afterwards, thens follow the steps 108.
If step 107 reaches, according to the back off time for keeping out of the way delay algorithm calculating first node.
Wherein, according to keep out of the way delay algorithm calculate first node back off time include：
C1, the address information for obtaining second node, second node are normal transmission data before no data transmission in bus
Node；
C2, the back off time that first node is calculated according to the second formula, the second formula are：
T2=| S1-S2|×t2+t3；
Wherein, T2For the back off time of first node, S1For the address information of first node, S2For the address of second node
Information, t2Keep out of the way delay time, t for unit3Keep out of the way delay time for minimum.
After the above-mentioned delay time for keeping out of the way delay algorithm calculating first node, first node expires in delay time
Afterwards, detect in bus whether have data transmission again, step 101 is gone successively to, to carry out subsequent operation.
It is exemplary, it is assumed that before address is 62 machine transmission data, the machine transmission data that address is 03 terminates, then
The machine that address is 03 is second node, and the address information of second node is 03；If unit keeps out of the way delay time t2For 10ms, most
It is small to keep out of the way delay time t3For 100ms, then, according to the back off time T for the first node that the second formula is calculated2It is equal to
690ms, i.e. T2=| 62-3 | × 10+100, the back off time for the first node being calculated are much larger than the free time etc. of first node
Wait for the time, it is therefore an objective to allow the machine of frequent collisions temporarily to exit bus contention, be in detection bus after waiting for back off time to expire
It is no to have data transmission, to reenter bus contention.
If step 108 is not up to, the delay time of first node is calculated according to conflict delay algorithm.
Wherein, include according to the delay time of conflict delay algorithm calculating first node：
D1, the second random attribute information for obtaining first node.
It should be noted that the second random attribute information obtained can be identical with the content of the first random attribute information,
Herein only for acquired in differentiation different time.Second random attribute information can be referred to above-mentioned to the first random attribute
The description of information.
D2, summation operation is carried out to the second random attribute information, obtains the second reference value.
D3, the delay time that first node is calculated according to third formula, third formula are：
T3=(M2mod N2)+t4-k×t5
Wherein, T3For the delay time of the first node, M2For second reference value, N2For the second modulus value, t4For nothing
Conflict minimum latency, and k is the conflict number of first node, t5For the stand-by period that conflicts.
After the delay time for calculating first node according to above-mentioned conflict delay algorithm, first node expires in delay time
Afterwards, detect in bus whether have data transmission again, step 101 is gone successively to, to carry out subsequent operation.
It is exemplary, it is assumed that the conflict number of machine for being 62 in address is 1, then gets the second of the machine that address is 60
Random attribute information includes：Address information 62,19 ° of the temperature of current environment and (0-255) middle random number 9 chosen, obtain
Second reference value M2Equal to 90, i.e. M2=62+19+9；If Lothrus apterus minimum latency t4For 16ms, conflict stand-by period t5For
2ms, the second modulus value are 8, then the delay time T for the first node being calculated according to third formula3Equal to 16ms, it is calculated
First node delay time be much smaller than first node the idle waiting time, in order to reduce the hair of subsequent collision
It is raw, in the case of limited conflict number, the time is recalculated according to conflict delay algorithm.And in order to reduce follow-up punching
Prominent odds provides the success rate that the machine clashed is retransmitted, when subtracting certain according to conflict number in the calculation
Between, provide the priority that the machine that clashes is sent successively, and be in detection bus after waiting for delay time to expire
It is no to have data transmission, to reenter bus contention.
The communication means of 485 multi-host communication provided in an embodiment of the present invention, by determine first node idle waiting when
Between, and detect whether have data transmission on the idle waiting time internal bus of first node；If no, first node is
Transmission data when the idle waiting time of one node expires.But when the node of bus mounting is more, it might have several machines
The idle waiting time of device and the idle waiting time of first node are identical, when the idle waiting time expires, first
Node and with this several machines can transmission data simultaneously, therefore first node can be clashed with this several machines, according to generation
The number of conflict recalculates back off time or the delay time of this several machines according to different algorithms, since delay time is small
In the idle waiting time, therefore, the time that the machine clashed waits for is less than the machine not clashed, thus each
The transmission of data is completed in collision detection.The method provided through the embodiment of the present invention makees each node in 485 buses
For first node, no master-slave relationship, by the idle waiting time for calculating first node so that first node is in its idle waiting
Transmission data when time expires, without in the prior art by the way of host computer polls into row data communication, solving single host
It is long to communicate poll time, the low problem of communication efficiency.Meanwhile the reliable efficient of multi-host communication may be implemented by collision detection
Operation.
An embodiment of the present invention provides a kind of devices of 485 multi-host communication, as shown in figure 4, including：
First determination unit 401, for determining the idle waiting time, which is first node from bus
No data is transferred to the time that transmission data is waited for；
Whether detection unit 402 has data transmission for detecting on idle waiting time internal bus；
Transmission unit 403 detects that no data transmits on idle waiting time internal bus for working as detection unit 402,
The then transmission data when the idle waiting time expires.
Further, as shown in figure 5, the device further includes：Second determination unit 404, computing unit 405.
Wherein, the second determination unit 404 is used to determine whether the data sent clash according to collision detection method；
If detection unit 402 is additionally operable to the second determination unit 404 and determines that the data sent clash, conflict number is detected
Whether preset conflict number is reached；
If computing unit 405 detects that conflict number reaches preset conflict number for detection unit 402, basis is moved back
Keep away the back off time that delay algorithm calculates first node；
Computing unit 405, if being additionally operable to detection unit 402 detects that conflict number is not up to preset conflict number,
The delay time of first node is calculated according to conflict delay algorithm；
Wherein, the back off time of first node is more than the idle waiting time of first node, the idle waiting of first node
Time is more than the delay time of first node.
Optionally, as shown in fig. 6, the first determination unit 401 includes：First, which obtains subelement 4011, first, calculates son list
Member 4012 and determination subelement 4013；
First obtains subelement 4011, the random attribute information for obtaining first node, the random attribute of first node
Information includes the address information of first node, and/or the hardware parameter of first node in current environment, and/or appointing in 0-255
One random number；
First computation subunit 4012 carries out summation operation for the random attribute information to first node, obtains first
Reference value；
Determination subelement 4013, the idle waiting time for determining first node according to the first formula, the first formula is：
T1=M1mod N1+t1；Wherein, T1For the idle waiting time of first node, M1For the first reference value, t1For Lothrus apterus minimum etc.
It waits for the time, N1For the first modulus value.
Optionally, the second determination unit 404 is specifically used for determining whether the parity check bit of the data sent is correct；If just
Really, it is determined that whether the data length of the data of transmission is correct；If correct, it is determined that just whether the stop position of the data of transmission
Really；If correct, it is determined that whether the data frame of the data of transmission is correct；If correct, it is determined that do not clash.
Optionally, as shown in fig. 6, computing unit 405 includes：Second obtains subelement 4051, the second computation subunit
4052。
Wherein, the second acquisition subelement 4051 is used to obtain the address information of second node, and the second node is described
The node of normal transmission data before no data transmits in bus；
Back off time of second computation subunit 4052 for calculating the first node according to the second formula, described second
Formula is：T2=| S1-S2|×t2+t3；Wherein, the T2For the back off time of the first node, the S1It is described first
Address of node information, the S2For the address information of the second node, the t2Keep out of the way delay time, the t for unit3
Keep out of the way delay time for minimum.
Optionally, the second acquisition subelement 4051 is additionally operable to obtain the second random attribute information of first node；Second meter
Operator unit 4052 is additionally operable to carry out summation operation to the second random attribute information, obtains the second reference value；According to third
Formula calculates the delay time of the first node, and the third formula is：T3=(M2mod N2)+t4-k×t5；Wherein, described
T3For the delay time of the first node, the M2For second reference value, the N2For the second modulus value, the t4For nothing
Conflict minimum latency, and the k is the conflict number of first node, the t5For the stand-by period that conflicts.
An embodiment of the present invention provides a kind of device of 485 multi-host communication, when idle waiting by determining first node
Between, and detect whether have data transmission on the idle waiting time internal bus of first node；If no, first node is
Transmission data when the idle waiting time of one node expires.In this way, it regard each node in 485 buses as first node,
Without master-slave relationship, by the idle waiting time for calculating first node so that first node is when its idle waiting time expires
Transmission data, when without communicating poll as in the prior art by the way of host computer polls into row data communication, solving single host
Between long, the low problem of communication efficiency.
In several embodiments provided herein, it should be understood that disclosed system, device and method can be with
It realizes by another way.For example, the apparatus embodiments described above are merely exemplary, for example, the unit
It divides, only a kind of division of logic function, formula that in actual implementation, there may be another division manner, such as multiple units or component
It can be combined or can be integrated into another system, or some features can be ignored or not executed.Another point, it is shown or
The mutual coupling, direct-coupling or communication connection discussed can be the indirect coupling by some interfaces, device or unit
It closes or communicates to connect, can be electrical, machinery or other forms.
The unit illustrated as separating component may or may not be physically separated, aobvious as unit
The component shown may or may not be physical unit, you can be located at a place, or may be distributed over multiple
In network element.Some or all of unit therein can be selected according to the actual needs to realize the mesh of this embodiment scheme
's.
In addition, each functional unit in each embodiment of the present invention can be integrated in a processing unit, it can also
It is that the independent physics of each unit includes, it can also be during two or more units be integrated in one unit.Above-mentioned integrated list
The form that hardware had both may be used in member is realized, can also be realized in the form of hardware adds SFU software functional unit.
The above-mentioned integrated unit being realized in the form of SFU software functional unit can be stored in one and computer-readable deposit
In storage media.Above-mentioned SFU software functional unit is stored in a storage medium, including some instructions are used so that a computer
Equipment (can be personal computer, server or the network equipment etc.) executes the portion of each embodiment the method for the present invention
Step by step.And storage medium above-mentioned includes：USB flash disk, mobile hard disk, read-only memory (Read-Only Memory, abbreviation
ROM), random access memory (Random Access Memory, abbreviation RAM), magnetic disc or CD etc. are various to store
The medium of program code.
Finally it should be noted that：The above embodiments are merely illustrative of the technical solutions of the present invention, rather than its limitations；Although
Present invention has been described in detail with reference to the aforementioned embodiments, it will be understood by those of ordinary skill in the art that：It still may be used
With technical scheme described in the above embodiments is modified or equivalent replacement of some of the technical features；
And these modifications or replacements, various embodiments of the present invention technical solution that it does not separate the essence of the corresponding technical solution spirit and
Range.
Claims (6)
1. a kind of method of 485 multi-host communication, which is characterized in that including：
First node determines that idle waiting time, the idle waiting time are that first node no data from bus transmits
The time waited for transmission data；
Whether detection has data transmission within the idle waiting time in the bus；
If no, first node transmission data when the idle waiting time expires；
When the idle waiting time expires while transmission data, the method further includes the first node：
Determine whether the data sent clash according to collision detection method；
If it is determined that the data sent clash, then detect whether conflict number reaches preset conflict number；
If reaching, basis keeps out of the way the back off time that delay algorithm calculates the first node；
If not up to, calculating the delay time of the first node according to conflict delay algorithm；
Wherein, the back off time of the first node is more than the idle waiting time of the first node, the first node
The idle waiting time is more than the delay time of the first node.
2. according to the method described in claim 1, it is characterized in that, the determining idle waiting time include：
The random attribute information of first node is obtained, the random attribute information of the first node includes the ground of the first node
The hardware parameter of first node described in location information, and/or current environment, and/or any random number in 0-255；
Summation operation is carried out to the random attribute information of the first node, obtains the first reference value；
Determine that the idle waiting time of the first node, first formula are according to the first formula：T1=M1mod N1+t1；
Wherein, the T1For the idle waiting time of the first node, the M1For first reference value, the t1For Lothrus apterus
Minimum latency, the N1For the first modulus value.
3. according to the method described in claim 1, it is characterized in that, described determine that the data sent are according to collision detection method
It is no clash including：
Determine whether the parity check bit of the data sent is correct；
If correct, it is determined that whether the data length of the data of transmission is correct；
If correct, it is determined that whether the stop position of the data of transmission is correct；
If correct, it is determined that whether the data frame of the data of transmission is correct；
If correct, it is determined that do not clash.
4. according to the method described in claim 1, it is characterized in that, the basis, which keeps out of the way delay algorithm, calculates the first node
Back off time include：
The address information of second node is obtained, the second node is normal transmission data before no data transmission in the bus
Node；
The back off time of the first node is calculated according to the second formula, second formula is：
T2=| S1-S2|×t2+t3；
Wherein, the T2For the back off time of the first node, the S1For the address information of the first node, the S2
For the address information of the second node, the t2Keep out of the way delay time, the t for unit3Keep out of the way delay time for minimum.
5. according to the method described in claim 1, it is characterized in that, described calculate the first node according to conflict delay algorithm
Delay time include：
Obtain the second random attribute information of first node；
Summation operation is carried out to the second random attribute information, obtains the second reference value；
The delay time of the first node is calculated according to third formula, the third formula is：
T3=(M2mod N2)+t4-k×t5；
Wherein, the T3For the delay time of the first node, the M2For second reference value, the N2For the second mould
Value, the t4For Lothrus apterus minimum latency, the k is the conflict number of first node, the t5For the stand-by period that conflicts.
6. a kind of device of 485 multi-host communication, which is characterized in that including：
First determination unit, for determining that idle waiting time, the idle waiting time are that first node is countless from bus
The time waited for according to transmission data is transferred to；
Whether detection unit has data transmission within the idle waiting time for detecting in the bus；
Transmission unit detects that no data passes in the bus within the idle waiting time for working as the detection unit
It is defeated, then the transmission data when the idle waiting time expires；
Described device further includes：Second determination unit, computing unit；Wherein,
Second determination unit, for determining whether the data sent clash according to collision detection method；
The detection unit detects conflict number if being additionally operable to second determination unit determines that the data sent clash
Whether preset conflict number is reached；
Computing unit prolongs if detecting that conflict number reaches preset conflict number for the detection unit according to keeping out of the way
When algorithm calculate the back off time of the first node；
The computing unit, if being additionally operable to the detection unit detects that conflict number is not up to preset conflict number, root
The delay time of the first node is calculated according to conflict delay algorithm；
Wherein, the back off time of the first node is more than the idle waiting time of the first node, the first node
The idle waiting time is more than the delay time of the first node.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510093094.6A CN105591857B (en) | 2015-03-02 | 2015-03-02 | A kind of method and apparatus of 485 multi-host communication |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510093094.6A CN105591857B (en) | 2015-03-02 | 2015-03-02 | A kind of method and apparatus of 485 multi-host communication |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105591857A CN105591857A (en) | 2016-05-18 |
| CN105591857B true CN105591857B (en) | 2018-09-25 |
Family
ID=55931108
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510093094.6A Active CN105591857B (en) | 2015-03-02 | 2015-03-02 | A kind of method and apparatus of 485 multi-host communication |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105591857B (en) |
Families Citing this family (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106302066A (en) * | 2016-08-26 | 2017-01-04 | 珠海格力电器股份有限公司 | Without master-slave communication method and device |
| CN106502936B (en) * | 2016-10-26 | 2020-02-04 | 海信（山东）空调有限公司 | Conflict avoidance method of multiple main buses and node equipment |
| CN107104865B (en) * | 2017-04-07 | 2020-08-18 | 惠州市天泽盈丰物联网科技股份有限公司 | RS485 bus-based background extension method and system |
| CN107171921B (en) * | 2017-04-07 | 2020-08-07 | 惠州市天泽盈丰物联网科技股份有限公司 | Real-time communication method based on RS485 network |
| CN107171917B (en) * | 2017-04-07 | 2020-11-03 | 惠州市天泽盈丰物联网科技股份有限公司 | RS485 bus capacity expansion-based network |
| CN106982156B (en) * | 2017-06-08 | 2019-11-15 | 日立楼宇技术（广州）有限公司 | Priority setting method, device, communication system, equipment and readable storage medium storing program for executing |
| CN107465487B (en) * | 2017-08-14 | 2020-07-28 | 来邦科技股份公司 | Bus data sending method, system and sub-equipment |
| CN109495215B (en) * | 2018-12-20 | 2022-02-11 | 山东比特智能科技股份有限公司 | Communication method, system and device of half-duplex bus and readable storage medium |
| CN112217701A (en) * | 2019-07-09 | 2021-01-12 | 杭州萤石软件有限公司 | Bus collision avoidance method and device |
| CN110635982B (en) * | 2019-08-09 | 2021-12-14 | 工业互联网创新中心（上海）有限公司 | Double-host communication method and system on communication bus, industrial control gateway and storage medium |
| CN113965308A (en) * | 2021-10-26 | 2022-01-21 | 上海三思电子工程有限公司 | Connection communication method, slave device and device control system |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101626334A (en) * | 2009-08-10 | 2010-01-13 | 中兴通讯股份有限公司 | Method and device for controlling communication bus |
| CN202041950U (en) * | 2010-12-30 | 2011-11-16 | Tcl集团股份有限公司 | Anti-collision controller for RS485 bus |
| CN102546141A (en) * | 2012-02-20 | 2012-07-04 | 杭州海康威视系统技术有限公司 | 485 bus system and asynchronous half-duplex communication method thereof |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7668998B2 (en) * | 2008-01-08 | 2010-02-23 | Parata Systems, Llc | Methods, systems, and devices for providing an interrupt scheme in automated pharmaceutical dispensing machines without centralized arbitration |
-
2015
- 2015-03-02 CN CN201510093094.6A patent/CN105591857B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101626334A (en) * | 2009-08-10 | 2010-01-13 | 中兴通讯股份有限公司 | Method and device for controlling communication bus |
| CN202041950U (en) * | 2010-12-30 | 2011-11-16 | Tcl集团股份有限公司 | Anti-collision controller for RS485 bus |
| CN102546141A (en) * | 2012-02-20 | 2012-07-04 | 杭州海康威视系统技术有限公司 | 485 bus system and asynchronous half-duplex communication method thereof |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105591857A (en) | 2016-05-18 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105591857B (en) | A kind of method and apparatus of 485 multi-host communication | |
| US10678243B2 (en) | Systems and methods for scalable electrical engineering (EE) architecture in vehicular environments | |
| US8792508B2 (en) | Subscriber and communication controller of a communication system and method for implementing a gateway functionality in a subscriber of a communication system | |
| US9298529B2 (en) | Indicating internal transmitter errors in a controller area network (CAN) | |
| US8856392B2 (en) | Dividing a port into smaller ports | |
| CN102546141B (en) | 485 bus system and asynchronous half-duplex communication method thereof | |
| KR101956940B1 (en) | Method and device for serial data transmission which is adapted to memory sizes | |
| US20140023068A1 (en) | Controller area network communications using ethernet | |
| CN102077514A (en) | Method for detecting a faulty node | |
| US9467309B2 (en) | Network distributor | |
| CN104854845B (en) | Use the method and apparatus of efficient atomic operation | |
| CN107038137A (en) | A kind of device and method of hot plug | |
| JP2008509463A (en) | Method for storing messages in message memory and message memory | |
| KR101380118B1 (en) | Ethernet network for vehicles and vehicles using the same | |
| JP6332060B2 (en) | In-vehicle network | |
| CN107127811A (en) | Flexible material cutting robot intelligent digital controller and implementation method | |
| KR102313636B1 (en) | Operation method of communication node for time sinchronizating in vehicle network | |
| US9665518B2 (en) | Methods and systems for controlling ordered write transactions to multiple devices using switch point networks | |
| US11362966B2 (en) | Method of ethernet auto-negotiation over one cable | |
| CN204390224U (en) | A kind of fault-tolerant master-slave synchronisation serial communication system based on FPGA | |
| KR20150061348A (en) | Method and Apparatus for setting up device address for I2C communication | |
| JP2013150045A5 (en) | ||
| JP5534711B2 (en) | Information processing apparatus, information processing method, and program | |
| CN104572537A (en) | Fault-tolerant master-slave synchronization serial communication system based on FPGA | |
| CN110661663B (en) | Interface state synchronization method and device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| CB02 | Change of applicant information | ||
| CB02 | Change of applicant information |
Address after: 266736 Hisense Road 1, South Village Town, Pingdu City, Qingdao, Shandong Applicant after: Hisense (Shandong) Air-conditioning Co., Ltd. Address before: 266100 Zhuzhou Road, Laoshan District, Qingdao, Shandong Province, No. 151 Applicant before: Hisense (Shandong) Air-conditioning Co., Ltd. |
|
| GR01 | Patent grant | ||
| GR01 | Patent grant |