CN104700137A - Information processing method based on Internet of Things - Google Patents
Information processing method based on Internet of Things Download PDFInfo
- Publication number
- CN104700137A CN104700137A CN201510152857.XA CN201510152857A CN104700137A CN 104700137 A CN104700137 A CN 104700137A CN 201510152857 A CN201510152857 A CN 201510152857A CN 104700137 A CN104700137 A CN 104700137A
- Authority
- CN
- China
- Prior art keywords
- node
- category
- rfid reader
- data
- access path
- 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
- 230000010365 information processing Effects 0.000 title claims abstract description 8
- 238000003672 processing method Methods 0.000 title claims abstract description 8
- 230000005540 biological transmission Effects 0.000 claims abstract description 24
- 238000006243 chemical reaction Methods 0.000 claims abstract description 4
- 238000012360 testing method Methods 0.000 claims description 21
- 238000012546 transfer Methods 0.000 claims description 16
- 238000000034 method Methods 0.000 claims description 12
- 230000004044 response Effects 0.000 claims description 12
- 238000004891 communication Methods 0.000 claims description 6
- 230000008569 process Effects 0.000 claims description 6
- 238000012935 Averaging Methods 0.000 claims description 3
- 240000007594 Oryza sativa Species 0.000 claims description 3
- 235000007164 Oryza sativa Nutrition 0.000 claims description 3
- 238000004364 calculation method Methods 0.000 claims description 3
- 239000000284 extract Substances 0.000 claims description 3
- 235000009566 rice Nutrition 0.000 claims description 3
- 238000005516 engineering process Methods 0.000 description 4
- 238000010276 construction Methods 0.000 description 2
- 235000007926 Craterellus fallax Nutrition 0.000 description 1
- 240000007175 Datura inoxia Species 0.000 description 1
- 230000008901 benefit Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000009466 transformation Effects 0.000 description 1
Landscapes
- Mobile Radio Communication Systems (AREA)
Abstract
The invention provides an information processing method based on the Internet of Things. The Internet of Things comprises an RFID label, an RFID reader and a plurality of network nodes. The network nodes which are connected with the RFID reader directly/indirectly are called A/B type nodes respectively. The RFID reader reads data information in the RFID label, and the data information is sent to one A type node. The A type node carries out format conversion on the received data information, and the data information is sent to a B type node. The B type node stores the data information from the A type node and can read data information stored in other B type nodes. According to the scheme, information under the environment of the Internet of Things can be effectively processed, the nodes in the Internet of Things are subjected to effective identity authentication, and the safety of data information transmission is improved.
Description
Technical field
The present invention relates to technology of Internet of things field, particularly relate to a kind of information processing method based on Internet of Things.
Background technology
Internet of Things is a kind of special network, the internet of information age and traditional object combine by it, object is made to become the main body of intelligence, and the application of daily life is by the calculating of internet and storage resources, become efficiently convenient, caused the major transformation in internet and the large field of real world applications two.Along with Internet technology is more and more dissolved into traditional application, Internet of Things also more and more comes into one's own, and technology of Internet of things also more and more appears in the application of various business, greatly improves efficiency and the commercial profit of enterprise.
It is exactly set up the network that can realize the Item Information Real-Time Sharing in global range that Internet of Things sets up initial object, makes under existing the Internet architecture, realize the targets such as article location in the world, tracking and other information inquiries.Internet of Things is exactly a huge information sharing and information exchange network, is intended to for people provide more horn of plenty and easily information service.Due to Internet of Things itself, what its scale can be larger than existing the Internet is many, and it is also well imagined big for the quantity of information of generation.Therefore, under Internet of Things applied environment, how efficiently, reliably tissue and the information of storage, and for user to provide information service to be easily a problem demanding prompt solution; Meanwhile, how carrying out effective authentication to the node in Internet of Things, improve the security of data information transfer, is also an important problem.
Summary of the invention
Fundamental purpose of the present invention is reading, the forwarding of the data message realizing article or service in Internet of Things, and the safe transmission of described data message between multiple Internet of things node.The invention provides a kind of information processing method based on Internet of Things.
Technical scheme of the present invention is as follows:
Based on an information processing method for Internet of Things, described Internet of Things comprises RFID label tag, RFID reader and multiple network node; The network node directly connecting described RFID reader is called category-A node, the network node directly not connecting described RFID reader is called category-B node, it is characterized in that:
Described RFID label tag stores the coded message of article or service in Internet of Things;
Described RFID reader reads the data message in described RFID label tag, and read data message is sent to a category-A node;
Described category-A node is forwarded to a category-B node after the data message received from described RFID reader is carried out format conversion;
Described category-B node stores the data message from described category-A node; Further, described category-B node can read the data message stored in other category-B nodes.
Preferably, after described RFID reader reads the data message in described RFID label tag, and before read data message is sent to a category-A node, first need the quantity judging the category-A node that this RFID reader can be connected to;
If this quantity is 1, then directly determines the target category-A node of this category-A node as data information transfer, upload the data message that current RFID reader reads;
If this quantity is greater than 1, then select one of them category-A node as the target category-A node of data information transfer in the following manner, upload the data message that current RFID reader reads, concrete steps are as follows:
Step S1, selects the test data s of regular length; Setup times threshold value t1, time threshold t2;
Step S2, for each category-A node that current RFID reader can be connected to, performs step S2.1 and step S2.2 successively, particularly:
Step S2.1, sends described test data s to current category-A node, obtains the response time t that current category-A node starts to receive data;
Step S2.2, record current category-A node from receive described test data s until complete described test data s all transmit consumed data transmission period Δ t;
Step S3, judges in the category-A node that current RFID reader can be connected to, and the response time t of all category-A nodes is all more than or equal to described time threshold t2;
If so, step S4 is performed;
Otherwise, reject the category-A node that response time t is more than or equal to described time threshold t2; Then judge now whether only remain a category-A node; If so, then this category-A node is defined as target category-A node, terminates;
Step S4, judges in the category-A node that current RFID reader can be connected to, and the data transmission period Δ t of all category-A nodes is all more than or equal to described time threshold t1;
If so, step S5 is performed;
Otherwise, reject the category-A node that data transmission period Δ t is more than or equal to described time threshold t1; Then judge now whether only remain a category-A node; If so, then this category-A node is defined as target category-A node, terminates;
Step S5, calculates the arithmetic mean t_avg of the response time t of remaining all category-A nodes; And calculate the arithmetic mean Δ t_avg of the data transmission period Δ t of remaining all category-A nodes;
Step S6, for remaining each category-A node, calculate the generalized time parameter value t ' of this category-A node successively, specific formula for calculation is as follows:
t’＝λ*|t-t_avg|
1/2*log
2|1+Δt-Δt_avg|
Wherein, λ is the constant preset;
Step S7, in remaining all category-A nodes, selects the category-A node that generalized time parameter value t ' is minimum, is defined as target category-A node.
Preferably, after described RFID reader determination target category-A node, also need to carry out authentication between described RFID reader and described target category-A node; Suppose that the name of computing machine or other computing terminals be directly connected with described RFID reader is called node R 1, the name of described target category-A node is called node R 2, then authentication process itself is as follows:
Step U1, node R 2 generates a random number Q, sends it to node R 1;
Step U2, node R 1 generates private key Ks and two PKI Ka and Kb after receiving the random number Q of node R 2 generation;
Wherein, (Ka)
2+ (Kb)
2=Q
2;
Then, PKI Ka and Kb is returned to node R 2 by node R 1;
Step U3, node R 2 is verified it after receiving PKI Ka and Kb;
If (Ka)
2+ (Kb)
2≠ Q
2, then authentication failure, stops communication;
Otherwise Ka and Kb that use public-key respectively is encrypted Q, enciphered data E (Ka) and E (Kb) is sent to node R 1;
Step U4, node R 1 utilizes private key Ks to the enciphered data E received (Ka) and E (Kb) deciphering, if decrypted result is all Q, then authentication is passed through, and shows can carry out normal data transmission between node R 1 and node R 2; Otherwise authentication failure, stops communication;
Step U5, if the failure of above-mentioned authentication process itself, then reselects a target category-A node, performs above-mentioned steps U1 ~ step U4, until determine one can by the target category-A node of authentication, to realize the transmission of described data message.
Preferably, complete authentication between described RFID reader and described target category-A node after, read data message is sent to described target category-A node by described RFID reader in the following manner, particularly:
For described RFID reader:
This RFID reader, before read data message is sent to target category-A node, performs following operation:
Step M1, is divided into three sections by described data message, is respectively subdata information info1, subdata information info2 and subdata information info3, and the length of above-mentioned three cross-talk data messages is respectively k1 byte, k2 byte, k3 byte; Above-mentioned three cross-talk data messages are arranged joint in order and can obtain described data message;
Wherein, k2>k1+k3, and k3=[log
2(k1)], symbol [] represents the computing of intercepting integral part;
Step M2, arranges joint in order by subdata information info1 and subdata information info3, obtains checking data information;
Step M3, calculates the MD5 value of described checking data information, obtains referential integrity proof test value H1;
Step M4, is sent to described target category-A node jointly by described data message and control information;
Wherein, described control information comprises the value of referential integrity proof test value H1 and k1 and k3;
For described target category-A node:
After the data message that this target category-A node receives described RFID reader and control information, perform following operation:
Step N1, extracts initial k1 byte and the last position k3 byte of described data message, arranges joint in order, obtain information to be verified;
Step N2, calculates the MD5 value of described information to be verified, obtains actual integrity check value H2;
Step N3, compares the referential integrity proof test value H1 calculated in the control information of described actual integrity check value H2 and the reception obtained; If both are identical, then described data message is by completeness check, by described data information memory to described target category-A node; Otherwise, described data message is abandoned, and sends transfer instruction again to described RFID reader.
Preferably, each category-B node self has an adjacent visit information list, for by visiting other category-B nodes with the category-B node that it is directly connected;
Described adjacent visit information list comprises following content:
(1) title of the category-B node be directly connected with current category-B node;
(2) physical address of the category-B node be directly connected with current category-B node, IP address;
(3) port numbers of the category-B node be directly connected with current category-B node;
(4) current category-B node and with the network bandwidth between its category-B node be directly connected;
(5) current category-B node and with the average connection setup time between its category-B node be directly connected;
(6) current category-B node and with the successful connection probability between its category-B node be directly connected;
(7) current category-B node and with the data transfer integrity probability between its category-B node be directly connected;
When an initial category-B node b1 to need in accesses network a target category-B node bn with its indirect connection, perform following operation:
Steps A 1, is set to described initial category-B node b1 by current category-B node initializing;
Steps A 2, inquires about all category-B nodes be directly connected with it in the adjacent visit information list of current category-B node b1;
If find described target category-B node bn, then return;
Otherwise, be each the category-B node be directly connected with described initial category-B node b1 successively by current category-B Node configuration; Correspondingly, steps A 3 is performed to each current category-B node that described initial category-B node b1 is directly connected;
Steps A 3, the adjacent visit information list of the category-B node adopting recursive algorithm inquiry to be directly connected with current category-B node, if find described target category-B node bn, then recurrence returns.
Preferably, if there is k bar access path L1, L2 between initial category-B node b1 and target category-B node bn ..., Lk, wherein, k be greater than 1 positive integer, then select the step of best access path as follows:
Step B1, calculates access path L1, L2 respectively ..., the summation W ' 1, W ' 2 of the network bandwidth between every two category-B nodes in Lk ..., W ' k;
According to every bar access path L1, L2 ..., the linking number in Lk, calculates the averaging network bandwidth W1 of every bar access path, W2 ..., Wk;
Wherein, the category-B number of nodes that the linking number in an access path is defined as in this access path deducts 1;
Step B2, calculates access path L1, L2 respectively ..., the summation T ' 1, T ' 2 of average connection setup time between every two category-B nodes in Lk ..., T ' k;
According to every bar access path L1, L2 ..., the linking number in Lk, calculates total connection setup time T1, the T2 of every bar access path ..., Tk;
Step B3, respectively by access path L1, L2 ..., the successful connection probability multiplication in Lk between every two category-B nodes, what obtain every bar access path connects into power C1, C2 ..., Ck;
Step B4, respectively by access path L1, L2 ..., the data transfer integrity probability multiplication in Lk between every two category-B nodes, obtains the data transmission percentage of head rice I1 of every bar access path, I2 ..., Ik;
Step 5, according to the data obtained in above-mentioned steps, calculates access path L1, L2 respectively ..., the assessment parameter Ф 1, Ф 2 of Lk ..., Ф k, the access path selecting assessment parameter value maximum is as best access path; Particularly, the computing formula of the assessment parameter Ф i of access path Li is as follows:
Фi＝lg(Wi+1)/lg(Ti+1)*(3Ci+2Ii)
2；
Wherein, i is positive integer, and 1≤i≤k.
Compared with prior art, there is following advantage in technical scheme of the present invention:
The first, technical scheme of the present invention can be organized efficiently, reliably and store the information in Internet of Things, provides Internet of Things information service easily;
The second, technical scheme of the present invention has used the safety technique of identity-based checking and data integrity verifying, substantially increases the safety and reliability of data transmission;
3rd, technical scheme of the present invention, for the selection course of routed path distributed in Internet of Things, combines various factors, optimizes routing.
Accompanying drawing explanation
In order to be illustrated more clearly in the technical scheme in the embodiment of the present invention, below the accompanying drawing used required in describing the embodiment of the present invention is briefly described, apparently, accompanying drawing in the following describes is only some embodiments of the present invention, for those of ordinary skill in the art, under the prerequisite not paying creative work, other accompanying drawing can also be obtained according to described accompanying drawing.
Fig. 1 is the system construction drawing according to the embodiment of the present invention.
Embodiment
Below with reference to accompanying drawings exemplary embodiment of the present disclosure is described in more detail.Although show exemplary embodiment of the present disclosure in accompanying drawing, however should be appreciated that can realize the disclosure in a variety of manners and not should limit by the embodiment set forth here.On the contrary, provide these embodiments to be in order to more thoroughly the disclosure can be understood, and complete for the scope of the present disclosure can be conveyed to those skilled in the art.
Fig. 1 is the system construction drawing according to the embodiment of the present invention.
With reference to shown in Fig. 1, a kind of information processing method based on Internet of Things, described Internet of Things comprises RFID label tag, RFID reader and multiple network node; The network node directly connecting described RFID reader is called category-A node, the network node directly not connecting described RFID reader is called category-B node, it is characterized in that:
Described RFID label tag stores the coded message of article or service in Internet of Things;
Described RFID reader reads the data message in described RFID label tag, and read data message is sent to a category-A node;
Described category-A node is forwarded to a category-B node after the data message received from described RFID reader is carried out format conversion;
Described category-B node stores the data message from described category-A node; Further, described category-B node can read the data message stored in other category-B nodes.
Preferably, after described RFID reader reads the data message in described RFID label tag, and before read data message is sent to a category-A node, first need the quantity judging the category-A node that this RFID reader can be connected to;
If this quantity is 1, then directly determines the target category-A node of this category-A node as data information transfer, upload the data message that current RFID reader reads;
If this quantity is greater than 1, then select one of them category-A node as the target category-A node of data information transfer in the following manner, upload the data message that current RFID reader reads, concrete steps are as follows:
Step S1, selects the test data s of regular length; Setup times threshold value t1, time threshold t2;
Step S2, for each category-A node that current RFID reader can be connected to, performs step S2.1 and step S2.2 successively, particularly:
Step S2.1, sends described test data s to current category-A node, obtains the response time t that current category-A node starts to receive data;
Step S2.2, record current category-A node from receive described test data s until complete described test data s all transmit consumed data transmission period Δ t;
Step S3, judges in the category-A node that current RFID reader can be connected to, and the response time t of all category-A nodes is all more than or equal to described time threshold t2;
If so, step S4 is performed;
Otherwise, reject the category-A node that response time t is more than or equal to described time threshold t2; Then judge now whether only remain a category-A node; If so, then this category-A node is defined as target category-A node, terminates;
Step S4, judges in the category-A node that current RFID reader can be connected to, and the data transmission period Δ t of all category-A nodes is all more than or equal to described time threshold t1;
If so, step S5 is performed;
Otherwise, reject the category-A node that data transmission period Δ t is more than or equal to described time threshold t1; Then judge now whether only remain a category-A node; If so, then this category-A node is defined as target category-A node, terminates;
Step S5, calculates the arithmetic mean t_avg of the response time t of remaining all category-A nodes; And calculate the arithmetic mean Δ t_avg of the data transmission period Δ t of remaining all category-A nodes;
Step S6, for remaining each category-A node, calculate the generalized time parameter value t ' of this category-A node successively, specific formula for calculation is as follows:
t’＝λ*|t-t_avg|
1/2*log
2|1+Δt-Δt_avg|
Wherein, λ is the constant preset;
Step S7, in remaining all category-A nodes, selects the category-A node that generalized time parameter value t ' is minimum, is defined as target category-A node.
Preferably, after described RFID reader determination target category-A node, also need to carry out authentication between described RFID reader and described target category-A node; Suppose that the name of computing machine or other computing terminals be directly connected with described RFID reader is called node R 1, the name of described target category-A node is called node R 2, then authentication process itself is as follows:
Step U1, node R 2 generates a random number Q, sends it to node R 1;
Step U2, node R 1 generates private key Ks and two PKI Ka and Kb after receiving the random number Q of node R 2 generation;
Wherein, (Ka)
2+ (Kb)
2=Q
2;
Then, PKI Ka and Kb is returned to node R 2 by node R 1;
Step U3, node R 2 is verified it after receiving PKI Ka and Kb;
If (Ka)
2+ (Kb)
2≠ Q
2, then authentication failure, stops communication;
Otherwise Ka and Kb that use public-key respectively is encrypted Q, enciphered data E (Ka) and E (Kb) is sent to node R 1;
Step U4, node R 1 utilizes private key Ks to the enciphered data E received (Ka) and E (Kb) deciphering, if decrypted result is all Q, then authentication is passed through, and shows can carry out normal data transmission between node R 1 and node R 2; Otherwise authentication failure, stops communication;
Step U5, if the failure of above-mentioned authentication process itself, then reselects a target category-A node, performs above-mentioned steps U1 ~ step U4, until determine one can by the target category-A node of authentication, to realize the transmission of described data message.
Preferably, complete authentication between described RFID reader and described target category-A node after, read data message is sent to described target category-A node by described RFID reader in the following manner, particularly:
For described RFID reader:
This RFID reader, before read data message is sent to target category-A node, performs following operation:
Step M1, is divided into three sections by described data message, is respectively subdata information info1, subdata information info2 and subdata information info3, and the length of above-mentioned three cross-talk data messages is respectively k1 byte, k2 byte, k3 byte; Above-mentioned three cross-talk data messages are arranged joint in order and can obtain described data message;
Wherein, k2>k1+k3, and k3=[log
2(k1)], symbol [] represents the computing of intercepting integral part;
Step M2, arranges joint in order by subdata information info1 and subdata information info3, obtains checking data information;
Step M3, calculates the MD5 value of described checking data information, obtains referential integrity proof test value H1;
Step M4, is sent to described target category-A node jointly by described data message and control information;
Wherein, described control information comprises the value of referential integrity proof test value H1 and k1 and k3;
For described target category-A node:
After the data message that this target category-A node receives described RFID reader and control information, perform following operation:
Step N1, extracts initial k1 byte and the last position k3 byte of described data message, arranges joint in order, obtain information to be verified;
Step N2, calculates the MD5 value of described information to be verified, obtains actual integrity check value H2;
Step N3, compares the referential integrity proof test value H1 calculated in the control information of described actual integrity check value H2 and the reception obtained; If both are identical, then described data message is by completeness check, by described data information memory to described target category-A node; Otherwise, described data message is abandoned, and sends transfer instruction again to described RFID reader.
Preferably, each category-B node self has an adjacent visit information list, for by visiting other category-B nodes with the category-B node that it is directly connected;
Described adjacent visit information list comprises following content:
(1) title of the category-B node be directly connected with current category-B node;
(2) physical address of the category-B node be directly connected with current category-B node, IP address;
(3) port numbers of the category-B node be directly connected with current category-B node;
(4) current category-B node and with the network bandwidth between its category-B node be directly connected;
(5) current category-B node and with the average connection setup time between its category-B node be directly connected;
(6) current category-B node and with the successful connection probability between its category-B node be directly connected;
(7) current category-B node and with the data transfer integrity probability between its category-B node be directly connected;
When an initial category-B node b1 to need in accesses network a target category-B node bn with its indirect connection, perform following operation:
Steps A 1, is set to described initial category-B node b1 by current category-B node initializing;
Steps A 2, inquires about all category-B nodes be directly connected with it in the adjacent visit information list of current category-B node b1;
If find described target category-B node bn, then return;
Otherwise, be each the category-B node be directly connected with described initial category-B node b1 successively by current category-B Node configuration; Correspondingly, steps A 3 is performed to each current category-B node that described initial category-B node b1 is directly connected;
Steps A 3, the adjacent visit information list of the category-B node adopting recursive algorithm inquiry to be directly connected with current category-B node, if find described target category-B node bn, then recurrence returns.
Preferably, if there is k bar access path L1, L2 between initial category-B node b1 and target category-B node bn ..., Lk, wherein, k be greater than 1 positive integer, then select the step of best access path as follows:
Step B1, calculates access path L1, L2 respectively ..., the summation W ' 1, W ' 2 of the network bandwidth between every two category-B nodes in Lk ..., W ' k;
According to every bar access path L1, L2 ..., the linking number in Lk, calculates the averaging network bandwidth W1 of every bar access path, W2 ..., Wk;
Wherein, the category-B number of nodes that the linking number in an access path is defined as in this access path deducts 1;
Step B2, calculates access path L1, L2 respectively ..., the summation T ' 1, T ' 2 of average connection setup time between every two category-B nodes in Lk ..., T ' k;
According to every bar access path L1, L2 ..., the linking number in Lk, calculates total connection setup time T1, the T2 of every bar access path ..., Tk;
Step B3, respectively by access path L1, L2 ..., the successful connection probability multiplication in Lk between every two category-B nodes, what obtain every bar access path connects into power C1, C2 ..., Ck;
Step B4, respectively by access path L1, L2 ..., the data transfer integrity probability multiplication in Lk between every two category-B nodes, obtains the data transmission percentage of head rice I1 of every bar access path, I2 ..., Ik;
Step 5, according to the data obtained in above-mentioned steps, calculates access path L1, L2 respectively ..., the assessment parameter Ф 1, Ф 2 of Lk ..., Ф k, the access path selecting assessment parameter value maximum is as best access path; Particularly, the computing formula of the assessment parameter Ф i of access path Li is as follows:
Фi＝lg(Wi+1)/lg(Ti+1)*(3Ci+2Ii)
2；
Wherein, i is positive integer, and 1≤i≤k.
Above embodiment is only for illustration of the present invention; and be not limitation of the present invention; the those of ordinary skill of relevant technical field; without departing from the spirit and scope of the present invention; can also make a variety of changes and modification; therefore all equivalent technical schemes also belong to category of the present invention, and scope of patent protection of the present invention should be defined by the claims.
Claims (6)
1., based on an information processing method for Internet of Things, described Internet of Things comprises RFID label tag, RFID reader and multiple network node; The network node directly connecting described RFID reader is called category-A node, the network node directly not connecting described RFID reader is called category-B node, it is characterized in that:
Described RFID label tag stores the coded message of article or service in Internet of Things;
Described RFID reader reads the data message in described RFID label tag, and read data message is sent to a category-A node;
Described category-A node is forwarded to a category-B node after the data message received from described RFID reader is carried out format conversion;
Described category-B node stores the data message from described category-A node; Further, described category-B node can read the data message stored in other category-B nodes.
2. method according to claim 1, is characterized in that:
After described RFID reader reads the data message in described RFID label tag, and before read data message is sent to a category-A node, first need the quantity judging the category-A node that this RFID reader can be connected to;
If this quantity is 1, then directly determines the target category-A node of this category-A node as data information transfer, upload the data message that current RFID reader reads;
If this quantity is greater than 1, then select one of them category-A node as the target category-A node of data information transfer in the following manner, upload the data message that current RFID reader reads, concrete steps are as follows:
Step S1, selects the test data s of regular length; Setup times threshold value t1, time threshold t2;
Step S2, for each category-A node that current RFID reader can be connected to, performs step S2.1 and step S2.2 successively, particularly:
Step S2.1, sends described test data s to current category-A node, obtains the response time t that current category-A node starts to receive data;
Step S2.2, record current category-A node from receive described test data s until complete described test data s all transmit consumed data transmission period Δ t;
Step S3, judges in the category-A node that current RFID reader can be connected to, and the response time t of all category-A nodes is all more than or equal to described time threshold t2;
If so, step S4 is performed;
Otherwise, reject the category-A node that response time t is more than or equal to described time threshold t2; Then judge now whether only remain a category-A node; If so, then this category-A node is defined as target category-A node, terminates;
Step S4, judges in the category-A node that current RFID reader can be connected to, and the data transmission period Δ t of all category-A nodes is all more than or equal to described time threshold t1;
If so, step S5 is performed;
Otherwise, reject the category-A node that data transmission period Δ t is more than or equal to described time threshold t1; Then judge now whether only remain a category-A node; If so, then this category-A node is defined as target category-A node, terminates;
Step S5, calculates the arithmetic mean t_avg of the response time t of remaining all category-A nodes; And calculate the arithmetic mean Δ t_avg of the data transmission period Δ t of remaining all category-A nodes;
Step S6, for remaining each category-A node, calculate the generalized time parameter value t ' of this category-A node successively, specific formula for calculation is as follows:
t’＝λ*|t-t_avg|
1/2*log
2|1+Δt-Δt_avg|
Wherein, λ is the constant preset;
Step S7, in remaining all category-A nodes, selects the category-A node that generalized time parameter value t ' is minimum, is defined as target category-A node.
3. method according to claim 2, is characterized in that:
After described RFID reader determination target category-A node, also need to carry out authentication between described RFID reader and described target category-A node; Suppose that the name of computing machine or other computing terminals be directly connected with described RFID reader is called node R 1, the name of described target category-A node is called node R 2, then authentication process itself is as follows:
Step U1, node R 2 generates a random number Q, sends it to node R 1;
Step U2, node R 1 generates private key Ks and two PKI Ka and Kb after receiving the random number Q of node R 2 generation;
Wherein, (Ka)
2+ (Kb)
2=Q
2;
Then, PKI Ka and Kb is returned to node R 2 by node R 1;
Step U3, node R 2 is verified it after receiving PKI Ka and Kb;
If (Ka)
2+ (Kb)
2≠ Q
2, then authentication failure, stops communication;
Otherwise Ka and Kb that use public-key respectively is encrypted Q, enciphered data E (Ka) and E (Kb) is sent to node R 1;
Step U4, node R 1 utilizes private key Ks to the enciphered data E received (Ka) and E (Kb) deciphering, if decrypted result is all Q, then authentication is passed through, and shows can carry out normal data transmission between node R 1 and node R 2; Otherwise authentication failure, stops communication;
Step U5, if the failure of above-mentioned authentication process itself, then reselects a target category-A node, performs above-mentioned steps U1 ~ step U4, until determine one can by the target category-A node of authentication, to realize the transmission of described data message.
4. method according to claim 3, is characterized in that:
Complete authentication between described RFID reader and described target category-A node after, read data message is sent to described target category-A node by described RFID reader in the following manner, particularly:
For described RFID reader:
This RFID reader, before read data message is sent to target category-A node, performs following operation:
Step M1, is divided into three sections by described data message, is respectively subdata information info1, subdata information info2 and subdata information info3, and the length of above-mentioned three cross-talk data messages is respectively k1 byte, k2 byte, k3 byte; Above-mentioned three cross-talk data messages are arranged joint in order and can obtain described data message;
Wherein, k2>k1+k3, and k3=[log
2(k1)], symbol [] represents the computing of intercepting integral part;
Step M2, arranges joint in order by subdata information info1 and subdata information info3, obtains checking data information;
Step M3, calculates the MD5 value of described checking data information, obtains referential integrity proof test value H1;
Step M4, is sent to described target category-A node jointly by described data message and control information;
Wherein, described control information comprises the value of referential integrity proof test value H1 and k1 and k3;
For described target category-A node:
After the data message that this target category-A node receives described RFID reader and control information, perform following operation:
Step N1, extracts initial k1 byte and the last position k3 byte of described data message, arranges joint in order, obtain information to be verified;
Step N2, calculates the MD5 value of described information to be verified, obtains actual integrity check value H2;
Step N3, compares the referential integrity proof test value H1 calculated in the control information of described actual integrity check value H2 and the reception obtained; If both are identical, then described data message is by completeness check, by described data information memory to described target category-A node; Otherwise, described data message is abandoned, and sends transfer instruction again to described RFID reader.
5. method according to claim 4, is characterized in that:
Each category-B node self has an adjacent visit information list, for by visiting other category-B nodes with the category-B node that it is directly connected;
Described adjacent visit information list comprises following content:
(1) title of the category-B node be directly connected with current category-B node;
(2) physical address of the category-B node be directly connected with current category-B node, IP address;
(3) port numbers of the category-B node be directly connected with current category-B node;
(4) current category-B node and with the network bandwidth between its category-B node be directly connected;
(5) current category-B node and with the average connection setup time between its category-B node be directly connected;
(6) current category-B node and with the successful connection probability between its category-B node be directly connected;
(7) current category-B node and with the data transfer integrity probability between its category-B node be directly connected;
When an initial category-B node b1 to need in accesses network a target category-B node bn with its indirect connection, perform following operation:
Steps A 1, is set to described initial category-B node b1 by current category-B node initializing;
Steps A 2, inquires about all category-B nodes be directly connected with it in the adjacent visit information list of current category-B node b1;
If find described target category-B node bn, then return;
Otherwise, be each the category-B node be directly connected with described initial category-B node b1 successively by current category-B Node configuration; Correspondingly, steps A 3 is performed to each current category-B node that described initial category-B node b1 is directly connected;
Steps A 3, the adjacent visit information list of the category-B node adopting recursive algorithm inquiry to be directly connected with current category-B node, if find described target category-B node bn, then recurrence returns.
6. method according to claim 5, is characterized in that:
If there is k bar access path L1, L2 between initial category-B node b1 and target category-B node bn ..., Lk, wherein, k be greater than 1 positive integer, then select the step of best access path as follows:
Step B1, calculates access path L1, L2 respectively ..., the summation W ' 1, W ' 2 of the network bandwidth between every two category-B nodes in Lk ..., W ' k;
According to every bar access path L1, L2 ..., the linking number in Lk, calculates the averaging network bandwidth W1 of every bar access path, W2 ..., Wk;
Wherein, the category-B number of nodes that the linking number in an access path is defined as in this access path deducts 1;
Step B2, calculates access path L1, L2 respectively ..., the summation T ' 1, T ' 2 of average connection setup time between every two category-B nodes in Lk ..., T ' k;
According to every bar access path L1, L2 ..., the linking number in Lk, calculates total connection setup time T1, the T2 of every bar access path ..., Tk;
Step B3, respectively by access path L1, L2 ..., the successful connection probability multiplication in Lk between every two category-B nodes, what obtain every bar access path connects into power C1, C2 ..., Ck;
Step B4, respectively by access path L1, L2 ..., the data transfer integrity probability multiplication in Lk between every two category-B nodes, obtains the data transmission percentage of head rice I1 of every bar access path, I2 ..., Ik;
Step 5, according to the data obtained in above-mentioned steps, calculates access path L1, L2 respectively ..., the assessment parameter Ф 1, Ф 2 of Lk ..., Ф k, the access path selecting assessment parameter value maximum is as best access path; Particularly, the computing formula of the assessment parameter Ф i of access path Li is as follows:
Фi＝lg(Wi+1)/lg(Ti+1)*(3Ci+2Ii)
2；
Wherein, i is positive integer, and 1≤i≤k.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510152857.XA CN104700137B (en) | 2015-04-01 | 2015-04-01 | A kind of information processing method based on Internet of Things |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510152857.XA CN104700137B (en) | 2015-04-01 | 2015-04-01 | A kind of information processing method based on Internet of Things |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104700137A true CN104700137A (en) | 2015-06-10 |
| CN104700137B CN104700137B (en) | 2017-11-07 |
Family
ID=53347234
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510152857.XA Expired - Fee Related CN104700137B (en) | 2015-04-01 | 2015-04-01 | A kind of information processing method based on Internet of Things |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104700137B (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108965477A (en) * | 2018-08-30 | 2018-12-07 | 广元量知汇科技有限公司 | forestry internet of things system |
| CN110119646A (en) * | 2018-02-07 | 2019-08-13 | 深圳市帝迈生物技术有限公司 | Device parameter setting method and system based on radio-frequency card |
| CN113055345A (en) * | 2019-12-27 | 2021-06-29 | 中国移动通信集团湖南有限公司 | Block chain-based data security authentication method and device |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1556624A (en) * | 2003-12-31 | 2004-12-22 | П | Adaptive selection method of data transmission mode in ethernet redundance network system |
| 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 |
| CN101197845A (en) * | 2006-12-05 | 2008-06-11 | 国际商业机器公司 | Middleware for query processing across a network of rfid databases |
| CN101917270A (en) * | 2010-08-03 | 2010-12-15 | 中国科学院软件研究所 | Weak authentication and key agreement method based on symmetrical password |
| CN102123471A (en) * | 2010-12-15 | 2011-07-13 | 北京理工大学 | Stub network of Internet of things and seepage data transmission method thereof |
| CN102164369A (en) * | 2011-05-13 | 2011-08-24 | 南京邮电大学 | Method for broadcast authentication of wireless sensor network based on automaton and game of life |
-
2015
- 2015-04-01 CN CN201510152857.XA patent/CN104700137B/en not_active Expired - Fee Related
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| 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 |
| CN1556624A (en) * | 2003-12-31 | 2004-12-22 | П | Adaptive selection method of data transmission mode in ethernet redundance network system |
| CN101197845A (en) * | 2006-12-05 | 2008-06-11 | 国际商业机器公司 | Middleware for query processing across a network of rfid databases |
| CN101917270A (en) * | 2010-08-03 | 2010-12-15 | 中国科学院软件研究所 | Weak authentication and key agreement method based on symmetrical password |
| CN102123471A (en) * | 2010-12-15 | 2011-07-13 | 北京理工大学 | Stub network of Internet of things and seepage data transmission method thereof |
| CN102164369A (en) * | 2011-05-13 | 2011-08-24 | 南京邮电大学 | Method for broadcast authentication of wireless sensor network based on automaton and game of life |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110119646A (en) * | 2018-02-07 | 2019-08-13 | 深圳市帝迈生物技术有限公司 | Device parameter setting method and system based on radio-frequency card |
| CN110119646B (en) * | 2018-02-07 | 2024-01-26 | 深圳市帝迈生物技术有限公司 | Device parameter setting method and system based on radio frequency card |
| CN108965477A (en) * | 2018-08-30 | 2018-12-07 | 广元量知汇科技有限公司 | forestry internet of things system |
| CN113055345A (en) * | 2019-12-27 | 2021-06-29 | 中国移动通信集团湖南有限公司 | Block chain-based data security authentication method and device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104700137B (en) | 2017-11-07 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Gao et al. | Privacy-preserving auction for big data trading using homomorphic encryption | |
| Roos et al. | Settling payments fast and private: Efficient decentralized routing for path-based transactions | |
| Aitzhan et al. | Security and privacy in decentralized energy trading through multi-signatures, blockchain and anonymous messaging streams | |
| CN110602239B (en) | Block chain information storage method and related equipment | |
| CN111740966B (en) | Data processing method based on block chain network and related equipment | |
| Zanetti et al. | Privacy-preserving clone detection for RFID-enabled supply chains | |
| CN110599174B (en) | Block chain information processing method and related equipment | |
| Li et al. | IoT device location information storage system based on blockchain | |
| Papageorgiou et al. | DPKI: a blockchain-based decentralized public key infrastructure system | |
| CN114638625B (en) | Big data-based agricultural whole industry chain traceability method and system and cloud platform | |
| CN104700137A (en) | Information processing method based on Internet of Things | |
| CN111367923A (en) | Data processing method, data processing device, node equipment and storage medium | |
| CN104869567A (en) | Information processing method based on intelligent terminals of internet of things | |
| Islam et al. | Integrating blockchain into supply chain safeguarded by PUF-enabled RFID | |
| Samuel et al. | GarliChain: A privacy preserving system for smart grid consumers using blockchain | |
| JPH09261220A (en) | Virtual authentification network for maintenance processor | |
| Asfia et al. | A blockchain construct for energy trading against sybil attacks | |
| Kumar et al. | Ultra-lightweight blockchain-enabled RFID authentication protocol for supply chain in the domain of 5G mobile edge computing | |
| Wang | Sok: Applying blockchain technology in industrial internet of things | |
| CN110620776A (en) | Data transfer information transmission method and device | |
| CN114338527A (en) | IPv6 active identifier processing method and system | |
| CN104767749A (en) | Information processing method based on wireless Internet of Things | |
| Zhang et al. | Low-overhead routing for offchain networks with high resource utilization | |
| Lee et al. | A new privacy-preserving path authentication scheme using RFID for supply chain management | |
| Moradi et al. | Enhancing security on social networks with IoT-based blockchain hierarchical structures with Markov chain |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| CB03 | Change of inventor or designer information |
Inventor after: Jiang Guojian Inventor before: Wang Meiting |
|
| CB03 | Change of inventor or designer information | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20170930 Address after: 350000 2-57D room, 1 floor, No. 27 Lake Road, Mawei District, Fujian, Fuzhou province (FTA test area) Applicant after: FUZHOU HUANYA ZHONGZHI COMPUTER Co.,Ltd. Address before: West high tech Zone Fucheng Road in Chengdu city of Sichuan province 610000 399 No. 6 Building 1 unit 6 floor No. 6 Applicant before: CHENGDU YICHEN DEXUN TECHNOLOGY Co.,Ltd. |
|
| TA01 | Transfer of patent application right | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20171107 |