CN110986703B - Electronic detonator network anti-collision method - Google Patents
Electronic detonator network anti-collision method Download PDFInfo
- Publication number
- CN110986703B CN110986703B CN201911088808.9A CN201911088808A CN110986703B CN 110986703 B CN110986703 B CN 110986703B CN 201911088808 A CN201911088808 A CN 201911088808A CN 110986703 B CN110986703 B CN 110986703B
- Authority
- CN
- China
- Prior art keywords
- slave
- len
- bit
- window
- confirmed
- 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
Images
Classifications
-
- F—MECHANICAL ENGINEERING; LIGHTING; HEATING; WEAPONS; BLASTING
- F42—AMMUNITION; BLASTING
- F42C—AMMUNITION FUZES; ARMING OR SAFETY MEANS THEREFOR
- F42C19/00—Details of fuzes
- F42C19/08—Primers; Detonators
- F42C19/12—Primers; Detonators electric
Landscapes
- Engineering & Computer Science (AREA)
- General Engineering & Computer Science (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses an anti-collision method of an electronic detonator network, which comprises the following steps that 1, a host computer sends an unlocking command A; step 2, the host reads the unique mark code UID of the slave machine in a broadcasting mode, if the reading is successful, the step 3 is carried out, and if the slave machine does not respond, the step 4 is carried out; if the frame check error occurs, executing step 5; step 3, establishing point-to-point communication with the slave through the UID, setting a slave communication address, locking the slave B, and not responding to the UID reading command of the host any more; step 4, reading the UID continuously for many times, and if the slave computer still does not answer the host computer command, ending the anti-collision process; step 5, entering an anti-collision process; step 6, reading a slave response signal, if the bus is abnormal, failing to prevent collision, and quitting; if there is a response signal, the search bit is 1, if the read signal is overtime, the search bit is 0; and 7, if the verified bit number is an integral multiple of 8, skipping to the step 2, otherwise skipping to the step 5. The invention uses the mechanism of the window to be confirmed and the confirmed window to realize the identification of the recessive code and improve the stability.
Description
Technical Field
The invention relates to the field of electronic detonators, in particular to an anti-collision method for an electronic detonator network.
Background
When the electronic detonators are arranged in a network 400, the communication quality of the network is poor when the communication distance is 1000m, and the communication speed needs to be reduced to ensure stable communication. If a complete command frame is used to poll each of the electronic detonators, the currently designed communication rates require more than 30 seconds (experimentally measured, read state 11/sec-13/sec). In the final detonation stage, whether the module has the detonation capability and the online state needs to be quickly detected, and the required time cannot exceed 10 seconds. Although the rapid detection can be solved by increasing the communication speed, the power consumption of the whole network is increased, and the stability of the network and the detonation capability of the electronic detonator are influenced.
Disclosure of Invention
In view of the above-mentioned drawbacks of the prior art, it is an object of the present invention to provide an electronic detonator network anti-collision method that solves at least one of the drawbacks of the prior art.
To achieve the above and other related objects, the present invention provides an anti-collision method for an electronic detonator network, the method comprising:
step 1, the host sends an unlocking command A;
step 2, the host reads the unique mark code UID of the slave machine in a broadcasting mode, if the reading is successful, the step 3 is carried out, and if the slave machine does not respond, the step 4 is carried out; if the error occurs, executing step 5;
step 3, establishing point-to-point communication with the slave machine through the unique mark code UID, setting a slave machine communication address, locking B the slave machine, and no longer responding to the UID reading command of the host machine;
step 4, continuously reading the unique mark code UID for multiple times, and ending the anti-collision process if the slave machine still does not respond to the host machine command;
step 5, taking the unique mark code UID of the slave machine as a bit stream, and comparing the bit stream by bit each time; sending the confirmed data length Len, the value Step of the current window 2bits to be confirmed and the data of the confirmed window by a broadcast command;
if Len is equal to 0, Step is equal to 1, which means that the slave judges the sliding window bit0, and locking confirmation is not performed; if Len is greater than 0, the host does not receive the response of the slave computer during the last comparison, Step is 2, the window bit to be confirmed is judged 1, and the data identified last time is 0; if Len is greater than 0, the host receives the response of the slave in the last time of alignment, Step is 3, the window bit to be confirmed is judged 1, and the data identified last time is 1;
step 6, reading a slave response signal, if the bus is abnormal, failing to prevent collision, and quitting; the search bit is 1 if there is a response signal, and 0 if the read signal times out.
And 7, if the verified bit number is an integral multiple of 8, skipping to the step 2, otherwise skipping to the step 5.
Optionally, if Len >2 and Len-2 is less than or equal to the confirmed window length, starting comparison from the lower position of the window, wherein the initial comparison bit index of the unique mark code UID is 0, and ending the index Len-2;
if Len >2 and Len-2 is greater than the verified window length, then the comparison is started from the high order bits of the window, with the start comparison bit indexed Len-2, the end index Len-2-n, and n being the verified window width.
Optionally, the overlapping part of the confirmed window and the unique mark code UID bit stream of the slave is subjected to exclusive OR, and if the result is greater than 1, the comparison is considered to fail, and the slave is locked by the A.
Optionally, according to the value of Len, finding a slave to-be-confirmed bit and performing exclusive or on the Step value to obtain C;
if Len is 0, the first bit of the unique mark code UID is 1, then the host is responded;
when Len >0, if C &0x01 is greater than 0, the slave locks on itself A; if C &0x03 is equal to 0x02, the slave does not return an acknowledgement signal; if C &0x03 equals 0, the slave returns a master reply.
To achieve the above and other related objects, the present invention provides a storage medium storing a computer program which, when executed by a processor, performs the method.
To achieve the above and other related objects, the present invention provides an electronic terminal, comprising: a processor and a memory;
the memory is used for storing computer programs, and the processor is used for executing the computer programs stored by the memory so as to enable the terminal to execute the method.
As described above, the anti-collision method for the electronic detonator network of the present invention has the following beneficial effects:
equipment on the network can be searched blindly, and a unique identification code UID of the slave is obtained after the searching is finished;
a window confirmation mechanism is arranged, so that the robustness of the comparison process is enhanced;
and a mechanism of a window to be confirmed and a confirmed window is used, the recessive code is identified by one-time comparison, and the stability is improved.
Drawings
Fig. 1 is a flowchart of an anti-collision method for an electronic detonator network according to an embodiment of the present invention.
Detailed Description
The embodiments of the present invention are described below with reference to specific embodiments, and other advantages and effects of the present invention will be easily understood by those skilled in the art from the disclosure of the present specification. The invention is capable of other and different embodiments and of being practiced or of being carried out in various ways, and its several details are capable of modification in various respects, all without departing from the spirit and scope of the present invention. It should be noted that the features in the following embodiments and examples may be combined with each other without conflict.
It should be noted that the drawings provided in the following embodiments are only for illustrating the basic idea of the present invention, and the components related to the present invention are only shown in the drawings rather than drawn according to the number, shape and size of the components in actual implementation, and the type, quantity and proportion of the components in actual implementation may be changed freely, and the layout of the components may be more complicated.
The embodiment provides an anti-collision method for an electronic detonator network, wherein an electronic detonator is set as a slave machine and is controlled by a host machine, the host machine and the slave machine are communicated through a bus, the slave machine returns data to the host machine in a synchronous communication mode, the host machine sends a pulse, and the slave machine can respond to a signal.
The physical characteristics of the bus are only two states, but communication requires 3 states and 0, 1, idle. In this embodiment, the combination of 0 and idle results in 0 being a type of recessive. When the slave responds to 0, the master does not know whether the slave responds or does not respond. When the slave station is not 1, the master station can receive the signal as long as one slave station responds. However, there is a special case: if all the slaves are zero, no signal is sent on the bus, but if the slaves are 1, the slaves have abnormity and do not respond, the master also considers to be 0, and at this moment, an error occurs, so that secondary confirmation is needed. As only one slave answers 1, the master receives the signal, but one slave is 0, and the slaves on the network do not know that other slaves answer. This is also a feature of the present communication, and the slaves are unaware that there are other slaves having reply signals. The host will query the next bit upon receiving 1. A slave that is 0 requires the master to tell the slave the value of the last bit, either 0 or 1. If the acknowledgement from the master on the slave does not match, it is terminated.
The master has two locks, a and B, for reading the unique identification code UID of the slave. Both locks a and B are open by default. The master machine has the capability of locking the A lock and the B lock, and the slave machine has the capability of locking the A lock and self-locking. The following description is in terms of bit streams, and 4 bytes is 32 bit streams. When the computer stores, the bit stream is continuous, and high order bits and low order bits exist.
The anti-collision algorithm is to search according to bits, and the command sent by the host computer every time asks bit1 to pass through a sliding confirmed window when the host computer is not on the bus, so that the function of searching according to bits is realized. The window is divided into two parts, 2bits to be confirmed + nbit has been confirmed.
2bits to be confirmed + nbit has been confirmed. The value of n is defined in advance by the slave. The reason for the window to be confirmed is that the slave has an explicit or implicit part of the anti-code communication. The slave of the data of the window to be confirmed needs to perform secondary confirmation, wherein bit0 is the bit value confirmed by the host last time, bit1 is the current bit value inquired by the host, and the bit sequence which is recognized by the host when the window is confirmed.
The method comprises the following specific steps:
step 1, the master machine sends an unlocking command, and the slave machine has the capability of broadcasting and reading the unique identification code UID.
And 2, reading the unique identification code UID by the host in a broadcasting mode, judging the error of the returned command frame if the frame format of the data returned by the slave has the verification capability, and if no error exists, successfully reading the unique identification code UID and entering the step 3. If the slave does not respond, the process proceeds to step 4. If an error occurs, it indicates that the bus has a collision and step 5 is entered.
And 3, establishing point-to-point communication with the slave machine through the unique identification code UID, setting a slave machine communication address, locking the slave machine B, and not responding to a command of reading the unique identification code UID of the host machine. And skipping to execute the step 1.
And 4, continuously reading the unique identification code UID for many times, and finishing the anti-collision process if the slave machine still does not respond to the host command.
And (3) when an error occurs in the process of reading the unique mark code UID of the slave machine by the host machine, executing the steps 5-7, wherein the steps 5-7 specifically comprise:
step 5, sending the confirmed data length Len, the value Step of the current window 2bits to be confirmed and the data of the confirmed window by a broadcast command;
if Len is 0, Step is 1, which means that the slave determines the sliding window bit0 and no shackle confirmation is made; if Len is greater than 0, the host does not receive the response of the slave during the last comparison, Step is 2, which means that the window bit to be confirmed is judged 1, and the data identified last time is 0; if Len is greater than 0, the master receives the response of the slave in the last comparison, Step is 3, which means that the window bit to be confirmed is judged 1, and the data identified last time is 1;
step 6, reading a slave response signal, if the bus is abnormal, failing to prevent collision, and quitting; the search bit is 1 if there is a response signal, and 0 if the read signal times out.
And 7, if the verified bit number is 8 and is equal to 0, jumping to the step 2, otherwise, jumping to the step 5.
In step 5, if Len >2 and Len-2 is less than or equal to the confirmed window length, comparing from the lower position of the window, the initial comparison bit index of the unique mark code UID is 0, and ending the index Len-2;
if Len >2 and Len-2 is greater than the verified window length, then the comparison is started from the high order of the window, with the start comparison bit indexed Len-2, the end index Len-2-n, and n the verified window width.
And carrying out XOR on the overlapped part of the confirmed window and the unique slave identification code UID bit stream, and considering that the comparison fails when the result is more than 1, and locking the slave A.
And finding the slave to-be-confirmed bit and performing XOR on the Step value according to the Len value to obtain C. And if Len is 0 and the first bit of the UID is 1, answering the host. When Len >0, if C &0x01 is greater than 0, the slave itself is a-locked. If C &0x03 is equal to 0x02, the slave does not return an acknowledgement signal; if C &0x03 equals 0, the slave returns a master reply.
After the flow is finished, all the slave machines are locked by the slave machine B, and finally the slave machine B is unlocked, so that point-to-point normal communication can be carried out with the slave machines, and the unique identification codes UIDs of all the slave machines are obtained.
Specifically, it may be assumed that the UIDs of the two slaves are 0x05(00000101B),0x07(00000111B)
When Len is 0, Step is 1, UID bit0 is a response of 1, and both slaves respond.
When Len is 1, Step is 3(11B), bit1 is 1, and bit0 is 1. bit0 indicates that the last time the master received a 1 reply, there was a slave reply signal. Bit1 of UID 0x05 is 0, and no response is made. Bit1 of UID 0x07 is 1 response.
When Len is 2, Step is 3 (11B). UID 0x05 gets the comparison bit1 of the last UID 0 according to Len-1 when bit0 of Step is 1. If the description at Step does not conform, the lock A is installed. UID of 0x07 matches itself, and then the next round of search is performed.
It will be apparent to those skilled in the art that, for convenience and brevity of description, only the above-mentioned division of the functional units and modules is illustrated, and in practical applications, the above-mentioned function distribution may be performed by different functional units and modules according to needs, that is, the internal structure of the apparatus is divided into different functional units or modules to perform all or part of the above-mentioned functions. Each functional unit and module in the embodiments may be integrated in one processing unit, or each unit may exist alone physically, or two or more units are integrated in one unit, and the integrated unit may be implemented in a form of hardware, or in a form of software functional unit. In addition, specific names of the functional units and modules are only for convenience of distinguishing from each other, and are not used for limiting the protection scope of the present application. The specific working processes of the units and modules in the system may refer to the corresponding processes in the foregoing method embodiments, and are not described herein again.
In the above embodiments, the descriptions of the respective embodiments have respective emphasis, and reference may be made to the related descriptions of other embodiments for parts that are not described or illustrated in a certain embodiment.
Those of ordinary skill in the art will appreciate that the various illustrative elements and algorithm steps described in connection with the embodiments disclosed herein may be implemented as electronic hardware or combinations of computer software and electronic hardware. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the implementation. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present invention.
In the embodiments provided in the present invention, it should be understood that the disclosed apparatus/terminal device and method may be implemented in other ways. For example, the above-described embodiments of the apparatus/terminal device are merely illustrative, and for example, the division of the modules or units is only one logical division, and there may be other divisions when actually implemented, for example, a plurality of units or components may be combined or integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection through some interfaces, devices or units, and may be in an electrical, mechanical or other form.
The units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of the embodiment.
In addition, functional units in the embodiments of the present invention may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit. The integrated unit can be realized in a form of hardware, and can also be realized in a form of a software functional unit.
The integrated modules/units, if implemented in the form of software functional units and sold or used as separate products, may be stored in a computer readable storage medium. Based on such understanding, all or part of the flow of the method according to the embodiments of the present invention may also be implemented by a computer program, which may be stored in a computer-readable storage medium, and when the computer program is executed by a processor, the steps of the method embodiments may be implemented. Wherein the computer program comprises computer program code, which may be in the form of source code, object code, an executable file or some intermediate form, etc. The computer readable medium may comprise any entity or device capable of carrying the computer program code, a recording medium, a U disk, a removable hard disk, a magnetic disk, an optical disk, a computer Memory, a Read-Only Memory (ROM), a Random Access Memory (RAM), an electrical carrier signal, a telecommunications signal, a software distribution medium, etc.
The foregoing embodiments are merely illustrative of the principles and utilities of the present invention and are not intended to limit the invention. Any person skilled in the art can modify or change the above-mentioned embodiments without departing from the spirit and scope of the present invention. Accordingly, it is intended that all equivalent modifications or changes which may be made by those skilled in the art without departing from the spirit and scope of the present invention as defined in the appended claims.
Claims (6)
1. An electronic detonator network anti-collision method, characterized in that the method comprises:
step 1, the host sends an unlocking command A;
step 2, the host reads the unique mark code UID of the slave machine in a broadcasting mode, if the reading is successful, the step 3 is carried out, and if the slave machine does not respond, the step 4 is carried out; if the frame check error occurs, executing step 5;
step 3, establishing point-to-point communication with the slave machine through the unique mark code UID, setting a slave machine communication address, locking the slave machine B, and no longer responding to the UID reading command of the host machine;
step 4, continuously reading the unique mark code UID for multiple times, and ending the anti-collision process if the slave machine still does not respond to the host machine command;
step 5, taking the unique mark code UID of the slave machine as a bit stream, and comparing the bit stream by bit each time; sending the confirmed data length Len, the value Step of 2bits of the current window to be confirmed and the data of the confirmed window through a broadcast command;
if Len is equal to 0, Step is equal to 1, which means that the slave judges the sliding window bit0, and locking confirmation is not performed; if Len is greater than 0, the host does not receive a slave response signal during the last comparison, Step is 2, the window bit to be confirmed is judged 1, and the data identified last time is 0; if Len is greater than 0, the master receives a slave response signal in the last time of alignment, Step is 3, which means that the window bit to be confirmed is judged 1, and the last identified data is 1;
step 6, reading a slave response signal, if the bus is abnormal, failing to prevent collision, and quitting; if the answer signal exists, the search bit is 1, and if the reading signal is overtime, the search bit is 0;
and 7, if the verified bit number is an integral multiple of 8, skipping to the step 2, otherwise skipping to the step 5.
2. The electronic detonator network anti-collision method according to claim 1,
if Len is greater than 2 and Len-2 is less than or equal to the confirmed window length, starting comparison from the lower position of the window, wherein the initial comparison bit index of the unique mark code UID is 0, and ending the index Len-2;
if Len >2 and Len-2 is greater than the verified window length, then the comparison is started from the high order of the window, with the start comparison bit index being Len-2, the end index being Len-2-n, and n being the verified window length.
3. The electronic detonator network anti-collision method as claimed in claim 2, wherein the overlapping part of the confirmed window and the unique mark code UID bit stream of the slave is subjected to XOR, and if the comparison is considered to fail in case that the result is more than 1, the slave is locked by A.
4. The electronic detonator network anti-collision method according to claim 3,
according to the value of Len, finding a slave machine to-be-confirmed bit and carrying out XOR on the slave machine to-be-confirmed bit and the Step value to obtain C;
if Len is 0, the first bit of the unique mark code UID is 1, then the host is responded;
when Len >0, if C &0x01 is greater than 0, the slave locks on itself A; if C &0x03 is equal to 0x02, the slave does not return an acknowledgement signal; if C &0x03 equals 0, the slave returns a master reply.
5. A storage medium storing a computer program, characterized in that the computer program, when executed by a processor, performs the method according to any one of claims 1 to 4.
6. An electronic terminal, comprising: a processor and a memory;
the memory is for storing a computer program and the processor is for executing the computer program stored by the memory to cause the terminal to perform the method of any of claims 1 to 4.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911088808.9A CN110986703B (en) | 2019-11-08 | 2019-11-08 | Electronic detonator network anti-collision method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911088808.9A CN110986703B (en) | 2019-11-08 | 2019-11-08 | Electronic detonator network anti-collision method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110986703A CN110986703A (en) | 2020-04-10 |
| CN110986703B true CN110986703B (en) | 2022-06-17 |
Family
ID=70083600
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201911088808.9A Active CN110986703B (en) | 2019-11-08 | 2019-11-08 | Electronic detonator network anti-collision method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110986703B (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112696995B (en) * | 2020-12-04 | 2021-09-28 | 上海微符尔半导体有限公司 | Electronic detonator network quick addressing method and device and electronic detonator system |
| CN112735501B (en) * | 2020-12-24 | 2024-05-03 | 珠海格力电器股份有限公司 | Data interaction method and device, main board and equipment with main board |
| CN115164658B (en) * | 2022-07-08 | 2023-09-19 | 融硅思创(北京)科技有限公司 | Automatic digital electronic detonator online system and communication method |
Family Cites Families (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| PE20061227A1 (en) * | 2005-01-24 | 2006-12-19 | Orica Explosives Tech Pty Ltd | ASSEMBLIES OF WIRELESS DETONATORS AND CORRESPONDING NETWORKS |
| CN106354694B (en) * | 2016-09-09 | 2019-02-05 | 广东顺德中山大学卡内基梅隆大学国际联合研究院 | A kind of conflict position anti-collision method based on Type A |
| CN109857004A (en) * | 2017-11-29 | 2019-06-07 | 北京煋邦数码科技有限公司 | A kind of digital electric detonator register method and its initiation system |
| CN109764779B (en) * | 2019-02-06 | 2021-11-23 | 华夏世昌(北京)科技有限公司 | Digital electronic detonator detonation system and method based on double-wire bus |
| CN109696097B (en) * | 2019-02-16 | 2022-01-07 | 华夏世昌(北京)科技有限公司 | Digital electronic detonator chip based on double-wire bus and control method |
-
2019
- 2019-11-08 CN CN201911088808.9A patent/CN110986703B/en active Active
Also Published As
| Publication number | Publication date |
|---|---|
| CN110986703A (en) | 2020-04-10 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110986703B (en) | Electronic detonator network anti-collision method | |
| JP5247124B2 (en) | Authentication device, in-vehicle device, and authentication system | |
| DE102006013504B4 (en) | A technique for programming a secret key for a transponder using encryption | |
| US6747546B1 (en) | Data communication transponder and communications system employing it | |
| US8028910B2 (en) | Tag anti-collision RFID system and method for tag identification | |
| CN108229230B (en) | Method for providing identification and access with respect to radio frequency tags | |
| Lai et al. | Two blocking algorithms on adaptive binary splitting: single and pair resolutions for RFID tag identification | |
| EP3806384A1 (en) | Vehicle unlocking authentication method and apparatus based on terminal device | |
| CN101739539A (en) | Method for resisting car reading conflict by automatic frequency hopping | |
| US5773803A (en) | Code discriminating system for determining correspondence of codes in a short time | |
| CN107895131B (en) | RFID label checking method in accordance with ISO15693 protocol | |
| CN108733674A (en) | A2L file merging method and device | |
| CN112000019B (en) | Method, device and equipment for sharing equipment instruction control | |
| US9495570B2 (en) | Method for authenticating an RFID tag | |
| CN107933499B (en) | PEPS system-based key ID verification method and related device | |
| CN104853356A (en) | NFC (Near Field Communication) system intelligent recognition method | |
| CN110545115B (en) | Method for reducing same frequency interference of vehicle and vehicle-mounted keyless starting equipment | |
| CN114519025A (en) | Method and system for automatically analyzing CAN bus data of intelligent network-connected automobile | |
| CN107380122B (en) | Method and device for unlocking vehicle | |
| US20170344738A1 (en) | Electronic device and unlocking method thereof | |
| CN107369022B (en) | Legal chip identification method and system | |
| CN113412487A (en) | Communication system and communication method of communication system | |
| CN113103989B (en) | Authentication information sending method, vehicle unlocking method, electronic device and storage medium | |
| EP3576003B1 (en) | Legal chip identification method and system | |
| CN115938022B (en) | Vehicle entity key safety authentication method and system |
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 |