CN1901276B - Method for producing scan mark and method for scanning antenna device - Google Patents
Method for producing scan mark and method for scanning antenna device Download PDFInfo
- Publication number
- CN1901276B CN1901276B CN2006100984650A CN200610098465A CN1901276B CN 1901276 B CN1901276 B CN 1901276B CN 2006100984650 A CN2006100984650 A CN 2006100984650A CN 200610098465 A CN200610098465 A CN 200610098465A CN 1901276 B CN1901276 B CN 1901276B
- Authority
- CN
- China
- Prior art keywords
- uid
- bit
- masks
- value
- length
- 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
Landscapes
- Mobile Radio Communication Systems (AREA)
Abstract
This invention discloses a method for generating scanning identifications including: generating UID and bit masks based on node values to get modulo-Pi and value-Qi of the integral part after i is divided by the largest byte length and take a same value of the value of bit Qi in byte Pi of the converted UID and the value of bit i in the generaged UID, setting the value of bit Qi in byte Pi of the converted bit mask 1 and i is smaller than all natural numbers of the generated UID effective bit length and taking values of other bits in the converted UID and bit masks zero to take the converted UID and bit masks as scanning identifications. This invention also discloses a method for scanning antenna devices.
Description
Technical field
The present invention relates to a kind of scanning technique, particularly produce the method for scanning sign and antenna equipment is carried out method for scanning.
Background technology
Stipulate that any one antenna equipment (ALD, Antenna line device) all needs a globally unique unique identification (UID, Unique ID) in Antenna Interface Standards Group (AISG, the Antenna Interface Standards Group) agreement.UID need obtain by scanning, scanning process is briefly described as follows: to be the antenna controller message that will have bit-masks (BIT MASK) and a UID be handed down to all slave station ALD on the bus with broadcast mode in main website, after ALD receives this message, if with self UID and BIT MASK do with computing after the value that obtains with receive that the UID in the message is consistent, then have the scanning response of self UID to the main website loopback.During two or more equipment loopback simultaneously success response, main website can receive all correct responses sometimes, receives wrong data sometimes, if wrong data are received by main website, then can think conflict to occur, and continue scanning.UID comprises significance bit and invalid bit usually, and the value of described significance bit can be 1, also can be 0, and the value of described invalid bit is 0.Such as: UID=00000101 and UID significance bit length are 4; UID=00000001, UID significance bit length are 2 etc.The maximum length of agreement regulation UID is totally 152 of 19 bytes at present, and in the practical application, if agreement allows, the maximum length of UID also can be other number.Described herein UID maximum length or UID maximum byte length are determined according to agreement, such as being 19 bytes etc.
How to guarantee to generate scanning message completely, be unlikely to simultaneously to consume very long sweep time, depend on the scanning algorithm of employing, the AISG agreement recommends to adopt binary tree algorithm.
Process when adopting binary tree algorithm that antenna equipment is scanned as shown in Figure 1, this process comprises following steps:
Step 101: main website traverses the node of binary tree.
In the step 101, main website can adopt the first root traversal method of binary tree to traverse a node.
Described binary tree can mark each nodal value among Figure 1A shown in Figure 1A.The nodal value of described binary tree generates in advance, such as: the left sibling 11a of layer one, the value of right node 11b are respectively 00000001 and 00000000; Layer four nodes its value from left to right of two is respectively binary: node 12aa is 00000011, node 12ab is 00000001, node 12ba is 00000010, node 12bb is 00000000; Or the like.
In the practical application, 0 and 1 value of the effective bit of each nodal value of certain one deck of binary tree can negate, and also want negate with 0 and 1 value of all brotghers of node of one deck and all child nodes below this layer this moment.Such as two nodes of layer one from left to right its value be respectively 00000000 and 00000001, then four nodes of layer two from left to right its value be respectively binary zero 0000000,00000010,00000001,00000011, or the like.The effective bit of described nodal value is according to the decision of the number of plies of described node, specifically, if the number of plies of node is the n layer, then in the nodal value the 0th be effective bit to the n-1 position.Effective bit such as one or two node of layer is the 0th, and the effective bit of 2 two node of layer is the 0th, the 1st etc.
Step 102: generate UID and bit-masks according to the nodal value that traverses, and with the UID that generates and bit-masks as the scanning sign.
The method of described generation UID is: the UID that makes generation is with to traverse nodal value identical.Such as certain node that traverses binary tree layer one, its nodal value is 00000001 o'clock, and the UID of generation is 00000001.
The method of described generation bit-masks is: make the bit-masks length of generation identical with the UID length of generation, the bit-masks median of generation is lower than the value of the position that traverses node level and all gets 1, and the value of all the other all gets 0.Such as: when traversing binary tree layer one node, the bit-masks length that generates is all 1 byte mutually with the UID length of generation, wherein, because the natural number less than the number of plies 1 has only 0, therefore the 0th place value gets 1 in the bit-masks that generates, all get 0 to the 7th place value for the 1st, promptly the bit-masks of Sheng Chenging is 00000001; Bit-masks length corresponding to two or four node of binary tree layer is 1 byte, wherein, owing to have two less than the natural number of the number of plies 2, be 0 and 1, therefore the 0th, the 1st place value all get 1, the 2 and all get 0 to the 7th place value in the bit-masks that generates, and promptly the bit-masks of Sheng Chenging is 00000011; Or the like.
In the step 102, the bit-masks of the UID that generates and generation during as the scanning sign, is also comprised effective byte length, the byte length of the UID that described effective byte length equals to generate and the bit-masks of generation in the scanning sign.Such as: the bit-masks of generation be 00000011, the UID that generates is 00000010, the effective byte length that comprises in the then scanning sign is 1 byte.
The effective byte length that comprises in the scanning sign is used to notify ALD the required UID byte length that reads.Such as: effective byte length is 2 in the scanning sign, then ALD minimum two bytes that will read-onlyly take from body UID come with the scanning sign in bit-masks carry out and calculate, and UID compares in identifying with scanning.
Step 103: the scanning information broadcast that main website will comprise scanning sign sends to all ALD on the bus, and detects the response of ALD, if testing result is for conflict occurring, then execution in step 104, if testing result is conflicted for occurring, then execution in step 105.
Except the scanning sign, also comprise other content in the described scanning message of step 103, described other content can generate referring to agreement, is not described in detail in this.
Described occur conflict can for: testing result for one or more correct responses not occurring conflicting and receiving, also can for testing result for not receiving any response.
Receive one or more correct responses if testing result is a main website, show that then present node is that the current scanning that traverses node is finished, can preserve scanning result this moment and further handle behind the end of scan being used for.
Step 104: all following branches of present node in the intercepting binary tree.
Step 105: judge whether to travel through complete binary tree, if then finish this handling process, otherwise return step 101.
In the step 103 shown in Figure 1, receive one or more correct responses if the detected response condition of main website is a main website, perhaps testing result is not for receiving any response, and then execution in step 104 intercepts all following branches of present node in the binary tree.At this moment, when after step 105, returning step 101, to not travel through each branch of this node subordinate, promptly, if utilize first root traversal method to travel through in the step 101 this moment, then the next one traverses node and is: if present node has the right brotgher of node, then the next one traverses node and is its right brotgher of node; If present node does not have the right brotgher of node, the then next right brotgher of node that traverses node for its father node, if its father node does not still have the right brotgher of node, the then next right brotgher of node that traverses node for the father node of its father node, so circulation.If whole tree has traveled through, promptly traversal finishes, and then after the step 105, finishes the scanning flow process.
In the step 103 shown in Figure 1, conflict appears if the testing result of main website is antenna equipment response, direct execution in step 105 then, and when after step 105, returning step 101, by circulation execution in step 101～step 105, can all child nodes of present node be traveled through.Such as: there are two child nodes in present node: left child node X, right child node X ' when utilizing first root traversal method to travel through in the step 101, can traverse nodes X earlier, and after circulation execution in step 101～step 105, can traverse nodes X again '.Here, if conflict still occurs after traversing nodes X, then can further scan all child nodes of nodes X.
The process that among Fig. 1 antenna equipment is scanned can be represented with the scanning tree that scans flow process that comprises shown in Figure 2.Express corresponding scanning sign on each scanning node of scanning tree shown in Figure 2, such as: the scanning of scanning tree middle level one left sibling 21a is designated BIT MASK=0...01, UID=00000001, effective byte length (Length)=1 byte; The scanning of layer two node 22aa is designated BITMASK=0...011, UID=00000011, effective byte length (Length)=1 byte, or the like.
In conjunction with Fig. 1, Figure 1A and Fig. 2, can be illustrated scanning process of the prior art.When scanning according to first root traversal method:
In the step 101, main website traverses the node of binary tree, as the layer one left sibling 11a among Figure 1A.
In the step 102, according to the UID and the bit-masks that traverse the nodal value generation be: UID=00000001, BIT MASK=0...01, and it is direct as the scanning sign UID that generates and bit-masks, at this moment, comprise that also effective byte length (Length) is 1 information in the scanning sign, as shown in scanning node 21a in Fig. 2.
In the step 103, after the scanning information broadcast that will comprise among Fig. 2 scanning sign shown in the scanning node 21a sends to all ALD on the bus, if testing result is not for conflict occurring, then execution in step 104 intercepts all following branches of node 11a in the binary tree, at this moment, when returning step 101 after the execution in step 105 again, the node that traverses is the one right node 11b of layer shown in Figure 1A, and the scanning sign that produces by step 102 as scan among Fig. 2 as shown in the node 21b, for: UID=00000000, BITMASK=00000001, effective byte length (Length)=1.And then in the step 103, after the scanning information broadcast that will comprise the sign of scanning shown in the node 21b shown in Figure 2 sends to all ALD on the bus, if testing result is conflicted the end of scan then for occurring.
In other words: when scanning according to first root traversal method, if conflict never occurs, then scanning sign can finish scanning successively afterwards shown in scanning node 21a, 21b among Fig. 2.
In the step 103, after the scanning information broadcast that will comprise among Fig. 2 the sign of scanning shown in the node 21a sends to all ALD on the bus, if testing result is for conflict occurring, when then directly execution in step 105 is returned step 101 afterwards, the node that traverses is the two node 12aa of layer shown in Figure 1A, and the scanning sign that produces by step 102 as scan among Fig. 2 as shown in the node 22aa, for: UID=00000011, BITMASK=00000011, effective byte length (Length)=1.And then in the step 103, after the scanning information broadcast that will comprise among Fig. 2 the sign of scanning shown in the node 22aa sends to all ALD on the bus, if testing result is not for conflict occurring, then execution in step 104 intercepts all following branches of the 12aa of node shown in Figure 1A, at this moment, when returning step 101 after the execution in step 105 again, the node that traverses is the two node 12ab of layer shown in Figure 1A, and the scanning of passing through step 102 generation identifies as shown in scanning node 22ab among Fig. 2, for: UID=00000001, BIT MASK=00000011, effective byte length (Length)=1, here, conflict do not occur after the scanning node 22ab, then next step takes turns to scanning node 21b; After the scanning information broadcast that will comprise among Fig. 2 the sign of scanning shown in the node 22aa sends to all ALD on the bus, if testing result is for conflict occurring, when returning step 101 after the then direct execution in step 105, the node that traverses is the three right node 13aaa of layer shown in Figure 1A, and the scanning sign that produces by step 102 as scan among Fig. 2 as shown in the node 23aaa, for: UID=00000111, BITMASK=00000111, effective byte length (Length)=1.
In other words: when scanning according to first root traversal method, if once conflict only occurs, then scanning sign can finish scanning successively afterwards shown in the scanning node 21a among Fig. 2,22aa, 21b; If consecutive collision, then scanning sign successively can as the scanning node 21a among Fig. 2,22aa, 23aaa...., shown in.
For the situation that consecutive collision occurs, can be referring to scanning tree shown in Figure 2, its scanning situation specifically can be as shown in Table 1:
| Scanning sequency | Length | UID | Bit-masks | Explanation |
| The |
1 | 00000001 | 00000001 | Scanning node 21a.Whether scanning UID the 0th place value is 1 |
| |
1 | 00000011 | 00000011 | Scanning node 22aa.Whether because UID the 0th place value is appearance conflict in 1 o'clock in the first step, therefore further scanning UID the 1st place value in second step is 1 |
| The |
1 | 00000111 | 00000111 | Scanning node 23aaa.Because UID the 1st place value is that conflict appears in continuation in 1 o'clock in second step, therefore whether further scanning UID the 2nd place value is 1 in the 3rd step |
| ... | ... | ... | ... | ... |
Table one
In the prior art, the scanning process of a UID be may be summarized to be:
The first step: the 0th of scanning UID.Here, described the 0th place value can be 1, also can be 0, whether be 1, if conflict then carried out for second step if generally can scan UID the 0th place value earlier, whether if conflict occurs or carry out after second step when conflict not occurring, then can scan UID the 0th place value is 0.UID the 0th place value with scanning in the table one is that appearance conflict in 1 o'clock is that example is illustrated.
Second step:, therefore further scan the 1st of UID in second step because UID the 0th place value is appearance conflict in 1 o'clock in the first step.Here, described the 1st place value can be 1, also can be 0, whether be 1, if continue conflict to occur, then carried out for the 3rd step if generally can scan UID the 1st place value earlier, whether if conflict occurs or carry out after the 3rd step when conflict not occurring, then can scan UID the 1st place value is 0.UID the 1st place value with scanning in the table one is that continuation appearance conflict in 1 o'clock is that example is illustrated.
The 3rd step: owing to UID the 1st place value in second step is continuation appearance conflict in 1 o'clock, so further the 2nd of the UID that scan in the 3rd step.Here, described the 2nd place value can be 1, also can be 0, whether generally can scan UID the 2nd place value earlier is 1, if continue to occur conflict, then continue the scanning next bit, if after conflict occurring or continuing the scanning next bit when conflict not occurring, whether then can scan UID the 2nd place value is 0.Whether be 1 to be that example is illustrated with scanning UID the 2nd place value in the table one.
As can be seen, when in the prior art ALD being scanned, if currently occur conflict during to the i position scanning the 0th of UID, then next step the 0th of scanning UID is to the i+1 position, promptly further scan the i+1 position of UID, therefore scan method of the prior art can be called the scan method that step-by-step increases progressively, and i is a natural number, and generally i is smaller or equal to the dominant bit length of UID, such as 0≤i≤151 etc.
The shortcoming of prior art is:
Nodal value according to binary tree in the prior art generates UID and bit-masks, and directly UID and the bit-masks that generates identified as scanning, when scanning according to scanning sign of the prior art, adopt the mode of scanning by turn to scan to ALD, if it is identical to run into some or a plurality of bytes of two UID, conflict many times will appear.Such as: preceding 10 bytes of two UID are identical, 10 * 8=80 time conflict then may occur.Under the more situation of the UID identical characters of two ALD below a port occurring, sweep speed is very slow, such as: the UID of two ALD preceding 80 identical, then main website may need to issue the UID that 81 scanning message just can be obtained an ALD.
Summary of the invention
In view of this, main purpose of the present invention is to provide a kind of method that produces the scanning sign, can produce the scanning sign of striding byte.
Another object of the present invention is to provide a kind of antenna equipment is carried out method for scanning, can be below a port under the more situation of the UID identical bytes of two ALD, improve sweep speed.
Technical scheme of the present invention is achieved in that
A kind of method that produces the scanning sign, the method includes the steps of:
A, generate unique identification UID and bit-masks according to nodal value;
B, the byte length of determining to change back UID and changing the back bit-masks; Obtain the mould Pi of i after divided by UID maximum byte length, obtain i divided by UID maximum byte length after the value Qi of integer part among the result, the value of getting Qi position in the UID Pi byte of conversion back for the UID that generates in the identical value of value of i position, the value of getting Qi position in the bit-masks Pi byte of conversion back is 1, i is that Pi, Qi are natural number less than all natural numbers of the UID significance bit length that generates; The value of all the other all gets 0 in conversion back UID and the conversion back bit-masks;
C, will change back UID and conversion back bit-masks as the scanning sign.
The method of the described generation of steps A UID is: make the UID of generation identical with nodal value.
The method of the described generation bit-masks of steps A is: make the bit-masks length of generation identical with the UID length of generation, the bit-masks median of generation be lower than described node the number of plies the position value all get 1, the value of all the other all gets 0.
The method of the byte length of described definite conversion back UID of step B and conversion back bit-masks is: the byte length of determining conversion back UID and conversion back bit-masks is a UID maximum byte length.
The method of the byte length of described definite conversion back UID of step B and conversion back bit-masks is: judge that whether the UID significance bit length that generates is less than UID maximum byte length, if, then change back UID and the UID significance bit length that the byte length of changing the back bit-masks equals to generate, equal UID maximum byte length with the byte length of changing the back bit-masks otherwise change back UID.
The UID significance bit length of described generation and the bit-masks median of generation are that all length of 1 is identical.
Comprise effective byte length in the described scanning sign of step C;
Described effective byte length equals to change the byte length of back UID and conversion back bit-masks.
Described nodal value is the nodal value on the binary tree.
The method includes the steps of:
A1, main website traverse the node of binary tree;
The nodal value that B1, basis traverse generates UID and bit-masks; Determine the byte length of conversion back UID and conversion back bit-masks; Obtain the mould Pi of i after divided by UID maximum byte length, obtain i divided by UID maximum byte length after the value Qi of integer part among the result; The value of getting Qi position in the UID Pi byte of conversion back for the UID that generates in the identical value of value of i position, the value of getting Qi position in the bit-masks Pi byte of conversion back is 1, i be that Pi, Qi are natural number less than all natural numbers of the UID significance bit length of generation; The value of all the other all gets 0 in conversion back UID and the conversion back bit-masks; To change back UID and conversion back bit-masks as the scanning sign;
The scanning information broadcast that C1, main website will comprise scanning sign sends to all antenna equipments on the bus, and the response of detection antenna equipment, if testing result is conflict, then execution in step D1 to occur, if testing result is for conflict, then execution in step E1 occurring;
All following branches of present node in D1, the intercepting binary tree;
E1, judge whether to travel through complete binary tree, if then finish this handling process, otherwise return steps A 1.
Described traversal adopts the first root traversal method of binary tree to carry out.
The method of the described generation of step B1 UID is: make the UID of generation identical with the nodal value that traverses.
The method of the described generation bit-masks of step B1 is: make the bit-masks length of generation identical with the UID length of generation, the bit-masks median of generation be lower than described node the number of plies the position value all get 1, the value of all the other all gets 0.
The method of the byte length of step B 1 described definite conversion back UID and conversion back bit-masks is: the byte length of determining conversion back UID and conversion back bit-masks is a UID maximum byte length.
The method of the byte length of described definite conversion back UID of step B1 and conversion back bit-masks is: judge that whether the UID significance bit length that generates is less than UID maximum byte length, if, then change back UID and the UID significance bit length that the byte length of changing the back bit-masks equals to generate, equal UID maximum byte length with the byte length of changing the back bit-masks otherwise change back UID.
The UID significance bit length of described generation and the bit-masks median of generation are that all length of 1 is identical.
The described appearance of step C1 conflict is: testing result is conflicted and is received one or more correct responses for not occurring, or testing result is not for receiving any response.
Among the present invention, after nodal value generation UID and bit-masks, the UID and the bit-masks that generate are changed, concrete conversion method is: the byte length of UID and conversion back bit-masks after determining to change; Obtain the mould Pi of i after divided by UID maximum byte length, obtain i divided by UID maximum byte length after the value Qi of integer part among the result; The value of getting Qi position in the UID Pi byte of conversion back for the UID that generates in the identical value of value of i position, the value of getting Qi position in the bit-masks Pi byte of conversion back is 1, i be that Pi, Qi are natural number less than all natural numbers of the UID significance bit length of generation; The value of all the other all gets 0 in conversion back UID and the conversion back bit-masks; To change back UID and conversion back bit-masks as the scanning sign.The scanning sign of utilizing said method to produce among the present invention scans antenna equipment.
The present invention has following beneficial effect:
1) utilizes the method that produces the scanning sign among the present invention, can produce the scanning sign of striding byte.
2) will generate UID and bit-masks is changed according to nodal value among the present invention, and the UID after will changing and bit-masks are as scanning sign, during the scanning conflict is not the step-by-step incremental scan, but cross over the byte incremental scan, under the more situation of the UID identical bytes of two or more ALD below the port, can improve sweep speed effectively.
3) consider the ALDUID of identical producer may comparing class seemingly, in case it is conflict occurs, then this byte is just the same probably, identical as preceding two bytes of the identical equipment UID of producer under many circumstances, utilize the present invention this moment, can improve sweep speed usually.The 0th byte, the 1st byte such as two equipment UID are identical, first of the 2nd byte is inequality, utilize prior art need scan this moment 8 * 2+1=17 time, utilizes the present invention only need scan 3 times, and as seen the present invention has significantly improved sweep speed in this case.
4) can comprise tower amplifier in the antenna equipment, a common tower amplifier comprises two UID, and described two UID only are the 0th difference of last byte usually, utilizes the present invention in this case, can significantly improve sweep speed.Effective byte such as two UID is 6, and wherein, the 0th～the 5th byte is identical, the 0th difference of the 6th byte, utilize prior art need scan this moment 8 * 6+1=49 time, utilizes the present invention only need scan 7 times, and as seen the present invention has significantly improved sweep speed in this case.
Description of drawings
The process schematic diagram that Fig. 1 scans ALD for the available technology adopting binary tree algorithm;
Figure 1A is the structural representation of binary tree;
The scanning tree schematic diagram of Fig. 2 in the prior art ALD being scanned;
The process schematic diagram of Fig. 3 in the embodiment of the invention ALD being scanned;
Fig. 4 is the process schematic diagram that produces the scanning sign in the embodiment of the invention;
The scanning tree schematic diagram of Fig. 5 in the embodiment of the invention ALD being scanned.
Embodiment
The method that produces the scanning sign among the present invention is:
Generate UID and bit-masks according to nodal value;
The UID and the bit-masks that generate are changed, obtained UID and bit-masks after the conversion, concrete conversion method is: the byte length of determining conversion back UID and conversion back bit-masks; Obtain the mould Pi of i after divided by UID maximum byte length, obtain i divided by UID maximum byte length after the value Qi of integer part among the result; The value of getting Qi position in the UID Pi byte of conversion back for the UID that generates in the identical value of value of i position, the value of getting Qi position in the bit-masks Pi byte of conversion back is 1, i be that Pi, Qi are natural number less than all natural numbers of the UID significance bit length of generation; The value of all the other all gets 0 in conversion back UID and the conversion back bit-masks;
To change back UID and conversion back bit-masks as the scanning sign.
Among the present invention antenna equipment being carried out method for scanning is:
A, main website traverse the node of binary tree;
B, generate UID and bit-masks according to the nodal value that traverses, and the UID and the bit-masks that generate are changed, obtain UID and bit-masks after the conversion, concrete conversion method is: the byte length of determining conversion back UID and conversion back bit-masks; Obtain the mould Pi of i after divided by UID maximum byte length, obtain i divided by UID maximum byte length after the value Qi of integer part among the result; Obtain the mould Pi of i after divided by UID maximum byte length, obtain i divided by UID maximum byte length after the value Qi of integer part among the result; The value of getting Qi position in the UID Pi byte of conversion back for the UID that generates in the identical value of value of i position, the value of getting Qi position in the bit-masks Pi byte of conversion back is 1, i be that Pi, Qi are natural number less than all natural numbers of the UID significance bit length of generation; The value of all the other all gets 0 in conversion back UID and the conversion back bit-masks; To change back UID and conversion back bit-masks as the scanning sign;
The scanning information broadcast that C, main website will comprise scanning sign sends to all ALD on the bus, and detects the response of ALD, if testing result is for conflict occurring, execution in step D then is if testing result is conflicted execution in step E then for occurring;
All following branches of present node in D, the intercepting binary tree;
E, judge whether to travel through complete binary tree, if then finish this handling process, otherwise return steps A.
Following with reference to the accompanying drawing embodiment that develops simultaneously, the present invention is described in more detail.
In the embodiment of the invention, the process that antenna equipment is scanned comprises following steps as shown in Figure 3:
Step 301 is identical with step 101 shown in Figure 1, is specially: main website traverses the node of binary tree.
Step 302: generate UID and bit-masks according to the nodal value that traverses, the UID of generation and the bit-masks conversion of generation are produced the scanning sign.
Step 303～step 305 is identical with step 103 shown in Figure 1～step 105, is specially:
Step 303: the scanning information broadcast that main website will comprise scanning sign sends to all ALD on the bus, and detects the response of ALD, if testing result is for conflict occurring, then execution in step 304, if testing result is conflicted for occurring, then execution in step 305.
Step 304: all following branches of present node in the intercepting binary tree.
Step 305: judge whether to travel through complete binary tree, if then finish this handling process, otherwise return step 301.
In the step 302 shown in Figure 3, the process that produces the scanning sign as shown in Figure 4, this process comprises following steps:
Step 401: generate UID and bit-masks according to nodal value.
In the step 401, identical in the method that generates UID and bit-masks according to nodal value and the prior art.
Step 402: the byte length of determining conversion back UID and conversion back bit-masks.
The described definite method of step 402 can for: the byte length of determining conversion back UID and conversion back bit-masks is a UID maximum byte length.
The described definite method of step 402 also can for: judge that whether the UID significance bit length that generates is less than UID maximum byte length, if, then change back UID and the UID significance bit length that the byte length of changing the back bit-masks equals to generate, equal UID maximum byte length with the byte length of changing the back bit-masks otherwise change back UID.
The bit-masks median of the UID significance bit length=generation of described generation is all length of 1, as: the bit-masks of generation is 00000111, and then the UID significance bit length of Sheng Chenging is 3; The bit-masks that generates is 0000000111111111, and then the UID significance bit length of Sheng Chenging is 9.
Step 403 step 406: obtain the value of conversion back UID and conversion back bit-masks, be specially:
Step 403: establishing all initial value of conversion back UID and conversion back bit-masks is 0; If the initial value of i is 0, i is a natural number.
Step 404: obtain the mould Pi of i after divided by UID maximum byte length, obtain i divided by UID maximum byte length after the value Qi of integer part among the result; Get that byte location is Pi among the UID of conversion back, in the Pi byte Qi position value for the UID that generates in the identical value of value of i position, get that byte location is Pi in the bit-masks of conversion back, the value of Qi position is 1 in the Pi byte.
In the step 404, get that byte location is Pi among the UID of conversion back, in the Pi byte Qi position value for the UID that generates in the identical value of value of i position.Such as: if the value of i position is 1 among the UID that generates, get then that byte location is Pi among the UID of conversion back, the value of Qi position is 1 in the Pi byte; If the value of i position is 0 among the UID that generates, get then that byte location is Pi among the UID of conversion back, the value of Qi position is 0 in the Pi byte.Whether the value that can judge i position among the UID of generation during specific implementation is 1 or is not 0, if, get then that byte location is Pi among the UID of conversion back, the value of Qi position is 1 or 0 in the Pi byte, byte location is Pi among the UID of conversion back, the value of Qi position is 0 or 1 in the Pi byte otherwise get.
In the step 404, get that byte location is Pi in the bit-masks of conversion back, in the Pi byte Qi position value for the bit-masks that generates in the identical value of value of i position, also can be described as: get that byte location is Pi in the bit-masks of conversion back, the value of Qi position is 1 in the Pi byte.Here, when i was arbitrary natural number less than the UID significance bit length that generates, in fact the value of i position was exactly 1 in the bit-masks.
Step 405: whether judge i less than generating back UID significance bit length, if then execution in step 407, otherwise execution in step 406.
Step 406:i value increases by 1, returns step 404.
The result who reaches by circulation execution in step 404～step 406 is: i for less than all natural numbers that generate back UID significance bit length, is obtained in conversion back UID and the conversion back bit-masks value of Qi position in the Pi byte.In the practical application, rationally revise by sequencing, judgement content step 404, step 405, step 406, also can reach same result, such as: after the step 404, value with i increases by 1 earlier, judges then whether i equals to generate back UID significance bit length, if, then execution in step 407, otherwise return step 404; Perhaps change into: judge whether i equals (generating back UID significance bit length-1) judging in the step 405; Or: judge earlier that between step 403 and step 404 whether i is less than generating back UID significance bit length, if not, then execution in step 407, otherwise execution in step 404, i value increase after 1, return again and judge that i is whether less than the step that generates back UID significance bit length between step 403 and the step 404, or the like, describe in detail no longer one by one at this.
In step 402～step 406, determine the byte length of conversion back UID and conversion back bit-masks earlier, and to establish all initial value of conversion back UID and conversion back bit-masks be 0, be when generating all natural numbers of back UID significance bit length to i then, the value assignment of Qi position in the Pi byte.In the practical application, also can obtain i earlier for when generating all natural numbers of back UID significance bit length, the value of Qi position in the corresponding Pi byte, to change in back UID and the conversion back bit-masks value of all the other then all gets 0 and also can, the step of the byte length of described definite conversion back UID of step 402 this moment and conversion back bit-masks can be after step 401, will change the value of all the other in back UID and the conversion back bit-masks and all get optional position execution before 0.
Here, after determining the byte length of conversion back UID and conversion back bit-masks, the method of obtaining conversion back UID also can be described as: the value of i position among the UID that generates is corresponded to, among the UID of conversion back, byte location be i after divided by UID maximum byte length mould and the figure place in this byte be i divided by UID maximum byte length after the value of the position of integer part among the result, i is less than all natural numbers that generate back UID significance bit length, and the value of all the other all gets 0 among the UID of conversion back.
In like manner, after determining the byte length of conversion back UID and conversion back bit-masks, the method of obtaining conversion back bit-masks also can be described as: the value of j position in the bit-masks that generates is corresponded to, in the bit-masks of conversion back, byte location be j after divided by UID maximum byte length mould and the figure place in this byte be j divided by UID maximum byte length after the value of the position of integer part among the result, j is less than all natural numbers that generate back UID significance bit length, and the value of all the other all gets 0 in the bit-masks of conversion back; Or: for j is less than all natural numbers that generate back UID significance bit length, byte location be j after divided by UID maximum byte length mould and the figure place in this byte be j divided by UID maximum byte length after among the result value of the position of integer part get 1, the value of all the other all gets 0 in the bit-masks of conversion back.
Step 407: will change back UID and conversion back bit-masks as the scanning sign.
In the step 407, in the time of will changing back UID and conversion back bit-masks as the scanning sign, comprise effective byte length information in the scanning sign, described effective byte length equals to change the byte length of back UID and conversion back bit-masks.Such as: if the byte length of conversion back UID and conversion back bit-masks is 2 bytes, effective byte length is 2 bytes in the then scanning sign; If the byte length of conversion back UID and conversion back bit-masks is 19 bytes, effective byte length is 19 bytes in the then scanning sign.
During specific implementation, if the UID that generated before changing is represented with TreeLen with the UID significance bit length of TreeMask, generation with TreeUid, the bit-masks that generated, and the bit-masks of the UID after will changing after with MsgUid, conversion with MsgMask, conversion afterwards the byte length of UID and bit-masks represent with MsgLen, and the maximum byte length of establishing UID is 19, the then described conversion of Fig. 4 can be exemplified as:
If, TreeUid=00000011, TreeMask=00000011, TreeLen=2
Then at first, because TreeLen=2 is less than 19, therefore,
MsgLen＝2 (1)
For i all natural numbers less than TreeLen=2, promptly, obtain Pi and Qi respectively to the situation of i=0 and i=1, wherein during i=0, P0=0%19=0, Q0 are 0/19 back result's integer value, i.e. Q0=0; During i=1, P1=1%19=1, Q1 are 0/19 back result's integer value, i.e. Q1=0.
Because the 0th of TreeUid, promptly the value during i=0 is 1, and therefore byte location is P0=0 among the UID of conversion back, and the value of the 0th byte median Q0=0 position gets 1; Because the 1st of TreeUid, promptly the value during i=1 is 1, and therefore byte location is P1=1 among the UID of conversion back, and the value of the 1st byte median Q1=0 position gets 1; The value of all the other all gets 0 among the UID of conversion back.Therefore conversion back MsgUid is:
MsgUid＝00000001 00000001 (2)
And among the MsgMask, the Q0=0 position of P0=0 byte, and the value of the Q1=0 position of P1=1 byte gets 1, and the value of all the other all gets 0, and therefore conversion back MsgMask is:
MsgMask＝00000001 00000001 (3)
Here, if MsgLen is not as shown in Equation (1), but get UID maximum byte length is MsgLen=19, then among MsgUid and the MsgMask low 2 bytes respectively as shown in formula (2) and formula (3), and among MsgUid and the MsgMask in high 17 bytes each place value all get 0.
The process that in the embodiment of the invention antenna equipment is scanned also can be represented with the scanning tree that scans flow process that comprises shown in Figure 5.Express corresponding scanning sign on each scanning node of scanning tree shown in Figure 5, such as: the scanning of scanning tree middle level one left sibling 51a is designated BIT MASK=0...01, UID=00000001, effective byte length (Length)=1 byte; The scanning of layer two left sibling 52aa is designated BIT MASK=0...01 00000001, UID=00000001 00000001, effective byte length (Length)=2 byte, or the like.
According to scanning tree shown in Figure 5, when consecutive collision occurring in the embodiment of the invention, the scanning situation can be as shown in Table 2:
| Scanning sequency | Length | UID | MASK |
| The |
1 | 00000001 | 00000001 |
| Scanning sequency | Length | UID | MASK |
| Second step | 2 | 00000001 00000001 | 00000001 00000001 |
| ...... | ...... | ...... | ...... |
| The 19 step | 19 | 00000001...00000001 | 00000001...00000001 |
| The 20 step | 19 | 00000001...00000011 | 00000001...00000011 |
| The 21 step | 19 | 00000001...000000110000001 1 | 00000001...0000001100000011 |
| ...... | ...... | ...... | ...... |
Table two
In the table two:
The 0th of first step scanning UID the 0th byte.Here, described the 0th place value can be 1, also can be 0, whether be 1, if conflict then carried out for second step if generally can scan UID the 0th place value earlier, whether if conflict occurs or carry out after second step when conflict not occurring, then can scan UID the 0th place value is 0; UID the 0th place value with scanning in the table two is that appearance conflict in 1 o'clock is that example is illustrated;
Because UID the 0th byte the 0th place value is appearance conflict in 1 o'clock in the first step, therefore further scans the 0th of UID the 1st byte in second step.Here, described the 1st byte the 0th place value can be 1, also can be 0, can scan earlier generally whether UID the 1st byte the 0th place value is 1, if continue to occur conflict, then carried out for the 3rd step,, can scan then whether UID the 1st byte the 0th place value is 0 if conflict occurs or carry out after the 3rd step when conflict not occurring; UID the 1st byte the 0th place value with scanning in the table two is that continuation appearance conflict in 1 o'clock is that example is illustrated;
Because UID the 1st byte the 0th place value is continuation appearance conflict in 1 o'clock in second step, therefore further the 0th of UID the 2nd byte that scan in the 3rd step.Here, described the 2nd byte the 0th place value can be 1, also can be 0, can scan earlier generally whether UID the 2nd byte the 0th place value is 1, if continue to occur conflict, then continue the scanning next bit, if after conflict occurring or continuing the scanning next bit when conflict not occurring, can scan then whether UID the 2nd byte the 0th place value is 0; Whether be 1 to be that example is illustrated with scanning UID the 2nd byte the 0th place value in the table two;
...；
Because UID the 19th byte the 0th place value is continue to occur conflict at 1 o'clock in the 19th step, whether therefore further the 1st of scanning UID the 0th byte in the 20th step is 1 to be that example is illustrated with scanning UID the 0th byte the 1st place value in the table two;
Because UID the 0th byte the 1st place value is continue to occur conflict at 1 o'clock in the 20th step, whether therefore further the 1st of scanning UID the 1st byte in the 21st step is 1 to be that example is illustrated with scanning UID the 1st byte the 1st place value in the table two;
Because UID the 1st byte the 1st place value is continue to occur conflict at 1 o'clock in the 21st step, whether therefore further the 1st of scanning UID the 2nd byte in the 22nd step is 1 to be that example is illustrated with scanning UID the 2nd byte the 1st place value in the table two;
Table two is that the situation when consecutive collision occurring among Fig. 5 is given an example.Conflict appears during the generally current s byte t position that scans UID, if the s byte is last effective byte, then further scan the t+1 position of UID the 0th byte, if this byte is not last effective byte, then further scan the t position of UID s+1 byte, here, if the s byte is last effective byte, and t=7 then finishes scanning process usually.
As can be seen,, when ALD is scanned, if conflict, then generally can further scan the same position of the next byte of UID, so the scan method among Fig. 5 can be called and strides the scan method that byte increases progressively according to scanning tree shown in Figure 5.
Utilize the scan method in the embodiment of the invention, if the UID of two ALD preceding 80 identical, the 81st when inequality, main website issues the UID that can obtain an ALD after 80 ÷ 8+1=11 the scanning message.
The above is preferred embodiment of the present invention only, is not to be used to limit the scope of application of the present invention.
Claims (16)
1. one kind produces the method that scanning identifies, and it is characterized in that the method includes the steps of:
A, generate unique identification UID and bit-masks according to nodal value;
B, the byte length of determining to change back UID and changing the back bit-masks; Obtain the mould Pi of i after divided by UID maximum byte length, obtain i divided by UID maximum byte length after the value Qi of integer part among the result, the value of getting Qi position in the UID Pi byte of conversion back for the UID that generates in the identical value of value of i position, the value of getting Qi position in the bit-masks Pi byte of conversion back is 1, i is that Pi, Qi are natural number less than all natural numbers of the UID significance bit length that generates; The value of all the other all gets 0 in conversion back UID and the conversion back bit-masks;
C, will change back UID and conversion back bit-masks as the scanning sign.
2. method according to claim 1 is characterized in that, the method for the described generation of steps A UID is: make the UID of generation identical with nodal value.
3. method according to claim 1, it is characterized in that, the method of the described generation bit-masks of steps A is: make the bit-masks length of generation identical with the UID length of generation, the bit-masks median of generation be lower than described node the number of plies the position value all get 1, the value of all the other all gets 0.
4. method according to claim 1 is characterized in that, the method for the byte length of described definite conversion back UID of step B and conversion back bit-masks is: the byte length of determining conversion back UID and conversion back bit-masks is a UID maximum byte length.
5. method according to claim 1, it is characterized in that, the method of the byte length of described definite conversion back UID of step B and conversion back bit-masks is: judge that whether the UID significance bit length that generates is less than UID maximum byte length, if, then change back UID and the UID significance bit length that the byte length of changing the back bit-masks equals to generate, equal UID maximum byte length with the byte length of changing the back bit-masks otherwise change back UID.
6. method according to claim 5 is characterized in that, the UID significance bit length of described generation and the bit-masks median of generation are that all length of 1 is identical.
7. method according to claim 1 is characterized in that, comprises effective byte length in the described scanning sign of step C;
Described effective byte length equals to change the byte length of back UID and conversion back bit-masks.
8. according to each described method of claim 1 to 7, it is characterized in that described nodal value is the nodal value on the binary tree.
9. one kind is carried out method for scanning to antenna equipment, it is characterized in that the method includes the steps of:
A1, main website traverse the node of binary tree;
The nodal value that B1, basis traverse generates UID and bit-masks; Determine the byte length of conversion back UID and conversion back bit-masks; Obtain the mould Pi of i after divided by UID maximum byte length, obtain i divided by UID maximum byte length after the value Qi of integer part among the result; The value of getting Qi position in the UID Pi byte of conversion back for the UID that generates in the identical value of value of i position, the value of getting Qi position in the bit-masks Pi byte of conversion back is 1, i be that Pi, Qi are natural number less than all natural numbers of the UID significance bit length of generation; The value of all the other all gets 0 in conversion back UID and the conversion back bit-masks; To change back UID and conversion back bit-masks as the scanning sign;
The scanning information broadcast that C1, main website will comprise scanning sign sends to all antenna equipments on the bus, and the response of detection antenna equipment, if testing result is conflict, then execution in step D1 to occur, if testing result is for conflict, then execution in step E1 occurring;
All following branches of present node in D1, the intercepting binary tree;
E 1, judge whether to travel through complete binary tree, if then finish this handling process, otherwise return steps A 1.
10. method according to claim 9 is characterized in that, described traversal adopts the first root traversal method of binary tree to carry out.
11. method according to claim 9 is characterized in that, the method for the described generation of step B1 UID is: make the UID of generation identical with the nodal value that traverses.
12. method according to claim 9, it is characterized in that, the method of the described generation bit-masks of step B1 is: make the bit-masks length of generation identical with the UID length of generation, the bit-masks median of generation be lower than described node the number of plies the position value all get 1, the value of all the other all gets 0.
13. method according to claim 9 is characterized in that, the method for the byte length of described definite conversion back UID of step B1 and conversion back bit-masks is: the byte length of determining conversion back UID and conversion back bit-masks is a UID maximum byte length.
14. method according to claim 9, it is characterized in that, the method of the byte length of described definite conversion back UID of step B1 and conversion back bit-masks is: judge that whether the UID significance bit length that generates is less than UID maximum byte length, if, then change back UID and the UID significance bit length that the byte length of changing the back bit-masks equals to generate, equal UID maximum byte length with the byte length of changing the back bit-masks otherwise change back UID.
15. method according to claim 14 is characterized in that, the UID significance bit length of described generation and the bit-masks median of generation are that all length of 1 is identical.
16. method according to claim 9 is characterized in that, the described appearance of step C1 conflict is: testing result is conflicted and is received one or more correct responses for not occurring, or testing result is not for receiving any response.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2006100984650A CN1901276B (en) | 2006-07-07 | 2006-07-07 | Method for producing scan mark and method for scanning antenna device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2006100984650A CN1901276B (en) | 2006-07-07 | 2006-07-07 | Method for producing scan mark and method for scanning antenna device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1901276A CN1901276A (en) | 2007-01-24 |
| CN1901276B true CN1901276B (en) | 2010-09-29 |
Family
ID=37657070
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2006100984650A Active CN1901276B (en) | 2006-07-07 | 2006-07-07 | Method for producing scan mark and method for scanning antenna device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN1901276B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20100278533A1 (en) * | 2009-04-30 | 2010-11-04 | Telefonaktiebolaget L M Ericsson (Publ) | Bit mask to obtain unique identifier |
| CN105493620A (en) * | 2013-09-05 | 2016-04-13 | 华为技术有限公司 | Method and device for discovering ALD |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20020130766A1 (en) * | 2001-03-16 | 2002-09-19 | E-Tag Systems, Inc. | Method and apparatus for efficiently querying and identifying multiple items on a communication channel |
| US20040103086A1 (en) * | 2002-11-26 | 2004-05-27 | Bapiraju Vinnakota | Data structure traversal instructions for packet processing |
| CN1706206A (en) * | 2002-10-18 | 2005-12-07 | 赛宝技术公司 | Method for the efficient reading of a population of radio frequency identification tags with unique identification numbers over a noisy air channel |
-
2006
- 2006-07-07 CN CN2006100984650A patent/CN1901276B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20020130766A1 (en) * | 2001-03-16 | 2002-09-19 | E-Tag Systems, Inc. | Method and apparatus for efficiently querying and identifying multiple items on a communication channel |
| CN1706206A (en) * | 2002-10-18 | 2005-12-07 | 赛宝技术公司 | Method for the efficient reading of a population of radio frequency identification tags with unique identification numbers over a noisy air channel |
| US20040103086A1 (en) * | 2002-11-26 | 2004-05-27 | Bapiraju Vinnakota | Data structure traversal instructions for packet processing |
Also Published As
| Publication number | Publication date |
|---|---|
| CN1901276A (en) | 2007-01-24 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Liu et al. | Global synchronization of coupled fractional-order recurrent neural networks | |
| Turau | Efficient transformation of distance-2 self-stabilizing algorithms | |
| CN1901276B (en) | Method for producing scan mark and method for scanning antenna device | |
| Kowalski et al. | Leader election in ad hoc radio networks: A keen ear helps | |
| CN105515997A (en) | BF_TCAM (Bloom Filter-Ternary Content Addressable Memory)-based high-efficiency range matching method for realizing zero range expansion | |
| Lan et al. | A linear-time algorithm for solving the center problem on weighted cactus graphs | |
| CN103136334A (en) | Fast ergodic synchronous data flow system node parameter processing method based on graphs | |
| CN108090386A (en) | A kind of multicycle RFID anti-collision algorithm decomposed based on binary tree | |
| Goddard et al. | Distance-k knowledge in self-stabilizing algorithms | |
| CN105357118A (en) | Rule based flow classifying method and system | |
| CN103685280A (en) | Message matching method, state machine compiling method and equipment | |
| CN104516914A (en) | Method and device for recognizing time sequence mode | |
| CN103902772B (en) | Staggered pin structure based escape wiring method for isometric difference pairs | |
| CN103415021B (en) | A kind of radio frequency assigning method based on satisfiability problem stipulations | |
| Bouabdallah et al. | Providing collision-free and conflict-free communication in general synchronous broadcast/receive networks | |
| CN106921681B (en) | Method, network node and the system for dividing group are realized based on random fashion | |
| Zhou et al. | Hybrid combinatorial synchronization on multiple sub-networks of complex network with unknown boundaries of uncertainties | |
| Jin et al. | Improving the speed and scalability of distributed simulations of sensor networks | |
| CN107564289B (en) | Road network preprocessing method for merging traffic nodes | |
| CN105764028A (en) | Wireless sensor network node positioning method | |
| CN112040017A (en) | IPv6 address allocation method for wireless sensor network of smart grid | |
| Cheng et al. | Which networks permit stable allocations? A theory of network‐based comparisons | |
| Caramia et al. | Solving the minimum‐weighted coloring problem | |
| Xing et al. | Optimal deadlock avoidance Petri net supervisors for automated manufacturing systems | |
| CN104699599A (en) | Interprocedural static slice extracting method based on idUCf quinary structure |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant |