CN110121206B - Multi-hop wireless awakening method based on limited queue length queuing model - Google Patents

Multi-hop wireless awakening method based on limited queue length queuing model Download PDF

Info

Publication number
CN110121206B
CN110121206B CN201910407340.9A CN201910407340A CN110121206B CN 110121206 B CN110121206 B CN 110121206B CN 201910407340 A CN201910407340 A CN 201910407340A CN 110121206 B CN110121206 B CN 110121206B
Authority
CN
China
Prior art keywords
node
data
packet
hop
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.)
Active
Application number
CN201910407340.9A
Other languages
Chinese (zh)
Other versions
CN110121206A (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.)
Chongqing University of Post and Telecommunications
Original Assignee
Chongqing University of Post and Telecommunications
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 Chongqing University of Post and Telecommunications filed Critical Chongqing University of Post and Telecommunications
Priority to CN201910407340.9A priority Critical patent/CN110121206B/en
Publication of CN110121206A publication Critical patent/CN110121206A/en
Priority to PCT/CN2019/115036 priority patent/WO2020228259A1/en
Application granted granted Critical
Publication of CN110121206B publication Critical patent/CN110121206B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

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 invention relates to a multi-hop wireless awakening method based on a limited queue length queuing model, belonging to the technical field of wireless sensor network communication and comprising the following steps: s1: establishing three different tree network node packet loss rate prediction models based on the limited queue length according to the node type; s2: the node estimates the packet loss rate, data delay time, total energy consumption and node data processing speed caused by that a terminal node and a relay node in the wireless network monitor that a channel is busy according to a packet loss rate prediction model; s3: the node selects whether to send one or a plurality of data packets in the awakening period according to the optimal value of the successful receiving rate of the data of the sink node, and informs the information to the node at the upper level through a confirmation frame. Aiming at the optimization of a multi-hop transmission awakening mechanism, the invention realizes wireless awakening by utilizing the self low power consumption characteristic of the awakening radio frequency and adopting a dynamic adjustment data transmission mechanism and an on-demand awakening technology, thereby improving the awakening success efficiency and increasing the data packet processing speed of the node.

Description

