CN111698680B - Cluster-based cooperative interference safety communication method in wireless sensor network - Google Patents

Cluster-based cooperative interference safety communication method in wireless sensor network Download PDF

Info

Publication number
CN111698680B
CN111698680B CN202010378566.3A CN202010378566A CN111698680B CN 111698680 B CN111698680 B CN 111698680B CN 202010378566 A CN202010378566 A CN 202010378566A CN 111698680 B CN111698680 B CN 111698680B
Authority
CN
China
Prior art keywords
communication
cluster
information
noise
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.)
Active
Application number
CN202010378566.3A
Other languages
Chinese (zh)
Other versions
CN111698680A (en
Inventor
童飞
祝甜
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Southeast University
Original Assignee
Southeast University
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Southeast University filed Critical Southeast University
Priority to CN202010378566.3A priority Critical patent/CN111698680B/en
Publication of CN111698680A publication Critical patent/CN111698680A/en
Application granted granted Critical
Publication of CN111698680B publication Critical patent/CN111698680B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W12/00—Security arrangements; Authentication; Protecting privacy or anonymity
    • H04W12/02—Protecting privacy or anonymity, e.g. protecting personally identifiable information [PII]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/46—Cluster building
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
    • H04W4/30—Services specially adapted for particular environments, situations or purposes
    • H04W4/38—Services specially adapted for particular environments, situations or purposes for collecting sensor information
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
    • H04W40/32—Connectivity information management, e.g. connectivity discovery or connectivity update for defining a routing cluster membership
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W84/00—Network topologies
    • H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Computer Security & Cryptography (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

The invention discloses a cluster-based cooperative interference secure communication method in a wireless sensor network, which comprises the following steps: s1, forming a plurality of clusters by each sensor node in a system through a clustering algorithm, wherein each cluster consists of a cluster head node and at least two common nodes added into the cluster; s2, before one-time conventional communication, cluster head nodes in two clusters separated by one-hop distance are contacted to perform pre-communication; s3, contacting the receivers in the two parties to generate a plurality of mutually orthogonal chips, randomly reserving one of the chips, and randomly distributing the rest chips to common nodes in the cluster of the receiver; s4, both communication parties carry out formal communication, the sender sends effective information to the receiver, and simultaneously all noise nodes in S3 continuously send noise information to the surroundings so as to interfere an eavesdropper; and S5, after receiving the interfered superposed information, the receiver eliminates the noise information by using the single orthogonal chip stored in the S3, and finally restores the effective information after decoding.

Description

Cluster-based cooperative interference safety communication method in wireless sensor network
Technical Field
The invention relates to the field of wireless sensor network communication safety, in particular to a cluster-based cooperative interference method.
Background
The sensor node is one of the most important data acquisition and data transmission devices of the internet of things, and the wireless sensor network refers to a network formed by organizing and combining the wireless sensor nodes in a free manner by a wireless communication technology. The security of the system is directly related to the accuracy of data sources of the Internet of things and the confidentiality of data transmission. A safe wireless sensor network system is the basis of the Internet of things.
The physical layer security technology based on the information theory can realize strict security theoretically. The idea behind physical layer security is to exploit noise and randomness of the communication channel to limit the eavesdropping capability of an illegitimate recipient. The prevention of communication interception by adding artificial noise is one of the commonly used technical means in physical layer security technology. In the case where even the performance of the main channel is occasionally worse than the average performance of the eavesdropper channel, the method using artificial noise can still ensure a good security rate.
With the continuous development and progress of wireless communication technologies, many wireless communication technologies, such as Multiple-Input-Multiple-Output (MIMO), are widely used. However, in a wireless sensor network environment where energy and resources are limited, it is not practical to equip sensor nodes with multiple antenna arrays. Therefore, the single-antenna sensor nodes can cooperate with each other to transmit and receive data, so that a MIMO system is formed. The single-antenna sensor nodes are distributed in a plurality of clusters according to a certain clustering algorithm, and the sensor nodes in the clusters are cooperatively communicated together.
The main idea of the cooperative interference technology based on clustering is that when two sensor nodes communicate, other nodes in a node cluster can cooperate to generate artificial noise, so that an eavesdropper is interfered to a certain degree, and the confidentiality of communication is ensured.
Disclosure of Invention
The invention aims to provide a relatively safe communication method in an application scene of a wireless sensor network.
To this end, the technical scheme provided by the invention is a cluster-based cooperative interference secure communication method in a wireless sensor network, which comprises the following steps:
s1, forming a plurality of clusters by each sensor node in a system through a clustering algorithm, wherein each cluster is composed of a cluster head node and at least two common nodes added into the cluster, the cluster head node is used for conventional communication, and the common nodes are used for auxiliary communication;
s2, before one-time conventional communication, cluster head nodes in two clusters separated by one-hop distance are contacted to perform pre-communication;
s3, contacting the receivers in the two parties to generate a plurality of mutually orthogonal chips, randomly reserving one of the chips, randomly distributing the rest chips to common nodes in a cluster of the receiver, storing one chip by one common node, and calling the selected common node as a noise node;
S4, both communication parties carry out formal communication, effective information is sent to a receiving party by a sending party, and simultaneously all noise nodes in S3 continuously send noise information to the surroundings to interfere an eavesdropper, wherein the noise information is randomly generated by each noise node and is spread by a single chip obtained in S3;
s5, after receiving the interfered superposed information, the receiver eliminates noise information by using a single orthogonal chip stored in S3, and finally restores effective information after decoding;
further, in the aforementioned S1, Alice communicates with Bob, Eve is an eavesdropping node; there are several common nodes in each cluster, with the cluster head node being used for regular communication and the common nodes being used for auxiliary communication.
Further, in the aforementioned S2, before Alice and Bob need to perform a regular communication, the sender Alice actively contacts the receiver Bob, and this process is a pre-communication.
Further, in the foregoing S3, after the receiving side Bob obtains the pre-communication signal, L (L is less than or equal to the number of common nodes in the cluster where Bob is located) orthogonal chips are generated
Figure BDA0002481159510000021
Then, Bob randomly selects among these orthogonal chips
Figure BDA0002481159510000022
The chips are stored, and L-1 common nodes are randomly selected as noise nodes in the Bob cluster (N is used) 1,N2,…,Nk-1,Nk+1,…,NLRepresentation), the remaining orthogonal chips are processed
Figure BDA0002481159510000023
Respectively sent to these noise nodes, each noise node holding one chip (without loss of generality, N)1Preservation of
Figure BDA0002481159510000024
N2Preservation of
Figure BDA0002481159510000025
Figure BDA0002481159510000026
Preservation of
Figure BDA0002481159510000027
Nk+1Preservation of
Figure BDA0002481159510000028
Preservation of
Figure BDA0002481159510000029
)。
Further, in S4, Alice formally sends valid information to Bob
Figure BDA00024811595100000210
While at the same time noise node N1,N2,…,Nk-1,Nk+1,…,NLInterference information (denoted respectively as
Figure BDA00024811595100000211
) The interference information is spread by the orthogonal chips generated in S3, and is expressed as:
Figure BDA00024811595100000212
the noise node simultaneously transmits the interference information to achieve the purpose of interfering the eavesdropper.
Further, in the foregoing S5, Bob receives the superimposition information C:
Figure BDA00024811595100000213
at this time, Bob uses the orthogonal chips stored in S3
Figure BDA00024811595100000214
Multiplication with the superimposed information C removes interference information:
Figure BDA00024811595100000215
finally, and then
Figure BDA00024811595100000216
The final effective information can be obtained by one-time dot multiplication
Figure BDA00024811595100000217
Figure BDA00024811595100000218
From now on, the secure communication under the wireless sensor network environment is accomplished.
Compared with the prior art, the invention has the following advantages: the method is suitable for being used in a very strict communication environment, and can still play a role even if an eavesdropper occupies a better receiving position relative to a sender than a receiver; moreover, the key for eliminating the noise is only generated and maintained by the receiver, and does not need to be transmitted through a channel, so that the confidentiality of the key is greatly ensured; in addition, the method takes full advantage of the randomness of selection of interfering nodes and the randomness of noise generation, the use of which would be a natural advantage against eavesdropping.
Drawings
Fig. 1 is a flowchart of a cluster-based cooperative jamming security communication method in a wireless sensor network.
Fig. 2 is a network topology structure diagram of the method.
Fig. 3 is a diagram of an exemplary model of a chip distribution process.
FIG. 4 is a diagram of an exemplary model of a conventional communication process.
Fig. 5 is a graph of the results of an analysis of the method with respect to secret capacity.
Detailed Description
The specific steps of the present invention are further illustrated in the following figures. In the drawings, the same or similar symbols or figures represent the same or similar elements or elements having the same or similar functions throughout. Finally, an embodiment including simulation results is described with reference to the drawings, but the embodiment is exemplary and intended to be illustrative of the invention and should not be construed as limiting the invention.
The invention relates to the field of wireless sensor network communication safety, in particular to a cluster-based cooperative interference method. The invention utilizes the strictness of physical layer safety, combines artificial noise technology, clustering technology and cooperative interference technology, and realizes a safety scheme which has lower cost and ensures higher confidentiality rate.
As shown in fig. 1, the cooperative jamming secure communication method of the embodiment of the present invention includes the following steps.
S1, forming a plurality of clusters by each sensor node in the system through a clustering algorithm, wherein each cluster is composed of a cluster head node and at least two common nodes added into the cluster, and the cluster head node is used for conventional communication while the common nodes are used for auxiliary communication.
Specifically, taking the model shown in fig. 2 as an example, three clusters are shown, namely a cluster a, a cluster B, and a cluster E. Each cluster has a cluster head node, which is Alice, Bob and Eve. In addition to this, there are several common nodes in each cluster, the cluster head node being used for regular communication and the common nodes being used for auxiliary communication.
And S2, before one-time conventional communication, the cluster head nodes in two clusters separated by one-hop distance are contacted to perform pre-communication.
Specifically, taking the model shown in fig. 2 as an example, before Alice and Bob need to perform a regular communication, Alice actively contacts Bob, which is a pre-communication process.
And S3, contacting the receivers in the two parties to generate a plurality of mutually orthogonal chips, randomly reserving one of the chips, randomly distributing the rest chips to common nodes in the cluster, storing one chip in one common node, and calling the selected common node as a noise node.
Specifically, taking the model shown in fig. 2 as an example, after the receiving side Bob obtains the pre-communication signal, several orthogonal chips are generated, so as to
Figure BDA0002481159510000041
Figure BDA0002481159510000042
For example. Then, Bob randomly saves one of these orthogonal chips (assumed to be
Figure BDA0002481159510000043
) And randomly selecting three common nodes as noise nodes in the cluster B (assuming N)1、N2、N3) The remaining orthogonal chips
Figure BDA0002481159510000044
Are sent separately to these noisy nodes, each noisy node holding one chip (assuming N1Preservation of
Figure BDA0002481159510000045
N2Preservation of
Figure BDA0002481159510000046
N3Preservation of
Figure BDA0002481159510000047
)。
And S4, the two communication parties carry out formal communication, the effective information is sent to the receiving party by the sending party, and simultaneously, all the noise nodes in the S3 continuously send noise information to the surrounding to interfere the eavesdropper, wherein the noise information is randomly generated by each noise node and is spread by the single chip obtained in the S3.
Specifically, taking the model shown in fig. 2 as an example, Alice formally sends valid information to Bob
Figure BDA0002481159510000048
In the same way as thatTime noise node N1、N2、N3Also randomly generating interference information
Figure BDA0002481159510000049
The interference information is spread by the orthogonal chips generated in S3, and is represented as:
Figure BDA00024811595100000410
the noise node simultaneously transmits the interference information to achieve the purpose of interfering the eavesdropper.
And S5, after receiving the interfered superposed information, the receiver eliminates the noise information by using the single orthogonal chip stored in the S3, and finally restores the effective information after decoding.
Specifically, taking the model shown in fig. 2 as an example, Bob receives the overlay information C:
Figure BDA00024811595100000411
at this time, Bob uses the orthogonal chips stored in S3
Figure BDA00024811595100000412
Multiplication by the superimposition information C can remove interference information:
Figure BDA00024811595100000413
and finally with
Figure BDA00024811595100000414
The final effective information can be obtained by one-time dot multiplication
Figure BDA00024811595100000415
Figure BDA00024811595100000416
The following are simulation experiment results:
the simulation experiment parameters are configured as follows: taking the model shown in fig. 2 as an example, for each communication, we assume that the channel is a rayleigh fading channel, which will be affected by additive white gaussian noise with zero mean unit variance. Because one of the advantages of the present invention is that it can still function when an eavesdropper occupies a better receiving position than the receiver with respect to the sender, we randomly generate rayleigh channel parameters to represent the channel. The secret capacity of a legitimate channel can be expressed as:
Figure BDA0002481159510000051
figure 5 shows the variation of the secret capacity of a legitimate channel as a function of the noise power and the number of noisy nodes. As the noise power increases, the secret capacity of the legitimate channel also increases. This is because the interference of the eavesdropping channel becomes more intense when the noise power is increased. The figure also compares scenarios where the number of interfering nodes varies from 1 to 4. As can be seen from the figure, when there are more interfering nodes, a higher secret capacity can be guaranteed at low power. There is a clear balance between the number of interfering nodes and the transmission power, depending on the requirements of the system.
In conclusion, the cooperative interference secure communication method only needs low noise power cost, and limits the ability of an eavesdropper on the premise of ensuring normal communication, thereby ensuring the confidentiality in a wireless sensor network to a great extent.
It should be expressly noted that any process or method described in flow charts, or in other manners, is understood to include one or more modules, segments, or portions of executable instruction code for implementing specific logical functions or process steps, and that the scope of the preferred embodiments of the present invention includes alternative implementations which may not be implemented in the exact order illustrated or discussed, including performing the functions in substantially the same way or in an inverse order, depending on the functionality involved, as would be understood by those reasonably skilled in the art of the patentable embodiments.
In the description herein, references to the terms "one embodiment," "some embodiments," "an example," "a specific example," or "some examples" or the like are intended to mean that a particular feature, structure, material, or characteristic described in connection with the embodiment or example is included in at least one embodiment or example of the invention. In this specification, the appearances of such terms are not necessarily referring to the same embodiment or example. And it is specifically noted that the particular features, structures, materials, or characteristics described may be combined in any suitable manner in any one or more embodiments or examples.
In addition, although "embodiments" of the present invention have been shown and described, it should be understood that the above-described embodiments are exemplary for the purpose of illustrating the invention and are not to be construed as limiting the invention, and that any changes, modifications, substitutions and alterations of the described embodiments may be made by those skilled in the art without departing from the principles and spirit of the present invention.

