CN110121206A - A kind of multi-hop wireless awakening method based on limited queue length queuing model - Google Patents
A kind of multi-hop wireless awakening method based on limited queue length queuing model Download PDFInfo
- Publication number
- CN110121206A CN110121206A CN201910407340.9A CN201910407340A CN110121206A CN 110121206 A CN110121206 A CN 110121206A CN 201910407340 A CN201910407340 A CN 201910407340A CN 110121206 A CN110121206 A CN 110121206A
- Authority
- CN
- China
- Prior art keywords
- node
- data
- data packet
- follows
- cca
- 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
- H04W52/00—Power management, e.g. TPC [Transmission Power Control], power saving or power classes
- H04W52/02—Power saving arrangements
- H04W52/0209—Power saving arrangements in terminal devices
- H04W52/0225—Power saving arrangements in terminal devices using monitoring of external events, e.g. the presence of a signal
- H04W52/0229—Power saving arrangements in terminal devices using monitoring of external events, e.g. the presence of a signal where the received signal is a wanted signal
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W52/00—Power management, e.g. TPC [Transmission Power Control], power saving or power classes
- H04W52/04—TPC
- H04W52/38—TPC being performed in particular situations
- H04W52/46—TPC being performed in particular situations in multi hop networks, e.g. wireless relay 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
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The present invention relates to a kind of multi-hop wireless awakening methods based on limited queue length queuing model, belong to network communication of wireless sensor technical field, comprising steps of S1: establishing three kinds of different tree network node packet loss prediction models based on limited queue length according to node type；S2: packet loss, data delay time, total energy consumption and node data processing speed caused by node monitors channel busy according to terminal node and relay node in packet loss prediction model evaluating wireless network；S3: node is properly received rate optimal value according to aggregation node data to select to send one or multiple data packets during wake-up, and information is informed even higher level of node by acknowledgement frame.The present invention is directed to the optimization of multi-hop transmission wake-up mechanism, and using the low-power consumption feature for waking up radio frequency itself, wireless awakening is realized using dynamic adjusting data transmission mechanism and on-demand awakening technology, improves and wakes up successfully efficiency, the data packet processing speed of increase node.
Description
Technical field
The invention belongs to network communication of wireless sensor technical fields, are related to a kind of based on limited queue length queuing model
Multi-hop wireless awakening method.
Background technique
Nowadays, WSN technology develops rapidly, and more and more sensor nodes begin to use WuR to execute wake request hair
Send and receive task.Because that no need to send nodes is synchronous with receiving node holding for it, and can be to avoid traditional duty ratio mould
Extra idle listening under formula, it is possible to be realized with extremely low energy consumption and be waken up on demand.In view of single-hop networks cannot be complete
It is adapted to the application of environmental monitoring entirely, so having derived the scheme that some multi-hops wake up again.Some is by increasing idle channel
Evaluation mechanism reduces wake request collision probability, and some can play wake-up and data validation by optimizing ACK simultaneously
Effect, some by change wake request frame structure by node execute different function, also by relaying wake request come
Reduce interaction times.
But waking up transceiver WuR is to share antenna by different modulating technology and main transceiver, so in wake request
It is easy to produce collision in the process, and it is identical as normal communication topology to wake up topology.Therefore need one kind can be effectively reduced it is more
Jump the awakening technology of nodes communication delay and energy consumption.
Summary of the invention
In view of this, the purpose of the present invention is to provide a kind of multi-hop wireless based on limited queue length queuing model to call out
Method of waking up not only is meeting low-power consumption but also is being not necessarily to additional circuit design expense for application of higher wireless sensor network environment is needed
In the case of, it is big using terminal node and relay node quantity, data packet average arrival rate, number of retransmissions threshold value, payload
The information such as small judge current network flow size cases, and overflow situation or the choosing of data packet processing speed according to its queuing data
Select optimal transmission mechanism；It can be realized wireless awakening, raising wakes up successfully efficiency, reduction data communication delays and node energy
Consumption.
In order to achieve the above objectives, the invention provides the following technical scheme:
A kind of multi-hop wireless awakening method based on limited queue length queuing model, comprising the following steps:
S1: three kinds of different tree network node packet loss based on limited queue length are established according to node type and are predicted
Model；
S2: node monitors that channel is numerous according to terminal node and relay node in packet loss prediction model evaluating wireless network
Packet loss α, data delay time T caused by busyA, total energy consumption EAWith node data processing speed λS Chuo rvic Chuo；
S3: node is properly received rate optimal value according to aggregation node data to select to send one during wake-up also
It is multiple data packets, and information is informed into even higher level of node by acknowledgement frame ACK.
Further, step S1 includes:
Using the Markov chain M/G/1/2 queuing model for considering the obedience Poisson distribution of data packet arrival rate, expanded
It opens up in tree network, and uses CTChannel status is assessed in secondary of short duration CCA idle channel detection, when detecting channel
Can quickly it be kept out of the way when busy；In view of the difference of terminal node and relay node sending and receiving data, obtain using single
The terminal node packet loss model A of the PST mechanism of data packet transmission and dynamic CCA optimization:
The terminal node packet loss model with the PCT mechanism of dynamic CCA optimization is continuously transmitted using multiple data packets:
Wherein N is number of nodes, and M is number of retransmissions, αcIt is the packet loss of present node, αbIt is the packet loss of upper hop node
Rate, TCCAIt is time required for executing a CCA, TwucIt is time required for sending wake request, SMCU=Ton+Th+Tl+
TSIFS+TackIt is that microcontroller is successfully transmitted data and receives delay, λ required for ACKcIt is the data packet of present node
Arrival rate, E [Γc] average data packet quantity in present node queue when being busy period,It is that upper hop node executes M+1
The secondary probability keeping out of the way rear data and being dropped, cgsumIt is that present node executes average CCA number, E [Γ required for PSTb] be under
Average data packet quantity in one hop node queue,It is that next-hop node executes and keeps out of the way the probability that rear data are dropped M+1 times,
bgsumIt is that next-hop node executes average CCA number, T required for dynamic CCA Optimization MechanismhIt is needed for sending data packet header
The time wanted, TlIt is the time required for sending packet payload.
E[Γc] be calculated asWherein a0cIt is data packet mean residence time in present node queue, because
Node also itself can generate data during receiving data, so using the calculating of PST mechanism are as follows:
Using the calculating of PCT mechanism are as follows:
Wherein GkIt calculates are as follows:
E[DHoLc] it is that node executes CCA and keeps out of the way required average time, it indicates are as follows:
Terminal node only carries out data upload, so without the concern for the influence of upper hop node, and relay node is not only
Need the influence in view of upper hop and the brother of node, it is also desirable to the influence of next-hop node is considered, so relay node is lost
Packet rate Model B indicates are as follows:
Wherein, αdIt is the packet loss of next-hop node, dgsumIt is that upper hop node executes dynamic CCA Optimization Mechanism PST institute
The average CCA number needed, E [Γd] it is average data packet quantity in upper hop node queue, and use multiple data packets continuous
The terminal node packet loss Model B of the PCT mechanism of transmission and dynamic CCA optimization indicates are as follows:
A in PST mechanism0cIt calculates are as follows:
A in PCT mechanism0cIt calculates are as follows:
Only need to consider the influence of upper hop and the brother of node close to the relay node of sink node, but nodal cache
Data packet number may have arrived at the upper limit, need additionally to consider the factor of this respect, these relay nodes loses under PST mechanism
Packet rate MODEL C calculates are as follows:
Wherein overflow is the data packet portions not received, is calculated are as follows:
Similarly, it is calculated using the node packet loss of PCT mechanism are as follows:
A in PST mechanism0cIt calculates are as follows:
A in PCT mechanism0cIt calculates are as follows:
Further, the step S2 includes:
Three kinds of different tree network node packet loss based on limited queue length according to step S1 predict mould
Type, every jump transmission delay T of nodetIt calculates are as follows:
Tt=(1- αM+1)(SWUR+SMCU)+αM+1DWUR
The transmission total delay of data packet is equal to the sum of delay needed for every jump, and the energy consumption of similarly every jump calculates are as follows:
Et=(1- αM+1)(EWUR+EMCU)+αM+1HWUR
Wherein SMCU=Ton+Th+Tl+TSIFS+TackIt is that microcontroller is successfully transmitted data and receives required for ACK
Delay, EMCU=Eon+Eh+El+ESIFS+EackIt is that data send successfully and receive energy consumed by ACK, wherein TonIt is node
Delay required for normal operating conditions, T are switched to from sleep statehIt is time required for sending data packet header, TlIt is hair
Send time required for data packet payload, TSIFSIt is most short frame interval, TackIt is time required for receiving ACK, EonIt is section
Point is switched to energy consumed by normal operating conditions from sleep state, EhIt is to send energy consumed by data packet header, ElIt is
Send energy consumed by data packet payload, ESIFSIt is the energy of idle state consumption, EackIt is to receive consumed by ACK
Energy；
SWURIt is that wake request is successfully transmitted required delay, calculates are as follows:
DWURIt is to calculate since channel is busy and does not issue delay required for wake request are as follows:
EWURIt is that wake request sends successfully consumed energy, calculates are as follows:
HWURIt is to calculate since channel is busy and does not issue energy consumed by wake request are as follows:
Wherein ICCAIt is the electric current of WuR when executing CCA, V is supply voltage, EwucIt is to send energy consumed by wake request
Amount, CW is the back off time upper limit, TBOIt is to keep out of the way the unit time, EBOIt is to keep out of the way energy consumed by the unit time, ECCAIt is to execute
The energy of CCA consumption；
Node data packet processing speed calculates are as follows:
Wherein λ is the data packet arrival rate of terminal node,It is that present node detects M+1 rear channel also busy
Shape probability of state, λxIt is the data packet arrival rate of present node.
Further, the step S3 is specifically included:
Nodal cache is smaller, and the queue in model is arranged to accommodate up to two data packets, so working as node data packet
When arrival rate is smaller, sending mechanism using continuous data packet can reduce data communication delays and energy consumption, but in data packet
When reaching rate increase, data congestion probability may be will increase instead in this way, next-hop node is also possible to not store so many
Data packet.So larger in data packet arrival rate, i.e., queuing data is overflowed quantity and is reached in queue length half or PCT-WuR
When second level node processing speed is less than PST-WuR, the mode transmitted using single data packet guarantees that data packet can be relayed
Node is forwarded, and information and data packet arrival rate of the node by recording are less than the threshold compared with the threshold value of setting
Multiple data packet continuous transmission modes are used when value, and individual data PTM Packet Transfer Mode is used when being greater than.
The beneficial effects of the present invention are:
(1) present invention is directed to the optimization of multi-hop transmission wake-up mechanism, using the low-power consumption feature for waking up radio frequency itself, uses
Dynamic adjusting data transmission mechanism and on-demand awakening technology improve to realize wireless awakening and wake up successful efficiency, increase node
Data packet processing speed.
(2) present invention can be adaptive selected according to the variation of network flow two different data packet transmission mechanisms into
Row communication, reduces data communication delays and node energy consumption.
Other advantages, target and feature of the invention will be illustrated in the following description to a certain extent, and
And to a certain extent, based on will be apparent to those skilled in the art to investigating hereafter, Huo Zheke
To be instructed from the practice of the present invention.Target of the invention and other advantages can be realized by following specification and
It obtains.
Detailed description of the invention
To make the objectives, technical solutions, and advantages of the present invention clearer, the present invention is made below in conjunction with attached drawing excellent
The detailed description of choosing, in which:
Fig. 1 is the structure chart of the multi-hop wireless awakening method of the present invention based on limited queue length queuing model；
Wireless awakening of the Fig. 2 between the terminal node and aggregation node of the present invention using PCT mechanism interacted
Journey；
Fig. 3 is the adaptively selected flow chart of wake-up mechanism of the present invention.
Specific embodiment
Illustrate embodiments of the present invention below by way of specific specific example, those skilled in the art can be by this specification
Other advantages and efficacy of the present invention can be easily understood for disclosed content.The present invention can also pass through in addition different specific realities
The mode of applying is embodied or practiced, the various details in this specification can also based on different viewpoints and application, without departing from
Various modifications or alterations are carried out under spirit of the invention.It should be noted that diagram provided in following embodiment is only to show
Meaning mode illustrates basic conception of the invention, and in the absence of conflict, the feature in following embodiment and embodiment can phase
Mutually combination.
Wherein, the drawings are for illustrative purposes only and are merely schematic diagrams, rather than pictorial diagram, should not be understood as to this
The limitation of invention；Embodiment in order to better illustrate the present invention, the certain components of attached drawing have omission, zoom in or out, not
Represent the size of actual product；It will be understood by those skilled in the art that certain known features and its explanation may be omitted and be in attached drawing
It is understood that.
The same or similar label correspond to the same or similar components in the attached drawing of the embodiment of the present invention；It is retouched in of the invention
In stating, it is to be understood that if there is the orientation or positional relationship of the instructions such as term " on ", "lower", "left", "right", "front", "rear"
To be based on the orientation or positional relationship shown in the drawings, be merely for convenience of description of the present invention and simplification of the description, rather than indicate or
It implies that signified device or element must have a particular orientation, be constructed and operated in a specific orientation, therefore is described in attached drawing
The term of positional relationship only for illustration, is not considered as limiting the invention, for the ordinary skill of this field
For personnel, the concrete meaning of above-mentioned term can be understood as the case may be.
As shown in Figure 1, the present invention provides a kind of multi-hop wireless awakening method based on limited queue length queuing model, lead to
Cross data packet and reach the parameter of rate and the number of retransmissions upper limit to predict the wake request drop probabilities of node, using average retardation,
The indexs such as energy consumption per second, data processing speed analyze protocol capabilities, comprising the following steps:
S1: three kinds of different tree network node packet loss based on limited queue length are established according to node type and are predicted
Model；
S2: node monitors that channel is numerous according to terminal node and relay node in packet loss prediction model evaluating wireless network
Packet loss α, data delay time T caused by busyA, total energy consumption EAWith node data processing speed λservice；
S3: node is properly received rate optimal value according to aggregation node data to select to send one during wake-up also
It is multiple data packets, and information is informed into even higher level of node by acknowledgement frame (ACK).
Wherein step S1 mainly includes three kinds of packet loss models of terminal node and relay node, specific as follows:
Using the Markov chain M/G/1/2 queuing model for considering the obedience Poisson distribution of data packet arrival rate, expanded
It opens up in tree network, and uses CTChannel status is assessed in secondary of short duration CCA idle channel detection, when detecting channel
Can quickly it be kept out of the way when busy；In view of the difference of terminal node and relay node sending and receiving data, obtain using single
The terminal node packet loss model A of the PST mechanism of data packet transmission and dynamic CCA optimization:
The terminal node packet loss model with the PCT mechanism of dynamic CCA optimization is continuously transmitted using multiple data packets:
Wherein N is number of nodes, and M is number of retransmissions, αcIt is the packet loss of present node, αbIt is the packet loss of upper hop node
Rate, TCCAIt is time required for executing a CCA, TwucIt is time required for sending wake request, SMCU=Ton+Th+Tl+
TSIFS+TackIt is that microcontroller is successfully transmitted data and receives delay required for ACK.λcIt is the data packet of present node
Arrival rate, E [Γc] average data packet quantity in present node queue when being busy period,It is that upper hop node executes M+1
The secondary probability keeping out of the way rear data and being dropped.cgsumIt is that present node executes average CCA number, E [Γ required for PSTb] be under
Average data packet quantity in one hop node queue,It is that next-hop node executes and keeps out of the way the probability that rear data are dropped M+1 times,
bgsumIt is that next-hop node executes average CCA number required for dynamic CCA Optimization Mechanism.ThIt is needed for sending data packet header
The time wanted, TlIt is the time required for sending packet payload.
E[Γc] may be calculatedWherein a0cIt is data packet mean residence time in present node queue,
Because node also itself can generate data during receiving data.So may be calculated using PST mechanism:
Using the calculating of PCT mechanism are as follows:
Wherein GkIt calculates are as follows:
E[DHoLc] it is that node executes CCA and keeps out of the way required average time, it can indicate are as follows:
Terminal node only carries out data upload, so without the concern for the influence of upper hop node.And relay node is not only
Need the influence in view of upper hop and the brother of node, it is also desirable to consider the influence of next-hop node.So relay node is lost
Packet rate Model B can indicate are as follows:
Wherein, αdIt is the packet loss of next-hop node, dgsumIt is that upper hop node executes dynamic CCA Optimization Mechanism PST institute
The average CCA number needed, E [Γd] it is average data packet quantity in upper hop node queue.And use multiple data packets continuous
The terminal node packet loss Model B of the PCT mechanism of transmission and dynamic CCA optimization can indicate are as follows:
A in PST mechanism0cIt may be calculated:
A in PCT mechanism0cIt may be calculated:
Only need to consider the influence of upper hop and the brother of node close to the relay node of sink node, but nodal cache
Data packet number may have arrived at the upper limit, need additionally to consider the factor of this respect.These relay nodes loses under PST mechanism
Packet rate MODEL C may be calculated:
Wherein overflow is the data packet portions not received, be may be calculated:
Similarly, it may be calculated using the node packet loss of PCT mechanism:
A in PST mechanism0cIt may be calculated:
A in PCT mechanism0cIt may be calculated:
It mainly include performance indicator calculation in step S2, specific as follows:
According to model described above, every jump transmission delay T of nodetIt may be calculated:
Tt=(1- αM+1)(SWUR+SMCU)+αM+1DWUR
The transmission total delay of data packet is equal to the sum of delay needed for every jump.Similarly the energy consumption of every jump may be calculated:
Et=(1- αM+1)(EWUR+EMCU)+αM+1HWUR
Wherein SMCU=Ton+Th+Tl+TSIFS+TackIt is that microcontroller is successfully transmitted data and receives required for ACK
Delay, EMCU=Eon+Eh+El+ESIFS+EackIt is that data send successfully and receive energy consumed by ACK.Wherein TonIt is node
Delay required for normal operating conditions, T are switched to from sleep statehIt is time required for sending data packet header, TlIt is hair
Send time required for data packet payload, TSIFSIt is most short frame interval, TackIt is the time required for receiving ACK.EonIt is section
Point is switched to energy consumed by normal operating conditions from sleep state, EhIt is to send energy consumed by data packet header, ElIt is
Send energy consumed by data packet payload, ESIFSIt is the energy of idle state consumption, EackIt is to receive consumed by ACK
Energy.
SWURIt is that wake request is successfully transmitted required delay, may be calculated:
DWURIt is to calculate since channel is busy and does not issue delay required for wake request are as follows:
EWURIt is that wake request sends successfully consumed energy, calculates are as follows:
HWURIt is to calculate since channel is busy and does not issue energy consumed by wake request are as follows:
Wherein ICCAIt is the electric current of WuR when executing CCA, V is supply voltage, EwucIt is to send energy consumed by wake request
Amount, CW is the back off time upper limit, TBOIt is to keep out of the way the unit time, EBOIt is to keep out of the way energy consumed by the unit time, ECCAIt is to execute
The energy of CCA consumption.
Node data packet processing speed may be calculated:
Wherein λ is the data packet arrival rate of terminal node,It is that present node detects M+1 rear channel also busy
Shape probability of state, λxIt is the data packet arrival rate of present node.
Step S3 is mainly for adaptively selected mechanism, including the following contents:
Nodal cache is smaller, and the queue in model is arranged at most accommodate two data packets.So working as node data
When packet arrival rate is smaller, data communication delays and energy consumption can be reduced by sending mechanism using continuous data packet, but in data
When packet reaches rate increase, data congestion probability may be will increase instead in this way, next-hop node is also possible to not store so
More data packets.So larger in data packet arrival rate, i.e., queuing data spilling quantity reaches queue length half or PCT-WuR
When middle second level node processing speed is less than PST-WuR, the mode transmitted using single data packet guarantees that data packet can be by
It is forwarded after node.For information and data packet arrival rate of the node by recording compared with the threshold value of setting, being less than should
Multiple data packet continuous transmission modes are used when threshold value, and individual data PTM Packet Transfer Mode is used when being greater than.
Fig. 2 is the wireless awakening interactive process under the PCT mechanism that the present embodiment uses between terminal node and aggregation node.
Node in PCT mechanism stops executing CCA when detecting that channel is busy condition immediately, is directly entered next stage.Such as
Fruit channel be free time, then with regard to need continue to execute, if midway certain once detect channel be it is busy, be carried out with it is upper
The identical step in face.If continuous CTIt is secondary all to detect that channel is idle state, wake request could be sent and wake up destination node.
In view of the energy for executing consumption required for CCA is larger, it is possible to using the detection pattern of dual-stage.It is i.e. for the first time and last
It is primary to execute CCA detection, intermediate CT- 2 times use free timeslot replaces, to reduce energy consumption.And PCT mechanism uses
The mode that data packet continuously transmits, source node, which sends a wake request, can continuously transmit two or more data packets, directly
It is sky to node queue.The wakeup frequency of node can be reduced in this way to reduce energy consumption, but when network flow is heavier
Delay may be seriously affected, so PCT mechanism defines a threshold value, node can be allowed to use and calculated by history information
Obtained value and threshold value is compared to choose whether to continuously transmit mechanism using data packet.
Fig. 3 is the adaptively selected flow chart of wake-up mechanism.When node has data packet to need to send, be first carried out keep out of the way and
The CCA clear channel assessment (CCA) stage is directly entered next stage when detecting that channel is busy.When channel is idle, after
Continuous detection, if CTFor secondary channel all shown as the free time, the data processing speed that just obtains prediction works as number compared with threshold value
When being greater than threshold value according to processing speed, using individual data transmission mode, multiple data transfer modes are used when being less than threshold value.Threshold value
It is to be obtained according to the node data processing speed in PST-WuR agreement.
Finally, it is stated that the above examples are only used to illustrate the technical scheme of the present invention and are not limiting, although referring to compared with
Good embodiment describes the invention in detail, those skilled in the art should understand that, it can be to skill of the invention
Art scheme is modified or replaced equivalently, and without departing from the objective and range of the technical program, should all be covered in the present invention
Scope of the claims in.
Claims (4)
1. a kind of multi-hop wireless awakening method based on limited queue length queuing model, it is characterised in that: the following steps are included:
S1: three kinds of different tree network node packet loss based on limited queue length are established according to node type and predict mould
Type；
S2: node monitors that channel busy is made according to terminal node and relay node in packet loss prediction model evaluating wireless network
At packet loss α, data delay time TA, total energy consumption EAWith node data processing speed λservice；
S3: node is properly received rate optimal value according to aggregation node data to select the transmission one during wake-up still more
A data packet, and information is informed into even higher level of node by acknowledgement frame ACK.
2. the multi-hop wireless awakening method according to claim 1 based on limited queue length queuing model, feature exist
In: step S1 includes:
Using the Markov chain M/G/1/2 queuing model for considering the obedience Poisson distribution of data packet arrival rate, expanded to
In tree network, and use CTChannel status is assessed in secondary of short duration CCA idle channel detection, when detecting channel busy
When can quickly be kept out of the way；In view of the difference of terminal node and relay node sending and receiving data, obtain using individual data
The terminal node packet loss model A of the PST mechanism of packet transmission and dynamic CCA optimization:
The terminal node packet loss model with the PCT mechanism of dynamic CCA optimization is continuously transmitted using multiple data packets:
Wherein N is number of nodes, and M is number of retransmissions, αcIt is the packet loss of present node, αbIt is the packet loss of upper hop node,
TCCAIt is time required for executing a CCA, TwucIt is time required for sending wake request, SMCU=Ton+Th+Tl+TSIFS+
TackIt is that microcontroller is successfully transmitted data and receives delay, λ required for ACKcIt is the data packet arrival of present node
Rate, E [Γc] average data packet quantity in present node queue when being busy period,It is that upper hop node is executed and moved back for M+1 times
Keep away the probability that rear data are dropped, cgsumIt is that present node executes average CCA number, E [Γ required for PSTb] it is next-hop
Average data packet quantity in node queue,It is that next-hop node executes and keeps out of the way the probability that rear data are dropped, bg M+1 timessum
It is that next-hop node executes average CCA number, T required for dynamic CCA Optimization MechanismhIt is required for sending data packet header
Time, TlIt is the time required for sending packet payload；
E[Γc] be calculated asWherein a0cIt is data packet mean residence time in present node queue, because of node
Also itself data can be generated during receiving data, so using the calculating of PST mechanism are as follows:
Using the calculating of PCT mechanism are as follows:
Wherein GkIt calculates are as follows:
E[DHoLc] it is that node executes CCA and keeps out of the way required average time, it indicates are as follows:
Terminal node only carries out data upload, so without the concern for the influence of upper hop node, and relay node not only needs
In view of the influence of upper hop and the brother of node, it is also desirable to the influence of next-hop node is considered, so the packet loss of relay node
Model B indicates are as follows:
Wherein, αdIt is the packet loss of next-hop node, dgsumIt is that upper hop node executes required for dynamic CCA Optimization Mechanism PST
Average CCA number, E [Γd] be average data packet quantity in upper hop node queue, and continuously transmitted using multiple data packets and
The terminal node packet loss Model B of the PCT mechanism of dynamic CCA optimization indicates are as follows:
A in PST mechanism0cIt calculates are as follows:
A in PCT mechanism0cIt calculates are as follows:
Only need to consider the influence of upper hop and the brother of node close to the relay node of sink node, but the data of nodal cache
Packet quantity may have arrived at the upper limit, need additionally to consider the factor of this respect, the packet loss of these relay nodes under PST mechanism
MODEL C calculates are as follows:
Wherein overflow is the data packet portions not received, is calculated are as follows:
Similarly, it is calculated using the node packet loss of PCT mechanism are as follows:
A in PST mechanism0cIt calculates are as follows:
A in PCT mechanism0cIt calculates are as follows:
3. the multi-hop wireless awakening method according to claim 1 based on limited queue length queuing model, feature exist
In: the step S2 includes:
Three kinds of different tree network node packet loss prediction models based on limited queue length according to step S1, section
Every jump transmission delay T of pointtIt calculates are as follows:
Tt=(1- αM+1)(SWUR+SMCU)+αM+1DWUR
The transmission total delay of data packet is equal to the sum of delay needed for every jump, and the energy consumption of similarly every jump calculates are as follows:
Et=(1- αM+1)(EWUR+EMCU)+αM+1HWUR
Wherein SMCU=Ton+Th+Tl+TSIFS+TackIt is that microcontroller is successfully transmitted data and receives and prolongs required for ACK
Late, EMCU=Eon+Eh+El+ESIFS+EackIt is that data send successfully and receive energy consumed by ACK, wherein TonNode from
Sleep state is switched to delay, T required for normal operating conditionshIt is time required for sending data packet header, TlIt is to send
Time required for data packet payload, TSIFSIt is most short frame interval, TackIt is time required for receiving ACK, EonIt is node
Energy consumed by normal operating conditions, E are switched to from sleep statehIt is to send energy consumed by data packet header, ElIt is hair
Send energy consumed by data packet payload, ESIFSIt is the energy of idle state consumption, EackIt is to receive energy consumed by ACK
Amount；
SWURIt is that wake request is successfully transmitted required delay, calculates are as follows:
DWURIt is to calculate since channel is busy and does not issue delay required for wake request are as follows:
EWURIt is that wake request sends successfully consumed energy, calculates are as follows:
HWURIt is to calculate since channel is busy and does not issue energy consumed by wake request are as follows:
Wherein ICCAIt is the electric current of WuR when executing CCA, V is supply voltage, EwucIt is to send energy consumed by wake request, CW
It is the back off time upper limit, TBOIt is to keep out of the way the unit time, EBOIt is to keep out of the way energy consumed by the unit time, ECCAIt is to execute CCA to disappear
The energy of consumption；
Node data packet processing speed calculates are as follows:
Wherein λ is the data packet arrival rate of terminal node,It is that present node detects M+1 rear channel also in busy condition
Probability, λxIt is the data packet arrival rate of present node.
4. the multi-hop wireless awakening method according to claim 1 based on limited queue length queuing model, feature exist
In: the step S3 is specifically included:
Nodal cache is smaller, and the queue in model is arranged to accommodate up to two data packets, so when node data packet reaches
When rate is smaller, sending mechanism using continuous data packet can reduce data communication delays and energy consumption, in data packet arrival rate
Larger, i.e., queuing data spilling quantity reaches second level node processing speed in queue length half or PCT-WuR and is less than
When PST-WuR, the mode transmitted using single data packet guarantees that data packet can be forwarded by relay node, and node passes through note
The information and data packet arrival rate of record are less than continuous using multiple data packets when the threshold value compared with the threshold value of setting
Transmission mode uses individual data PTM Packet Transfer Mode when being greater than the threshold value.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910407340.9A CN110121206B (en) | 2019-05-15 | 2019-05-15 | Multi-hop wireless awakening method based on limited queue length queuing model |
| PCT/CN2019/115036 WO2020228259A1 (en) | 2019-05-15 | 2019-11-01 | Multi-hop wake-up radio method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910407340.9A CN110121206B (en) | 2019-05-15 | 2019-05-15 | Multi-hop wireless awakening method based on limited queue length queuing model |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110121206A true CN110121206A (en) | 2019-08-13 |
| CN110121206B CN110121206B (en) | 2021-06-08 |
Family
ID=67522575
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910407340.9A Active CN110121206B (en) | 2019-05-15 | 2019-05-15 | Multi-hop wireless awakening method based on limited queue length queuing model |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN110121206B (en) |
| WO (1) | WO2020228259A1 (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111831529A (en) * | 2020-07-23 | 2020-10-27 | 南京工程学院 | Relay node buffer area proportion calculation method meeting buffer area overflow probability requirement |
| WO2020228259A1 (en) * | 2019-05-15 | 2020-11-19 | 重庆邮电大学 | Multi-hop wake-up radio method and device |
| CN112492627A (en) * | 2020-12-08 | 2021-03-12 | 哈尔滨工业大学（深圳） | Back-to-first service communication system, transmitting end equipment, medium and performance optimization method |
| CN115002883A (en) * | 2022-05-30 | 2022-09-02 | 珠海格力电器股份有限公司 | Intelligent door lock communication method and device, intelligent door lock and storage medium |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2015040351A1 (en) * | 2013-09-18 | 2015-03-26 | Toshiba Research Europe Limited | Wireless device and method |
| CN105636062A (en) * | 2016-01-25 | 2016-06-01 | 长江大学 | Cognitive radio network transmission learning method for moderate business services |
| US20170310380A1 (en) * | 2016-04-22 | 2017-10-26 | Research & Business Foundation Sungkyunkwan Unive Rsity | Full-duplex relay communication method using energy harvesting, full-duplex relay communication system based on energy-harvesting, relay node device, and source node device |
| CN109495957A (en) * | 2018-12-14 | 2019-03-19 | 重庆邮电大学 | A kind of adaptive asynchronous wireless awakening method based on secondary collision probabilistic model |
Family Cites Families (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101594643B (en) * | 2009-07-08 | 2011-07-27 | 北京航空航天大学 | Method for adjusting transmission of control frames based on traffic and packet loss |
| KR20150016458A (en) * | 2013-08-02 | 2015-02-12 | 한국전자통신연구원 | Method and apparatus for transmission scheduling in wireless sensor network |
| CN107347201B (en) * | 2017-07-07 | 2021-11-05 | 杨志军 | Wireless sensor network polling system control method based on priority |
| CN110121206B (en) * | 2019-05-15 | 2021-06-08 | 重庆邮电大学 | Multi-hop wireless awakening method based on limited queue length queuing model |
-
2019
- 2019-05-15 CN CN201910407340.9A patent/CN110121206B/en active Active
- 2019-11-01 WO PCT/CN2019/115036 patent/WO2020228259A1/en active Application Filing
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2015040351A1 (en) * | 2013-09-18 | 2015-03-26 | Toshiba Research Europe Limited | Wireless device and method |
| CN105636062A (en) * | 2016-01-25 | 2016-06-01 | 长江大学 | Cognitive radio network transmission learning method for moderate business services |
| US20170310380A1 (en) * | 2016-04-22 | 2017-10-26 | Research & Business Foundation Sungkyunkwan Unive Rsity | Full-duplex relay communication method using energy harvesting, full-duplex relay communication system based on energy-harvesting, relay node device, and source node device |
| CN109495957A (en) * | 2018-12-14 | 2019-03-19 | 重庆邮电大学 | A kind of adaptive asynchronous wireless awakening method based on secondary collision probabilistic model |
Non-Patent Citations (2)
| Title |
|---|
| 李志敏: "基于平均变化率和空闲长度的丢包概率模型", 《计算机工程与应用》 * |
| 谢昊飞: "Research of Conformance Testing of Low-rate Wireless Sensor Networks based on", 《IEEE》 * |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2020228259A1 (en) * | 2019-05-15 | 2020-11-19 | 重庆邮电大学 | Multi-hop wake-up radio method and device |
| CN111831529A (en) * | 2020-07-23 | 2020-10-27 | 南京工程学院 | Relay node buffer area proportion calculation method meeting buffer area overflow probability requirement |
| CN111831529B (en) * | 2020-07-23 | 2024-09-10 | 南京工程学院 | Relay node buffer area proportion calculation method meeting buffer area overflow probability requirement |
| CN112492627A (en) * | 2020-12-08 | 2021-03-12 | 哈尔滨工业大学（深圳） | Back-to-first service communication system, transmitting end equipment, medium and performance optimization method |
| CN112492627B (en) * | 2020-12-08 | 2023-05-12 | 哈尔滨工业大学（深圳） | Post-first-service communication system, transmitting terminal equipment, medium and performance optimization method |
| CN115002883A (en) * | 2022-05-30 | 2022-09-02 | 珠海格力电器股份有限公司 | Intelligent door lock communication method and device, intelligent door lock and storage medium |
| CN115002883B (en) * | 2022-05-30 | 2024-02-09 | 珠海格力电器股份有限公司 | Intelligent door lock communication method and device, intelligent door lock and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110121206B (en) | 2021-06-08 |
| WO2020228259A1 (en) | 2020-11-19 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101232518B (en) | Low-power dissipation media access control method of node dynamic state resting | |
| Yang et al. | Utilization based duty cycle tuning MAC protocol for wireless sensor networks | |
| CN110121206A (en) | A kind of multi-hop wireless awakening method based on limited queue length queuing model | |
| KR20150016458A (en) | Method and apparatus for transmission scheduling in wireless sensor network | |
| CN101557606B (en) | Media access control (MAC) method applicable to wireless sensor network | |
| Wang et al. | Ds-mac: An energy efficient demand sleep mac protocol with low latency for wireless sensor networks | |
| Oliveira et al. | A duty cycle self-adaptation algorithm for the 802.15. 4 wireless sensor networks | |
| CN103906207A (en) | Wireless sensor network data transmission method based on self-adaptation required awakening technology | |
| Papadopoulos et al. | T-AAD: Lightweight traffic auto-adaptations for low-power MAC protocols | |
| Wu et al. | Named data networking enabled power saving mode design for WLAN | |
| Wang et al. | Energy-efficient and delay-guaranteed routing algorithm for software-defined wireless sensor networks: A cooperative deep reinforcement learning approach | |
| CN105007586A (en) | Two-factor based self-adaptive contention window adjusting method for SMAC protocol of wireless sensor network | |
| CN105050136A (en) | Self-adaptive delay-sensing energy-saving method of optical wireless mixed broadband access network | |
| Cabezas et al. | Low energy and low latency in wireless sensor networks | |
| Sah et al. | TDMA policy to optimize resource utilization in Wireless Sensor Networks using reinforcement learning for ambient environment | |
| Gao | A energy consumption improvements of S-MAC in WSN | |
| Zheng et al. | Performance analysis of the IEEE 802.11 power saving mode | |
| Bhandari et al. | Study on improving the network life time maximazation for wireless sensor network using cross layer approach | |
| Hu et al. | RP-MAC: A passive MAC protocol with frame reordering for wireless sensor networks | |
| Aranda et al. | A framework for multimodal wireless sensor networks | |
| Prakash et al. | Energy aware power save mode management in wireless mesh networks | |
| Afroz et al. | QX-MAC: Improving QoS and Energy Performance of IoT-based WSNs using Q-Learning | |
| de Paz et al. | Dcla: A duty-cycle learning algorithm for ieee 802.15. 4 beacon-enabled wsns | |
| Crystal et al. | A new MAC protocol for improving energy efficiency and reducing end-to-end packet delay in wireless sensor networks | |
| Portillo et al. | IoT WSN MAC Protocol: Simulation Analysis of Minimum Packets in Queue Nodes for Medium Access Contention |
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 |