CN110366197A - A kind of wireless sensor network communication means based on the access of compressed sensing multiple access in smart home - Google Patents
A kind of wireless sensor network communication means based on the access of compressed sensing multiple access in smart home Download PDFInfo
- Publication number
- CN110366197A CN110366197A CN201910595284.6A CN201910595284A CN110366197A CN 110366197 A CN110366197 A CN 110366197A CN 201910595284 A CN201910595284 A CN 201910595284A CN 110366197 A CN110366197 A CN 110366197A
- Authority
- CN
- China
- Prior art keywords
- sensor
- symbol
- receiving end
- data
- sensor node
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W24/00—Supervisory, monitoring or testing arrangements
- H04W24/06—Testing, supervising or monitoring using simulated traffic
-
- 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
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Abstract
A kind of wireless sensor network communication means based on the access of compressed sensing multiple access in smart home.It is related to the wireless sensor network communication means based on the access of compressed sensing multiple access in wireless sensor technology field more particularly to a kind of smart home.It provides a kind of using multichannel accidental channel matrix as the calculation matrix during compressed sensing, it is reconstructed using multichannel original signal of the base tracing algorithm to overlapping, the adaptability to channel is improved, the wireless sensor network communication means based on the access of compressed sensing multiple access in the smart home of transmission accuracy and handling capacity is improved.The present invention is reconstructed using multichannel original signal of the base tracing algorithm to overlapping using multichannel accidental channel matrix as the calculation matrix during compressed sensing, improves the adaptability to channel.
Description
Technical field
The present invention relates to be based on compressed sensing multiple access in wireless sensor technology field more particularly to a kind of smart home to access
Wireless sensor network communication means.
Background technique
Smart home is that instrumentation embodies under the influence of Internet of Things, and smart home will be in family by technology of Internet of things
Various equipment (such as audio & video equipment, lighting system, curtain control, airconditioning control, security system, Digital Theater Systems, network man
Electricity and three tables are made a copy for) it connects together, home wiring control, Lighting control, curtain control, remote control using telephone, interior are provided
Multiple functions and the means such as outer remote control, burglar alarm, environmental monitoring, HVAC control, infrared forwarding and programmable Timer control.
Smart home is in use, needs using wireless communication technique, such as CSMA/CD；CSMA/CD is a kind of distributed Jie
Matter access-control protocol, each station (node) in net can independently determination data frame send and receive.It is sending out at each station
Before sending data frame, when first having to carry out carrier sense, only medium clear, just allow to send frame.At this moment, if it is more than two
Station while listening for medium clear and frame is sent, then can generate conflict phenomenon, this makes the frame sent all become invalid frame, sends
It counts out immediately.Each station must have the ability to detect whether conflict occurs at any time, once clashing, then should stop sending,
In order to avoid medium bandwidth is wasted because transmitting invalid frame, then random delay for a period of time after, then contention medium again, weight
Send frame.Its shortcomings that is exactly when network load increases, and sending time increases, and transmitting efficiency sharply declines, causes to receive number
It is reduced according to amount, the problems such as handling capacity is small.
Efficient multiple access access is to improve network throughput, reduces the effective ways of channel random access collision, existing
The conventional methods such as carrier sense still have the defects of efficiency is lower, and network throughput is not high.
Summary of the invention
The present invention is in view of the above problems, provide a kind of using multichannel accidental channel matrix as the survey during compressed sensing
Moment matrix is reconstructed using multichannel original signal of the base tracing algorithm to overlapping, improves the adaptability to channel, improving transmission just
Wireless sensor network communication means based on the access of compressed sensing multiple access in the smart home of true rate and handling capacity.
The technical solution of the present invention is as follows: the following steps are included:
1) system mode:
In a time frame, the sensor of data transmission is taken part in, is referred to as to enliven sensor；By the way that quantity r is arranged
Enliven sensor, each enliven sensor and fill Bernoulli Jacob's random generator, probability of success λ meets λ N " N；
The sum of sensor is enlivened in a time frame, obeys bi-distribution, parameter N and λ, i.e. r~B (N, λ),
The beginning of each time frame, each generator execute an independent Bernoulli trials, as a result indication sensor section
Point i whether in this time frame by its measurement data diIt is transferred to receiving end, by designing λ, can received with compressed sensing
Restore to enliven the data of sensor node in end；
Before transmitting, the data for enlivening sensor node must be converted into binary digit and be packaged to carry out digital biography
It is defeated；
2) system signal model:
Time slot n in a time frame, in sensing matrixIt is from orthonormal basis
Ф€RN*NIn select at random, whereinFor the sensing vector of sensor node i, element therein is independent same
The zero-mean random variable of distribution；
In the symbol time of each time slot n, the modulation symbol s of sensor node i is enlivenediIt can be sent to receiving end, by si
With corresponding sensing vectorWhen multiplication, symbol is transmitted to receiving end simultaneously by all sensor nodes that enlivens；
After the matched filtering of receiving end, in the duration of each symbol, the signal that the antenna of receiving end observes is normalizing
The QPSK symbol of changeMultiplied by the sensing vector for enlivening sensor node i euro AAssuming that perfect same
Walk and be in different MCThe node of sub-channels possesses identical transmission power, in k-th of antenna received signal vector
It can be expressed as
Wherein operator o indicates Hadamard product,It is sensor node to k-th of receiving end
The channel vector (in all frequency bands) of antenna, wherein element is the multiple Gauss stochastic variable of zero-mean standard variance,It is measurement noise,Transmission power and to enliven sensor node i | transmission
The product of symbol, here symbolWork as equal to 1Other situations are 0；
The signal that receiving end receives can be written as
Wherein And
From formula (2.2) it can be seen that receiving end includes M in a symbol periodC*MRA observation, if observation is not
It is enough compressed sensing recovery, just must just retransmits；It keeps retransmitting identical data packet until p time slot, receives
Signal can be written as
Z=Ψ x+W, (2.3)
Wherein receive signal z=[yT(1)…yT(p)]T, sense matrixNoise is W=[wT(1)…wT(p)]T；
3) compressed sensing based symbol restores:
The each antenna received signal in receiving end is by a matched filter, the signal received by all antennas
Input signal as compressed sensing reconstruction algorithm；In specific time frame, when the P time slot terminates, receiving end is obtained
The observation of p*MC*MR sparse modulation symbol, by detecting the symbol reconstruction error of two continuous slots, when difference is less than one
A threshold value predetermined, enlivening sensor node can stop transmitting signal；Otherwise, which will continue to send number
According to until this frame end.
In step 1), the spatial sparsity of sensor reading is defined as rs, the network data based on spatial coherence is extensive
Number m is observed needed for multiplesM can be useds=O (rsLogN it) obtains；
By selecting access probability λ=ms/ N so that the observation number needed from average is guaranteed；
A binomial distribution r~B (N, λ) is followed when enlivening sensor node quantity r, the desired value of r may be calculated
With E (r)=λ N=ms, wherein E () is expectation operator.
In step 1), sensor node A={ a ... a is enlivened in same time framerIndicate, from all the sensors section
The data vector that point is sent is denoted as d=[d1 ..., dn]T, only d is denoted as from the data for enlivening sensor node transmissionA=
[da1···dar]T。
The present invention has studied compressed sensing based multiple access method, and compressed sensing is that signal is sampled and compressed
Theory, compressive sensing theory is introduced into multiple access technique, proposes a kind of compressed sensing based multiple access method.It will
Multichannel accidental channel matrix is as the calculation matrix during compressed sensing, using the original letter of multichannel of the base tracing algorithm to overlapping
Number reconstruct, improve the adaptability to channel.It, can using this method compared with Carrier Sense Multiple Access (CSMA/CD) method
To improve transmission accuracy and handling capacity.
Detailed description of the invention
Fig. 1 is signal transmission figure of the invention,
Fig. 2 is the structure chart of time frame and data packet in the present invention,
Fig. 3 is the comparison of the par comparison SNR for the data packet for enlivening sensor being properly received in each time frame
Figure,
Fig. 4 is that the average of data packet is had successfully received based on CS and CSMA in the case where different time frame length
Comparison figure,
Fig. 5 is that the par comparison channel for enlivening sensor data packet being successfully received in a time frame holds
Compare figure,
Fig. 6 is to utilize the figure for the averaging network data packet recovery quantity that correlation when sky obtains at different λ.
Specific embodiment
The present invention is as shown in Figs. 1-2, and sensor node periodic transmission data are to receiving end, a reporting cycle TfHold
The continuous time, we are defined as a time frame, it is assumed that it is less than the coherence time of natural phenomena.This hypothesis ensures monitoring ring
Border keeps static in a time frame, it means that measurement data only needs to be passed to receiving end one in a complete frame
It is secondary.It is if sensor takes part in data transmission, then referred to as active in a time frame.Due to sensing data when
Between and correlation spatially only need an a small number of sensors to be in active state to save the power consumption of sensor node, quantity is used
R is indicated, transmits data in a time frame.In order to achieve this goal, a reasonable modeling method is to make each sensing
Device fills Bernoulli Jacob's random generator, and probability of success λ meets λ N " N.Therefore, the sum of sensor is enlivened in a time frame
It is interior, obey bi-distribution, parameter N and λ, i.e. r~B (N, λ).The beginning of each time frame, each generator execute an independence
Bernoulli trials, as a result indication sensor node i whether in this time frame by its measurement data diIt is transferred to receiving end.It is logical
It crosses that design λ is sufficiently small, several data for enlivening sensor node can be restored in receiving end with CS.In addition, we are same
Time frame enliven sensor node A=a ... arIndicate.The data vector sent from all the sensors node is denoted as d=
[d1 ..., dn]T, only d is denoted as from the data for enlivening sensor node transmissionA=[da1···dar]T。
Wherein, how to determine that a suitable probability λ value is particularly critical, because its value influences the feasible of network data recovery
Property and effect.The spatial sparsity of sensor reading is defined as rs, observe needed for the network data recovery based on spatial coherence
Number msM can be useds=O (rsLogN it) obtains.In order to meet this requirement, we select access probability λ=ms/ N, this makes
The observation number needed from average is guaranteed.Specifically, a binomial is followed when enlivening sensor node quantity r
Formula is distributed r~B (N, λ), and the desired value of r may be calculated with E (r)=λ N=ms, wherein E () is expectation operator.
Before transmitting, the data for enlivening sensor node must be converted into binary digit and be packaged to carry out digital biography
It is defeated.
We assume that each time frame TfBe divided into I time slot, the length of a time slot is defined as each sensor
Send the time of a data packet.Under the premise of not losing general, it is assumed that the data packet of all the sensors node is identical
Length, be expressed as L bit.Therefore, for given transmitted data rates R, number of time slot in a time frame is defined as
I, or equally, the number for the data packet that maximum can be successfully transmitted, by I=RTf/ L is provided.
Fig. 2 gives time frame and packet structure.It is L (length of bit) in view of the data packet and uses
QPSK, each enlivens the symbol that sensor sends L/2 in a time slot.In the beginning of a time frame, all active biographies
Sensor simultaneous transmission in the first time slot obtains M according to signal model formula (2.2) receiving endC*MRA observation.These are lived
Jump sensor node should be in subsequent time slot it is sluggish, the data d (l) transmitted by i-th of time slot be it is sparse,
This means that the modulation symbol vector in formula (2.2) is the identical data packet of sparse transmission, until receiving end collects foot
Enough observation numbers.
2: system signal model
Fig. 1 illustrates the signals transmission based on QPSK (quadrature phase shift keying) modulation.MCThe freedom degree of radio channel
Indicate the number of subcarriers of OFDM, observation Fig. 1 is it can be found that the sensor reading is first converted to binary system by formatting
Bit stream then pass through constellation and be converted to modulation symbol.
Time slot n in a time frame, in sensing matrixIt is from orthonormal basis
Φ€RN*NIn select at random, whereinReferred to as the sensing vector of sensor node i, element therein are only
The vertical zero-mean random variable with distribution.Next, enlivening the modulation of sensor node i in the symbol time of each time slot n
Symbol siIt can be sent to receiving end, by siWith corresponding sensing vectorWhen multiplication, all enlivens sensor node
Symbol is transmitted to receiving end simultaneously.
After lower conversion and the matched filtering of receiving end, in the duration of each symbol, the antenna of receiving end is observed
To signal be normalized QPSK symbolMultiplied by the sensing vector for enlivening sensor node i euro AAssuming that perfect synchronization and be in different MCThe node of sub-channels possesses identical transmission power, in k-th of antenna
Received signal vector can be expressed as
Wherein operator o indicates Hadamard product,It is sensor node to k-th of receiving end
The channel vector (in all frequency bands) of antenna, wherein element is the multiple Gauss stochastic variable of zero-mean standard variance,It is measurement noise,Transmission power and to enliven sensor node i | transmission
The product of symbol, here symbolWork as equal to 1Other situations are 0；
The signal that receiving end receives can be written as
Wherein And
From formula (2.2) it can be seen that receiving end includes M in a symbol periodC*MRA observation, if observation is not
It is enough CS recovery, just must just retransmits.Keep retransmitting identical data packet until p time slot, receiving signal can
To be written as
Z=Ψ x+W, (2.3)
Wherein receive signal z=[yT(1)…yT(p)]T, sense matrixNoise is W=[wT(1)…wT(p)]T。
3: the symbol based on CS (compressed sensing) restores
As shown in Figure 1, each antenna received signal in receiving end is connect by a matched filter by all antennas
The signal received becomes the input signal of compressed sensing reconstruction algorithm.In specific time frame, when the P time slot terminates,
Receiving end obtains the observation of p*MC*MR sparse modulation symbol, can be by solving following l1Minimization problem is restored:
P1
subject to||z-Ψx||2≤ ε, (3.1)
Wherein euro is the upper bound of data noise size, and problem P1 belongs to the problem of base association asks (BP), he can be by a little
The algorithm inscribed between effective solution solves.Such as least absolute retract and selection operator (LASSO) algorithm or MATLAB
L1-magic pays attention to increasing over time when receiving end observation frequency, and the dimension of Z and Ψ also will increase, while symbol is extensive
Multiple precision will also increase.Therefore, by detecting the symbol reconstruction error of two continuous slots, when difference is pre-defined less than one
Read value, enliven sensor node can stop transmit signal.Otherwise, which will continue to send data until this frame
Terminate.
The present invention in the application, it should be noted that below:
(1) enable call sign Exact recovery observation number demand be it is estimable, about exist in our example
4r or so.In order to reduce receiving end signal processing task amount, receiving end is arranged to from time slot?
Start to restore data, wherein MS is equal to the average value of signal degree of rarefication；
It (2) is modulation symbol x rather than practical initial data d by the symbol recovery process based on CS (compressed sensing)；
Initial data d is converted into its physical layer transmission for being then modulated into L/2QPSK symbol of a data packet L bit；In view of active
The time slot n of sensor node meets r < < N, it is understood that x is a sparse unit matrix；
(3) output that the symbol based on CS restores (3.1) is
(4) each enliven one time slot of sensor node sends L/2 symbol in total, it means that in one time slot,
If receiving end, which has begun, executes CS recovery, the symbol based on CS restores to execute L/2 times；
(5) identity information does not need to send together with data packet, because identity (can be based on from the Symbol recognition of recovery
The position of nonzero element)；
(6) capacity of the method proposed by the present invention within a time can be considered as the maximum that can allow for and actively sense
The number r of device, multiplied by effective data rate L/TF, i.e. C=Lr/Tf.In order to apply CS, the number setting r ratio for enlivening sensor is passed
Sensor sum N is much smaller.Then, for picking up the wireless sensor network of antenna with Mc sub-channels and Mr, maximum can be received
The observation number of collection meets m < IMcMr, and the number in interior time limit is asked when wherein I is.Finally, based on required observation number m's and degree of rarefication r
Relationship, m=o (r logN), the capacity of method proposed by the present invention can be expressed as C=O (R Mc Mr/logN).
The present invention carries out the comparative studies of the access of the multiple access based on CS and the throughput performance of CSMA；This relatively in,
CSMA is based on IEEE80211 distributed coordination function (DCF), and transmission request sends (RTS) and allows to send (CTS) machine
System.For CSMA, a time slot assumes equal symbol duration, the CW that minimum and maximum competition window is arranged tomin=4
And CWmax=64.When starting, sensor monitoring channel is each enlivened, then waiting a random-backoff time, (symbol is held
The multiple of continuous time), on condition that channel does not have free, otherwise log-on data is transmitted.Once data packet is in receiving end by correctly
It receives, confirmation (ACK) signal will be sent back to transmitting terminal.If transmitting terminal does not receive ACK during confirmation, such as,
Since data collision or channel are impaired, it can wait another random-backoff time to retransmit as in the scheme based on CS, and one
Quantity is=25 when the maximum of time, this ensures that enough observations are restored for CS data.When in view of communication mistake,
The r*PER such as maximum quantity of data packet being properly received in one time volume, first PER indicates the good fortune of data packet error code, as one
The ratio line of a justice, CSMA have examined necessary transmission and have opened specifically, and 96 data joined several packets, wherein combining part letter
In addition breath, RTS, CTS further include 32 additional ACK that confirmation is received for data packet.Therefore, for CSMA mono-
The maximum timeslot number that time includes is Icsma=RTf*128/Lcsma=1600 is last, and the data packet number that CSDA is properly received can
With with | pbIt obtains,It is the bit error rate (BER) of QPsK modulated signal in the attenuation channel of Ruili, Eb
It is the value of bit energy, hiIt is the channel fading coefficient of i-th of sensor node.
Fig. 3 shows that the par for the data packet for enlivening sensor being properly received in a time frame compares SNR, dilute
Dredge degree respectively equal to 10 and 20.The apparent letter cries out than while influencing the throughput performance of CSMA and the MAC scheme based on CS.
But this influence more protrudes the scheme based on CS.Such as when signal-to-noise ratio increase, the received numbers of CSMA institute
It is saturated rapidly according to the number of packet, and is gradually increased in wider range based on the scheme of CS.It is said differently, based on CS's
The performance of scheme is more sensitive to the variation of SNR.There are one it is noted that CSMA has the achievable handling capacity of a maximum
The upper limit.Such as CSMA can only transmit about 4 data packets when=10.On the contrary, the MAC scheme based on CS can accommodate more
Data packet simultaneous transmission, as long as observation quantity is sufficiently large.
Next, we compare in Fig. 4 frame length T in different timesfIn the case where, successfully based on CS and CSMA
The average of the data packet received, wherein signal-to-noise ratio is set as 24dB.It is known that fixed data rate R and long data packet
Spend L, in a time frame, maximum timeslot number I and IcsmaWith TfLinear proportional.Then, it is observed from fig. 4 that, time frame length
TfWhen less than 0.2 second, the two schemes are all performed poor.In this case, machine is given for the sensor node based on CS
Data can be transmitted.With the increase of frame length, the data packet number of the scheme average received based on CS increases rapidly and to maximum
Peak value, and CSMA can only achieve 4 or so in r=10 ,=20 when, can only achieve 1.
Fig. 5 shows the par comparison channel for enlivening sensor data packet being successfully received in a time frame
Capacity, degree of rarefication are respectively 10 and 20.For CS reconstruction, it is few that smaller channel capacity will lead to reformed view quantity, and
For CSMA, smaller channel capacity leads to less number of timeslots in a time frame.When channel capacity is about
When 0.64kbps, the performance of the two is all poor.However when the channel capacity increases, the data receiver amount based on CS scheme increases
It is long rapid, similar to the situation in Fig. 4, and for CSMA, it can only achieve a relatively small value, receive relatively fewer
Data.
Finally, we show the reconstruction performance of entire sensor network whithin a period of time, while time and sky is utilized
Between correlation.The sensor readings that we use are the data based on offer, according to the experimental setup of offer, geographical field
It is two-dimensional and approximate equidistant.When no loss is general, we consider K=50 time frame, and required sight
Measured value quantity is ms=20 and mt=20.Fig. 6 presents successfully the par of recovery data packets, this is the result is that in high noise
Different (communication error has been ignored) that enters is used than in the case of.The extensive amount compound case that dotted line indicates, has only used sky
Between correlation, and solid line indicate scheme both used temporal correlation to also use spatial coherence, from Fig. 6 we
It arrives, for two schemes, the quantity of the network packet of recovery all increases with the increase of λ.In particular, united side
The data packet number that case is restored increases sharply when λ is more than 0.15 or so.This means that the data packet restored is the same number of
In the case of, scheme for combining needs smaller λ, or sensor node quantity is less, this will further decrease whole for enlivening of needing
The power consumption of a system.
For this case disclosure of that, need to illustrate there are also the following:
(1), this case the disclosed embodiments attached drawing relate only to structure involved by this case disclosed embodiment,
His structure, which can refer to, to be commonly designed；
(2), in the absence of conflict, the feature in this case the disclosed embodiments and embodiment can be combined with each other with
Obtain new embodiment；
More than, only specific embodiment disclosed in this case, but the protection scope of the disclosure is not limited thereto, this case
Disclosed protection scope should be subject to the protection scope in claims.
Claims (3)
1. the wireless sensor network communication means based on the access of compressed sensing multiple access in a kind of smart home, which is characterized in that packet
Include following steps:
1) system mode:
In a time frame, the sensor of data transmission is taken part in, is referred to as to enliven sensor；By the work that quantity r is arranged
Jump sensor, each enlivens sensor and fills Bernoulli Jacob's random generator, probability of success λ meets λ N " N；
The sum of sensor is enlivened in a time frame, obeys bi-distribution, parameter N and λ, i.e. r~B (N, λ),
The beginning of each time frame, each generator execute an independent Bernoulli trials, and as a result indication sensor node i is
It is no in this time frame by its measurement data diIt is transferred to receiving end, by designing λ, can be restored with compressed sensing in receiving end
Enliven the data of sensor node；
Before transmitting, the data for enlivening sensor node must be converted into binary digit and be packaged to carry out Digital Transmission；
2) system signal model:
Time slot n in a time frame, in sensing matrixIt is from orthonormal basis Ф euro
RN*NIn select at random, whereinFor the sensing vector of sensor node i, element therein is independent identically distributed
Zero-mean random variable；
In the symbol time of each time slot n, the modulation symbol s of sensor node i is enlivenediIt can be sent to receiving end, by siWith with
Its corresponding sensing vectorWhen multiplication, symbol is transmitted to receiving end simultaneously by all sensor nodes that enlivens；
After the matched filtering of receiving end, in the duration of each symbol, the signal that the antenna of receiving end observes is normalized
QPSK symbolMultiplied by the sensing vector for enlivening sensor node i euro АAssuming that perfect synchronization with
And it is in different MCThe node of sub-channels possesses identical transmission power, k-th antenna received signal vector can be with
It is expressed as
Wherein operatorIndicate Hadamard product,It is antenna of the sensor node to k-th of receiving end
Channel vector (in all frequency bands), wherein element is the multiple Gauss stochastic variable of zero-mean standard variance,It is measurement noise,Transmission power and to enliven sensor node i | transmission
The product of symbol, here symbolWork as equal to 1Other situations are 0；
The signal that receiving end receives can be written as
Wherein And
From formula (2.2) it can be seen that receiving end includes M in a symbol periodC*MRA observation, if observation is not enough to
Compressed sensing is restored, and just must just retransmit；It keeps retransmitting identical data packet until p time slot, receives signal
It can be written as
Z=Ψ x+W, (2.3)
Wherein receive signal z=[yT(1)…yT(p)]T, sense matrix
Noise is W=[wT(1)…wT(p)]T；
3) compressed sensing based symbol restores:
The each antenna received signal in receiving end is become by a matched filter by the signal that all antennas receive
The input signal of compressed sensing reconstruction algorithm；In specific time frame, when the P time slot terminates, receiving end obtains p*MC*
The observation of MR sparse modulation symbol, by detecting the symbol reconstruction error of two continuous slots, when difference is pre- less than one
The threshold value first defined, enlivening sensor node can stop transmitting signal；Otherwise, which it is straight will to continue transmission data
To this frame end.
2. based on the wireless sensor network communication of compressed sensing multiple access access in a kind of smart home according to claim 1
Method, which is characterized in that
In step 1), the spatial sparsity of sensor reading is defined as rs, needed for the network data recovery based on spatial coherence
Observe number msM can be useds=O (rsLogN it) obtains；
By selecting access probability λ=ms/ N so that the observation number needed from average is guaranteed；
A binomial distribution r~B (N, λ) is followed when enlivening sensor node quantity r, the desired value of r may be calculated with E
(r)=λ N=ms, wherein E () is expectation operator.
3. based on the wireless sensor network communication of compressed sensing multiple access access in a kind of smart home according to claim 1
Method, which is characterized in that
In step 1), sensor node A={ a ... a is enlivened in same time framerIndicate, it is sent out from all the sensors node
The data vector sent is denoted as d=[d1 ..., dn]T, only d is denoted as from the data for enlivening sensor node transmissionA=[da1···
dar]T。
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910595284.6A CN110366197B (en) | 2019-07-03 | 2019-07-03 | Wireless sensor network communication method based on compressed sensing multiple access in smart home |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910595284.6A CN110366197B (en) | 2019-07-03 | 2019-07-03 | Wireless sensor network communication method based on compressed sensing multiple access in smart home |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110366197A true CN110366197A (en) | 2019-10-22 |
| CN110366197B CN110366197B (en) | 2023-03-14 |
Family
ID=68217714
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910595284.6A Active CN110366197B (en) | 2019-07-03 | 2019-07-03 | Wireless sensor network communication method based on compressed sensing multiple access in smart home |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110366197B (en) |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102164395A (en) * | 2011-04-20 | 2011-08-24 | 上海大学 | Method for locally acquiring overall information of wireless sensor network based on compressed sensing |
| CN108322409A (en) * | 2018-01-25 | 2018-07-24 | 杭州电子科技大学 | Sparse OFDM channel estimation method based on generalized orthogonal matching pursuit algorithm |
-
2019
- 2019-07-03 CN CN201910595284.6A patent/CN110366197B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102164395A (en) * | 2011-04-20 | 2011-08-24 | 上海大学 | Method for locally acquiring overall information of wireless sensor network based on compressed sensing |
| CN108322409A (en) * | 2018-01-25 | 2018-07-24 | 杭州电子科技大学 | Sparse OFDM channel estimation method based on generalized orthogonal matching pursuit algorithm |
Non-Patent Citations (3)
| Title |
|---|
| 徐乃等: "基于压缩感知的多址接入方法研究", 《南开大学学报(自然科学版)》 * |
| 杜睿: "基于压缩感知的多用户检测技术研究", 《优秀硕士论文全文库信息科技辑》 * |
| 陈良英: "贝叶斯压缩感知在船舶通信超宽带信道估计中的应用", 《舰船科学技术》 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110366197B (en) | 2023-03-14 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| JP7007329B2 (en) | Wireless communication method for simultaneous data communication and wireless communication terminal using this | |
| US8804685B2 (en) | Dual mode operation in a wireless network | |
| JP3708354B2 (en) | Wireless communication system | |
| KR101415271B1 (en) | Response Request Frame and Response Frame Transmission in Multi-User based Wireless Communication System | |
| CN101272307B (en) | Wireless communication system, wireless communication apparatus, wireless communication method and computer program | |
| US8089946B2 (en) | Bandwidth efficient wireless network modem | |
| US7180850B2 (en) | Frequency offset differential pulse position modulation | |
| WO2013022253A2 (en) | Method of channel access in wireless local area network and apparatus for the same | |
| MX2010010113A (en) | Random phase multiple access communication interface system and method. | |
| HUE035812T2 (en) | High speed media access control | |
| JP2012519426A (en) | Piggyback information on transmission opportunities | |
| JP2006238464A (en) | Method and apparatus for wireless lan communication | |
| Chi et al. | Parallel inclusive communication for connecting heterogeneous IoT devices at the edge | |
| US7305237B2 (en) | Hole-filling channel access | |
| CN111182608A (en) | LoRa communication method based on multipath technology | |
| CN101801109A (en) | Medium access control system and medium access control method in wireless packet network | |
| CN109314975B (en) | Method for operating a communication node in a wireless communication network, associated communication node, communication system and storage system | |
| EP4258808A1 (en) | Method for determining characteristics of terminal, and communication apparatus | |
| CN110366197A (en) | A kind of wireless sensor network communication means based on the access of compressed sensing multiple access in smart home | |
| US20220417943A1 (en) | Termination of wireless transmission of a data frame | |
| Lee | A MAC throughput in the wireless LAN | |
| Liu et al. | Throughput improvement for power line communication by adaptive MAC protocol | |
| JP5065850B2 (en) | Wireless communication method and wireless communication system | |
| WO2022008068A1 (en) | Measurement signals for sensing | |
| US9386592B2 (en) | Method and device for managing communications in a wireless network, method for setting up a second communication, corresponding computer program product and storage means |
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 |