Multi-hop wireless awakening method based on limited queue length queuing model
Technical Field
The invention belongs to the technical field of wireless sensor network communication, and relates to a multi-hop wireless awakening method based on a limited queue length queuing model.
Background
Nowadays, WSN technology is rapidly developing, and more sensor nodes begin to use WuR to perform wake request sending and receiving tasks. Because it does not require the transmitting node and the receiving node to be synchronized and redundant idle listening in the conventional duty cycle mode can be avoided, on-demand wake-up can be achieved with extremely low energy consumption. Considering that the single-hop network is not fully suitable for the application of environment monitoring, some multi-hop wake-up schemes have been derived. Some reduce and awaken the request collision probability through increasing idle channel assessment mechanism, some make it can play and awaken and data confirmation effect at the same time through optimizing ACK, some let the node carry out different functions through changing the frame structure of awakening the request, still some reduce the interaction number through relaying the awakening request.
But the wake-up transceiver WuR shares an antenna with the master transceiver through a different modulation technique, so a collision is easily generated during the wake-up request, and the wake-up topology is the same as the normal communication topology. Therefore, there is a need for a wake-up technique that can effectively reduce the communication delay and energy consumption of nodes in a multi-hop network.
Disclosure of Invention
In view of the above, an object of the present invention is to provide a multi-hop wireless wake-up method based on a limited queue length queuing model, which is implemented in a wireless sensor network application environment, under the conditions of meeting low power consumption and not requiring additional circuit design overhead, using information such as the number of terminal nodes and relay nodes, average arrival rate of data packets, retransmission time threshold, payload size, and the like to determine the current network traffic size, and selecting an optimal transmission mechanism according to the queue data overflow condition or the data packet processing speed; the wireless awakening can be realized, the awakening success efficiency is improved, and the data communication delay and the node energy consumption are reduced.
In order to achieve the purpose, the invention provides the following technical scheme:
a multi-hop wireless awakening method based on a limited queue length queuing model comprises the following steps:
s1: establishing three different tree network node packet loss rate prediction models based on the limited queue length according to the node type;
s2: the node estimates the packet loss rate alpha and the data delay time T caused by the fact that the terminal node and the relay node in the wireless network monitor the busy channel according to a packet loss rate prediction modelATotal energy consumption EAAnd node data processing speed lambdas rvic ；
S3: the node selects whether to send one or a plurality of data packets in the awakening period according to the optimal value of the successful receiving rate of the data of the sink node, and informs the upper-level node of the information through an acknowledgement frame ACK.
Further, step S1 includes:
extending packet arrival rates into a tree network using a Markov chain M/G/1/2 queuing model that obeys Poisson distribution taking into account their arrival rates, and using CTThe second transient CCA idle channel detection evaluates the channel state, and can quickly perform backoff when the channel is detected to be busy; transmit-receive data considering terminal node and relay nodeThe difference is that a terminal node packet loss rate model a of a PST mechanism employing single data packet transmission and dynamic CCA optimization is obtained:
Figure BDA0002061662330000021
adopting a terminal node packet loss rate model of a PCT mechanism of continuous transmission of a plurality of data packets and dynamic CCA optimization:
Figure BDA0002061662330000022
where N is the number of nodes, M is the number of retransmissions, αcIs the packet loss rate, α, of the current nodebIs the packet loss rate, T, of the previous hop nodeCCAIs the time required to perform a CCA, TwucIs the time required to send a wake-up request, SMCU＝Ton+Th+Tl+TSIFS+TackIs the delay, λ, required for the microcontroller MCU to successfully transmit data and receive an ACKcIs the packet arrival rate of the current node, E [ gamma ]c]Is the average number of packets in the current node queue at the busy period,
Figure BDA0002061662330000023
is the probability, cg, that data was lost after the last hop node performed M +1 backoffsumIs the average CCA number, E [ gamma ], required by the current node to perform the PSTb]Is the average number of packets in the next hop node queue,
Figure BDA0002061662330000024
is the probability, bg, that data is lost after the next hop node performs M +1 backoffsumIs the average number of CCA times, T, required by the next hop node to perform the dynamic CCA optimization mechanismhIs the time required to send the header of the data packet, TlIs the time required to send the packet payload.
E[Γc]Is calculated as
Figure BDA0002061662330000025
Wherein a is0cThe average residence time of the data packet in the current node queue is, and since the node also generates data in the process of receiving the data, the calculation adopting the PST mechanism is as follows:
Figure BDA0002061662330000026
the calculation using the PCT mechanism was:
Figure BDA0002061662330000027
wherein G iskThe calculation is as follows:
Figure BDA0002061662330000028
E[DHoLc]is the average time required for a node to perform CCA and backoff, expressed as:
Figure BDA0002061662330000031
the terminal node only executes data upload, so the influence of the previous-hop node does not need to be considered, and the relay node not only needs to consider the influences of the previous-hop and peer-level nodes, but also needs to consider the influence of the next-hop node, so the packet loss rate model B of the relay node is expressed as:
Figure BDA0002061662330000032
wherein alpha isdIs the packet loss rate, dg, of the next hop nodesumIs the average CCA times, E [ gamma ], required by the last hop node to execute the dynamic CCA optimization mechanism PSTd]Is the average number of data packets in the last hop node queue, and a plurality of data packets are adoptedA terminal node packet loss rate model B of a PCT mechanism for continuous transmission and dynamic CCA optimization is shown as:
Figure BDA0002061662330000033
in the PST mechanism a0cThe calculation is as follows:
Figure BDA0002061662330000034
mechanism of PCT a0cThe calculation is as follows:
Figure BDA0002061662330000035
the relay nodes close to the sink node only need to consider the influence of the previous hop and the peer node, but the number of data packets cached by the node may reach the upper limit, and this aspect factor needs to be additionally considered, and the packet loss rate model C of these relay nodes under the PST mechanism is calculated as:
Figure BDA0002061662330000036
wherein overflow is the portion of the data packet that is not received, and is calculated as:
Figure BDA0002061662330000041
similarly, the packet loss rate of the node adopting the PCT mechanism is calculated as:
Figure BDA0002061662330000042
in the PST mechanism a0cThe calculation is as follows:
Figure BDA0002061662330000043
mechanism of PCT a0cThe calculation is as follows:
Figure BDA0002061662330000044
further, the step S2 includes:
according to the three different tree network node packet loss rate prediction models based on the finite queue length in the step S1, the transmission delay T of each hop of the nodetThe calculation is as follows:
Tt＝(1-αM+1)(SWUR+SMCU)+αM+1DWUR
the total delay of transmission of a data packet is equal to the sum of the required delays per hop, and similarly the energy consumption per hop is calculated as:
Et＝(1-αM+1)(EWUR+EMCU)+αM+1HWUR
wherein SMCU＝Ton+Th+Tl+TSIFS+TackThe delay, E, required for the microcontroller MCU to successfully transmit data and receive an ACKMCU＝Eon+Eh+El+ESIFS+EackIs the energy consumed by the successful transmission of data and the reception of an ACK, where TonIs the delay, T, required for the node to switch from the sleep state to the normal operating statehIs the time required to send the header of the data packet, TlIs the time required to send the payload of a data packet, TSIFSIs the shortest frame interval, TackIs the time required to receive the ACK, EonEnergy consumed by a node to switch from a sleep state to a normal operating state, EhIs the energy consumed by sending the header of the data packet, ElIs the energy consumed by sending the payload of a data packet, ESIFSIs the energy consumed by the idle state, EackIs the energy consumed to receive the ACK;
SWURis that the wake-up request is successfully sentThe required delay is calculated as:
Figure BDA0002061662330000051
DWURthe delay required to not issue a wake-up request due to the channel being busy is calculated as:
Figure BDA0002061662330000052
EWURthe energy consumed for the successful transmission of the wake-up request is calculated as:
Figure BDA0002061662330000053
HWURis the energy consumed by not issuing a wake-up request due to the channel being busy, calculated as:
Figure BDA0002061662330000054
wherein ICCAIs the current of WuR when performing CCA, V is the supply voltage, EwucIs the energy consumed to send the wake-up request, CW is the back-off upper limit, TBOIs a back-off unit time, EBOIs the energy consumed per unit time of backoff, ECCAIs the energy consumed to perform CCA;
the node packet processing speed is calculated as:
Figure BDA0002061662330000055
where lambda is the packet arrival rate of the end node,
Figure BDA0002061662330000056
is the probability of the channel still in a busy state after the current node detects M +1 times, lambdaxIs the packet arrival rate of the current node.
Further, the step S3 specifically includes:
the node cache is small, and the queue in the model is set to accommodate two data packets at most, so when the arrival rate of the node data packet is small, the data communication delay and the energy consumption can be reduced by adopting a continuous data packet sending mechanism, but when the arrival rate of the data packet is increased, the data congestion probability may be increased, and the next hop node may not be capable of storing the multiple data packets. Therefore, when the arrival rate of the data packet is large, namely the overflow quantity of the queue data reaches half of the queue length or the processing speed of the second-level node in the PCT-WuR is lower than the PST-WuR, a single data packet transmission mode is adopted to ensure that the data packet can be forwarded by the relay node, the node compares the recorded information and the arrival rate of the data packet with a set threshold value, a plurality of data packet continuous transmission modes are adopted when the arrival rate of the data packet is lower than the threshold value, and a single data packet transmission mode is adopted when the arrival rate of the data packet is higher than the threshold value.
The invention has the beneficial effects that:
(1) aiming at the optimization of a multi-hop transmission awakening mechanism, the invention realizes wireless awakening by utilizing the self low power consumption characteristic of the awakening radio frequency and adopting a dynamic adjustment data transmission mechanism and an on-demand awakening technology, thereby improving the awakening success efficiency and increasing the data packet processing speed of the node.
(2) The invention can adaptively select two different data packet transmission mechanisms for communication according to the change of network flow, thereby reducing data communication delay and node energy consumption.
Additional advantages, objects, and features of the invention will be set forth in part in the description which follows and in part will become apparent to those having ordinary skill in the art upon examination of the following or may be learned from practice of the invention. The objectives and other advantages of the invention may be realized and attained by the means of the instrumentalities and combinations particularly pointed out hereinafter.
Drawings
For the purposes of promoting a better understanding of the objects, aspects and advantages of the invention, reference will now be made to the following detailed description taken in conjunction with the accompanying drawings in which:
fig. 1 is a structural diagram of a multi-hop wireless wake-up method based on a limited queue length queuing model according to the present invention;
FIG. 2 is a wireless wakeup interaction process between a terminal node and a sink node using a PCT mechanism according to the present invention;
fig. 3 is a flow chart of adaptive selection of the wake-up mechanism according to the present invention.
Detailed Description
The embodiments of the present invention are described below with reference to specific embodiments, and other advantages and effects of the present invention will be easily understood by those skilled in the art from the disclosure of the present specification. The invention is capable of other and different embodiments and of being practiced or of being carried out in various ways, and its several details are capable of modification in various respects, all without departing from the spirit and scope of the present invention. It should be noted that the drawings provided in the following embodiments are only for illustrating the basic idea of the present invention in a schematic way, and the features in the following embodiments and examples may be combined with each other without conflict.
Wherein the showings are for the purpose of illustrating the invention only and not for the purpose of limiting the same, and in which there is shown by way of illustration only and not in the drawings in which there is no intention to limit the invention thereto; to better illustrate the embodiments of the present invention, some parts of the drawings may be omitted, enlarged or reduced, and do not represent the size of an actual product; it will be understood by those skilled in the art that certain well-known structures in the drawings and descriptions thereof may be omitted.
The same or similar reference numerals in the drawings of the embodiments of the present invention correspond to the same or similar components; in the description of the present invention, it should be understood that if there is an orientation or positional relationship indicated by terms such as "upper", "lower", "left", "right", "front", "rear", etc., based on the orientation or positional relationship shown in the drawings, it is only for convenience of description and simplification of description, but it is not an indication or suggestion that the referred device or element must have a specific orientation, be constructed in a specific orientation, and be operated, and therefore, the terms describing the positional relationship in the drawings are only used for illustrative purposes, and are not to be construed as limiting the present invention, and the specific meaning of the terms may be understood by those skilled in the art according to specific situations.
As shown in fig. 1, the present invention provides a multi-hop wireless wake-up method based on a limited queue length queuing model, which predicts the packet loss probability of a wake-up request of a node through parameters of a data packet arrival rate and a retransmission time upper limit, and analyzes protocol performance by using indexes such as average delay, energy consumption per second, data processing speed, and the like, and includes the following steps:
s1: establishing three different tree network node packet loss rate prediction models based on the limited queue length according to the node type;
s2: the node estimates the packet loss rate alpha and the data delay time T caused by the fact that the terminal node and the relay node in the wireless network monitor the busy channel according to a packet loss rate prediction modelATotal energy consumption EAAnd node data processing speed lambdaservice；
S3: the node selects whether to send one or more data packets in the awakening period according to the optimal value of the successful receiving rate of the data of the sink node, and informs the upper-level node of the information through an acknowledgement frame (ACK).
Step S1 mainly includes three packet loss rate models of the terminal node and the relay node, which are as follows:
extending packet arrival rates into a tree network using a Markov chain M/G/1/2 queuing model that obeys Poisson distribution taking into account their arrival rates, and using CTThe second transient CCA idle channel detection evaluates the channel state, and can quickly perform backoff when the channel is detected to be busy; considering the difference between the terminal node and the relay node in data receiving and sending, a terminal node packet loss rate model A adopting a PST mechanism of single data packet transmission and dynamic CCA optimization is obtained:
Figure BDA0002061662330000071
adopting a terminal node packet loss rate model of a PCT mechanism of continuous transmission of a plurality of data packets and dynamic CCA optimization:
Figure BDA0002061662330000072
where N is the number of nodes, M is the number of retransmissions, αcIs the packet loss rate, α, of the current nodebIs the packet loss rate, T, of the previous hop nodeCCAIs the time required to perform a CCA, TwucIs the time required to send a wake-up request, SMCU＝Ton+Th+Tl+TSIFS+TackIs the delay required for the microcontroller MCU to successfully transmit data and receive an ACK. Lambda [ alpha ]cIs the packet arrival rate of the current node, E [ gamma ]c]Is the average number of packets in the current node queue at the busy period,
Figure BDA0002061662330000073
is the probability that data is lost after the previous hop node performs M +1 backoff. cg (cg)sumIs the average CCA number, E [ gamma ], required by the current node to perform the PSTb]Is the average number of packets in the next hop node queue,
Figure BDA0002061662330000074
is the probability, bg, that data is lost after the next hop node performs M +1 backoffsumIs the average number of CCAs required by the next hop node to perform the dynamic CCA optimization mechanism. T ishIs the time required to send the header of the data packet, TlIs the time required to send the packet payload.
E[Γc]Can be calculated as
Figure BDA0002061662330000075
Wherein a is0cIs the average residence time of the data packet in the current node queue, because the node will generate data itself during the process of receiving data. So with the PST mechanism can be calculated as:
Figure BDA0002061662330000081
the calculation using the PCT mechanism was:
Figure BDA0002061662330000082
wherein G iskThe calculation is as follows:
Figure BDA0002061662330000083
E[DHoLc]the average time required for a node to perform CCA and backoff may be expressed as:
Figure BDA0002061662330000084
the terminal node only performs data uploading, so the influence of the previous-hop node does not need to be considered. The relay node needs to consider not only the influence of the previous hop and the peer node, but also the influence of the next hop node. Therefore, the packet loss rate model B of the relay node can be expressed as:
Figure BDA0002061662330000085
wherein alpha isdIs the packet loss rate, dg, of the next hop nodesumIs the average CCA times, E [ gamma ], required by the last hop node to execute the dynamic CCA optimization mechanism PSTd]Is the average number of packets in the last hop node queue. The terminal node packet loss rate model B of the PCT mechanism using continuous transmission of multiple data packets and dynamic CCA optimization may be represented as:
Figure BDA0002061662330000086
in the PST mechanism a0cCan be calculated as:
Figure BDA0002061662330000087
mechanism of PCT a0cCan be calculated as:
Figure BDA0002061662330000091
the relay node close to the sink node only needs to consider the influence of the previous hop and the peer node, but the number of the data packets cached by the node may reach the upper limit, and the factor in this respect needs to be additionally considered. The packet loss rate model C of these relay nodes under the PST mechanism may be calculated as:
Figure BDA0002061662330000092
wherein overflow is the portion of the data packet that is not received, and can be calculated as:
Figure BDA0002061662330000093
similarly, the packet loss rate of the node using the PCT mechanism can be calculated as:
Figure BDA0002061662330000094
in the PST mechanism a0cCan be calculated as:
Figure BDA0002061662330000095
mechanism of PCT a0cCan be calculated as:
Figure BDA0002061662330000096
the step S2 mainly includes a performance index calculation method, which is as follows:
according to the model described above, the transmission delay per hop of a node is TtCan be calculated as:
Tt＝(1-αM+1)(SWUR+SMCU)+αM+1DWUR
the total delay for transmission of a data packet is equal to the sum of the required delays per hop. Similarly the energy consumption per hop can be calculated as:
Et＝(1-αM+1)(EWUR+EMCU)+αM+1HWUR
wherein SMCU＝Ton+Th+Tl+TSIFS+TackThe delay, E, required for the microcontroller MCU to successfully transmit data and receive an ACKMCU＝Eon+Eh+El+ESIFS+EackIs the energy consumed by the successful transmission of the data and the reception of the ACK. Wherein T isonIs the delay, T, required for the node to switch from the sleep state to the normal operating statehIs the time required to send the header of the data packet, TlIs the time required to send the payload of a data packet, TSIFSIs the shortest frame interval, TackIs the time required to receive the ACK. EonEnergy consumed by a node to switch from a sleep state to a normal operating state, EhIs the energy consumed by sending the header of the data packet, ElIs the energy consumed by sending the payload of a data packet, ESIFSIs the energy consumed by the idle state, EackIs the energy consumed to receive the ACK.
SWURThe delay required for the wakeup request to be successfully sent can be calculated as:
Figure BDA0002061662330000101
DWURthe delay required to not issue a wake-up request due to the channel being busy is calculated as:
Figure BDA0002061662330000102
EWURthe energy consumed for the successful transmission of the wake-up request is calculated as:
Figure BDA0002061662330000103
HWURis the energy consumed by not issuing a wake-up request due to the channel being busy, calculated as:
Figure BDA0002061662330000104
wherein ICCAIs the current of WuR when performing CCA, V is the supply voltage, EwucIs the energy consumed to send the wake-up request, CW is the back-off upper limit, TBOIs a back-off unit time, EBOIs the energy consumed per unit time of backoff, ECCAIs the energy consumed to perform CCA.
The node packet processing speed can be calculated as:
Figure BDA0002061662330000105
where lambda is the packet arrival rate of the end node,
Figure BDA0002061662330000106
is the probability of the channel still in a busy state after the current node detects M +1 times, lambdaxIs the packet arrival rate of the current node.
Step S3 is primarily directed to an adaptive selection mechanism, including the following:
the node cache is small and the queues in the model are set to accommodate a maximum of two packets. Therefore, when the arrival rate of the node data packet is low, the data communication delay and the energy consumption can be reduced by adopting the continuous data packet sending mechanism, but when the arrival rate of the data packet is increased, the probability of data congestion may be increased, and the next-hop node may not be capable of storing the multiple data packets. Therefore, when the arrival rate of the data packet is high, namely the overflow quantity of the queue data reaches half of the queue length or the processing speed of the second-stage node in the PCT-WuR is lower than the PST-WuR, a single data packet transmission mode is adopted, and the data packet can be ensured to be forwarded by the relay node. The node compares the recorded information and the self data packet arrival rate with a set threshold value, and adopts a plurality of data packet continuous transmission modes when the threshold value is smaller than the threshold value and adopts a single data packet transmission mode when the threshold value is larger than the threshold value.
Fig. 2 is a wireless wakeup interaction procedure between a terminal node and a sink node under the PCT mechanism adopted in this embodiment. The nodes in the PCT mechanism immediately stop performing CCA upon detecting that the channel is busy, and proceed directly to the next phase. If the channel is free, it needs to be continued, and if the channel is detected busy midway, the same steps as above are performed. If C is continuousTAnd the channel is detected to be in an idle state at the time, and a wake-up request can be sent to wake up the destination node. A dual-phase detection mode may be employed, considering the large amount of energy consumed to perform CCA. I.e. the first and last CCA detection performed, C in betweenTIdle time slots are used instead 2 times to reduce energy consumption. And the PCT mechanism adopts a mode of data packet continuous transmission, and the source node can continuously transmit two or more data packets by sending a wake-up request once until the node queue is empty. This may reduce the wake-up frequency of the node to reduce energy consumption, but may seriously affect the delay when the network traffic is heavy, so the PCT scheme specifies a threshold value that allows the node to select whether to use the packet continuous transmission scheme by comparing the value calculated from the history information with the threshold value.
Fig. 3 is a flow chart of adaptive selection of a wake-up mechanism. When a node has a data packet to send, a backoff and CCA clear channel assessment stage is firstly executed, and when the node detects that a channel is busy, the node directly enters the next stage. When the channel is idle, continue to detect if CTSecondary letterAnd comparing the predicted data processing speed with a threshold value when the lanes are all displayed to be idle, and adopting a single data transmission mode when the data processing speed is greater than the threshold value and adopting a plurality of data transmission modes when the data processing speed is less than the threshold value. The threshold is obtained according to the node data processing speed in the PST-WuR protocol.
Finally, the above embodiments are only intended to illustrate the technical solutions of the present invention and not to limit the present invention, and although the present invention has been described in detail with reference to the preferred embodiments, it will be understood by those skilled in the art that modifications or equivalent substitutions may be made on the technical solutions of the present invention without departing from the spirit and scope of the technical solutions, and all of them should be covered by the claims of the present invention.