Claims (6)

1. A cluster-based cooperative interference safety communication method in a wireless sensor network is characterized by comprising the following steps:
s1, forming a plurality of clusters by each sensor node in a system through a clustering algorithm, wherein each cluster is composed of a cluster head node and at least two common nodes added into the cluster, the cluster head node is used for conventional communication, and the common nodes are used for auxiliary communication;
s2, before one-time conventional communication, cluster head nodes in two clusters separated by one-hop distance are contacted to perform pre-communication;
s3, contacting the receivers in the two parties to generate a plurality of mutually orthogonal chips, randomly reserving one of the chips, randomly distributing the rest chips to common nodes in the cluster, wherein one common node stores one chip, and the selected common nodes are also called noise nodes:
S4, both communication parties carry out formal communication, effective information is sent to a receiving party by a sending party, and simultaneously all noise nodes in S3 continuously send noise information to the periphery to interfere an eavesdropper, wherein the noise information is randomly generated by each noise node and is spread by a single chip obtained in S3;
and S5, after receiving the interfered superposed information, the receiving party eliminates the noise information by using the single orthogonal chip stored in the S3, and finally restores the effective information through decoding.
2. The method for cooperative interference secure communication based on clustering in a wireless sensor network as claimed in claim 1, wherein in S1, Alice communicates with Bob, Eve is an eavesdropping node; there are several common nodes in each cluster, with the cluster head node being used for regular communication and the common nodes being used for auxiliary communication.
3. The method of claim 2, wherein in the S2, before Alice and Bob need to perform a regular communication, the sender Alice actively contacts with the receiver Bob, and the procedure is pre-communication.
4. The method of claim 3, wherein in S3, after receiving end Bob obtains pre-communication signal, L orthogonal chips are generated
Figure FDA0003627825610000011
Figure FDA0003627825610000012
L is less than or equal to the number of common nodes in the cluster where Bob is located, and then Bob randomly selects the orthogonal chips
Figure FDA0003627825610000013
The code pieces are stored in a memory, and stored,and randomly selecting L-1 common nodes in the Bob cluster as noise nodes, and using N1,N2,…,Nk-1,Nk+1,…,NLIndicating that the remaining orthogonal chips are
Figure FDA0003627825610000014
Respectively transmitted to the noise nodes, each noise node storing a chip, N1Preservation of
Figure FDA0003627825610000021
N2Preservation of
Figure FDA00036278256100000215
Preservation of
Figure FDA0003627825610000023
Nk+1Preservation of
Figure DEST_PATH_IMAGE002
，NLPreservation of
Figure FDA0003627825610000025
5. The method for cooperative interference secure communication based on clustering in a wireless sensor network as claimed in claim 4, wherein in S4, Alice formally sends valid information to Bob
Figure FDA0003627825610000026
While at the same time noise node N1,N2,…,Nk-1,Nk+1,…,NLAlso randomly generated interference information, respectively denoted as
Figure 490734DEST_PATH_IMAGE002
The interference information is spread by the orthogonal chips generated in S3, and is represented as:
Figure FDA0003627825610000028
the noise node simultaneously transmits the interference information to achieve the purpose of interfering the eavesdropper.
6. The method for cooperative interference secure communication based on clustering in a wireless sensor network as claimed in claim 5, wherein in S5, Bob receives the superposition information C:
Figure FDA0003627825610000029
at this time, Bob uses the orthogonal chips stored in S3
Figure FDA00036278256100000210
Multiplication with the superimposed information C removes interference information:
Figure FDA00036278256100000211
finally, and then
Figure FDA00036278256100000212
The final effective information can be obtained by one-time dot multiplication
Figure FDA00036278256100000213
Figure FDA00036278256100000214
From now on, the secure communication under the wireless sensor network environment is accomplished.
CN202010378566.3A 2020-05-07 2020-05-07 Cluster-based cooperative interference safety communication method in wireless sensor network Active CN111698680B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202010378566.3A CN111698680B (en) 2020-05-07 2020-05-07 Cluster-based cooperative interference safety communication method in wireless sensor network

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202010378566.3A CN111698680B (en) 2020-05-07 2020-05-07 Cluster-based cooperative interference safety communication method in wireless sensor network

