CN114422480A - Automatic communication address allocation method - Google Patents
Automatic communication address allocation method Download PDFInfo
- Publication number
- CN114422480A CN114422480A CN202111468428.5A CN202111468428A CN114422480A CN 114422480 A CN114422480 A CN 114422480A CN 202111468428 A CN202111468428 A CN 202111468428A CN 114422480 A CN114422480 A CN 114422480A
- Authority
- CN
- China
- Prior art keywords
- address
- hash
- node
- slave node
- hash table
- 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
- 238000004891 communication Methods 0.000 title claims abstract description 58
- 238000000034 method Methods 0.000 title claims abstract description 47
- 230000004044 response Effects 0.000 claims abstract description 33
- 238000004364 calculation method Methods 0.000 claims description 6
- 230000000977 initiatory effect Effects 0.000 claims description 2
- 230000006855 networking Effects 0.000 abstract description 3
- 101150060512 SPATA6 gene Proteins 0.000 description 118
- 238000010586 diagram Methods 0.000 description 7
- 230000008569 process Effects 0.000 description 6
- 238000005516 engineering process Methods 0.000 description 2
- 230000006870 function Effects 0.000 description 2
- 238000013507 mapping Methods 0.000 description 2
- 238000012790 confirmation Methods 0.000 description 1
- 230000003111 delayed effect Effects 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 230000007717 exclusion Effects 0.000 description 1
- 239000000203 mixture Substances 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L61/00—Network arrangements, protocols or services for addressing or naming
- H04L61/30—Managing network names, e.g. use of aliases or nicknames
- H04L61/3005—Mechanisms for avoiding name conflicts
Abstract
The application discloses a communication address automatic allocation method, which comprises the following steps: the master node sends a query frame containing the hash table turn and the hash table sequence number to the slave node; under the condition that the slave node receives the query frame, if the hash table sequence number in the query frame is the same as the hash table sequence number generated by the slave node, the slave node feeds back a response frame to the master node; and after receiving the response frame fed back by the slave node, the master node selects an idle address from the communication address table and allocates the idle address to the slave node. The method includes that automatic allocation of slave node addresses is achieved by a master node and a slave node through a query frame and response frame mode based on hash table serial numbers calculated by a hash algorithm; hash conflicts can be identified and eliminated through multiple rounds of Hash, and the networking efficiency of the system is improved.
Description
Technical Field
The present application relates to the field of communications technologies, and in particular, to an automatic communication address allocation method.
Background
With the development of electronic information technology, various industrial and commercial products are more and more intelligent, and systems are more and more complex. A complete product solution generally comprises a plurality of devices, and data needs to be interacted between the devices through communication when the devices work normally. The communication network supporting multiple devices needs to support the functions of device identification, address allocation, node dynamic management and the like; the complex system is often required to be communicated and networked when being installed on site, the traditional manual configuration method is time-consuming, labor-consuming and easy to make mistakes, dynamic management of communication nodes cannot be realized, and the application requirements of modern products cannot be met.
Patent publication (publication) No. CN112929249A proposes an automatic distribution method, device and system for RS-485 bus multi-machine communication addresses, after receiving a main node command, each slave node to be distributed reports its own identity information in a delayed manner according to the random number generated by each slave node, and after receiving the information of each slave node, the main node distributes addresses in sequence. However, the automatic allocation method has the following problems: when the number of slave nodes to be assigned with addresses is large, if the range of the random numbers is too small, two rounds of random numbers may not avoid collision; if the random number range is too large, the total delay is too large, and the system networking time is very long; and the method can occupy the bus for a long time when allocating the address, is only suitable for allocating once during initialization and is not suitable for node dynamic management after normal operation.
Disclosure of Invention
The application provides an automatic communication address allocation method, which aims to solve the problem of how to automatically allocate communication addresses.
One aspect of the present application provides a method for automatically allocating a communication address, where the method includes:
sending a query frame containing the hash table turn and the hash table sequence number to a slave node;
and after receiving the response frame fed back by the slave node, selecting an idle address from a communication address table and allocating the idle address to the slave node.
Another aspect of the present application provides a method for automatically allocating a communication address, where the method includes:
receiving a query frame which is sent by a main node and contains a hash table turn and a hash table sequence number;
and under the condition of receiving the query frame, if the hash table sequence number in the query frame is the same as the hash table sequence number generated by the query frame, feeding back a response frame to the main node.
Another aspect of the present application further provides a method for automatically allocating a communication address, where the method includes:
the master node sends a query frame containing the hash table turn and the hash table sequence number to the slave node;
under the condition that the slave node receives the query frame, if the hash table sequence number in the query frame is the same as the hash table sequence number generated by the slave node, the slave node feeds back a response frame to the master node;
and after receiving the response frame fed back by the slave node, the master node selects an idle address from the communication address table and allocates the idle address to the slave node.
According to the communication address automatic allocation method, the master node and the slave node realize automatic allocation of slave node addresses in a mode of query frames and response frames based on hash table serial numbers calculated by a hash algorithm; hash conflicts can be identified and eliminated through multiple rounds of Hash, and the networking efficiency of the system is improved.
Drawings
Fig. 1 is a schematic diagram illustrating an automatic communication address allocation method according to an embodiment of the present disclosure;
fig. 2 is a schematic diagram of a large set by hash mapping according to an embodiment of the present application;
fig. 3 is a schematic diagram of a master node and a slave node according to an embodiment of the present application;
fig. 4 is a schematic diagram illustrating another method for automatically allocating a communication address according to an embodiment of the present application;
FIG. 5 is a schematic diagram of a master node control process provided in an embodiment of the present application;
fig. 6 is a schematic diagram illustrating another method for automatically allocating a communication address according to an embodiment of the present application;
fig. 7 is a schematic diagram of a slave node control process provided in an embodiment of the present application.
The implementation, functional features and advantages of the objectives of the present application will be further explained with reference to the accompanying drawings.
Detailed Description
In order to make the technical problems, technical solutions and advantageous effects to be solved by the present application clearer and clearer, the present application is further described in detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative of the present application and are not intended to limit the present application.
In the description of the present application, it is to be understood that the terms "center", "upper", "lower", "front", "rear", "left", "right", and the like, indicate orientations or positional relationships based on the orientations or positional relationships shown in the drawings, are only for convenience in describing the present application and simplifying the description, and do not indicate or imply that the referred device or element must have a specific orientation, be constructed in a specific orientation, and be operated, and thus, should not be construed as limiting the present application. Furthermore, the terms "first" and "second" are used for descriptive purposes only and are not to be construed as indicating or implying relative importance.
Example 1
As shown in fig. 1, a first embodiment of the present application provides an automatic communication address allocation method, including:
step S11, the master node sends a query frame containing the hash table turn and the hash table sequence number to the slave node;
the master node sends a query frame containing the hash table turn and the hash table sequence number to the slave node, and the method also comprises the following steps:
and the master node sends a hash algorithm configuration frame to the slave node so that the slave node receives the hash algorithm configuration frame sent by the master node, and performs hash calculation according to the hash algorithm configuration frame and the characteristic information of the slave node under the condition of receiving the hash algorithm configuration frame so as to generate a hash table serial number.
It is understood that the master node may send the hash algorithm configuration frame to all slave nodes in a broadcast manner.
Wherein the hash algorithm configuration frame comprises at least one of: the slave node adopts a Hash calculation method, a Hash table length, input information, a Hash function and an address allocation mode. The self characteristic information of the slave node comprises at least one of the following: product serial number, chip serial number, random number, and other mutually exclusive characteristic information.
In an alternative implementation, if the master node does not send a hash algorithm configuration frame to the slave node, the slave node may adopt a default configuration.
Step S12, under the condition that the slave node receives the query frame, if the hash table sequence number in the query frame is the same as the hash table sequence number generated by the slave node, feeding back a response frame to the master node;
and step S13, after receiving the response frame fed back by the slave node, the master node selects an idle address from the communication address table and allocates the idle address to the slave node.
In bus communication, to realize multi-node communication, each device needs to have its own special identifier, which is defined as a node number in the industrial field. The devices on the bus can only have one master node and other devices as slave nodes at the same time, but a precondition is that each node in the bus network needs to have a fixed ID number, and the ID number is used as a unique identifier of communication, namely a communication address, and determines the reliability of the communication. The communication address table is an information table comprising the corresponding relation between the nodes and the unique identifiers thereof.
In a further implementation, the master node sends an address configuration frame containing address information and a configuration command to the slave node, so that the slave node performs configuration after receiving the address configuration frame sent by the master node.
In an optional implementation, if the master node does not receive any information within a preset time, it determines that a slave node corresponding to the hash table sequence number in the query frame is empty; and if the main node receives a plurality of response frames or receives non-response frame information, judging that hash collision exists between the hash table sequence numbers in the query frame and a plurality of slave nodes.
In an optional implementation, after the master node sequentially sends all query frames to all slave nodes, if hash collision is detected, starting the next round of address allocation; if no hash collision is detected and/or the number of slave nodes of the allocated address is equal to the number of slave nodes of the address to be allocated, the address allocation is finished.
In a preferred implementation, the next round of address assignment uses incremental address assignment. Specifically, the master node saves the successfully allocated slave node address and the characteristic information thereof to the communication address table, and the slave node saves the address allocation state; the slave nodes which have successfully allocated the addresses do not participate in address allocation any more, and only newly added slave nodes participate in allocation, so that the allocation can be carried out in normal communication gaps without interrupting normal communication.
The master node can dynamically manage the slave nodes through the communication address table. Specifically, the master node communicates with the slave node to which the address has been successfully allocated at regular time, and if the communication fails after a specified time, it is determined that the slave node is disconnected, and the slave node can be deleted from the communication address table to release the address. The main node can also initiate incremental address allocation at regular time, automatically allocate addresses for the newly on-line slave nodes and add the addresses to the communication address table. The communication period between the master node and the slave node which has successfully allocated the address and the period for the master node to initiate the incremental address allocation can be configured.
In a further implementation, after the preset round of address allocation is completed, if the master node detects a hash collision or the number of slave nodes to which addresses have been allocated is less than the number of slave nodes to which addresses are to be allocated, it is determined that address allocation has failed.
Orderly mapping a small number of mutually exclusive nodes in a large set to a small set through Hash; each node has unique characteristic information. The characteristic information can be diversified, and only the characteristic information has the mutual exclusion characteristic, and the information format does not need to be concerned. For example, the device serial number may be hashed without parsing the serial number format; when the input information is different, the code can be adapted without being modified; multiple devices can be used in a mixture, such as a serial number for one type of device and a name for another type of device. Ideally, for example, the hash distribution is absolutely uniform, and after the hash algorithm is specified, each device can calculate the unique position of itself in the whole hash table without communicating with other devices.
The hash result has the possibility of conflict, namely different input information obtains the same hash value; to reduce the collision probability, the hash table may be made larger. Meanwhile, the conflict can be gradually eliminated through multiple times of hash and multiple times of communication; the uncertain information is reduced after each hash and communication confirmation, and the hash table can be reduced next time (for example, the hash table is reduced according to 1/2); and proper hash times and table sizes are selected, the probability of collision of multiple hashes is negligible, and engineering feasibility is achieved. Generally, there are two ways for multiple hashes: the first is that the input information is unchanged, and various different hash algorithms are adopted; the second is a variety of different input information, the same hash algorithm.
As shown in fig. 2, after the first hash calculation, 6 devices including SN2, SNz, SN6, abc, def, and SNc have hash collision between abc and SN6, and all other devices have unique hash values in hash table 1; after the second hash calculation, the hash values of abc and SN6 in hash table 2 do not collide.
As shown in fig. 3, 1 master station (master node), N slave stations (slave nodes); the multiple hash adopts a second mode, and the hash is carried out for at most 3 times; the address assignment pattern is a total reassignment, i.e., all devices clear and resume assigning addresses regardless of whether the addresses have been successfully assigned.
And the main node broadcasts and sends a hash algorithm configuration frame. Wherein, in order to balance the hash collision probability and the time overhead, the length of the hash table can be adjusted according to the N value.
And the slave node respectively adopts the equipment serial number, the chip serial number and the random number according to the command of the master node, and calculates and stores three hash values which are hs1, hs2 and hs3 respectively.
The main node sends a query frame of hs1 and sequentially sends broadcast frames of hash table sequence numbers X (such as 0-4095); when receiving the query frame of the hash table sequence number X, if the hash table sequence number of a certain slave node sx is X, sending a response frame to the master node, and attaching characteristic information such as the equipment sequence number, the name and the like.
If the master node receives the effective response frame, recognizing that the sx node exists, and allocating a node address for the sx node; if there is no response within the specified time TD1, for example, 5ms, it is determined that no node exists. If a plurality of valid response frames are received or non-response frame information is detected (for example, the slave nodes reply data but not response frames), judging that the hash sequence number corresponds to a plurality of slave nodes, and recording a conflict and continuously sending a query frame if the hash sequence number corresponds to the slave nodes;
after the master node sequentially sends all query frames of hs1, if the number of identified effective slave nodes is equal to the number N of configured slave nodes and no hash collision is detected, the address allocation is finished; if a hash collision is detected, then the hs2 query is entered.
The hs2 query is similar to the hs1 query process, and incremental address allocation is adopted at the moment, namely only slave nodes without allocated addresses participate; querying the slave node that has completed the address assignment via hs1 for no response; when hs2 is finished, if the hash collision still exists, entering hs3 query; the hs3 query is similar to the hs2 process described above.
After the inquiry is confirmed for three times, if the number of the identified effective slave nodes is equal to the number N of the configured slave nodes, the operation is finished; otherwise, prompting failure, and displaying the successfully configured serial number and address of the slave node equipment.
Example 2
As shown in fig. 4, a second embodiment of the present application provides an automatic communication address allocation method, which is used for a master node. The method comprises the following steps:
step S21, sending a query frame containing the hash table turn and the hash table sequence number to the slave node;
and step S22, after receiving the response frame fed back by the slave node, selecting an idle address from the communication address table and allocating the idle address to the slave node.
In one example, the sending a query frame containing a hash table turn and a hash table sequence number to the slave node further comprises:
and sending a hash algorithm configuration frame to the slave node.
In one example, the sending a query frame containing the hash table turn and the hash table sequence number to the slave node further includes:
if no information is received within the preset time, judging that a slave node corresponding to the hash table sequence number in the query frame is empty;
and if a plurality of response frames or non-response frame information is received, judging that hash collision exists between the hash table sequence numbers in the query frame and a plurality of slave nodes.
In one example, the selecting a free address from the communication address table to allocate to the slave node further includes:
and sending an address configuration frame containing address information and a configuration command to the slave node.
In one example, the selecting a free address from the communication address table to allocate to the slave node further includes:
after all the query frames are sent, if hash collision is detected, starting address allocation of the next round; if no hash collision is detected and/or the number of slave nodes of the allocated address is equal to the number of slave nodes of the address to be allocated, the address allocation is finished.
In one example, the initiating the next round of address assignment further comprises:
after the preset round of address allocation is completed, if hash collision is detected or the number of slave nodes of the allocated address is smaller than that of the slave nodes of the address to be allocated, it is determined that the address allocation fails.
In one example, the selecting a free address from the communication address table to allocate to the slave node further includes:
and storing the slave node address and the characteristic information thereof into a communication address table so as to dynamically manage the slave node through the communication address table.
The master node as shown in fig. 5 controls the process:
first, the master node transmits a hash algorithm configuration frame to the slave node.
The master node then sends a query frame containing the hash table turn and the hash table sequence number to the slave node.
The master node then determines whether a valid response has been received. If the main node receives the effective response, the address is distributed to the slave nodes, and the number of the effective nodes is judged; if the number of the slave nodes of the allocated address is equal to that of the slave nodes of the address to be allocated, the address allocation is successful; if the number of the slave nodes of the allocated address is less than that of the slave nodes of the address to be allocated, judging the hash turn; if the hash round exceeds the preset round, the address allocation fails; and if the hash round does not exceed the preset round or the hash table is not convenient completely, continuously sending the query frame containing the hash table round and the hash table sequence number.
If the main node receives an invalid response, judging the hash round; if the hash round exceeds the preset round, the address allocation fails; and if the hash round does not exceed the preset round or the hash table is not convenient completely, continuously sending the query frame containing the hash table round and the hash table sequence number.
Further, an embodiment of the present application further provides a master node device, including a processor and a memory, where the memory stores at least one program code, and the at least one program code is loaded and executed by the processor, so as to implement the method for automatically allocating a communication address according to the second embodiment.
Example 3
As shown in fig. 6, a third embodiment of the present application provides an automatic communication address allocation method, which is used for a slave node. The method comprises the following steps:
step S31, receiving a query frame which is sent by the main node and contains the hash table turn and the hash table sequence number;
step S32, when the query frame is received, if the hash table sequence number in the query frame is the same as the hash table sequence number generated by the query frame, feeding back a response frame to the master node.
In an example, the receiving a query frame including a hash table turn and a hash table sequence number sent by a master node previously further includes:
receiving a hash algorithm configuration frame sent by the main node;
and under the condition of receiving the hash algorithm configuration frame, performing hash calculation according to the hash algorithm configuration frame and the characteristic information of the hash algorithm configuration frame to generate a hash table sequence number.
In an example, the feeding back the response frame to the primary node further includes:
and receiving an address configuration frame which is sent by the main node and contains address information and a configuration command.
The slave node control process as shown in fig. 7:
firstly, the slave node waits for a hash algorithm configuration frame sent by a master node and a slave node;
then, the slave node waits for the query frame sent by the master node and the slave node;
then, judging whether to answer; if the hash table serial number is the same as the hash table serial number generated by the hash table, feeding back a response frame to the master node; otherwise, continuing to wait for the query frame;
and finally, the slave node waits for the address configuration frame sent by the master node and the slave node, namely the configuration is successful.
Further, an embodiment of the present application further provides a slave node device, including a processor and a memory, where the memory stores at least one program code, and the at least one program code is loaded and executed by the processor, so as to implement the method for automatically allocating a communication address according to the third embodiment.
Further, an embodiment of the present application further provides a computer-readable storage medium, where at least one extent code is stored in the computer-readable storage medium, and the at least one extent code is loaded and executed by a processor, so as to implement the method for automatically allocating a communication address according to the second embodiment or the third embodiment.
The preferred embodiments of the present application have been described above with reference to the accompanying drawings, and are not intended to limit the scope of the claims of the application accordingly. Any modifications, equivalents and improvements which may occur to those skilled in the art without departing from the scope and spirit of the present application are intended to be within the scope of the claims of the present application.
Claims (10)
1. A method for automatically allocating communication addresses, the method comprising:
sending a query frame containing the hash table turn and the hash table sequence number to a slave node;
and after receiving the response frame fed back by the slave node, selecting an idle address from a communication address table and allocating the idle address to the slave node.
2. The method of claim 1, wherein sending the query frame containing the hash table turn and the hash table sequence number to the slave node further comprises:
and sending a hash algorithm configuration frame to the slave node.
3. The method of claim 1, wherein sending a query frame containing the hash table turn and the hash table sequence number to the slave node further comprises:
if no information is received within the preset time, judging that a slave node corresponding to the hash table sequence number in the query frame is empty;
and if a plurality of response frames or non-response frame information is received, judging that hash collision exists between the hash table sequence numbers in the query frame and a plurality of slave nodes.
4. The method of claim 1, wherein the selecting a free address from the communication address table to be allocated to the slave node, further comprising:
and sending an address configuration frame containing address information and a configuration command to the slave node.
5. The method of claim 1, wherein the selecting a free address from the communication address table to be allocated to the slave node, further comprising:
after all the query frames are sent, if hash collision is detected, starting address allocation of the next round; if no hash collision is detected and/or the number of slave nodes of the allocated address is equal to the number of slave nodes of the address to be allocated, the address allocation is finished.
6. The method of claim 5, wherein the initiating a next round of address assignment further comprises:
after the preset round of address allocation is completed, if hash collision is detected or the number of slave nodes of the allocated address is smaller than that of the slave nodes of the address to be allocated, it is determined that the address allocation fails.
7. The method of claim 1, wherein the selecting a free address from the communication address table to be allocated to the slave node, further comprising:
and storing the slave node address and the characteristic information thereof into a communication address table so as to dynamically manage the slave node through the communication address table.
8. A method for automatically allocating communication addresses, the method comprising:
receiving a query frame which is sent by a main node and contains a hash table turn and a hash table sequence number;
and under the condition of receiving the query frame, if the hash table sequence number in the query frame is the same as the hash table sequence number generated by the query frame, feeding back a response frame to the main node.
9. The method of claim 8, wherein receiving the query frame containing the hash table turn and the hash table sequence number sent by the master node further comprises:
receiving a hash algorithm configuration frame sent by the main node;
and under the condition of receiving the hash algorithm configuration frame, performing hash calculation according to the hash algorithm configuration frame and the characteristic information of the hash algorithm configuration frame to generate a hash table sequence number.
10. The method of claim 8, wherein the feeding back the response frame to the primary node further comprises:
and receiving an address configuration frame which is sent by the main node and contains address information and a configuration command.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111468428.5A CN114422480B (en) | 2021-12-03 | 2021-12-03 | Automatic communication address allocation method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111468428.5A CN114422480B (en) | 2021-12-03 | 2021-12-03 | Automatic communication address allocation method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN114422480A true CN114422480A (en) | 2022-04-29 |
| CN114422480B CN114422480B (en) | 2024-02-20 |
Family
ID=81264709
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111468428.5A Active CN114422480B (en) | 2021-12-03 | 2021-12-03 | Automatic communication address allocation method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114422480B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117614939A (en) * | 2024-01-19 | 2024-02-27 | 杭州方千科技有限公司 | 485 communication address automatic allocation method for image light supplementing device |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101446438A (en) * | 2008-08-29 | 2009-06-03 | 广东志高空调有限公司 | Method for assigning address to indoor unit of central air-conditioning system, device and system thereof |
| CN107395787A (en) * | 2017-09-01 | 2017-11-24 | 北京镁伽机器人科技有限公司 | Address distribution method, system, gateway and the medium of CAN communication network |
| CN107872739A (en) * | 2016-09-26 | 2018-04-03 | 中国电信股份有限公司 | A kind of ONU LLID distribution method, OLT and EPON systems |
| CN110933194A (en) * | 2019-11-05 | 2020-03-27 | 珠海格力电器股份有限公司 | Automatic address allocation method, equipment and system |
-
2021
- 2021-12-03 CN CN202111468428.5A patent/CN114422480B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101446438A (en) * | 2008-08-29 | 2009-06-03 | 广东志高空调有限公司 | Method for assigning address to indoor unit of central air-conditioning system, device and system thereof |
| CN107872739A (en) * | 2016-09-26 | 2018-04-03 | 中国电信股份有限公司 | A kind of ONU LLID distribution method, OLT and EPON systems |
| CN107395787A (en) * | 2017-09-01 | 2017-11-24 | 北京镁伽机器人科技有限公司 | Address distribution method, system, gateway and the medium of CAN communication network |
| CN110933194A (en) * | 2019-11-05 | 2020-03-27 | 珠海格力电器股份有限公司 | Automatic address allocation method, equipment and system |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117614939A (en) * | 2024-01-19 | 2024-02-27 | 杭州方千科技有限公司 | 485 communication address automatic allocation method for image light supplementing device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114422480B (en) | 2024-02-20 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10204072B2 (en) | Method for automatically allocating addresses to similar bus users | |
| EP1569419B1 (en) | Method of assigning addresses to a plurality of devices on a network and a network system therefor | |
| JP3860175B2 (en) | Efficient IP address assignment and duplicate detection method in ad hoc network environment | |
| EP1942618B1 (en) | Distributed determination of dynamic frame sizes in a network | |
| US8737366B2 (en) | Method, network nodes and system for broadcast transmission of data | |
| WO2001041379A1 (en) | Method and communication system in wireless ad hoc networks | |
| EP3780559A1 (en) | Address competition method of multi-connected type control system | |
| JPH06125347A (en) | Exchange method of message | |
| CN114422480B (en) | Automatic communication address allocation method | |
| EP1309138B1 (en) | Primary station for use in a multiple access telecommunication network | |
| CN113114793A (en) | Slave node address competition method and device and electrical appliance system | |
| CN112929249A (en) | RS-485 bus multi-machine communication address automatic allocation method, device and system | |
| CN115442333A (en) | Self-networking method and device based on RS485 communication, computer equipment and medium | |
| CN114423066B (en) | Networking control method and device for data communication | |
| CN111371659B (en) | Method for automatically allocating RS485 slave equipment address | |
| CN111918382B (en) | Wireless synchronous group control method and device | |
| CN112929465A (en) | Bus address allocation method and bus system | |
| US20100303055A1 (en) | Method for Assigning Data Messages to Time Slots in a Wireless Data Bus System Having Hidden Subscribers | |
| GB2415855A (en) | Variable network address lengths | |
| CN102420731A (en) | Network access control method and system | |
| CN113115282A (en) | Internet of things communication method and Internet of things communication system | |
| WO2023125579A1 (en) | Wireless resource scheduling method and apparatus, and storage medium | |
| CN115550908B (en) | 2.4G network communication system and method based on TDMA | |
| CN114448799B (en) | Remote upgrading method, device, main control board, household electrical appliance and storage medium | |
| CN113411158B (en) | Processing method and system for preempting time slot resources at two ends of link |
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 |