Claims (2)

1. A multi-hop wireless awakening method based on a limited queue length queuing model is characterized in that: the method comprises the following steps:
s1: establishing three different tree network node packet loss rate prediction models based on the limited queue length according to the node type; the method specifically comprises the following steps:
extending packet arrival rates into a tree network using a Markov chain M/G/1/2 queuing model that obeys Poisson distribution taking into account their arrival rates, and using CTThe second transient CCA idle channel detection evaluates the channel state, and can quickly perform backoff when the channel is detected to be busy; considering the difference between the terminal node and the relay node in data receiving and sending, a terminal node packet loss rate model A adopting a PST mechanism of single data packet transmission and dynamic CCA optimization is obtained:
Figure FDA0003035090100000011
adopting a terminal node packet loss rate model of a PCT mechanism of continuous transmission of a plurality of data packets and dynamic CCA optimization:
Figure FDA0003035090100000012
where N is the number of nodes, M is the number of retransmissions, αcIs the packet loss rate, α, of the current nodebIs the packet loss rate, T, of the previous hop nodeCCAIs the time required to perform a CCA, TwucIs the time required to send a wake-up request, SMCU＝Ton+Th+Tl+TSIFS+TackIs the delay, λ, required for the microcontroller MCU to successfully transmit data and receive an ACKcIs the packet arrival rate of the current node, E [ gamma ]c]Is the average number of packets in the current node queue at the busy period,
Figure FDA0003035090100000013
is the probability, cg, that data was lost after the last hop node performed M +1 backoffsumIs the average CCA number, E [ gamma ], required by the current node to perform the PSTb]Is the average number of packets in the next hop node queue,
Figure FDA0003035090100000014
is the probability, bg, that data is lost after the next hop node performs M +1 backoffsumIs the average number of CCA times, T, required by the next hop node to perform the dynamic CCA optimization mechanismhIs the time required to send the header of the data packet, TlIs the time required to send the packet payload;
E[Γc]is calculated as
Figure FDA0003035090100000015
Wherein a is0cThe average residence time of the data packet in the current node queue is, and since the node also generates data in the process of receiving the data, the calculation adopting the PST mechanism is as follows:
Figure FDA0003035090100000016
the calculation using the PCT mechanism was:
Figure FDA0003035090100000017
wherein G iskThe calculation is as follows:
Figure FDA0003035090100000021
E[DHoLc]is the average time required for a node to perform CCA and backoff, expressed as:
Figure FDA0003035090100000022
the terminal node only executes data upload, so the influence of the previous-hop node does not need to be considered, and the relay node not only needs to consider the influences of the previous-hop and peer-level nodes, but also needs to consider the influence of the next-hop node, so the packet loss rate model B of the relay node is expressed as:
Figure FDA0003035090100000023
wherein alpha isdIs the packet loss rate, dg, of the next hop nodesumIs the average CCA times, E [ gamma ], required by the last hop node to execute the dynamic CCA optimization mechanism PSTd]The terminal node packet loss rate model B, which is the average number of data packets in the previous-hop node queue and adopts the PCT mechanism of continuous transmission of multiple data packets and dynamic CCA optimization, is represented as:
Figure FDA0003035090100000024
in the PST mechanism a0cThe calculation is as follows:
Figure FDA0003035090100000025
mechanism of PCT a0cThe calculation is as follows:
Figure FDA0003035090100000026
the relay nodes close to the sink node only need to consider the influence of the previous hop and the peer node, but the number of data packets cached by the node may reach the upper limit, and this aspect factor needs to be additionally considered, and the packet loss rate model C of these relay nodes under the PST mechanism is calculated as:
Figure FDA0003035090100000031
wherein overflow is the portion of the data packet that is not received, and is calculated as:
Figure FDA0003035090100000032
similarly, the packet loss rate of the node adopting the PCT mechanism is calculated as:
Figure FDA0003035090100000033
in the PST mechanism a0cThe calculation is as follows:
Figure FDA0003035090100000034
mechanism of PCT a0cThe calculation is as follows:
Figure FDA0003035090100000035
s2: the node is predicted according to the packet loss rateThe measurement model estimates the packet loss rate alpha and the data delay time T caused by the fact that the terminal node and the relay node in the wireless network monitor that the channel is busyATotal energy consumption EAAnd node data processing speed lambdaservice(ii) a The method specifically comprises the following steps:
according to the three different tree network node packet loss rate prediction models based on the finite queue length in the step S1, the transmission delay T of each hop of the nodetThe calculation is as follows:
Tt＝(1-αM+1)(SWUR+SMCU)+αM+1DWUR
the total delay of transmission of a data packet is equal to the sum of the required delays per hop, and similarly the energy consumption per hop is calculated as:
Et＝(1-αM+1)(EWUR+EMCU)+αM+1HWUR
wherein SMCU＝Ton+Th+Tl+TSIFS+TackThe delay, E, required for the microcontroller MCU to successfully transmit data and receive an ACKMCU＝Eon+Eh+El+ESIFS+EackIs the energy consumed by the successful transmission of data and the reception of an ACK, where TonIs the delay, T, required for the node to switch from the sleep state to the normal operating statehIs the time required to send the header of the data packet, TlIs the time required to send the payload of a data packet, TSIFSIs the shortest frame interval, TackIs the time required to receive the ACK, EonEnergy consumed by a node to switch from a sleep state to a normal operating state, EhIs the energy consumed by sending the header of the data packet, ElIs the energy consumed by sending the payload of a data packet, ESIFSIs the energy consumed by the idle state, EackIs the energy consumed to receive the ACK;
SWURthe delay required for the successful transmission of the wake-up request is calculated as:
Figure FDA0003035090100000041
DWURthe delay required to not issue a wake-up request due to the channel being busy is calculated as:
Figure FDA0003035090100000042
EWURthe energy consumed for the successful transmission of the wake-up request is calculated as:
Figure FDA0003035090100000043
HWURis the energy consumed by not issuing a wake-up request due to the channel being busy, calculated as:
Figure FDA0003035090100000044
wherein ICCAIs the current of WuR when performing CCA, V is the supply voltage, EwucIs the energy consumed to send the wake-up request, CW is the back-off upper limit, TBOIs a back-off unit time, EBOIs the energy consumed per unit time of backoff, ECCAIs the energy consumed to perform CCA;
the node packet processing speed is calculated as:
Figure FDA0003035090100000045
where lambda is the packet arrival rate of the end node,
Figure FDA0003035090100000046
is the probability of the channel still in a busy state after the current node detects M +1 times, lambdaxIs the packet arrival rate of the current node
S3: the node selects whether to send one or a plurality of data packets in the awakening period according to the optimal value of the successful receiving rate of the data of the sink node, and informs the upper-level node of the information through an acknowledgement frame ACK.
2. The multi-hop wireless wake-up method based on the limited queue length queuing model of claim 1, wherein: the step S3 specifically includes:
the node cache is small, the queue in the model is set to accommodate two data packets at most, so when the arrival rate of the node data packet is small, a continuous data packet sending mechanism is adopted to reduce data communication delay and energy consumption, when the arrival rate of the data packet is large, namely the overflow quantity of the queue data reaches half of the queue length or the processing speed of a second-level node in PCT-WuR is lower than PST-WuR, a single data packet transmission mode is adopted to ensure that the data packet can be forwarded by the relay node, the node compares the recorded information and the arrival rate of the self data packet with a set threshold value, when the data packet arrival rate is lower than the threshold value, a plurality of data packet continuous transmission modes are adopted, and when the data packet arrival rate is higher than the threshold value, a single data packet transmission mode is adopted.
CN201910407340.9A 2019-05-15 2019-05-15 Multi-hop wireless awakening method based on limited queue length queuing model Active CN110121206B (en)

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 CN110121206A (en) 2019-08-13
CN110121206B true 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)

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110121206B (en) * 2019-05-15 2021-06-08 重庆邮电大学 Multi-hop wireless awakening method based on limited queue length queuing model
CN112492627B (en) * 2020-12-08 2023-05-12 哈尔滨工业大学（深圳） Post-first-service communication system, transmitting terminal equipment, medium and performance optimization method
CN115002883B (en) * 2022-05-30 2024-02-09 珠海格力电器股份有限公司 Intelligent door lock communication method and device, intelligent door lock and storage medium

