CN107809760A

CN107809760A - A kind of method of message authentication in wireless sensor network

Info

Publication number: CN107809760A
Application number: CN201711135478.5A
Authority: CN
Inventors: 李娜娜; 贺蕾; 邹东尧; 杜中州; 穆聪; 刘宽; 张少磊; 杨宇博; 周辰宇; 孙婧
Original assignee: Zhengzhou University of Light Industry
Current assignee: Zhengzhou University of Light Industry
Priority date: 2017-11-16
Filing date: 2017-11-16
Publication date: 2018-03-16

Abstract

The method that the present invention proposes message authentication in a kind of wireless sensor network, different sending nodes calculate multiple MAC message authentication tags according to the information to be sent, forwarded by the way that these MAC message authentication tags are aggregated into after a short label is attached to message on the node of multi-hop transfer using polymerization MAC algorithms, and this short label still can be used to differentiate the message and the identity of source side that receive by receiving node；The short label generated using polymerization MAC algorithms is used to differentiate the message and the identity of source side that receive by receiving node.The present invention is time-consuming small, and amount of calculation is small, and the data packet load transmitted wirelessly in whole network greatly reduces, and reduces energy and bandwidth spent by wireless transmission data, extends node life span, extend the life-span of network；Share different keys between receiving node and multiple sending nodes, MAC message authentication tags be it is random, it is safe.

Description

Method for authenticating message in wireless sensor network

Technical Field

The invention relates to the technical field of information security, in particular to a method for authenticating messages in a wireless sensor network.

Background

The Wireless Sensor Network (WSN) can monitor, sense and collect information of various environments or monitored objects in the monitored area of the Network in real time, and finally transmit the information to the terminal user, and has wide application in various fields such as industry, agriculture, traffic, military, safety, medical treatment, space detection, home and office environments, etc., and the technology promotes economic development and also draws attention of the user to the information safety aspect.

Due to the fact that a wireless transmission channel is adopted, meanwhile, the node energy is limited, compared with other networks, the WSN has more prominent safety problems such as eavesdropping, malicious routing and message tampering, and the solution of the safety problems becomes a hotspot and a difficulty of current research. Before various kinds of perception information are sent to the end users, multi-hop transmission is often carried out, and the information finally reaches the receiving end nodes. In the process, how to ensure the authenticity and integrity of the message sender and the message receiver and prevent active attacks of an adversary, such as impersonation, tampering, replay and the like, is a first line of defense for security protection in the WSN application system, and is a problem to be solved urgently.

Currently, message authentication remains a common technique for ensuring the authenticity and integrity of message senders and recipients. As shown in fig. 1, a Message Authentication Code (MAC) generated by a sender of a Message is appended to the Message and then transmitted to a receiver, and the receiver authenticates the received Message and the identity of the source according to the authenticator. The MAC is a short data block with fixed length calculated by taking a key K and a message needing authentication as parameters and adopting an MAC function. And after receiving the message, the receiver recalculates the MAC according to the key K and the MAC function and checks whether the MAC is equal to the transmitted MAC or not. The important reason why the method can guarantee the authenticity and integrity of the message sender and receiver is that the secret key K is shared by the sender and the receiver and is unknown to others.

If the MAC mechanism is directly applied to the WSN to ensure security, a large energy cost is paid, especially when the number of nodes in the network is large or communication is frequent, so that the nodes die and the service life of the network is greatly reduced. How to reduce the energy consumption of the MAC mechanism in the WSN, improve the service life of the network, improve the execution efficiency of the protocol, and reduce the probability of information attack by an attacker is very necessary.

Disclosure of Invention

Aiming at the technical problems of high energy cost and short service life of an MAC mechanism in a wireless sensor network, the invention provides a method for authenticating a message in the wireless sensor network, which has the advantages of low energy consumption, small calculated amount and high safety.

In order to achieve the purpose, the technical scheme of the invention is realized as follows: a method for message authentication in wireless sensor network, the wireless sensor network includes a base station B, aA sink node U ₀ And at least one collection node, sink node U ₀ Is the only node communicating with the base station B, and all the collection nodes can send data to the sink node U through the multi-hop wireless network ₀ Node U _i The packet to be sent to base station B is M _i Node U _i The secret key between the base station B and the base station is K _i I =0,1, \8230 \ 8230;, m, m +1 are the number of nodes; the method comprises the following steps:

step 1: judging node U _i Whether one or more data packets or nodes U needing to be transferred already exist in the current wireless receiving buffer or not _i Whether an information packet needs to be sent to the base station B or not;

step 2: if not, jumping to the step 1 after delaying for a period of time tau; otherwise, continuing to execute the step 3;

and step 3: if node U _i With information packet M _i Needs to be sent to a base station B, the number of data packets to be sent is z, and an MAC algorithm is adopted to utilize a secret key K _i And packet M _i Information generation MAC tag MAC _i MAC label MAC _i Attached to its packet M _i Post-construction packet D _i ＝{M _i ，MAC _i }; if node U _i One or more data packets needing to be transferred exist in the current wireless receiving buffer, and the number of the data packets needing to be transferred is x;

and 4, step 4: judging whether (x + z) is larger than 1, if not, the new label is the label MAC _i Or a label included in a packet to be transferred, and the new packet is the packet M _i Or an information packet in a data packet to be transferred;

if (x + z)&gt, 1 at node U _i Processing the label by adopting an aggregation MAC algorithm to generate a new aggregation label, and aggregating the information in the data packet participating in aggregation and the node U according to the sequence of label aggregation _i Information packet M of _i Are sequentially arranged to form a new information packet M _i ’；

And 5: node U _i The generated new tag is attached to its newGenerating a new data packet D after the packet _i ', determine the node U _i Whether it is a sink node U ₀ If so, the new data packet D is sent _i ' directly sends to the base station B, and jumps to step 8; otherwise, the new data packet D is sent _i ' wireless transmission;

step 6: node U _i Data packet D sent out wirelessly _i ' transfer to sink node U through multi-hop network by other nodes ₀ The processing at each node participating in the transit is performed at the same node U _i The treatment process is the same;

and 7: at sink node U ₀ Is processed at the same node U _i The treatment process is the same;

and 8: and the base station B identifies the received data packet by adopting an authentication algorithm.

Labels generated by the MAC algorithmWherein, the node U _i The packet to be sent to base station B is M _i Node U _i The secret key between the base station B and the base station B is K _i I =0,1, \8230;, m, and K _i ∈{0,1} ⁿ N is the key length, packet M _i ∈{0,1} ^* Mac () is a public function, a value that can produce a fixed length, tag _i Is a MAC tag.

The input of the aggregation MAC algorithm is more than one MAC label tag _i 、……、tag _n 、……、tag _j Output is tag _IJ I.e. aggregation tag MAC _IJ And is made of Is an exclusive or operation;

the input of the aggregation MAC algorithm is one or more than one MAC label tag _i 、……、tag _n 、……、tag _j And one or more polymeric tag tags _PQ 、……、tag _UW 、……、tag _RS Output is tag _1S I.e. the aggregated tag is:

the input of the aggregation MAC algorithm is more than one aggregation label tag _PQ 、……、tag _UW 、……、tag _RS Output is tag _PS I.e. the aggregated tag is:

is an exclusive or operation.

The authentication algorithm of the base station B is as follows:

and (3) calculating:

judging if tag _IY '＝tag _IY I.e. MAC _IY '＝MAC _IY The output is 1, otherwise the output is 0;

wherein,the data packet received by the base station B is D' = { M = { _i ，……，M _j ，……，M _p ，……，M _y ，tag _IY Mac () is a public function, a value that can produce a fixed length.

A method for message authentication in a wireless sensor network comprises the following steps:

step 301: judging node U ₀ There is already one transfer-required from node U in the current wireless receiving buffer ₁ Data packet D of ₁ ＝{M ₁ ，MAC ₁ }，Node U ₀ An information packet needs to be sent to the base station B;

step 302: continuing to execute step 303;

step 303: node U ₀ With packet M ₀ The number of data packets z =1 to be transmitted is required to be transmitted to the base station B, and meanwhile, the information packet M is generated by adopting the MAC algorithm ₀ MAC label MAC of information ₀ MAC label MAC ₀ Attached to packet M ₀ Then form its data packet D ₀ ＝{M ₀ ，MAC ₀ }; node U ₀ The current wireless receiving buffer has a data packet D to be transferred ₁ The number x =1 of the data packets needing to be transferred;

step 304: if x + z =2> -1, continuing to execute step 305;

step 305: data packet D to be transferred ₁ Message authentication tag MAC in ₁ And node U ₀ Message authentication tag MAC of ₀ Generating new aggregation label MAC after aggregation by adopting aggregation MAC algorithm ₁₀ And the information packets M in the data packets participating in the aggregation are processed according to the sequence of the label aggregation ₁ And a collection node U ₀ Information packet M of ₀ Are arranged in sequence to form a new information packet M ₀ ’＝{M ₁ ，M ₀ }；

Step 306: node U ₀ To the generated aggregated tag MAC ₁₀ Attach to it a new packet M ₀ ' post-generation of a New data packet D ₀ ’＝{M ₁ ，M ₀ ，MAC ₁₀ Judge the node U ₀ If the node is a sink node, a new data packet D is sent ₀ ' directly send to base station B and jump to step 307;

