CN104700137B - A kind of information processing method based on Internet of Things - Google Patents
A kind of information processing method based on Internet of Things Download PDFInfo
- Publication number
- CN104700137B CN104700137B CN201510152857.XA CN201510152857A CN104700137B CN 104700137 B CN104700137 B CN 104700137B CN 201510152857 A CN201510152857 A CN 201510152857A CN 104700137 B CN104700137 B CN 104700137B
- Authority
- CN
- China
- Prior art keywords
- node
- class
- class nodes
- classes
- nodes
- 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.)
- Expired - Fee Related
Links
- 230000010365 information processing Effects 0.000 title claims abstract description 7
- 238000003672 processing method Methods 0.000 title claims abstract description 7
- 238000012546 transfer Methods 0.000 claims abstract description 23
- 238000006243 chemical reaction Methods 0.000 claims abstract description 4
- 230000005540 biological transmission Effects 0.000 claims description 17
- 230000004044 response Effects 0.000 claims description 12
- 238000012360 testing method Methods 0.000 claims description 12
- 238000000034 method Methods 0.000 claims description 11
- 238000004891 communication Methods 0.000 claims description 6
- 230000008569 process Effects 0.000 claims description 6
- 238000012795 verification Methods 0.000 claims description 6
- 208000032366 Oversensing Diseases 0.000 claims description 5
- 238000004364 calculation method Methods 0.000 claims description 5
- 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
- 239000000284 extract Substances 0.000 claims description 3
- 235000009566 rice Nutrition 0.000 claims description 3
- 238000005516 engineering process Methods 0.000 description 3
- 238000010276 construction Methods 0.000 description 2
- 235000007926 Craterellus fallax Nutrition 0.000 description 1
- 240000007175 Datura inoxia Species 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 present invention provides a kind of information processing method based on Internet of Things, and the Internet of Things includes RFID tag, RFID reader, multiple network nodes；Directly/network node of RFID reader described in indirect connection is referred to as A/B class nodes.RFID reader reads the data message in RFID tag, sends it to an A class node；A classes node is forwarded to a B class node by after the data message form conversion of reception；B classes node stores the data message from A class nodes, and can read the data message stored in other B class nodes.The solution of the present invention can be effectively treated to the information under environment of internet of things, and effective authentication is carried out to the node in Internet of Things, improve the security of data information transfer.
Description
Technical field
The present invention relates to internet of things field, more particularly to a kind of information processing method based on Internet of Things.
Background technology
Internet of Things is a kind of special network, and it combines the internet of information age and traditional object
Come so that object becomes intelligent main body, and calculating and storage resource of the application of daily life by internet, becomes more
Plus convenience and high-efficiency, trigger the major transformation in internet and the big field of practical application two.As Internet technology increasingly incorporates
To traditional application, Internet of Things is also increasingly taken seriously, and technology of Internet of things also more and more appears in various business applications
In, greatly improve the efficiency and commercial profit of enterprise.
It is exactly to set up the Item Information that can be realized in a global range Real-Time Sharing that Internet of Things, which sets up initial purpose,
Network so that article positioning in the world, tracking and other information inquiry etc. are realized under existing the Internet architecture
Target.Internet of Things is exactly a huge information sharing and information exchange network, it is intended to provide more horn of plenty and convenient for people
Information service.The characteristics of due to Internet of Things itself, what its scale can be bigger than existing internet is more, and it is by the information content of generation
It is big also to well imagine.Therefore, under Internet of Things application environment, how efficiently, reliably organize and storage information, and be user
It is a urgent problem to be solved to provide easily information service；Meanwhile, how effective body is carried out to the node in Internet of Things
Part certification, improves the security of data information transfer, is also an important problem.
The content of the invention
It is a primary object of the present invention to realize reading, the forwarding of article or the data message of service in Internet of Things, and
Safe transmission of the data message between multiple Internet of things node.At a kind of information based on Internet of Things
Reason method.
Technical scheme is as follows：
A kind of information processing method based on Internet of Things, the Internet of Things include RFID tag, RFID reader and
Multiple network nodes；The network node for being directly connected to the RFID reader is referred to as A class nodes, will be not directly connected described
The network node of RFID reader is referred to as B class nodes, it is characterised in that：
Article or the coding information of service in the RFID tag storage Internet of Things；
The RFID reader reads the data message in the RFID tag, and the data message read is sent to
One A class node；
The A classes node enters the data message received from the RFID reader after row format conversion, is forwarded
To a B class node；
The B classes node stores the data message from the A classes node；Also, the B classes node can read other
The data message stored in B class nodes.
Preferably, after the data message that the RFID reader reads in the RFID tag, and it will read
The data message taken is sent to before an A class node, it is necessary first to judge the A class nodes that the RFID reader is connectable to
Quantity；
If the quantity is 1, directly determine that the A classes node, as the target A class nodes of data information transfer, is uploaded and worked as
The data message that preceding RFID reader is read；
If the quantity is more than 1, one of A classes node is selected in the following manner as data information transfer
Target A class nodes, upload the data message that current RFID reader is read, comprise the following steps that：
Step S1, selects the test data s of regular length；Time threshold t1, time threshold t2 are set；
Step S2, each A classes node being connectable to for current RFID reader performs step S2.1 and step successively
Rapid S2.2, specifically：
Step S2.1, the test data s is sent to current A classes node, is obtained current A classes node and is started to receive data
Response time t；
Step S2.2, records current A classes node from starting to receive the test data s up to completing the test data s
All transmit consumed data transmission period Δ t；
Step S3, judges in the A class nodes that current RFID reader is connectable to, if the response of all A classes nodes
Time t is all higher than or equal to the time threshold t2；
If so, performing step S4；
Otherwise, A class node of response time t more than or equal to the time threshold t2 is rejected；Then judge now whether
An only remaining A class node；If so, the A class nodes then are defined as into target A class nodes, terminate；
Step S4, judges in the A class nodes that current RFID reader is connectable to, if the data of all A classes nodes
Transmission time Δ t is all higher than or equal to the time threshold t1；
If so, performing step S5；
Otherwise, the A class nodes that data transmission period Δ t is more than or equal to the time threshold t1 are rejected；Then this is judged
When whether an only remaining A class node；If so, the A class nodes then are defined as into target A class nodes, terminate；
Step S5, calculates the response time t of remaining all A classes nodes arithmetic mean of instantaneous value t_avg；And calculate residue
All A classes nodes data transmission period Δ t arithmetic mean of instantaneous value Δ t_avg；
Step S6, for remaining each A classes node, calculates the generalized time parameter value t ' of the A class nodes, specifically successively
Calculation formula is as follows：
T '=λ * | t-t_avg |1/2*log2|1+Δt-Δt_avg|
Wherein, λ is constant set in advance；
Step S7, in remaining all A classes nodes, a minimum selection generalized time parameter value t ' A class node will
It is defined as target A class nodes.
Preferably, after the RFID reader determines target A class nodes, in addition it is also necessary in the RFID reader and institute
State and carry out authentication between target A class nodes；Assuming that the computer being directly connected to the RFID reader or other calculating
The entitled node R 1 of terminal, the entitled node R 2 of the target A class nodes, 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 is received after the random number Q of the generation of node R 2, one private key Ks of generation and two public key Ka and
Kb；
Wherein, (Ka)2+(Kb)2=Q2；
Then, public key Ka and Kb are returned to node R 2 by node R 1；
Step U3, node R 2 is verified after receiving public key Ka and Kb to it；
If (Ka)2+(Kb)2≠Q2, then authentication failure, termination communication；
Otherwise, Q is encrypted using public key Ka and Kb respectively, encryption data E (Ka) and E (Kb) is sent to node
R1；
Step U4, node R 1 is decrypted using private key Ks to the encryption data E (Ka) and E (Kb) that receive, if decrypted result
All it is Q, then authentication passes through, shows that normal data transfer can be carried out between node R 1 and node R 2；Otherwise, identity is tested
Card failure, terminates communication；
Step U5, if above-mentioned authentication process itself fails, reselects a target A class node, performs above-mentioned step
Rapid U1~step U4, until determine one can be by the target A class nodes of authentication, to realize the biography of the data message
It is defeated.
Preferably, between the RFID reader and the target A class nodes after completion authentication, the RFID
The data message read is sent to the target A class nodes by reader in the following manner, specifically：
For the RFID reader：
The RFID reader performs following operate before the data message read to be sent to target A class nodes：
Step M1, three sections, respectively subdata information info1, subdata information are divided into by the data message
Info2 and subdata information info3, the length of above-mentioned three cross-talks data message is respectively k1 bytes, k2 bytes, k3 bytes；
Above-mentioned three cross-talks data message is arranged into engagement in order can obtain the data message；
Wherein, k2>K1+k3, and k3=[log2(k1)], symbol [] represents interception integer part computing；
Step M2, engagement is arranged by subdata information info1 and subdata information info3 in order, obtains verification data
Information；
Step M3, calculates the MD5 values of the verification data information, obtains referential integrity check value H1；
Step M4, the data message and control information are sent to the target A class nodes jointly；
Wherein, the control information includes referential integrity check value H1 and k1 and k3 value；
For the target A class nodes：
Target A class nodes are received after the data message and control information of the RFID reader, perform following operate：
Step N1, extracts the starting k1 bytes and last position k3 bytes of the data message, arrangement engagement, is treated in order
Check information；
Step N2, calculates the MD5 values of the information to be verified, obtains actual integrity check value H2；
Step N3 is complete by the reference in the control information for calculating the actual integrity check value H2 and reception obtained
Property check value H1 is compared；If both are identical, the data message is deposited the data message by completeness check
Store up the target A class nodes；Otherwise, the data message is abandoned, and transmission again is sent to the RFID reader and referred to
Order.
Preferably, each B classes node itself has adjacent access information list, for by directly connecting
B classes node accesses other B class nodes；
The adjacent access information list includes herein below：
(1) title for the B class nodes being directly connected to current B classes node；
(2) physical address for the B class nodes being directly connected to current B classes node, IP address；
(3) port numbers for the B class nodes being directly connected to current B classes node；
(4) network bandwidth between current B classes node and directly connected B class nodes；
(5) the average connection setup time between current B classes node and directly connected B class nodes；
(6) the successful connection probability between current B classes node and directly connected B class nodes；
(7) the data transfer integrity probability between current B classes node and directly connected B class nodes；
When one, which originates B class nodes b1, needs to access in network one with the target B class node bn of its indirect connection,
Perform following operate：
Step A1, the starting B class nodes b1 is set to by current B classes node initializing；
Step A2, inquires about all B class sections directly connected in current B classes node b1 adjoining access information list
Point；
If it find that the target B classes node bn, then return；
Otherwise, current B classes node is set to each B class section for being directly connected to the starting B class nodes b1 successively
Point；Correspondingly, couple each current B classes node execution step A3 being directly connected to the starting B class nodes b1；
Step A3, the adjoining access information for inquiring about the B class nodes being directly connected to current B classes node using recursive algorithm is arranged
Table, if it find that the target B classes node bn, then recurrence return.
Preferably, if there is k bar access path L1, L2 ... between starting B class node b1 and target B class nodes bn,
Lk, wherein, k is greater than 1 positive integer, then the step of selecting optimal access path is as follows：
Step B1, calculates the summation W ' of the network bandwidth between each two B class nodes in access path L1, L2 ..., Lk respectively
1, W ' 2 ..., W ' k；
According to the connection number in every access path L1, L2 ..., Lk, the averaging network bandwidth of every access path is calculated
W1, W2 ..., Wk；
Wherein, the B class number of nodes that the connection number in an access path is defined as in the access path subtracts 1；
Step B2, calculates the connection setup time that is averaged in access path L1, L2 ..., Lk between each two B class nodes respectively
Summation T ' 1, T ' 2 ..., T ' k；
According to the connection number in every access path L1, L2 ..., Lk, when the total connection for calculating every access path is set up
Between T1, T2 ..., Tk；
Step B3, respectively by access path L1, L2 ..., the successful connection probability phase in Lk between each two B class nodes
Multiply, obtain every access path connects into power C1, C2 ..., Ck；
Step B4, respectively by access path L1, L2 ..., the data transfer integrity in Lk between each two B class nodes is general
Rate is multiplied, and obtains data transfer the percentage of head rice I1, I2 ..., Ik of every access path；
Step 5, according to the data obtained in above-mentioned steps, access path L1, L2 ..., Lk overall merit are calculated respectively
Parameter Ф 1, Ф 2 ..., Ф k, the maximum access path of selection assessment parameter value are used as optimal access path；Specifically, visit
Ask the way footpath Li assessment parameter Ф i calculation formula it 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 advantages below in technical scheme：
First, there is provided convenient for the information that technical scheme efficiently, reliably can be organized and store in Internet of Things
Internet of Things information service；
Second, technical scheme has used the safe practice of identity-based checking and data integrity verifying,
Substantially increase the safety and reliability of data transfer；
3rd, technical scheme is combined various for the selection course of distributed routed path in Internet of Things
Factor, optimizes Path selection.
Brief description of the drawings
Technical scheme in order to illustrate the embodiments of the present invention more clearly, institute in being described below to the embodiment of the present invention
The accompanying drawing needed to use is briefly described, it should be apparent that, drawings in the following description are only some implementations of the present invention
Example, for those of ordinary skill in the art, without having to pay creative labor, can also be according to the accompanying drawing
Obtain other accompanying drawings.
Fig. 1 is the system construction drawing according to the embodiment of the present invention.
Embodiment
The exemplary embodiment of the disclosure is more fully described below with reference to accompanying drawings.Although showing the disclosure in accompanying drawing
Exemplary embodiment, it being understood, however, that may be realized in various forms the disclosure without should be by embodiments set forth here
Limited.On the contrary, these embodiments are provided to facilitate a more thoroughly understanding of the present invention, and can be by the scope of the present disclosure
Complete conveys to those skilled in the art.
Fig. 1 is the system construction drawing according to the embodiment of the present invention.
Shown in reference picture 1, a kind of information processing method based on Internet of Things, the Internet of Things include RFID tag,
RFID reader and multiple network nodes；The network node for being directly connected to the RFID reader is referred to as A class nodes, will
The network node for the RFID reader that is not directly connected is referred to as B class nodes, it is characterised in that：
Article or the coding information of service in the RFID tag storage Internet of Things；
The RFID reader reads the data message in the RFID tag, and the data message read is sent to
One A class node；
The A classes node enters the data message received from the RFID reader after row format conversion, is forwarded
To a B class node；
The B classes node stores the data message from the A classes node；Also, the B classes node can read other
The data message stored in B class nodes.
Preferably, after the data message that the RFID reader reads in the RFID tag, and it will read
The data message taken is sent to before an A class node, it is necessary first to judge the A class nodes that the RFID reader is connectable to
Quantity；
If the quantity is 1, directly determine that the A classes node, as the target A class nodes of data information transfer, is uploaded and worked as
The data message that preceding RFID reader is read；
If the quantity is more than 1, one of A classes node is selected in the following manner as data information transfer
Target A class nodes, upload the data message that current RFID reader is read, comprise the following steps that：
Step S1, selects the test data s of regular length；Time threshold t1, time threshold t2 are set；
Step S2, each A classes node being connectable to for current RFID reader performs step S2.1 and step successively
Rapid S2.2, specifically：
Step S2.1, the test data s is sent to current A classes node, is obtained current A classes node and is started to receive data
Response time t；
Step S2.2, records current A classes node from starting to receive the test data s up to completing the test data s
All transmit consumed data transmission period Δ t；
Step S3, judges in the A class nodes that current RFID reader is connectable to, if the response of all A classes nodes
Time t is all higher than or equal to the time threshold t2；
If so, performing step S4；
Otherwise, A class node of response time t more than or equal to the time threshold t2 is rejected；Then judge now whether
An only remaining A class node；If so, the A class nodes then are defined as into target A class nodes, terminate；
Step S4, judges in the A class nodes that current RFID reader is connectable to, if the data of all A classes nodes
Transmission time Δ t is all higher than or equal to the time threshold t1；
If so, performing step S5；
Otherwise, the A class nodes that data transmission period Δ t is more than or equal to the time threshold t1 are rejected；Then this is judged
When whether an only remaining A class node；If so, the A class nodes then are defined as into target A class nodes, terminate；
Step S5, calculates the response time t of remaining all A classes nodes arithmetic mean of instantaneous value t_avg；And calculate residue
All A classes nodes data transmission period Δ t arithmetic mean of instantaneous value Δ t_avg；
Step S6, for remaining each A classes node, calculates the generalized time parameter value t ' of the A class nodes, specifically successively
Calculation formula is as follows：
T '=λ * | t-t_avg |1/2*log2|1+Δt-Δt_avg|
Wherein, λ is constant set in advance；
Step S7, in remaining all A classes nodes, a minimum selection generalized time parameter value t ' A class node will
It is defined as target A class nodes.
Preferably, after the RFID reader determines target A class nodes, in addition it is also necessary in the RFID reader and institute
State and carry out authentication between target A class nodes；Assuming that the computer being directly connected to the RFID reader or other calculating
The entitled node R 1 of terminal, the entitled node R 2 of the target A class nodes, 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 is received after the random number Q of the generation of node R 2, one private key Ks of generation and two public key Ka and
Kb；
Wherein, (Ka)2+(Kb)2=Q2；
Then, public key Ka and Kb are returned to node R 2 by node R 1；
Step U3, node R 2 is verified after receiving public key Ka and Kb to it；
If (Ka)2+(Kb)2≠Q2, then authentication failure, termination communication；
Otherwise, Q is encrypted using public key Ka and Kb respectively, encryption data E (Ka) and E (Kb) is sent to node
R1；
Step U4, node R 1 is decrypted using private key Ks to the encryption data E (Ka) and E (Kb) that receive, if decrypted result
All it is Q, then authentication passes through, shows that normal data transfer can be carried out between node R 1 and node R 2；Otherwise, identity is tested
Card failure, terminates communication；
Step U5, if above-mentioned authentication process itself fails, reselects a target A class node, performs above-mentioned step
Rapid U1~step U4, until determine one can be by the target A class nodes of authentication, to realize the biography of the data message
It is defeated.
Preferably, between the RFID reader and the target A class nodes after completion authentication, the RFID
The data message read is sent to the target A class nodes by reader in the following manner, specifically：
For the RFID reader：
The RFID reader performs following operate before the data message read to be sent to target A class nodes：
Step M1, three sections, respectively subdata information info1, subdata information are divided into by the data message
Info2 and subdata information info3, the length of above-mentioned three cross-talks data message is respectively k1 bytes, k2 bytes, k3 bytes；
Above-mentioned three cross-talks data message is arranged into engagement in order can obtain the data message；
Wherein, k2>K1+k3, and k3=[log2(k1)], symbol [] represents interception integer part computing；
Step M2, engagement is arranged by subdata information info1 and subdata information info3 in order, obtains verification data
Information；
Step M3, calculates the MD5 values of the verification data information, obtains referential integrity check value H1；
Step M4, the data message and control information are sent to the target A class nodes jointly；
Wherein, the control information includes referential integrity check value H1 and k1 and k3 value；
For the target A class nodes：
Target A class nodes are received after the data message and control information of the RFID reader, perform following operate：
Step N1, extracts the starting k1 bytes and last position k3 bytes of the data message, arrangement engagement, is treated in order
Check information；
Step N2, calculates the MD5 values of the information to be verified, obtains actual integrity check value H2；
Step N3 is complete by the reference in the control information for calculating the actual integrity check value H2 and reception obtained
Property check value H1 is compared；If both are identical, the data message is deposited the data message by completeness check
Store up the target A class nodes；Otherwise, the data message is abandoned, and transmission again is sent to the RFID reader and referred to
Order.
Preferably, each B classes node itself has adjacent access information list, for by directly connecting
B classes node accesses other B class nodes；
The adjacent access information list includes herein below：
(1) title for the B class nodes being directly connected to current B classes node；
(2) physical address for the B class nodes being directly connected to current B classes node, IP address；
(3) port numbers for the B class nodes being directly connected to current B classes node；
(4) network bandwidth between current B classes node and directly connected B class nodes；
(5) the average connection setup time between current B classes node and directly connected B class nodes；
(6) the successful connection probability between current B classes node and directly connected B class nodes；
(7) the data transfer integrity probability between current B classes node and directly connected B class nodes；
When one, which originates B class nodes b1, needs to access in network one with the target B class node bn of its indirect connection,
Perform following operate：
Step A1, the starting B class nodes b1 is set to by current B classes node initializing；
Step A2, inquires about all B class sections directly connected in current B classes node b1 adjoining access information list
Point；
If it find that the target B classes node bn, then return；
Otherwise, current B classes node is set to each B class section for being directly connected to the starting B class nodes b1 successively
Point；Correspondingly, couple each current B classes node execution step A3 being directly connected to the starting B class nodes b1；
Step A3, the adjoining access information for inquiring about the B class nodes being directly connected to current B classes node using recursive algorithm is arranged
Table, if it find that the target B classes node bn, then recurrence return.
Preferably, if there is k bar access path L1, L2 ... between starting B class node b1 and target B class nodes bn,
Lk, wherein, k is greater than 1 positive integer, then the step of selecting optimal access path is as follows：
Step B1, calculates the summation W ' of the network bandwidth between each two B class nodes in access path L1, L2 ..., Lk respectively
1, W ' 2 ..., W ' k；
According to the connection number in every access path L1, L2 ..., Lk, the averaging network bandwidth of every access path is calculated
W1, W2 ..., Wk；
Wherein, the B class number of nodes that the connection number in an access path is defined as in the access path subtracts 1；
Step B2, calculates the connection setup time that is averaged in access path L1, L2 ..., Lk between each two B class nodes respectively
Summation T ' 1, T ' 2 ..., T ' k；
According to the connection number in every access path L1, L2 ..., Lk, when the total connection for calculating every access path is set up
Between T1, T2 ..., Tk；
Step B3, respectively by access path L1, L2 ..., the successful connection probability phase in Lk between each two B class nodes
Multiply, obtain every access path connects into power C1, C2 ..., Ck；
Step B4, respectively by access path L1, L2 ..., the data transfer integrity in Lk between each two B class nodes is general
Rate is multiplied, and obtains data transfer the percentage of head rice I1, I2 ..., Ik of every access path；
Step 5, according to the data obtained in above-mentioned steps, access path L1, L2 ..., Lk overall merit are calculated respectively
Parameter Ф 1, Ф 2 ..., Ф k, the maximum access path of selection assessment parameter value are used as optimal access path；Specifically, visit
Ask the way footpath Li assessment parameter Ф i calculation formula it is as follows：
Ф i=lg (Wi+1)/lg (Ti+1) * (3Ci+2Ii)2；
Wherein, i is positive integer, and 1≤i≤k.
Embodiment of above is merely to illustrate the present invention, and not limitation of the present invention, about the common of technical field
Technical staff, without departing from the spirit and scope of the present invention, can also make a variety of changes and modification, therefore all
Equivalent technical scheme falls within scope of the invention, and scope of patent protection of the invention should be defined by the claims.
Claims (5)
1. a kind of information processing method based on Internet of Things, the Internet of Things includes RFID tag, RFID reader, Yi Jiduo
Individual network node；The network node for being directly connected to the RFID reader is referred to as A class nodes, will be not directly connected the RFID
The network node of reader is referred to as B class nodes, it is characterised in that：
Article or the coding information of service in the RFID tag storage Internet of Things；
The RFID reader reads the data message in the RFID tag, and the data message read is sent into one
A class nodes；
The A classes node enters the data message received from the RFID reader after row format conversion, transfers it to one
Individual B classes node；
The B classes node stores the data message from the A classes node；Also, the B classes node can read other B classes
The data message stored in node；
Wherein, after the data message that the RFID reader reads in the RFID tag, and by the number read
It is believed that breath is sent to before an A class node, it is necessary first to judge the number for the A class nodes that the RFID reader is connectable to
Amount；
If the quantity is 1, the A classes node is directly determined as the target A class nodes of data information transfer, is uploaded current
The data message that RFID reader is read；
If the quantity is more than 1, one of A classes node is selected in the following manner as the target of data information transfer
A class nodes, upload the data message that current RFID reader is read, comprise the following steps that：
Step S1, selects the test data s of regular length；Time threshold t1, time threshold t2 are set；
Step S2, each A classes node being connectable to for current RFID reader performs step S2.1 and step successively
S2.2, specifically：
Step S2.1, the test data s is sent to current A classes node, is obtained current A classes node and is started to receive the response of data
Time t；
Step S2.2, records current A classes node from starting to receive the test data s up to completing the test data s wholes
The consumed data transmission period Δ t of transmission；
Step S3, judges in the A class nodes that current RFID reader is connectable to, if the response time t of all A classes nodes
It is all higher than or equal to the time threshold t2；
If so, performing step S4；
Otherwise, A class node of response time t more than or equal to the time threshold t2 is rejected；Then judge now whether only remain
Remaining an A class node；If so, the A class nodes then are defined as into target A class nodes, terminate；
Step S4, judges in the A class nodes that current RFID reader is connectable to, if the data transfer of all A classes nodes
Time Δ t is all higher than or equal to the time threshold t1；
If so, performing step S5；
Otherwise, the A class nodes that data transmission period Δ t is more than or equal to the time threshold t1 are rejected；Then judge be now
A no only remaining A class node；If so, the A class nodes then are defined as into target A class nodes, terminate；
Step S5, calculates the response time t of remaining all A classes nodes arithmetic mean of instantaneous value t_avg；And calculate remaining institute
There is the data transmission period Δ t of A class nodes arithmetic mean of instantaneous value Δ t_avg；
Step S6, for remaining each A classes node, calculates the generalized time parameter value t ' of the A class nodes successively, specific to calculate
Formula is as follows：
T '=λ * | t-t_avg|1/2*log2|1+Δt-Δt_avg|
Wherein, λ is constant set in advance；
Step S7, in remaining all A classes nodes, a minimum selection generalized time parameter value t ' A class node is true by its
It is set to target A class nodes.
2. according to the method described in claim 1, it is characterised in that：
After the RFID reader determines target A class nodes, in addition it is also necessary in the RFID reader and the target A class sections
Authentication is carried out between point；Assuming that the computer that is directly connected to the RFID reader or other computing terminals is entitled
Node R 1, the entitled node R 2 of the target A class nodes, 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 is received after the random number Q of the generation of node R 2, one private key Ks of generation and two public keys Ka and Kb；
Wherein, (Ka)2+(Kb)2=Q2；
Then, public key Ka and Kb are returned to node R 2 by node R 1；
Step U3, node R 2 is verified after receiving public key Ka and Kb to it；
If (Ka)2+(Kb)2≠Q2, then authentication failure, termination communication；
Otherwise, Q is encrypted using public key Ka and Kb respectively, encryption data E (Ka) and E (Kb) is sent to node R 1；
Step U4, node R 1 is decrypted using private key Ks to the encryption data E (Ka) and E (Kb) that receive, if decrypted result is all
Q, then authentication passes through, and shows that normal data transfer can be carried out between node R 1 and node R 2；Otherwise, authentication is lost
Lose, terminate communication；
Step U5, if above-mentioned authentication process itself fails, reselects a target A class node, performs above-mentioned steps U1
~step U4, until determine one can be by the target A class nodes of authentication, to realize the transmission of the data message.
3. method according to claim 2, it is characterised in that：
Completed between the RFID reader and the target A class nodes after authentication, the RFID reader passes through
The data message read is sent to the target A class nodes by the following manner, specifically：
For the RFID reader：
The RFID reader performs following operate before the data message read to be sent to target A class nodes：
Step M1, three sections are divided into by the data message, respectively subdata information info1, subdata information info2, with
And subdata information info3, the length of above-mentioned three cross-talks data message is respectively k1 bytes, k2 bytes, k3 bytes；By above-mentioned three
Cross-talk data message arranges engagement in order can obtain the data message；
Wherein, k2>K1+k3, and k3=[log2(k1)], symbol [] represents interception integer part computing；
Step M2, engagement is arranged by subdata information info1 and subdata information info3 in order, obtains verification data information；
Step M3, calculates the MD5 values of the verification data information, obtains referential integrity check value H1；
Step M4, the data message and control information are sent to the target A class nodes jointly；
Wherein, the control information includes referential integrity check value H1 and k1 and k3 value；
For the target A class nodes：
Target A class nodes are received after the data message and control information of the RFID reader, perform following operate：
Step N1, extracts the starting k1 bytes and last position k3 bytes of the data message, and arrangement engagement in order is obtained to be verified
Information；
Step N2, calculates the MD5 values of the information to be verified, obtains actual integrity check value H2；
Step N3, by the referential integrity school in the control information for calculating the actual integrity check value H2 and reception obtained
Value H1 is tested to be compared；If both are identical, the data message is arrived the data information memory by completeness check
The target A class nodes；Otherwise, the data message is abandoned, and transmission again is sent to the RFID reader and instructed.
4. method according to claim 3, it is characterised in that：
Each B classes node itself has an adjacent access information list, is come to visit for the B classes node by directly connecting
Ask other B class nodes；
The adjacent access information list includes herein below：
(1) title for the B class nodes being directly connected to current B classes node；
(2) physical address for the B class nodes being directly connected to current B classes node, IP address；
(3) port numbers for the B class nodes being directly connected to current B classes node；
(4) network bandwidth between current B classes node and directly connected B class nodes；
(5) the average connection setup time between current B classes node and directly connected B class nodes；
(6) the successful connection probability between current B classes node and directly connected B class nodes；
(7) the data transfer integrity probability between current B classes node and directly connected B class nodes；
When one, which originates B class nodes b1, needs to access in network one with the target B class node bn of its indirect connection, execution
Operate below：
Step A1, the starting B class nodes b1 is set to by current B classes node initializing；
Step A2, inquires about all B class nodes directly connected in current B classes node b1 adjoining access information list；
If it find that the target B classes node bn, then return；
Otherwise, current B classes node is set to each B class node for being directly connected to the starting B class nodes b1 successively；Phase
Ying Di, couple each current B classes node execution step A3 being directly connected to the starting B class nodes b1；
Step A3, the adjoining access information list for the B class nodes being directly connected to current B classes node is inquired about using recursive algorithm,
If it find that the target B classes node bn, then recurrence return.
5. method according to claim 4, it is characterised in that：
If there is k bar access path L1, L2 ..., Lk between starting B class node b1 and target B class nodes bn, wherein, k is big
In 1 positive integer, then the step of selecting optimal access path is as follows：
Step B1, calculates the summation W ' 1, W ' of the network bandwidth between each two B class nodes in access path L1, L2 ..., Lk respectively
2 ..., W ' k；
According to the connection number in every access path L1, L2 ..., Lk, the averaging network bandwidth W1 of every access path is calculated,
W2 ..., Wk；
Wherein, the B class number of nodes that the connection number in an access path is defined as in the access path subtracts 1；
Step B2, calculates the total of connection setup time that be averaged in access path L1, L2 ..., Lk between each two B class nodes respectively
And T ' 1, T ' 2 ..., T ' k；
According to the connection number in every access path L1, L2 ..., Lk, total connection setup time T1 of every access path is calculated,
T2 ..., Tk；
Step B3, respectively by access path L1, L2 ..., the successful connection probability multiplication in Lk between each two B class nodes is obtained
Power C1, C2 ..., Ck are connected into every access path；
Step B4, respectively by access path L1, L2 ..., the data transfer integrity probability phase in Lk between each two B class nodes
Multiply, obtain data transfer the percentage of head rice I1, I2 ..., Ik of every access path；
Step 5, according to the data obtained in above-mentioned steps, access path L1, L2 ..., Lk assessment parameter are calculated respectively
Ф 1, Ф 2 ..., Ф k, the maximum access path of selection assessment parameter value are used as optimal access path；Specifically, road is accessed
Footpath Li assessment parameter Ф i calculation formula 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 CN104700137A (en) | 2015-06-10 |
| CN104700137B true 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) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110119646B (en) * | 2018-02-07 | 2024-01-26 | 深圳市帝迈生物技术有限公司 | Device parameter setting method and system based on radio frequency card |
| CN108965477B (en) * | 2018-08-30 | 2019-07-09 | 河北一森园林绿化工程股份有限公司 | Forestry Internet of things system |
| CN113055345B (en) * | 2019-12-27 | 2022-11-08 | 中国移动通信集团湖南有限公司 | 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 |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104700137A (en) | 2015-06-10 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Gao et al. | Privacy-preserving auction for big data trading using homomorphic encryption | |
| Aitzhan et al. | Security and privacy in decentralized energy trading through multi-signatures, blockchain and anonymous messaging streams | |
| CN113407640B (en) | Cross-chain method and system based on multi-chain NFT (network File transfer) | |
| Fabian et al. | SHARDIS: A privacy-enhanced discovery service for RFID-based product information | |
| CN111309711A (en) | Cross-block-chain data migration method, device, equipment and storage medium | |
| CN107819749A (en) | Block catenary system and transaction data processing method based on ether mill | |
| CN111259070A (en) | Method and related device for storing and acquiring service data | |
| CN102394753B (en) | RFID (Radio Frequency Identification Device) mutual authentication method based on secret key and cache mechanism | |
| CN109377363B (en) | Block chain-based Internet of things data transaction architecture and transaction security method thereof | |
| CN104700137B (en) | A kind of information processing method based on Internet of Things | |
| CN104869567B (en) | A kind of information processing method based on Intelligent terminal for Internet of things | |
| CN106960166A (en) | A kind of smart jack management system and its method based on distributed general ledger technology | |
| He et al. | A novel cryptocurrency wallet management scheme based on decentralized multi-constrained derangement | |
| CN110555783B (en) | Block chain-based electric power marketing data protection method and system | |
| Xue et al. | DStore: A distributed system for outsourced data storage and retrieval | |
| Asfia et al. | A blockchain construct for energy trading against sybil attacks | |
| CN109104476A (en) | A kind of security information for power system system based on block chain | |
| Wang | Sok: Applying blockchain technology in industrial internet of things | |
| Kumar et al. | Ultra-lightweight blockchain-enabled RFID authentication protocol for supply chain in the domain of 5G mobile edge computing | |
| CN110351383A (en) | Method for processing business, equipment and readable storage medium storing program for executing | |
| Greubel et al. | Quantifying measurement quality and load distribution in tor | |
| CN104767749B (en) | A kind of information processing method based on wireless Internet of Things | |
| Zhu | Research on key technologies and applications of energy internet blockchain | |
| Vieira et al. | Blockchain technologies for IoT applications: Use-cases and limitations | |
| Şimşek et al. | TPS3: A privacy preserving data collection protocol for smart grids |
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 |