Family Cites Families (8)

* Cited by examiner, † Cited by third party
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
GB2533247A (en) * 2013-09-18 2016-06-15 Toshiba Res Europe Ltd Wireless device and method
CN105636062B (en) * 2016-01-25 2019-02-26 长江大学 A kind of cognition wireless network that service-oriented moderately services transmission learning method
KR101816613B1 (en) * 2016-04-22 2018-01-09 성균관대학교산학협력단 Full-duplex relay communication method based on energy harvesting and full-duplex relay communication system based on energy harvesting
CN107347201B (en) * 2017-07-07 2021-11-05 杨志军 Wireless sensor network polling system control method based on priority
CN109495957B (en) * 2018-12-14 2021-07-30 重庆邮电大学 Self-adaptive asynchronous wireless awakening method based on secondary collision probability model
CN110121206B (en) * 2019-05-15 2021-06-08 重庆邮电大学 Multi-hop wireless awakening method based on limited queue length queuing model

Also Published As

Publication number Publication date
WO2020228259A1 (en) 2020-11-19
CN110121206A (en) 2019-08-13

Similar Documents

Publication Publication Date Title
CN102651898B (en) Delay Constraint in asynchronous sensor network and the online method for routing of energy efficient
CN109495957B (en) Self-adaptive asynchronous wireless awakening method based on secondary collision probability model
CN110121206B (en) Multi-hop wireless awakening method based on limited queue length queuing model
Jurdak et al. Radio sleep mode optimization in wireless sensor networks
KR101571076B1 (en) Method for setting the operation of a routing node of an asynchronous wireless communication network, network node and communication network implementing the method
CN101232518B (en) Low-power dissipation media access control method of node dynamic state resting
US8811379B2 (en) Control apparatus and control method
CN101404602B (en) DCF protocol node self-adapting dormancy mechanism suitable for multi-hop ad hoc network
CN103906207B (en) Wireless sensor network data transmission method based on self adaptation awakening technology on demand
CN101557606B (en) Media access control (MAC) method applicable to wireless sensor network
CN107222903B (en) Constructive interference-based data collection method in asynchronous low-duty-ratio WSN
CN113453304B (en) Self-adaptive synchronous MAC protocol based on virtual clustering and path reservation
Bouachir et al. EAMP-AIDC-energy-aware mac protocol with adaptive individual duty cycle for EH-WSN
Sadiq et al. An Energy-Efficient Cross-Layer approach for cloud wireless green communications
CN103546377A (en) Method for transmitting data of delay tolerant network on basis of improved transmission probability estimation
Wang et al. DPS-MAC: An asynchronous MAC protocol for wireless sensor networks
CN112073931A (en) Linear sensor network multi-hop data collection method based on redundant nodes
Crystal et al. A new MAC protocol for improving energy efficiency and reducing end-to-end packet delay in wireless sensor networks
KR101378496B1 (en) Wireless sensor network node and method for transferring data thereof
Moon et al. Enabling low power listening on ieee 802.15. 4-based sensor nodes
CN112055405A (en) Data collection method for increasing duty ratio only to connected domination centralized node
Ramadan et al. Energy-efficient dual-layer MAC protocol with adaptive layer duration for WSNs
Cabezas et al. Low energy and low latency in wireless sensor networks
Bengheni A multi-threshold energy approach for energy harvesting WSN
Liu et al. An adaptive energy-efficient and low-latency MAC protocol for wireless sensor networks

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