step 307: base station B receives data packet D ₀ ’＝{M ₁ ，M ₀ ，MAC ₁₀ Adopting an authentication algorithm to carry out authentication; the base station B receives the data packet D ₀ ' thereafter, according to itself with node U ₁ Node U ₀ Respectively shared secret key K ₁ 、K ₀ Substituting the MAC function to recalculate the tag MAC ₁ ' and tag MAC ₀ ', butTag MAC obtained by post-pair calculation ₀ ' and tag MAC ₁ ' XOR operation to get MAC ₁₀ ', and calculating the resulting MAC ₁₀ ' with received data packet D ₀ ' the aggregation tag MAC ₁₀ Carrying out comparison; if the two are the same, the recipient base station B can be confident that the data packet D is available ₀ ' the message has not been tampered with and the recipient base station B can be confident that packet D is present ₀ ' messages come from the purported sender node U ₁ And node U ₀ (ii) a Otherwise, the receiver BS B cannot acknowledge the packet D ₀ ' the message is not tampered with, and it cannot be certain that the data packet D is ₀ ' messages come from the purported sender node U ₁ And node U ₀ 。

step 401: judging node U ₀ Currently, there is already a node U in the wireless receiving buffer that needs to be transferred _r Data packet D of _r ’＝{M ₁ ，M ₂ ……M _r ，MAC _1R }, simultaneous nodes U ₀ With packet M ₀ Needs to be sent to the base station B;

step 402: continuing to execute step 403;

step 403: node U ₀ With packet M ₀ The number of data packets z =1 to be transmitted is required to be transmitted to the base station B, and meanwhile, the information packet M is generated by adopting the MAC algorithm ₀ MAC label MAC of information ₀ MAC tag MAC ₀ Attached to its packet M ₀ Then form its data packet D ₀ ＝{M ₀ ，MAC ₀ }; node U ₀ There is a data packet D in the current wireless receiving buffer that needs to be transferred _r ', the number of packets to be relayed x =1;

step 404: judging x + z =2> -1, and continuing to execute step 405;

step 405: at node U ₀ Processing the label by adopting an aggregation MAC algorithm, and transmitting the data packet D to be transmitted _r ' aggregation tag MAC _1R And node U ₀ Message authentication MAC tag MAC ₀ Generating aggregation label MAC after aggregation by adopting aggregation MAC algorithm ₁₀ And information in the data packets participating in aggregation and the nodes U are combined according to the sequence of label aggregation ₀ Information packet M of ₀ Are sequentially arranged to form a new information packet M ₀ ’＝{M ₁ ，M ₂ ，……，M _r ，M ₀ }；

Step 406: node U ₀ Site generated new tag MAC ₁₀ Attach to its new packet M ₀ ' post-generation of a New data packet D ₀ ’＝{M ₁ ，M ₂ ，……，M _r ，M ₀ ，MAC ₁₀ } this node U ₀ If the node is a sink node, a new data packet D is sent ₀ ' directly send to base station B and jump to step 407;

step 407: base station B receives data packet D ₀ ’＝{M ₁ ，M ₂ ，……，M _r ，M ₀ ，MAC ₁₀ Adopting an authentication algorithm to carry out authentication; after receiving the data packet, the base station B according to the data packet and the node U ₁ Node U ₂ 823060, 8230node U _r Node U ₀ Respectively shared secret key K ₁ 、K ₂ 、……、K _r 、K ₀ Substituting the MAC function to recalculate the tag MAC ₁ ’、MAC ₂ ’、……、MAC _r ’、MAC ₀ ', then MAC the calculated tag ₁ ’、MAC ₂ ’、……、MAC _r ’、MAC ₀ ' performing XOR operation to get tag MAC ₁₀ ', and calculating the obtained label MAC ₁₀ ' with received data packet D ₀ ' aggregation tag MAC ₁₀ Carrying out comparison; if the two are the same, the recipient base station B can be confident that packet D is data packet D ₀ ' the message has not been tampered with and the recipient base station B can be confident that the data packet D is ₀ ' messages come from the purported sender node U ₁ 、U ₂ 、……、U _r 、U ₀ (ii) a Otherwise, the receiver base station B cannot acknowledge the data packet D ₀ ' messages are not tampered with, data cannot be assuredBag D ₀ ' messages come from the purported sender node U ₁ 、U ₂ 、……、U _r 、U ₀ 。

step 501: judging node U ₀ There are 2 data packets to be transferred in the current wireless receiving buffer, which are from the node U respectively _p Data packet D of _p ’＝{M _i ，……，M _p ，MAC _IP And from node U _q Data packet D of _q ’＝{M _q ，MAC _q At the same time node U ₀ With packet M ₀ Needs to be sent to the base station B;

step 502: continuing to execute step 503;

step 503: node U ₀ With packet M ₀ The data packets are required to be sent to a base station B, the number z =1 of the data packets required to be sent is adopted, and meanwhile, an information packet M is generated by adopting an MAC algorithm ₀ MAC label MAC of information ₀ Tag MAC ₀ Attached to packet M ₀ Post-construction packet D ₀ ＝{M ₀ ，MAC ₀ }; node U ₀ There are 2 data packets D to be transferred in the current wireless receiving buffer _p ' and D _q ', the number of packets to be relayed x =2;

step 504: determining x + z =3> -1, and continuing to execute step 505;

step 505: at node U ₀ Processing the label by adopting an aggregation MAC algorithm, and transmitting the data packet D needing to be transmitted _p ' and D _q ' aggregation tag MAC _1P Message authentication tag MAC _q And node U ₀ Message authentication tag MAC of ₀ Generating aggregation label MAC after aggregation by adopting aggregation MAC algorithm _I0 And information in the data packets participating in aggregation and the node U are combined according to the sequence of label aggregation ₀ Information packet M of ₀ Are arranged in sequence to form a new information packet M ₀ ’＝{M _i ，……，M _p ，M _q ，M ₀ }；

Step 506: node U ₀ To the generated aggregated tag MAC _I0 Attach to it a new packet M ₀ ' post-generation of a new data packet D ₀ ’＝{M _i ，……，M _p ，M _q ，M ₀ ，MAC _I0 } this node U ₀ Is the sink node, the new data packet D is sent ₀ ' directly send to base station B and jump to step 507;

step 507: base station B receives data packet D ₀ ’＝{M _i ，……，M _p ，M _q ，M ₀ ，MAC _I0 Adopting an authentication algorithm to carry out authentication; after receiving the message of the data packet, the base station B according to the base station B and the node U _i 823060, 8230node U _p Node U _q Node U ₀ Respectively shared secret key K _i 、……、K _p 、K _q 、K ₀ Substituting the MAC function to recalculate the tag MAC _i ’、MAC _p ’、……、MAC _q ’、MAC ₀ ', then MAC the calculated tag _i ’、MAC _p ’、……、MAC _q ’、MAC ₀ ' performing XOR operation to obtain tag MAC _I0 ', and calculating the obtained label MAC _I0 ' with received data packet D ₀ ' the aggregation tag MAC _I0 Carrying out comparison; if the two are the same, the recipient base station B can be confident that packet D is data packet D ₀ ' the message has not been tampered with and the recipient base station B can be confident that the data packet D is ₀ ' messages come from the purported sender node U _i 823060, 8230node U _p Node U _q Node U ₀ (ii) a Otherwise, the receiver BS B cannot acknowledge the packet D ₀ ' the message has not been tampered with and packet D cannot be assured ₀ ' messages come from the purported sender node U _i 823060, node U _p Node U _q Node U ₀ 。

step 601: judging node U ₀ Has been currently in the wireless receiving bufferThrough the existence of a plurality of data packets needing to be transferred, the data packets are respectively from the node U _a Data packet D of _a ’＝{M _d ，……，M _a ，MAC _DA \8230;, from node U _e Data packet D of _e ’＝{M _h ，……，M _e ，MAC _HE From node U _j Data packet D of _j ’＝{M _j ，MAC _j 8230from node U _s Data packet D of _s ’＝{M _s ，MAC _s }, simultaneous nodes U ₀ With packet M ₀ Needs to be sent to the base station B;

step 602: continuing to execute step 603;

step 603: node U ₀ With information packet M ₀ The number of the data packets to be transmitted z =1 is required to be transmitted to the base station B, and meanwhile, the information packet M is generated by adopting the MAC algorithm ₀ MAC label MAC of information ₀ Tag MAC ₀ Attached to its packet M ₀ Then form its data packet D ₀ ＝{M ₀ ，MAC ₀ }; node U ₀ The current wireless receiving buffer has a plurality of data packets to be transferred, and the number of the data packets to be transferred is x>2；

Step 604: judging that x + z is greater than 3, and continuing to execute step 605;

step 605: at node U ₀ Processing the label by adopting an aggregation MAC algorithm, and transmitting D in the data packet to be transferred _a ’、……、D _e ’、D _j ’、……、D _s ' the aggregate tag MAC _DA 、……、MAC _HE And message authentication tag MAC _j 、……、MAC _s And acquisition node U ₀ Message authentication tag MAC of ₀ Generating aggregation label MAC after aggregation by adopting aggregation MAC algorithm _D0 And information in the data packets participating in aggregation and the node U are combined according to the sequence of label aggregation ₀ Information packet M of ₀ Are arranged in sequence to form a new information packet M ₀ ’＝{M _d ，……，M _a ，……，M _h ，……，M _e ，M _j ，……，M _s ，M ₀ }；

Step 606: node U ₀ Site generated new tag MAC _D0 Attach to its new packet M ₀ ' post-generation of a new data packet D ₀ ’＝{M _d ，……，M _a ，……，M _h ，……，M _e ，M _j ，……，M _s ，M ₀ ，MAC _D0 } this node U ₀ Is the sink node, the new data packet D is sent ₀ ' directly to base station B and jumps to step 607;

step 607: base station B receives data packet D ₀ ’＝{M _d ，……，M _a ，……，M _h ，……，M _e ，M _j ，……，M _s ，M ₀ ，MAC _D0 Adopting an authentication algorithm to perform authentication; base station B receives data packet D ₀ ' after the message, according to itself and node U _d 823060, node U _a 823060, node U _h 823060, 8230node U _e Node U _j 823060, node U _s Node U ₀ Respectively shared secret key K _d 、……、K _a 、……、K _h 、……、K _e 、K _j 、……、K _s 、K ₀ Substituting the MAC function to recalculate the tag MAC _d ’、……、MAC _a ’、……、MAC _h ’、……、MAC _e ’、MAC _j ’、……、MAC _s ’、MAC ₀ ', then MAC the calculated tag _d ’、……、MAC _a ’、……、MAC _h ’、……、MAC _e ’、MAC _j ’、……、MAC _s ’、MAC ₀ ' performing XOR operation to obtain tag MAC _D0 ', and calculating the obtained label MAC _D0 ' with received data packet D ₀ ' the aggregation tag MAC _D0 Comparing; if the two are the same, the recipient base station B can be confident that packet D is data packet D ₀ ' the message has not been tampered with and the recipient base station B can be confident that the data packet D is ₀ ' messages from purported sendersNode U _d 823060, node U _a 823060, 8230node U _h 823060, node U _e Node U _j 823060, 8230node U _s Node U ₀ (ii) a Otherwise, the receiver BS B cannot acknowledge the packet D ₀ ' the message has not been tampered with and packet D cannot be assured ₀ ' messages come from the purported sender node U _d 823060, 8230node U _a 823060, node U _h 823060, 8230node U _e Node U _j 823060, node U _s Node U ₀ 。

step 701: judging node U _i The data packets needing to be transferred do not exist in the current wireless receiving buffer, but the node U _i With packet M _i Needs to be sent to the base station B;

step 702: continuing to execute step 703;

step 703: node U _i With information packet M _i The number z =1 of the data packets to be transmitted is generated by adopting the MAC algorithm to generate M _i MAC label MAC of information _i Attached to its packet M _i Then form its data packet D _i ＝{M _i ，MAC _i }; node U _i The current wireless receiving buffer has no data packets needing to be transferred, and the number of the data packets needing to be transferred x =0;

step 704: judging x + z =1, then the node U is indicated _i Only 1 label is needed, and the new label is the MAC without adopting the aggregation algorithm for processing _i The new packet is M _i ；

Step 705: node U _i Site generated new tag MAC _i Attach to it a new packet M _i ’＝{M _i Generate a new data packet D _i ’＝D _i ＝{M _i ，MAC _i } this node U _i If not, the new data packet D is sent _i ' wireless transmission;

step 706: node U _i The data packet sent out by the wireless is covered by the next hop node U _j Transferred at node U _j The processing at the node is in U _i The processing procedures of the nodes are completely the same;

step 707: node U _i The data packet sent out by wireless is transferred to a sink node U through a plurality of other nodes through a multi-hop network ₀ The processing at each transit node is in U _i The processing procedures of the nodes are completely the same;

step 708: at sink node U ₀ Is processed at the same node U _i The processing procedures are the same, and the step is transferred to 701';

step 701': judging node U ₀ The current wireless receiving buffer has the point U needing to be transferred _x Data packet D of _x ’＝{M _i ，M _j ，M _q ，……，M _p ，M _x ，MAC _IX At the same time node U ₀ With packet M ₀ Needs to be sent to the base station B;

step 702': continuing to execute step 703';

step 703': node U ₀ With packet M ₀ The number of the data packets to be transmitted z =1 is required to be transmitted to the base station B, and meanwhile, the information packet M is generated by adopting the MAC algorithm ₀ MAC label MAC of information ₀ Tag MAC ₀ Attached to its packet M ₀ Then form its data packet D ₀ ’＝{M ₀ ，MAC ₀ }; node U ₀ The current wireless receiving buffer has a data packet D needing to be transferred _x ', the number of packets to be relayed x =1;

step 704': judging x + z =2&gt, 1, the node U is described ₀ 2 tags are present, and the aggregation algorithm is adopted for processing, and the step 705' is executed continuously;

step 705': x + z =2&gt, 1 indicates that 2 tags can be processed by adopting an aggregation algorithm, and then the node U is provided with a label list ₀ Processing the label by adopting an aggregation MAC algorithm to generate a new aggregation label MAC _I0 And according toThe sequence of label aggregation is to combine the information in the data packet participating in aggregation with the node U ₀ Information packet M of ₀ Are arranged in sequence to form a new information packet M ₀ ’＝{M _i ，M _j ，M _q ，……，M _p ，M _x ，M ₀ }; the new tag is the MAC _I0 The new packet is M ₀ ’＝{M _i ，M _j ，M _q ，……，M _p ，M _x ，M ₀ And jump to step 706';

step 706': node U ₀ Site generated new tag MAC _I0 Attach to its new packet M ₀ ' post-generation of a New data packet D ₀ ’＝{M _i ，M _j ，M _q ，……，M _p ，M _x ，M ₀ ，MAC _I0 }, this node U ₀ Is a sink node, and sends a new data packet D ₀ ' directly to base station B and jumps to step 710;

step 710: base station B receives data packet D ₀ ’＝{M _i ，M _j ，M _q ，……，M _p ，M _x ，M ₀ ，MAC _I0 Adopting an authentication algorithm to carry out authentication; that is, after receiving the message, the base station B according to itself and the node U _i Node U _j Node U _q 823060, 8230node U _p Node U _x Node U ₀ Respectively shared secret key K _i 、K _j 、K _q 、……、K _p 、K _x 、K ₀ Substituting the MAC function to recalculate the tag MAC _i ’、MAC _j ’、MAC _q ’、……、MAC _p ’、MAC _x ’、MAC ₀ ' and then MAC the calculated tag _i ’、MAC _j ’、MAC _q ’、……、MAC _p ’、MAC _x ’、MAC ₀ ' performing XOR operation to obtain tag MAC _I0 ', and calculating the obtained label MAC _I0 ' with the received data packet D ₀ Tag MAC of _I0 Carrying out comparison; if the two are the same, thenThe recipient base station B can be confident that packet D is present ₀ ' the message has not been tampered with and the recipient base station B can be confident that the data packet D is ₀ ' messages come from the purported sender node U _i Node U _j Node U _q 823060, 8230node U _p Node U _x Node U ₀ (ii) a Otherwise, the receiver BS B cannot acknowledge the packet D ₀ ' the message has not been tampered with and packet D cannot be assured ₀ ' messages come from the purported sender node U _i Node U _j Node U _q 823060, node U _p Node U _x Node U ₀ 。

The invention has the beneficial effects that:

1) Reduce energy consumption, improve network working life: different sending nodes calculate a plurality of MAC message authentication labels according to the information to be sent, and the MAC message authentication labels are aggregated into a short label on a multi-hop transit node and are attached to the message for forwarding; the aggregation MAC algorithm needs to consume a certain time, but the time consumption is relatively small, the calculation amount is small, the load of the data packet wirelessly transmitted in the whole network is greatly reduced, the energy and the bandwidth consumed by wirelessly transmitting data are greatly reduced, the survival time of the nodes is prolonged, the service life of the network is prolonged, and particularly when the number of the nodes is large, the energy efficiency advantage is more obvious.

2) Better security: the receiving node and the plurality of sending nodes share different keys respectively, the key length is n, and as other nodes do not know the key, the MAC message authentication tag is random from the perspective of an attacker, and a random string of values is subjected to XOR operation with any other unrelated random values to still generate a random string of values; the probability of the enemy attacking the system is not higher than 2 ^-n That is, the short label generated by using the aggregated MAC algorithm can still be used by the receiving node to authenticate the received message and the identity of the source.

Drawings

In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, it is obvious that the drawings in the following description are only some embodiments of the present invention, and for those skilled in the art, other drawings can be obtained according to the drawings without creative efforts.

Fig. 1 is a diagram illustrating a MAC message authentication information flow in the prior art.

Fig. 2 is a schematic diagram of a network topology.

FIG. 3 is a diagram of a sink node U according to the present invention ₀ And the message flow diagram is used for realizing message authentication by aggregating the MAC label of the local node and 1 MAC label.

FIG. 4 is a diagram of a sink node U according to the present invention ₀ And the message flow diagram is used for aggregating the MAC label and the 1 aggregation label of the local node so as to realize message authentication.

FIG. 5 is a diagram of a sink node U according to the present invention ₀ And the message flow diagram is used for aggregating the MAC label of the local node and 1 aggregation label of 1 MAC label so as to realize message authentication.

FIG. 6 is a diagram of a sink node U according to the present invention ₀ And the message flow diagram is used for aggregating the MAC label of the local node and a plurality of aggregation labels of a plurality of MAC labels so as to realize message authentication.

Fig. 7 is a schematic diagram of a multi-hop path according to the present invention employing an aggregate MAC algorithm at a plurality of transit nodes.

Detailed Description

The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be obtained by a person skilled in the art without inventive effort based on the embodiments of the present invention, are within the scope of the present invention.

The design idea of the invention is as follows: in a wireless sensor network, the same node (e.g., base station) shares a different key with each of the different transmitting nodes. Different sending nodes calculate a plurality of MAC labels according to the information to be sent, the MAC labels are aggregated into a short label on the multi-hop relay node and are attached to the message for forwarding, and the short label can be used by a receiving node for identifying the received message and the identity of a source.

A method for message authentication in wireless sensor network, the wireless sensor network includes a base station B, a convergent node U ₀ And at least one collection node, sink node U ₀ Is the only node communicating with the base station B, and all the collection nodes can send data to the sink node U through the multi-hop wireless network ₀ Node U _i The packet to be sent to base station B is M _i Node U _i The secret key between the base station B and the base station is K _i I =0,1, \8230;, m, m +1 is the number of nodes, as shown in fig. 2, and node U _i If there is data to be sent to the base station B, the path may be: u shape _i →U _j →U _q →…→U _p →U _x →U ₀ I.e. slave node U _i The wireless data packet transmitted by the point passes through the node U in turn _j 、U _q 、……U _p 、U _x To the sink node U ₀ And then transmitted to the base station B.

The first embodiment is as follows:

and step 3: if node U _i With packet M _i The number of data packets to be transmitted is represented by z, and the MAC algorithm is adopted to utilize a secret key K _i And packet M _i Information generation MAC tag MAC _i Tag MAC _i Attached to its packet M _i Post-construction packet D _i ＝{M _i ，MAC _i }; if node U _i One or more data packets to be transferred are currently in the wireless receiving buffer, and the number of the data packets to be transferred is represented by x.

MAC algorithm generated labelsWherein, K _i Is a key, n is a key length, K _i ∈{0,1} ⁿ Information packet M _i ∈{0,1} ^* Mac () is a public function, meaning a conventional encryption or hash function, from which a fixed-length value, tag, can be generated _i Is a MAC tag.

And 4, step 4: judging whether (x + z) is larger than 1, if not, indicating the node U _i Only 1 label is needed, and the new label is the label MAC without adopting the aggregation algorithm for processing _i Or a label included in a packet to be transferred, and the new packet is the packet M _i Or the information packet in the data packet needing to be transferred;

if (x + z)&gt, 1 at node U _i Processing the label by adopting an aggregation MAC algorithm to generate a new aggregation label, and aggregating the information in the data packet participating in aggregation and the node U according to the sequence of label aggregation _i Information packet M of _i Are sequentially arranged to form a new information packet M _i ’。

The aggregated MAC algorithm can be divided into three cases according to the difference of input: the input of the aggregated MAC algorithm is more than one MAC label tag _i 、……、tag _n 、……、tag _j Output is tag _IJ I.e. aggregation tag MAC _IJ And is made of Is an exclusive or operation;

the input of the aggregation MAC algorithm is one or more than one MAC label tag _i 、……、tag _n 、……、tag _j And one or more polymeric tags tag _PQ 、……、tag _UW 、……、tag _RS Output is tag _1S I.e. the polymeric label is:

the input of the aggregation MAC algorithm is more than one aggregation label tag _PQ 、……、tag _UW 、……、tag _RS Output is tag _PS I.e. the polymeric label is:

is an exclusive or operation.

And 5: node U _i The generated new label is attached to its new packet M _i ' post-generation of a New data packet D _i ', if this node U _i Is a sink node U ₀ Then new data packet D is sent _i ' directly send to base station B and jump to step 8; otherwise, the new data packet D is sent _i ' wireless transmission;

step 6: node U _i Data packet D sent out wirelessly _i ' forward to sink node U through other nodes via multi-hop network ₀ The processing at each node participating in the transit is performed at the same node U _i The processing procedures of the nodes are completely the same;

node U _i Data packet D sent out wirelessly _i ' by its next hop node U _j Transferred at node U _j Is processed at the same node U _i The processing procedure of the nodes is completely the same. Node U _i Data packet D sent out wirelessly _i ' transfer to sink node U through 0 or more other nodes via multi-hop network ₀ 。

And 7: at sink node U ₀ Is processed at the same node U _i The processing procedures are completely the same, and the steps 1-5 are repeated to send the data packet to the base station B;

The authentication algorithm of the base station B is as follows:

and (3) calculating:

wherein,received by base station B data packet is D' = { M = _i ，……，M _j ，……，M _p ，……，M _y ，tag _IY }, node U _i The packet to be sent to base station B is M _i Node U _i The secret key between the base station B and the base station B is K _i I =0,1, \8230;, m, n is the key length, K _i ∈{0,1} ⁿ Information packet M _i ∈{0,1} ^* Mac () is a public function, referring to a conventional encryption or hash function, from which a fixed-length value can be generated.

Example two

A method for message authentication in wireless sensor network is disclosed, which is at sink node U ₀ The message flow diagram of the local node MAC label and 1 MAC label for realizing message authentication is shown in FIG. 3The method comprises the following steps:

step 301: judging node U ₀ There is already a packet in the current wireless receiving buffer that needs to be forwarded, i.e. from node U ₀ Node U of front end ₁ Data packet D of ₁ ＝{M ₁ ，MAC ₁ }, node U ₀ An information packet needs to be sent to the base station B;

step 302: continuing to execute step 303;

step 303: node U ₀ With information packet M ₀ The data packets are required to be sent to a base station B, the number z =1 of the data packets required to be sent is adopted, and meanwhile, an information packet M is generated by adopting an MAC algorithm ₀ MAC label MAC of information ₀ Tag MAC ₀ Attached to packet M ₀ Then form its data packet D ₀ ＝{M ₀ ，MAC ₀ }; node U ₀ The current wireless receiving buffer has a data packet D to be transferred ₁ The number of data packets to be transferred x =1;

step 304: if x + z =2> -1, continuing to execute step 305;

step 305: x + z =2&gt, 1 shows that 2 tags can be processed by adopting an aggregation algorithm and a data packet D to be transferred ₁ Message authentication tag MAC in ₁ And node U ₀ Message authentication tag MAC ₀ Generating new aggregation label MAC after aggregation by adopting aggregation MAC algorithm ₁₀ And the information packets M in the data packets participating in the aggregation are processed according to the sequence of the label aggregation ₁ And a collection node U ₀ Information packet M of ₀ Are arranged in sequence to form a new information packet M ₀ ’＝{M ₁ ，M ₀ }；

Step 306: node U ₀ To generated aggregated label MAC ₁₀ Attach to it a new packet M ₀ ' post-generation of a New data packet D ₀ ’＝{M ₁ ，M ₀ ，MAC ₁₀ Judge the node U ₀ If the node is a sink node, a new data packet D is sent ₀ ' directly to base station B and jumps to step 307;

step 307: base station B pairReceived data packet D ₀ ’＝{M ₁ ，M ₀ ，MAC ₁₀ Adopting an authentication algorithm to carry out authentication; base station B receives data packet D ₀ ' afterwards, according to itself and the collection node U ₁ And a sink node U ₀ Respectively shared secret key K ₁ 、K ₀ Substituting the MAC function to recalculate the tag MAC ₁ ' and tag MAC ₀ ', then MAC the calculated tag ₀ ' and tag MAC ₁ ' XOR operation to get MAC ₁₀ ', and calculating the resulting MAC ₁₀ ' with the received data packet D ₀ ' aggregation tag MAC ₁₀ Comparing; if the two are the same, the recipient base station B can be confident that the data packet D is available ₀ ' and the recipient base station B can be confident that the data packet D has not been tampered with ₀ ' messages come from the purported sender node U ₁ And node U ₀ (ii) a Otherwise, the receiver BS B cannot acknowledge the packet D ₀ ' the message is not tampered with, and it cannot be certain that the data packet D is ₀ ' messages come from the purported sender node U ₁ And node U ₀ 。

EXAMPLE III

A method for message authentication in wireless sensor network is disclosed, which is at sink node U ₀ As shown in fig. 4, the message flow diagram for implementing message authentication by aggregating the MAC tag and 1 aggregation tag of the local node includes the following steps:

step 401: judging node U ₀ There is already a data packet in the current wireless receiving buffer, i.e. from node U, that needs to be forwarded ₀ Front node U _r Data packet D of _r ’＝{M ₁ ，M ₂ ，……，M _r ，MAC _1R At the same time node U ₀ With packet M ₀ Needs to be sent to the base station B;

step 402: continuing to execute step 403;

step 403: acquisition node U ₀ With packet M ₀ The number of data packets to be transmitted to the base station BMesh z =1, and meanwhile, the MAC algorithm is adopted to generate the information packet M ₀ MAC label MAC of information ₀ Tag MAC ₀ Is to transmit the information packet M ₀ And a secret key K ₀ Carrying in a Mac function to obtain; tag MAC ₀ Attached to its packet M ₀ Then form its data packet D ₀ ＝{M ₀ ，MAC ₀ }; node U ₀ There is a data packet D in the current wireless receiving buffer that needs to be transferred _r ', the number of the data packets to be transferred x =1;

step 404: judging x + z =2> -1, and continuing to execute step 405;

step 405: x + z =2&gt 1 shows that 2 tags can be processed by adopting an aggregation algorithm and are in a node U ₀ Processing the label by adopting an aggregation MAC algorithm, and transmitting the data packet D to be transmitted _r ' the aggregation tag MAC _1R And node U ₀ Message authentication MAC tag MAC ₀ Generating aggregation label MAC after aggregation by adopting aggregation MAC algorithm ₁₀ ，And information in the data packets participating in aggregation and the node U are combined according to the sequence of label aggregation ₀ Information packet M of ₀ Are arranged in sequence to form a new information packet M ₀ ’＝{M ₁ ，M ₂ ，……，M _r ，M ₀ }；

Step 406: node U ₀ Site generated new tag MAC ₁₀ Attach to it a new packet M ₀ ' post-generation of a new data packet D ₀ ’＝{M ₁ ，M ₂ ，……，M _r ，M ₀ ，MAC ₁₀ } this node U ₀ Is the sink node, a new data packet D is sent ₀ ' directly send to base station B and jump to step 407;

step 407: base station B receives data packet D ₀ ’＝{M ₁ ，M ₂ ，……，M _r ，M ₀ ，MAC ₁₀ Adopting an authentication algorithm to carry out authentication; after receiving the data packet, the base station B according to the base stationBody and node U ₁ Node U ₂ 823060, 8230node U _r Node U ₀ Respectively shared secret key K ₁ 、K ₂ 、……、K _r 、K ₀ Substituting the MAC function to recalculate the tag MAC ₁ ’、MAC ₂ ’、……、MAC _r ’、MAC ₀ ' and then MAC the calculated tag ₁ ’、MAC ₂ ’、……、MAC _r ’、MAC ₀ ' performing XOR operation to obtain tag MAC ₁₀ ', and calculating the obtained label MAC ₁₀ ' with received data packet D ₀ ' the aggregation tag MAC ₁₀ Comparing; if the two are the same, the recipient base station B can be sure that packet D is present ₀ ' the message has not been tampered with and the recipient base station B can be confident that the data packet D is ₀ ' messages come from the purported sender node U ₁ 、U ₂ 、……、U _r 、U ₀ (ii) a Otherwise, the receiver base station B cannot acknowledge the data packet D ₀ ' the message has not been tampered with and packet D cannot be assured ₀ ' messages come from the purported sender node U ₁ 、U ₂ 、……、U _r 、U ₀ 。

Example four

A method for message authentication in wireless sensor network is disclosed, which is at sink node U ₀ As shown in fig. 5, the message flow diagram for implementing message authentication by aggregating the MAC tag of the local node and 1 aggregation tag of 1 MAC tag includes the following steps:

step 501: judging node U ₀ There are already 2 packets to be forwarded in the current wireless receive buffer, i.e. from node U ₀ Front node U _p And U _q Are respectively D _p ’＝{M _i ，……，M _p ，MAC _IP }、D _q ’＝{M _q ，MAC _q At the same time node U ₀ With packet M ₀ Needs to be sent to the base station B;

step 502: continuing to execute step 503;

step 503: node U ₀ With packet M ₀ The data packets are required to be sent to a base station B, the number z =1 of the data packets required to be sent is adopted, and meanwhile, an information packet M is generated by adopting an MAC algorithm ₀ MAC label MAC of information ₀ Tag MAC ₀ Is to transmit the information packet M ₀ And a secret key K ₀ By substituting Mac function, tag MAC ₀ Attached to packet M ₀ Post-formation packet D ₀ ＝{M ₀ ，MAC ₀ }; node U ₀ There are 2 data packets D to be transferred in the current wireless receiving buffer _p ' and D _q ', the number of packets to be relayed x =2;

step 504: determining x + z =3> -1, and continuing to execute step 505;

step 505: x + z =3&gt 1 shows that 3 tags can be processed by adopting an aggregation algorithm and are arranged at a node U ₀ Processing the label by adopting an aggregation MAC algorithm, and transmitting the data packet D to be transmitted _p ' and D _q ' the aggregation tag MAC _1P Message authentication tag MAC _q And node U ₀ Message authentication tag MAC of ₀ Generating aggregation label MAC after aggregation by adopting aggregation MAC algorithm _I0 I.e. byAnd information in the data packets participating in aggregation and the node U are combined according to the sequence of label aggregation ₀ Information packet M of ₀ Are sequentially arranged to form a new information packet M ₀ ’＝{M _i ，……，M _p ，M _q ，M ₀ }；

Step 506: node U ₀ To the generated aggregated tag MAC _I0 Attach to it a new packet M ₀ ' post-generation of a New data packet D ₀ ’＝{M _i ，……，M _p ，M _q ，M ₀ ，MAC _I0 }, this node U ₀ Is the sink node, the new data packet D is sent ₀ ' directly send to base station B and jump to step 507;

step 507: base station B receivesTo data packet D ₀ ’＝{M _i ，……，M _p ，M _q ，M ₀ ，MAC _I0 Adopting an authentication algorithm to carry out authentication; after receiving the message of the data packet, the base station B according to the base station B and the node U _i 823060, node U _p Node U _q Node U ₀ Respectively shared secret key K _i 、……、K _p 、K _q 、K ₀ Substituting the MAC function to recalculate the tag MAC _i ’、MAC _p ’、……、MAC _q ’、MAC ₀ ', then MAC the calculated tag _i ’、MAC _p ’、……、MAC _q ’、MAC ₀ ' performing XOR operation to get tag MAC _I0 ', and calculating the obtained label MAC _I0 ' with received data packet D ₀ ' aggregation tag MAC _I0 Comparing; if the two are the same, the recipient base station B can be sure that packet D is present ₀ ' the message has not been tampered with and the recipient base station B can be confident that the data packet D is ₀ ' messages come from the purported sender node U _i 823060, node U _p Node U _q Node U ₀ (ii) a Otherwise, the receiver BS B cannot acknowledge the packet D ₀ ' the message is not tampered with, and it cannot be certain that the data packet D is ₀ ' messages come from the purported sender node U _i 823060, node U _p Node U _q Node U ₀ 。

EXAMPLE five

A method for message authentication in wireless sensor network is disclosed, which is at sink node U ₀ As shown in fig. 6, the message flow diagram for implementing message authentication by aggregating the MAC tag of the local node and multiple aggregation tags of multiple MAC tags includes the following steps:

step 601: judging node U ₀ There are multiple data packets to be transferred in the current wireless receiving buffer, which are from the node U respectively _a Data packet D of _a ’＝{M _d ，……，M _a ，MAC _DA }、\8230; \ 8230;, originating from node U _e Data packet D of _e ’＝{M _h ，……，M _e ，MAC _HE Is from node U _j Data packet D of _j ’＝{M _j ，MAC _j 8230from node U _s Data packet D of _s ’＝{M _s ，MAC _s At the same time node U ₀ With packet M ₀ Needs to be sent to the base station B;

step 602: continuing to execute step 603;

step 603: node U ₀ With information packet M ₀ The number of the data packets to be transmitted z =1 is required to be transmitted to the base station B, and meanwhile, the information packet M is generated by adopting the MAC algorithm ₀ MAC label MAC of information ₀ Tag MAC ₀ Is to transmit the information packet M ₀ And a secret key K ₀ Bringing into the Mac function results in the tag MAC ₀ Attached to its packet M ₀ Then form its data packet D ₀ ＝{M ₀ ，MAC ₀ }; node U ₀ The current wireless receiving buffer has a plurality of data packets to be transferred, the number of the data packets to be transferred is represented by x, and x is the time>2；

step 605: x + z&gt, 1 indicates that more than 3 labels can be processed by adopting an aggregation algorithm and are positioned at a node U ₀ Processing the label by adopting an aggregation MAC algorithm, and transmitting D in the data packet to be transferred _a ’、……、D _e ’、D _j ’、……、D _s ' the aggregate tag MAC _DA 、……、MAC _HE And message authentication tag MAC _j 、……、MAC _s And a collection node U ₀ Message authentication tag MAC of ₀ Generating aggregation label MAC after aggregation by adopting aggregation MAC algorithm _D0 And is andand information in the data packets participating in aggregation and the acquisition node U are acquired according to the sequence of label aggregation ₀ Information packet M of ₀ Are arranged in sequence and are arranged in sequence,form a new information packet M ₀ ’＝{M _d ，……，M _a ，……，M _h ，……，M _e ，M _j ，……，M _s ，M ₀ }；

Step 606: node U ₀ Site generated new tag MAC _D0 Attach to it a new packet M ₀ ' post-generation of a New data packet D ₀ ’＝{M _d ，……，M _a ，……，M _h ，……，M _e ，M _j ，……，M _s ，M ₀ ，MAC _D0 } this node U ₀ Is the sink node, the new data packet D is sent ₀ ' directly to base station B and jumps to step 607;

step 607: base station B receives data packet D ₀ ’＝{M _d ，……，M _a ，……，M _h ，……，M _e ，M _j ，……，M _s ，M ₀ ，MAC _D0 Adopting an authentication algorithm to perform authentication; the base station B receives the data packet D ₀ ' after the message, according to itself and node U _d 8230; 8230a node U _a 823060, 8230node U _h 8230a' node U _e Node U _j 823060, 8230node U _s Node U ₀ Respectively shared secret key K _d 、……、K _a 、……、K _h 、……、K _e 、K _j 、……、K _s 、K ₀ Substituting the MAC function to recalculate the tag MAC _d ’、……、MAC _a ’、……MAC _h ’、……MAC _e ’、MAC _j ’、……、MAC _s ’、MAC ₀ ' and then MAC the calculated tag _d ’、……、MAC _a ’、……、MAC _h ’、……、MAC _e ’、MAC _j ’、……、MAC _s ’、MAC ₀ ' performing XOR operation to obtain tag MAC _D0 ', and calculating the obtained label MAC _D0 ' with received data packet D ₀ ' the aggregation tag MAC _D0 Comparing; if the two are the same, the receiverBase station B can be confident of packet D ₀ ' the message has not been tampered with and the recipient base station B can be confident that the data packet D is ₀ ' messages come from the purported sender node U _d 823060, 8230node U _a 823060, 8230node U _h 823060, 8230node U _e Node U _j 823060, 8230node U _s Node U ₀ (ii) a Otherwise, the receiver base station B cannot acknowledge the data packet D ₀ ' the message is not tampered with, and it cannot be certain that the data packet D is ₀ ' messages come from the purported sender node U _d 823060, node U _a 823060, 8230node U _h 823060, 8230node U _e Node U _j 823060, node U _s Node U ₀ 。

Example six

Message authentication method in wireless sensor network, data packet slave node U _i From the beginning, through a plurality of transit nodes U _j 、U _q ……U _p 、U _x To the sink node U ₀ At node U _i 、U _j 、U _q ……U _p 、U _x 、U ₀ A message flow diagram for implementing message authentication by respectively adopting an aggregation MAC algorithm is shown in fig. 7, and the steps are as follows:

step 701: judging node U _i The current wireless receiving buffer does not have the data packet needing to be transferred, but the node U _i With packet M _i Needs to be sent to the base station B;

step 702: continuing to execute step 703;

step 703: node U _i With packet M _i The number of the data packets to be transmitted z =1 is transmitted to the base station B, and M is generated by adopting the MAC algorithm _i MAC label MAC of information _i Attached to its packet M _i Then form its data packet D _i ＝{M _i ，MAC _i }; node U _i The current wireless receiving buffer has no data packets needing to be transferred, and the number of the data packets needing to be transferred x =0;

step 706: node U _i The data packet sent out by the wireless is covered by the next hop node U _j Transferred at node U _j The processing at the node is in U _i The processing procedures of the nodes are completely the same; are not described in detail herein;

step 707: node U _i The data packet sent out by wireless is transferred to a sink node U through a plurality of other nodes through a multi-hop network ₀ At each transit node, i.e. node U _q 823060, 8230node U _p Node U _x Processing at equal places is in U _i The processing procedures of the nodes are completely the same, and are not described again here;

step 708: at sink node U ₀ Is processed at the same node U _i The treatment process is the same as follows;

step 701': judging node U ₀ The current wireless receiving buffer has the point U needing to be transferred _x Data packet D of _x ’＝{M _i ，M _j ，M _q ，……，M _p ，M _x ，MAC _IX }, simultaneous nodes U ₀ With packet M ₀ Needs to be sent to the base station B;

a step 702': go on to step 703';

step 703': node U ₀ With packet M ₀ The number z =1 of the data packets to be transmitted is required to be transmitted to the base station B, and meanwhile, the information packet M is generated by adopting the MAC algorithm ₀ MAC label MAC of information ₀ Tag MAC ₀ Attached to its packet M ₀ Then form its data packet D ₀ ’＝{M ₀ ，MAC ₀ }; node U ₀ The current wireless receiving buffer has a data packet D needing to be transferred _x ', the number of the data packets to be transferred x =1;

step 705': x + z =2&gt, 1 shows that 2 tags can be processed by adopting an aggregation algorithm, and then the node U is provided with a label list ₀ Processing the label by adopting an aggregation MAC algorithm to generate a new aggregation label MAC _I0 And according to the sequence of label aggregation, the information in the data packet participating in aggregation and the node U are combined ₀ Information packet M of ₀ Are arranged in sequence to form a new information packet M ₀ ’＝{M _i ，M _j ，M _q ，……，M _p ，M _x ，M ₀ }; the new tag is the MAC _I0 The new packet is M ₀ ’＝{M _i ，M _j ，M _q ，……，M _p ，M _x ，M ₀ And jump to step 706';

step 706': node U ₀ Site generated new tag MAC _I0 Attach to it a new packet M ₀ ' post-generation of a new data packet D ₀ ’＝{M _i ，M _j ，M _q ，……，M _p ，M _x ，M ₀ ，MAC _I0 } this node U ₀ Is a sink node, and sends a new data packet D ₀ ' directly to base station B and jumps to step 710;

step 710: base station B receives data packet D ₀ ’＝{M _i ，M _j ，M _q ，……，M _p ，M _x ，M ₀ ，MAC _I0 Adopting an authentication algorithm to carry out authentication; that is, the base station B receives the message and then according to itself and the node U _i Node U _j Node U _q 823060, 8230node U _p Node U _x Node U ₀ Respectively shared secret key K _i 、K _j 、K _q 、……、K _p 、K _x 、K ₀ Substituting the MAC function to recalculate the tag MAC _i ’、MAC _j ’、MAC _q ’、……、MAC _p ’、MAC _x ’、MAC ₀ ', then MAC the calculated tag _i ’、MAC _j ’、MAC _q ’、……、MAC _p ’、MAC _x ’、MAC ₀ ' performing XOR operation to obtain tag MAC _I0 ', and calculating the obtained label MAC _I0 ' with received data packet D ₀ ' tag MAC of _I0 Comparing; if the two are the same, the recipient base station B can be confident that packet D is data packet D ₀ ' the message has not been tampered with and the recipient base station B can be confident that the data packet D is ₀ ' messages come from the purported sender node U _i Node U _j Node U _q 823060, 8230node U _p Node U _x Node U ₀ (ii) a Otherwise, the receiver BS B cannot acknowledge the packet D ₀ ' the message is not tampered with, and it cannot be certain that the data packet D is ₀ ' messages come from the purported sender node U _i Node U _j Node U _q 823060, node U _p Node U _x Node U ₀ 。

Different sending nodes calculate a plurality of MAC message authentication labels according to information to be sent, and the MAC message authentication labels are aggregated on a multi-hop relay node by adopting an aggregation MAC algorithm to form a short label which is attached to the message and then forwarded; the short label can still be used by the receiving node to authenticate the received message and the identity of the source party; the aggregation algorithm executes exclusive-or operation, the calculation amount is small, and the load of the data packet wirelessly transmitted in the whole network can be greatly reduced, so that the energy and bandwidth consumed by wirelessly transmitting data are greatly reduced, the survival time of the node is prolonged, and the service life of the network is prolonged; particularly, when the number of nodes is large or communication is frequent, the energy efficiency advantage is more obvious. Meanwhile, since the receiving node and the plurality of sending nodes share different keys, respectively, and other nodes do not know the keys, the receiver can be assured that the message has not been tampered with, and the receiver can be assured that the message is from the purported sender.

The above description is only for the purpose of illustrating the preferred embodiments of the present invention and is not to be construed as limiting the invention, and any modifications, equivalents, improvements and the like that fall within the spirit and principle of the present invention are intended to be included therein.

Claims

1. A method for message authentication in wireless sensor network is characterized in that the wireless sensor network comprises a base station B and a sink node U ₀ And at least one collection node, sink node U ₀ Is the only node communicating with the base station B, and all the collection nodes can send data to the sink node U through the multi-hop wireless network ₀ Node U _i The packet to be sent to base station B is M _i Node U _i The secret key between the base station B and the base station is K _i I =0,1, \8230;, m, m +1 are the number of nodes; the method comprises the following steps:

and 3, step 3: if node U _i With information packet M _i Needs to be sent to a base station B, the number of data packets to be sent is z, and an MAC algorithm is adopted to utilize a secret key K _i And packet M _i Information generation MAC tag MAC _i MAC tag MAC _i Attached to its packet M _i Post-formation packet D _i ＝{M _i ，MAC _i }; if node U _i One or more data packets needing to be transferred are currently in the wireless receiving buffer, and the number of the data packets needing to be transferred is x；

And 5: node U _i The generated new label is attached to the new information packet to generate a new data packet D _i ', determine the node U _i Whether it is a sink node U ₀ If so, the new data packet D is sent _i ' directly sends to the base station B, and jumps to step 8; otherwise, the new data packet D is sent _i ' wireless transmission;

and step 8: and the base station B identifies the received data packet by adopting an authentication algorithm.

2. Method of message authentication in a wireless sensor network according to claim 1, characterized in that the tags generated by the MAC algorithmWherein, the node U _i The packet to be sent to base station B is M _i Node U _i The secret key between the base station B and the base station B is K _i ，i＝0，1，……，m，And K is _i ∈{0,1} ⁿ N is the key length, packet M _i ∈{0,1} ^* Mac () is a public function, a value that can produce a fixed length, tag _i Is a MAC tag.

3. The method of claim 1, wherein the input to the aggregated MAC algorithm is one or more MAC tag tags _i 、……、tag _n 、……、tag _j Output is tag _IJ I.e. aggregation tag MAC _IJ And is and is an exclusive or operation;

the input of the aggregation MAC algorithm is one or more than one MAC label tag _i 、……、tag _n 、……、tag _j And one or more polymeric tags tag _PQ 、……、tag _UW 、……、tag _RS The output is tag _1S I.e. the polymeric label is:

is an exclusive or operation.

4. A method for message authentication in a wireless sensor network according to claim 1 or 2, characterized in that the authentication algorithm of the base station B is:

and (3) calculating:

wherein,received by base station B the data packet is D' = { M = _i ，……，M _j ，……，M _p ，……，M _y ，tag _IY Mac () is a public function, a value that can produce a fixed length.

5. A method for message authentication in a wireless sensor network according to claim 3, characterized by the steps of:

step 301: judging node U ₀ There is already one transfer-required from node U in the current wireless receiving buffer ₁ Data packet D of ₁ ＝{M ₁ ，MAC ₁ }, node U ₀ An information packet needs to be sent to the base station B;

step 302: continuing to execute step 303;

step 303: node U ₀ With packet M ₀ The number of data packets z =1 to be transmitted is required to be transmitted to the base station B, and meanwhile, the information packet M is generated by adopting the MAC algorithm ₀ MAC label MAC of information ₀ MAC tag MAC ₀ Attached to packet M ₀ Then form its data packet D ₀ ＝{M ₀ ，MAC ₀ }; node U ₀ The current wireless receiving buffer has a data packet D to be transferred ₁ The number of data packets to be transferred x =1;

step 304: if x + z =2> -1, continuing to execute step 305;

step 305: data packet D to be transferred ₁ Message authentication tag MAC in ₁ And node U ₀ Message authentication tag MAC of ₀ Generating new aggregation label MAC after aggregation by adopting aggregation MAC algorithm ₁₀ And the information packets M in the data packets participating in the aggregation are processed according to the sequence of the label aggregation ₁ And acquisition node U ₀ Information packet M of ₀ Are arranged in sequence to form a new information packet M ₀ ’＝{M ₁ ，M ₀ }；

Step 306: node U ₀ To the generated aggregated tag MAC ₁₀ Attach to it a new packet M ₀ ' post-generation of a new data packet D ₀ ’＝{M ₁ ，M ₀ ，MAC ₁₀ Judge the node U ₀ Is the sink node, the new data packet D is sent ₀ ' directly send to base station B and jump to step 307;

step 307: base station B receives data packet D ₀ ’＝{M ₁ ，M ₀ ，MAC ₁₀ Adopting an authentication algorithm to perform authentication; base station B receives data packet D ₀ ' later, according to itself and node U ₁ Node U ₀ Respectively shared secret key K ₁ 、K ₀ Substituting the MAC function to recalculate the tag MAC ₁ ' and tag MAC ₀ ', then MAC the calculated tag ₀ ' and tag MAC ₁ ' XOR operation to get MAC ₁₀ ', and calculating the resulting MAC ₁₀ ' with received data packet D ₀ ' the aggregation tag MAC ₁₀ Carrying out comparison; if the two are the same, the recipient base station B can be confident that the data packet D is available ₀ ' and the recipient base station B can be confident that the data packet D has not been tampered with ₀ ' messages come from the purported sender node U ₁ And node U ₀ (ii) a Otherwise, the receiver base station B cannot acknowledge the data packet D ₀ ' the message has not been tampered with and packet D cannot be assured ₀ ' messages come from the purported sender node U ₁ And node U ₀ 。

6. A method for message authentication in a wireless sensor network according to claim 3, characterized by the steps of:

step 401: judging node U ₀ Currently, there is already a node U in the wireless receiving buffer that needs to be transferred _r Data packet D of _r ’＝{M ₁ ，M ₂ ……M _r ，MAC _1R At the same time node U ₀ With information packet M ₀ Needs to be sent to the base station B;

step 402: continuing to execute step 403;

step 403: node U ₀ With packet M ₀ The data packets are required to be sent to a base station B, the number z =1 of the data packets required to be sent is adopted, and meanwhile, an information packet M is generated by adopting an MAC algorithm ₀ MAC label MAC of information ₀ MAC tag MAC ₀ Attached to its packet M ₀ Then form its data packet D ₀ ＝{M ₀ ，MAC ₀ }; node U ₀ The current wireless receiving buffer has a data packet D to be transferred _r ', the number of packets to be relayed x =1;

step 404: judging x + z =2> -1, and continuing to execute step 405;

step 405: at node U ₀ Processing the label by adopting an aggregation MAC algorithm, and transmitting the data packet D to be transmitted _r ' aggregation tag MAC _1R And node U ₀ Message authentication MAC tag MAC ₀ Generating aggregation label MAC after aggregation by adopting aggregation MAC algorithm ₁₀ And information in the data packets participating in aggregation and the node U are combined according to the sequence of label aggregation ₀ Information packet M of ₀ Are sequentially arranged to form a new information packet M ₀ ’＝{M ₁ ，M ₂ ，……，M _r ，M ₀ }；

Step 406: node U ₀ Site generated new tag MAC ₁₀ Attach to it a new packet M ₀ ' post-generation of a new data packet D ₀ ’＝{M ₁ ，M ₂ ，……，M _r ，M ₀ ，MAC ₁₀ } this node U ₀ Is the sink node, it willNew data packet D ₀ ' directly send to base station B and jump to step 407;

step 407: base station B receives data packet D ₀ ’＝{M ₁ ，M ₂ ，……，M _r ，M ₀ ，MAC ₁₀ Adopting an authentication algorithm to carry out authentication; after receiving the data packet, the base station B according to the data packet and the node U ₁ Node U ₂ 823060, node U _r Node U ₀ Respectively shared secret key K ₁ 、K ₂ 、……、K _r 、K ₀ Substituting the MAC function to recalculate the tag MAC ₁ ’、MAC ₂ ’、……、MAC _r ’、MAC ₀ ' and then MAC the calculated tag ₁ ’、MAC ₂ ’、……、MAC _r ’、MAC ₀ ' performing XOR operation to get tag MAC ₁₀ ' and calculating the obtained tag MAC ₁₀ ' with the received data packet D ₀ ' the aggregation tag MAC ₁₀ Carrying out comparison; if the two are the same, the recipient base station B can be sure that packet D is present ₀ ' the message has not been tampered with and the recipient base station B can be confident that the data packet D is ₀ ' messages come from the purported sender node U ₁ 、U ₂ 、……、U _r 、U ₀ (ii) a Otherwise, the receiver base station B cannot acknowledge the data packet D ₀ ' the message is not tampered with, and it cannot be certain that the data packet D is ₀ ' messages come from the purported sender node U ₁ 、U ₂ 、……、U _r 、U ₀ 。

7. The method of claim 1, comprising the steps of:

step 501: judging node U ₀ There are 2 data packets to be transferred in the current wireless receiving buffer, which are from the node U respectively _p Data packet D of _p ’＝{M _i ，……，M _p ，MAC _IP And from node U _q Middle data packet D _q ’＝{M _q ，MAC _q At the same time node U ₀ With packet M ₀ Needs to be sent to the base station B;

step 502: continuing to execute step 503;

step 503: node U ₀ With packet M ₀ The data packets are required to be sent to a base station B, the number z =1 of the data packets required to be sent is adopted, and meanwhile, an information packet M is generated by adopting an MAC algorithm ₀ MAC label MAC of information ₀ Tag MAC ₀ Attached to packet M ₀ Post-formation packet D ₀ ＝{M ₀ ，MAC ₀ }; node U ₀ There are 2 data packets D to be transferred in the current wireless receiving buffer _p ' and D _q ', the number of packets to be relayed x =2;

step 504: determining x + z =3> -1, and continuing to execute step 505;

step 505: at node U ₀ Processing the label by adopting an aggregation MAC algorithm, and transmitting the data packet D to be transmitted _p ' and D _q ' the aggregation tag MAC _1P Message authentication tag MAC _q And node U ₀ Message authentication tag MAC of ₀ Generating aggregation label MAC after aggregation by adopting aggregation MAC algorithm _I0 And information in the data packets participating in aggregation and the node U are combined according to the sequence of label aggregation ₀ Information packet M of ₀ Are arranged in sequence to form a new information packet M ₀ ’＝{M _i ，……，M _p ，M _q ，M ₀ }；

Step 506: node U ₀ To the generated aggregated tag MAC _I0 Attach to it a new packet M ₀ ' post-generation of a new data packet D ₀ ’＝{M _i ，……，M _p ，M _q ，M ₀ ，MAC _I0 }, this node U ₀ If the node is a sink node, a new data packet D is sent ₀ ' directly send to base station B and jump to step 507;

step 507: base station B receives data packet D ₀ ’＝{M _i ，……，M _p ，M _q ，M ₀ ，MAC _I0 Adopting an authentication algorithm to perform authentication; cancellation of data packets received by base station BAfter that, according to the self and the node U _i 823060, 8230node U _p Node U _q Node U ₀ Respectively shared secret key K _i 、……、K _p 、K _q 、K ₀ Substituting the MAC function to recalculate the tag MAC _i ’、MAC _p ’、……、MAC _q ’、MAC ₀ ', then MAC the calculated tag _i ’、MAC _p ’、……、MAC _q ’、MAC ₀ ' performing XOR operation to obtain tag MAC _I0 ' and calculating the obtained tag MAC _I0 ' with received data packet D ₀ ' aggregation tag MAC _I0 Carrying out comparison; if the two are the same, the recipient base station B can be confident that packet D is data packet D ₀ ' the message has not been tampered with and the recipient base station B can be confident that the data packet D is ₀ ' messages come from the purported sender node U _i 823060, 8230node U _p Node U _q Node U ₀ (ii) a Otherwise, the receiver BS B cannot acknowledge the packet D ₀ ' the message has not been tampered with and packet D cannot be assured ₀ ' messages come from the purported sender node U _i 823060, 8230node U _p Node U _q Node U ₀ 。

8. The method of claim 1, comprising the steps of:

step 601: judging node U ₀ There are multiple data packets to be transferred in the current wireless receiving buffer, which are from the node U respectively _a Data packet D of _a ’＝{M _d ，……，M _a ，MAC _DA 8230from node U _e Data packet D of _e ’＝{M _h ，……，M _e ，MAC _HE From node U _j Data packet D of _j ’＝{M _j ，MAC _j 8230from node U _s Data packet D of _s ’＝{M _s ，MAC _s At the same time node U ₀ With packet M ₀ Need to be sent to the baseA station B;

step 602: continuing to execute step 603;

step 603: node U ₀ With information packet M ₀ The number z =1 of the data packets to be transmitted is required to be transmitted to the base station B, and meanwhile, the information packet M is generated by adopting the MAC algorithm ₀ MAC label MAC of information ₀ Tag MAC ₀ Attached to its packet M ₀ Then form its data packet D ₀ ＝{M ₀ ，MAC ₀ }; node U ₀ The current wireless receiving buffer has a plurality of data packets needing to be transferred, and the number of the data packets needing to be transferred is x>2；

step 605: at node U ₀ Processing the label by adopting an aggregation MAC algorithm, and transmitting the D in the data packet to be transmitted _a ’、……、D _e ’、D _j ’、……、D _s ' the aggregate tag MAC _DA 、……、MAC _HE And message authentication tag MAC _j 、……、MAC _s And a collection node U ₀ Message authentication tag MAC of ₀ Generating aggregation label MAC after aggregation by adopting aggregation MAC algorithm _D0 And information in the data packets participating in aggregation and the nodes U are combined according to the sequence of label aggregation ₀ Information packet M of ₀ Are arranged in sequence to form a new information packet M ₀ ’＝{M _d ，……，M _a ，……，M _h ，……，M _e ，M _j ，……，M _s ，M ₀ }；

Step 606: node U ₀ Site generated new tag MAC _D0 Attach to its new packet M ₀ ' post-generation of a new data packet D ₀ ’＝{M _d ，……，M _a ，……，M _h ，……，M _e ，M _j ，……，M _s ，M ₀ ，MAC _D0 }, this node U ₀ Is the sink node, the new data packet D is sent ₀ ' directly to base station B and jumps to step 607;

step 607: base station B dockingReceived data packet D ₀ ’＝{M _d ，……，M _a ，……，M _h ，……，M _e ，M _j ，……，M _s ，M ₀ ，MAC _D0 Adopting an authentication algorithm to carry out authentication; the base station B receives the data packet D ₀ ' after the message, according to itself and node U _d 823060, node U _a 823060, node U _h 823060, 8230node U _e Node U _j 823060, 8230node U _s Node U ₀ Respectively shared secret key K _d 、……、K _a 、……、K _h 、……、K _e 、K _j 、……、K _s 、K ₀ Substituting the MAC function to recalculate the tag MAC _d ’、……、MAC _a ’、……、MAC _h ’、……、MAC _e ’、MAC _j ’、……、MAC _s ’、MAC ₀ ' and then MAC the calculated tag _d ’、……、MAC _a ’、……、MAC _h ’、……、MAC _e ’、MAC _j ’、……、MAC _s ’、MAC ₀ ' performing XOR operation to obtain tag MAC _D0 ' and calculating the obtained tag MAC _D0 ' with the received data packet D ₀ ' aggregation tag MAC _D0 Comparing; if the two are the same, the recipient base station B can be confident that packet D is data packet D ₀ ' the message has not been tampered with and the recipient base station B can be confident that the data packet D is ₀ ' messages come from the purported sender node U _d 823060, node U _a 823060, 8230node U _h 823060, 8230node U _e Node U _j 823060, 8230node U _s Node U ₀ (ii) a Otherwise, the receiver BS B cannot acknowledge the packet D ₀ ' the message has not been tampered with and packet D cannot be assured ₀ ' messages come from the purported sender node U _d 823060, node U _a 823060, 8230node U _h 823060, 8230node U _e Node U _j 823060, 8230node U _s Node U ₀ 。

9. The method of claim 1, comprising the steps of:

step 702: continuing to execute step 703;

step 703: node U _i With packet M _i The number of the data packets to be transmitted z =1 is transmitted to the base station B, and M is generated by adopting the MAC algorithm _i MAC label MAC of information _i Attached to its packet M _i Then form its data packet D _i ＝{M _i ，MAC _i }; node U _i The current wireless receiving buffer has no data packets needing to be transferred, and the number of the data packets needing to be transferred is x =0;

step 708: at sink node U ₀ Is processed at the same node U _i The processing procedure is the same, and the step is transferred to 701';

a step 702': go on to step 703';

a step 703': node U ₀ With information packet M ₀ The number of the data packets to be transmitted z =1 is required to be transmitted to the base station B, and meanwhile, the information packet M is generated by adopting the MAC algorithm ₀ MAC label MAC of information ₀ Tag MAC ₀ Attached to its packet M ₀ Then form its data packet D ₀ ’＝{M ₀ ，MAC ₀ }; node U ₀ The current wireless receiving buffer has a data packet D needing to be transferred _x ', the number of the data packets to be transferred x =1;

step 704': judging x + z =2&gt, 1, the node U is described ₀ 2 tags are located, the aggregation algorithm is needed to be adopted for processing, and the step 705' is continuously executed;

step 705': x + z =2&gt, 1 indicates that 2 tags can be processed by adopting an aggregation algorithm, and then the node U is provided with a label list ₀ Processing the label by adopting an aggregation MAC algorithm to generate a new aggregation label MAC _I0 And according to the sequence of label aggregation, the information in the data packet participating in aggregation and the node U are combined ₀ Information packet M of ₀ Are arranged in sequence to form a new information packet M ₀ ’＝{M _i ，M _j ，M _q ，……，M _p ，M _x ，M ₀ }; the new tag is the MAC _I0 The new packet is M ₀ ’＝{M _i ，M _j ，M _q ，……，M _p ，M _x ，M ₀ And jump to step 706';

step 706': will be provided withNode U ₀ Site generated new tag MAC _I0 Attach to it a new packet M ₀ ' post-generation of a new data packet D ₀ ’＝{M _i ，M _j ，M _q ，……，M _p ，M _x ，M ₀ ，MAC _I0 } this node U ₀ Is a sink node, and sends a new data packet D ₀ ' directly to base station B and jumps to step 710;

step 710: base station B receives data packet D ₀ ’＝{M _i ，M _j ，M _q ，……，M _p ，M _x ，M ₀ ，MAC _I0 Adopting an authentication algorithm to carry out authentication; that is, after receiving the message, the base station B according to itself and the node U _i Node U _j Node U _q 823060, 8230node U _p Node U _x Node U ₀ Respectively shared secret key K _i 、K _j 、K _q 、……、K _p 、K _x 、K ₀ Substituting the MAC function to recalculate the tag MAC _i ’、MAC _j ’、MAC _q ’、……、MAC _p ’、MAC _x ’、MAC ₀ ', then MAC the calculated tag _i ’、MAC _j ’、MAC _q ’、……、MAC _p ’、MAC _x ’、MAC ₀ ' performing XOR operation to get tag MAC _I0 ', and calculating the obtained label MAC _I0 ' with received data packet D ₀ ' tag MAC of _I0 Comparing; if the two are the same, the recipient base station B can be confident that packet D is data packet D ₀ ' the message has not been tampered with and the recipient base station B can be confident that the data packet D is ₀ ' messages come from the purported sender node U _i Node U _j Node U _q 823060, node U _p Node U _x Node U ₀ (ii) a Otherwise, the receiver BS B cannot acknowledge the packet D ₀ ' the message has not been tampered with and packet D cannot be assured ₀ ' messages come from the purported sender node U _i Node U _j Node U _q 823060, node U _p Section (B)Point U _x Node U ₀ 。