Publications (2)

Publication Number Publication Date
CN111698680A CN111698680A (en) 2020-09-22
CN111698680B true CN111698680B (en) 2022-06-28

Family

ID=72476609

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202010378566.3A Active CN111698680B (en) 2020-05-07 2020-05-07 Cluster-based cooperative interference safety communication method in wireless sensor network

Country Status (1)

Country Link
CN (1) CN111698680B (en)

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103475441A (en) * 2013-07-26 2013-12-25 北京邮电大学 Cooperative interference transmission method based on clusters in wireless multi-hop network

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103475441A (en) * 2013-07-26 2013-12-25 北京邮电大学 Cooperative interference transmission method based on clusters in wireless multi-hop network

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
"基于协作干扰的物理层安全技术研究";丁威;《中国优秀硕士学位论文全文数据库》;20200215;全文 *
"基于演化博弈的传感节点保密率自适应调节方法";沈士根 等;《电信科学》;20141130;第30卷(第11期);全文 *
基于人工噪声的中继网络物理层安全传输机制;李翔宇等;《计算机应用研究》;20120915(第09期);全文 *

Also Published As

Publication number Publication date
CN111698680A (en) 2020-09-22

Similar Documents

Publication Publication Date Title
Wang et al. Enhancing information security via physical layer approaches in heterogeneous IoT with multiple access mobile edge computing in smart city
Goeckel et al. Artificial noise generation from cooperative relays for everlasting secrecy in two-hop wireless networks
Zhang et al. Anti-jamming message-driven frequency hopping—Part I: System design
Liu et al. Physical layer security assisted computation offloading in intelligently connected vehicle networks
Chen et al. Fast power allocation for secure communication with full-duplex radio
Kang et al. A survey of security mechanisms with direct sequence spread spectrum signals
Osorio et al. Safeguarding MTC at the physical layer: Potentials and challenges
Jin et al. On the multi-user diversity with secrecy in uplink wiretap networks
CN108770069A (en) Power distribution method for the communication of satellite communication network safety of physical layer
Yadav et al. A comprehensive survey of physical layer security over fading channels: Classifications, applications, and challenges
Wang Physical layer security in wireless cooperative networks
Bang et al. Secure modulation based on constellation mapping obfuscation in OFDM based TDD systems
CN108768443B (en) Spectrum spreading parameter agility method based on random signal
Kumar et al. Key less physical layer security for wireless networks: A survey
Okamoto et al. Multilevel modulated chaos MIMO transmission scheme with physical layer security
Yusuf et al. On signal space diversity: An adaptive interleaver for enhancing physical layer security in frequency selective fading channels
Hu et al. Channel coding scheme for relay edge computing wireless networks via homomorphic encryption and NOMA
Tang et al. Secure MIMO-SVD communications against eavesdroppers with any number of antennas
CN111698680B (en) Cluster-based cooperative interference safety communication method in wireless sensor network
Cheng et al. MIMO-OFDM PHY integrated (MOPI) scheme for confidential wireless transmission
Ghannadrezaii et al. Securing a janus-based flooding routing protocol for underwater acoustic networks
Yusuf et al. Enhancing physical-layer security in wireless communications using signal space diversity
CN111726221A (en) Physical layer safety transmission method capable of resisting arbitrary eavesdropping antenna number
Hussain et al. Security protection over wireless fading channels by exploiting frequency selectivity
Hamamreh et al. An efficient security method based on exploiting channel state information (CSI)

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant