WO2020228259A1 - Multi-hop wake-up radio method and device - Google Patents

Abstract

Disclosed by the present application is a multi-hop Wake-up Radio method, comprising: building different limited queue length-based tree-type network node packet loss rate prediction models according to the node type; estimating the packet loss rate, data delay time, total energy consumption and node data processing speed monitored by a terminal node and a relay node in a wireless network according to the prediction models; selecting to transmit one or more data packets during a wake-up period according to the optimal value of the rate at which sink node data is successfully received; and notifying an upper level node by means of an acknowledgement frame. The present application utilizes the characteristic of low power consumption of a wake-up radio frequency for the optimization of a multi-hop transmission wake-up mechanism, and enables Wake-up Radio by using a dynamic adjustment data transmission mechanism and on-demand wake-up technology, thereby improving the wake-up successful efficiency and increasing the data packet processing speed of a node.

Description

Multi-hop wireless wake-up method and equipment

This application claims the priority of a Chinese patent application filed with the Chinese Patent Office on May 15, 2019, the application number is 201910407340.9, and the application title is "a multi-hop wireless wake-up method based on a queuing model with a limited queue length", and its entire contents Incorporated in this application by reference.

Technical field

This application relates to the technical field of wireless sensor network communication, and in particular to a multi-hop wireless wake-up method.

Background technique

Nowadays, wireless sensor network (wireless sensor network, WSN) technology is developing rapidly, and more and more sensor nodes use wireless wake-up transceivers (wake up on radio, WUR) to perform the task of sending and receiving wake-up requests. Because it does not require the sending node and the receiving node to maintain synchronization, and can avoid redundant idle listening in the traditional duty cycle mode, it can achieve on-demand wake-up with extremely low energy consumption. Considering that the single-hop network cannot fully adapt to the application of environmental monitoring, some multi-hop wake-up schemes have been derived. Some increase the idle channel assessment mechanism to reduce the collision probability of wake-up requests, some optimize the acknowledgement (ACK) frame so that it can play the role of wake-up and data confirmation at the same time, and some make the node by changing the frame structure of the wake-up request Perform different functions, and some reduce the number of interactions by relaying wake-up requests.

However, WUR shares the antenna with the main transceiver through different modulation techniques, so collisions are likely to occur during the wake-up request process, and the wake-up topology is the same as the normal communication topology. Therefore, there is an urgent need for a wake-up technology that can effectively reduce the communication delay and energy consumption of nodes in a multi-hop network.

Summary of the invention

In view of this, the present application provides a multi-hop wireless wake-up method, aiming at the need for wireless sensor network application environment, while meeting low power consumption and without additional circuit design overhead, using the number and data of terminal nodes and relay nodes The average packet arrival rate, retransmission threshold, payload size and other information determine the current network traffic size, and select the optimal transmission mechanism according to its queue data overflow or data packet processing speed to achieve wireless wake-up and improve the efficiency of wake-up success. Reduce data communication delay and node energy consumption.

To achieve the above objectives, this application provides the following technical solutions:

The first aspect of the present application provides a multi-hop wireless wake-up method, including the following steps: establishing different node packet loss rate prediction models based on a tree network with a limited queue length according to node types. According to the prediction model, the packet loss rate α, data delay time T _A , total energy consumption E _A and node data processing speed λ _service caused by the terminal node and relay node monitoring the busy channel in the wireless network are estimated. According to the optimal value of the successful reception rate of the sink node data, one or more data packets are selected to be sent during the wake-up period, and the information is notified to the upper-level node through the confirmation frame ACK.

Optionally, in combination with the above first aspect, in a first possible implementation manner, different node packet loss rate prediction models based on a tree network with a finite queue length are established according to node types, including: obeying the data packet arrival rate The Poisson-distributed Markov chain M/G/1/2 queue model is extended to the tree network, and C _T short clear channel assessment (CCA) is used to evaluate the channel state. When the channel is busy, back off quickly; taking into account the difference between the terminal node and the relay node in sending and receiving data, a single packet transmission (single packet transmission, PST) mechanism optimized by a single data packet transmission and dynamic CCA is obtained. Packet rate model A:

The terminal node packet loss rate model using the continuous transmission of multiple data packets and the dynamic CCA-optimized packet continuous transmission (PCT) mechanism:

是上一跳节点执行M+1次退避后数据被丢掉的概率，cg _sum是当前节点执行PST所需要的平均CCA次数，E[Γ _b]是下一跳节点队列中平均数据包数量，

是下一跳节点执行M+1次退避后数据被丢掉的概率，bg _sum是下一跳节点执行动态CCA优化机制所需要的平均CCA次数，T _h是发送数据包头部所需要的时间，T _l是发送数据包有效负载所需要的时间。 Where N is the number of nodes, M is the number of retransmissions, α _c is the packet loss rate of the current node, α _b is the packet loss rate of the previous hop node, T _CCA is the time required to perform a CCA, and T _wuc is the wake-up call The time required for the request, S _MCU = _Ton + T _h + T _l + T _SIFS + T _ack is the delay required for a microprocessor (microcontroller unit, MCU) to successfully send data and receive ACK, λ _c is the current node The data packet arrival rate, E[Γ _c ] is the average number of data packets in the current node’s queue during the busy period,

Is the probability of data being lost after the previous hop node performs M+1 backoffs, cg _sum is the average number of CCA times required for the current node to perform PST, E[Γ _b ] is the average number of data packets in the queue of the next hop node,

Is the probability of data being lost after the next hop node performs M+1 backoffs, bg _sum is the average number of CCA times required by the next hop node to perform the dynamic CCA optimization mechanism, T _h is the time required to send the header of the data packet, T _l is the time required to send the payload of the packet.

a _0c是数据包在当前节点队列中平均停留时间，因为节点在接收数据的过程中也会自身产生数据，所以采用PST机制的计算为： among them,

a _0c is the average stay time of the data packet in the queue of the current node, because the node will also generate data in the process of receiving data, so the calculation using the PST mechanism is:

The calculation using the PCT mechanism is:

Where G _{k is} calculated as:

E[D _HoLc ] is the average time required for a node to perform CCA and backoff, expressed as:

The terminal node only performs data upload, so there is no need to consider the impact of the previous hop node. The relay node not only needs to consider the impact of the previous hop and peer nodes, but also needs to consider the impact of the next hop node, so the relay node The packet loss rate model B is expressed as:

Among them, α _d is the packet loss rate of the next hop node, dg _sum is the average number of CCA times required by the previous hop node to execute the dynamic CCA optimization mechanism PST, and E[Γ _d ] is the average number of packets in the queue of the previous hop node , And the terminal node packet loss rate model B using the PCT mechanism optimized by multiple data packets continuous transmission and dynamic CCA is expressed as:

In the PST mechanism, a _{0c is} calculated as:

In the PCT mechanism, a _{0c is} calculated as:

Relay nodes close to the sink node only need to consider the impact of the previous hop and peer nodes, but the number of data packets cached by the node may have reached the upper limit, and this factor needs to be considered extra. These relays under the PST mechanism The node's packet loss rate model C is calculated as:

Where overflow is the part of the packet that has not been received, calculated as:

Similarly, the packet loss rate of nodes using the PCT mechanism is calculated as:

In the PST mechanism, a _{0c is} calculated as:

In the PCT mechanism, a _{0c is} calculated as:

Optionally, in combination with the first aspect described above, in the first possible implementation manner, the packet loss rate α and data delay time caused by the terminal node and relay node in the wireless network monitored by the busy channel are estimated according to the packet loss rate prediction model T _A , total energy consumption E _A and node data processing speed λ _service , including: According to different tree-type network node packet loss rate prediction models based on finite queue length, the transmission delay T _t of each node is calculated as:

T _t =(1-α ^M+1 )(S _WUR +S _MCU )+α ^M+1 D _WUR

The total delay of data packet transmission is equal to the sum of the delays required for each hop. Similarly, the energy consumption of each hop is calculated as:

E _t =(1-α ^M+1 )(E _WUR +E _MCU )+α ^M+1 H _WUR

S _MCU =T _on +T _h +T _l +T _SIFS +T _ack is the delay required for MCU to successfully send data and receive ACK, E _MCU =E _on +E _h +E _l +E _SIFS +E _ack is The energy consumed when the data is sent successfully and the ACK is received. Among them, _Ton is the delay required for the node to switch from the sleep state to the normal working state, T _h is the time required to send the header of the data packet, and T _l is the effective sending of the data packet The time required for the load, T _SIFS is the shortest frame interval, T _ack is the time required to receive ACK, E _on is the energy consumed by the node to switch from the sleep state to the normal working state, and E _h is the energy consumed by sending the packet header Energy, E _l is the energy consumed to send the data packet payload, E _SIFS is the energy consumed in the idle state, and E _ack is the energy consumed to receive ACK;

S _WUR is the delay required to successfully send the wake-up request, calculated as:

D _WUR is the delay required for no wake-up request due to the busy channel, and is calculated as:

E _WUR is the energy consumed when the wake-up request is sent successfully, calculated as:

H _WUR is the energy consumed by a busy channel without a wake-up request. It is calculated as:

Where I _CCA is the current of WUR when performing CCA, V is the power supply voltage, E _wuc is the energy consumed to send a wake-up request, CW is the upper limit of the back-off time, T _BO is the back-off unit time, and E _BO is the energy consumed in the back-off unit time , E _CCA is the energy consumed to execute CCA;

The node data packet processing speed is calculated as:

是当前节点检测M+1次后信道还在忙碌状态的概率，λ _x是当前节点的数据包到达速率。 Where λ is the data packet arrival rate of the terminal node,

It is the probability that the channel is still busy after the current node detects M+1 times, and λ _x is the data packet arrival rate of the current node.

Optionally, in combination with the above-mentioned first aspect, in a second possible implementation manner, one or more data packets are selected to be sent during the wake-up period according to the optimal value of the data receiving rate of the sink node, and the information is passed through the confirmation frame ACK informs the upper-level node, including: the continuous data packet sending mechanism can reduce the data communication delay and energy consumption. This is because the node cache is small, and the queue in the model is set to accommodate two data packets at most, so when the node data When the packet arrival rate is small, the continuous data packet sending mechanism can reduce the data communication delay and energy consumption. When the data packet arrival rate is large, that is, the number of queue data overflow reaches half of the queue length, or the processing speed of the second-level node in the PCT-based WUR is lower than the PST-based WUR, the single data packet transmission mode is used, because the data packet When the arrival rate increases, the probability of data congestion may increase, and the next hop node may not be able to store so many data packets. Through the second possible implementation of the first aspect, it is ensured that the data packet can be forwarded by the relay node. The node compares the recorded information and its own data packet arrival rate with the set threshold, and uses multiple data packets when it is less than the threshold. Continuous transmission mode, when greater than a single packet transmission mode.

The second aspect of the present application provides a device for multi-hop wireless wake-up. The device has the function of implementing the above-mentioned first aspect or any one of the possible implementation methods of the first aspect. This function can be realized by hardware, or by hardware executing corresponding software. The hardware or software includes one or more modules corresponding to the above-mentioned functions.

A third aspect of the present application provides a computer-readable storage medium that stores instructions in the computer-readable storage medium, and when it runs on a computer, the computer can execute the first aspect or any possible implementation manner of the first aspect Multi-hop wireless wake-up method.

The fourth aspect of the present application provides a computer program product containing instructions, which when running on a computer, enables the computer to execute the multi-hop wireless wake-up method of the first aspect or any one of the possible implementations of the first aspect.

This application aims at the optimization of the multi-hop transmission wake-up mechanism, utilizes the low power consumption characteristics of the wake-up radio frequency itself, uses dynamic adjustment of the data transmission mechanism and on-demand wake-up technology to achieve wireless wake-up, improves the wake-up success efficiency, and increases the data packet processing speed of the node. In addition, two different data packet transmission mechanisms can be adaptively selected for communication according to changes in network traffic, which reduces data communication delay and node energy consumption.

Description of the drawings

FIG. 1 is a schematic flowchart of a multi-hop wireless wake-up method provided by this application;

Figure 2 is a schematic diagram of the wireless wake-up interaction process between the terminal node and the sink node using the PCT mechanism provided by this application;

Figure 3 is a flowchart of adaptive selection of the wake-up mechanism provided by this application;

Figure 4 is a schematic structural diagram of a communication device provided by this application;

Fig. 5 is a schematic diagram of the structure of a node provided by this application.

Detailed ways

The following describes the implementation of this application through specific specific examples, and those skilled in the art can easily understand other advantages and effects of this application from the content disclosed in this application. It should be noted that the illustrations provided in the following embodiments are only illustrative to illustrate the basic concept of the present application. In the case of no conflict, the following embodiments and the features in the embodiments can be combined with each other.

As shown in Figure 1, the flow diagram of a multi-hop wireless wake-up method provided by this application is used to predict the packet loss probability of a node's wake-up request through the parameters of the data packet reaching rate and the upper limit of the number of retransmissions. Energy consumption, data processing speed and other indicators to analyze the performance of the protocol can include the following steps:

S1: Establish different tree-type network node packet loss rate prediction models based on finite queue length according to node types.

S2: The node packet loss rate prediction model to estimate the radio network termination node and the relay node monitors the channel is busy due to the packet loss rate α, the data delay time T _A, and the total energy E _A node data processing speed λ _service.

S3: The node selects whether to send one or more data packets during the wake-up period according to the optimal value of the data successfully received by the sink node, and informs the upper-level node of the information through the ACK.

Step S1 may include three packet loss rate models of terminal nodes and relay nodes, which are specifically as follows:

Consider the Markov chain M/G/1/2 queue model in which the packet arrival rate obeys the Poisson distribution, extend it to the tree network, and use _CT short CCA to evaluate the channel state, when it is detected Backoff can be performed quickly when the channel is busy; considering the difference between the terminal node and the relay node receiving and sending data, the terminal node packet loss rate model A using a single data packet transmission and a dynamic CCA optimized PST mechanism is obtained:

The terminal node packet loss rate model using the PCT mechanism optimized by the continuous transmission of multiple data packets and dynamic CCA:

是上一跳节点执行M+1次退避后数据被丢掉的概率。cg _sum是当前节点执行PST所需要的平均CCA次数，E[Γ _b]是下一跳节点队列中平均数据包数量，

是下一跳节点执行M+1次退避后数据被丢掉的概率，bg _sum是下一跳节点执行动态CCA优化机制所需要的平均CCA次数。T _h是发送数据包头部所需要的时间，T _l是发送数据包有效负载所需要的时间。 Where N is the number of nodes, M is the number of retransmissions, α _c is the packet loss rate of the current node, α _b is the packet loss rate of the previous hop node, T _CCA is the time required to perform a CCA, and T _wuc is the wake-up call The time required for the request, S _MCU = _Ton + T _h + T _l + T _SIFS + T _ack is the delay required for the microcontroller MCU to successfully send data and receive ACK. λ _c is the data packet arrival rate of the current node, E[Γ _c ] is the average number of data packets in the queue of the current node during the busy period,

It is the probability of data being lost after the previous hop node performs M+1 backoff. cg _sum is the average number of CCA required by the current node to execute PST, E[Γ _b ] is the average number of packets in the queue of the next hop node,

It is the probability that data will be lost after the next hop node performs M+1 backoffs, and bg _sum is the average number of CCA times required for the next hop node to perform the dynamic CCA optimization mechanism. T _h is the time required to send the header of the data packet, and T _l is the time required to send the payload of the data packet.

其中a _0c是数据包在当前节点队列中平均停留时间，因为节点在接收数据的过程中也会自身产生数据。所以采用PST机制的可以计算为： E[Γ _c ] can be calculated as

Among them, a _0c is the average staying time of the data packet in the queue of the current node, because the node also generates data by itself in the process of receiving data. Therefore, the PST mechanism can be calculated as:

The calculation using the PCT mechanism is:

Where G _{k is} calculated as:

E[D _HoLc ] is the average time required for the node to perform CCA and backoff, which can be expressed as:

The terminal node only performs data upload, so there is no need to consider the impact of the previous hop node. The relay node not only needs to consider the influence of the previous hop and peer nodes, but also the influence of the next hop node. So the packet loss rate model B of the relay node can be expressed as:

Among them, α _d is the packet loss rate of the next hop node, dg _sum is the average number of CCA times required by the previous hop node to execute the dynamic CCA optimization mechanism PST, and E[Γ _d ] is the average number of packets in the queue of the previous hop node . The terminal node packet loss rate model B using the PCT mechanism with multiple data packets continuous transmission and dynamic CCA optimization can be expressed as:

In the PST mechanism, a _0c can be calculated as:

In the PCT mechanism, a _0c can be calculated as:

Relay nodes close to the sink node only need to consider the impact of the previous hop and peer nodes, but the number of data packets cached by the node may have reached the upper limit, and additional considerations in this aspect are required. The packet loss rate model C of these relay nodes under the PST mechanism can be calculated as:

Where overflow is the part of the packet that has not been received, which can be calculated as:

Similarly, the packet loss rate of nodes using the PCT mechanism can be calculated as:

In the PST mechanism, a _0c can be calculated as:

In the PCT mechanism, a _0c can be calculated as:

Step S2 mainly includes performance index calculation methods, which are specifically as follows:

According to the model described above, the transmission delay T _t per hop of a node can be calculated as:

T _t =(1-α ^M+1 )(S _WUR +S _MCU )+α ^M+1 D _WUR

The total delay of data packet transmission is equal to the sum of the required delays for each hop. Similarly, the energy consumption per hop can be calculated as:

E _t =(1-α ^M+1 )(E _WUR +E _MCU )+α ^M+1 H _WUR

Where S _MCU =T _on +T _h +T _l +T _SIFS +T _ack is the delay required for the microcontroller MCU to successfully send data and receive ACK, E _MCU =E _on +E _h +E _l +E _SIFS + E _ack is the energy consumed when data is successfully sent and ACK is received. Among them, T _on is the delay required for the node to switch from the sleep state to the normal working state, T _h is the time required to send the packet header, T _l is the time required to send the data packet payload, and T _SIFS is the shortest frame interval, T _ack is the time required to receive ACK. E _on is the energy consumed by the node to switch from the sleep state to the normal working state, E _h is the energy consumed by sending the header of the data packet, E _l is the energy consumed by sending the data packet payload, and E _SIFS is the energy consumed by the idle state , E _ack is the energy consumed to receive ACK.

S _WUR is the delay required for the successful transmission of the wake-up request, which can be calculated as:

D _WUR is the delay required for no wake-up request due to the busy channel, and is calculated as:

E _WUR is the energy consumed when the wake-up request is sent successfully, calculated as:

H _WUR is the energy consumed by a busy channel without a wake-up request. It is calculated as:

Where I _CCA is the current of WUR when performing CCA, V is the power supply voltage, E _wuc is the energy consumed to send a wake-up request, CW is the upper limit of the back-off time, T _BO is the back-off unit time, and E _BO is the energy consumed in the back-off unit time , E _CCA is the energy consumed to perform CCA.

The node data packet processing speed can be calculated as:

是当前节点检测M+1次后信道还在忙碌状态的概率，λ _x是当前节点的数据包到达速率。 Where λ is the data packet arrival rate of the terminal node,

It is the probability that the channel is still busy after the current node detects M+1 times, and λ _x is the data packet arrival rate of the current node.

Step S3 is mainly for the adaptive selection mechanism, including the following:

The node cache is small, and the queue in the model is set to hold up to two packets. Therefore, when the node data packet arrival rate is small, the continuous data packet sending mechanism can reduce the data communication delay and energy consumption, but when the data packet arrival rate increases, this may increase the probability of data congestion, and the next hop node may not be able to Store so many packets. Therefore, when the data packet arrival rate is large, that is, when the number of data overflow in the queue reaches half of the queue length, or the processing speed of the second-level node in the PCT-based WUR is lower than the PST-based 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 its own data packet arrival rate with the set threshold. When the threshold is less than the threshold, it adopts multiple data packet continuous transmission mode, and when it is greater than the threshold, it adopts a single data packet transmission mode.

Figure 2 is a wireless wake-up interaction process between the terminal node and the sink node under the PCT mechanism adopted in this embodiment. Nodes in the PCT mechanism immediately stop executing CCA when detecting that the channel is busy, and directly enter the next stage. If the channel is idle, then it needs to continue. If it is detected that the channel is busy some time in the middle, then perform the same steps as above. If it is detected that the channel is in an idle state for C _T consecutive times, a wake-up request can be sent to wake up the destination node. Considering that the energy required to perform CCA is relatively large, a two-stage detection mode can be used. That is, CCA detection is performed for the first and last time, and idle time slots are used for the middle _CT-2 times to reduce energy consumption. And the PCT mechanism adopts the mode of continuous transmission of data packets. The source node can transmit two or more data packets continuously by sending a wake-up request once until the node queue is empty. This can reduce the node's wake-up frequency to reduce energy consumption, but when the network traffic is heavy, it may seriously affect the delay. Therefore, the PCT mechanism specifies a threshold that allows the node to use the value calculated from the historical record information to compare with the threshold. Choose whether to use a continuous packet transmission mechanism.

Figure 3 is a flowchart of adaptive selection of wake-up mechanism. When a node has a data packet to send, it first performs backoff and CCA idle channel assessment phases, and when it detects that the channel is busy, it directly enters the next phase. When the channel is idle, continue to detect. If the C _T channels are all shown as idle, compare the predicted data processing speed with the threshold. When the data processing speed is greater than the threshold, use a single data transmission method, and when it is less than the threshold Use multiple data transmission methods. The threshold is obtained according to the node data processing speed in the WUR protocol based on PST.

It can be understood that, when the above-mentioned node device is used for multi-hop wireless wake-up, in order to realize the above-mentioned functions, it includes hardware structures and/or software modules corresponding to each function. In this application, the node device is also referred to as a device for short, or a device for multi-hop wireless wake-up. Those skilled in the art should easily realize that in combination with the modules and algorithm steps of the examples described in the embodiments disclosed herein, the present application can be implemented in the form of hardware or a combination of hardware and computer software. Whether a certain function is executed by hardware or computer software-driven hardware depends on the specific application and design constraint conditions of the technical solution. Professionals and technicians can use different methods for each specific application to implement the described functions, but such implementation should not be considered beyond the scope of this application.

Described in terms of hardware structure, the nodes in Figures 1 to 3 can be implemented by one physical device, or can be implemented by multiple physical devices together, or can be a logical function module in one physical device. There is no specific limitation.

For example, it can be realized by the communication device in FIG. 4. Fig. 4 shows a schematic diagram of the hardware structure of a node provided by an embodiment of the application. It includes: a communication interface 401 and a processor 402, and may also include a memory 403.

The communication interface 401 can use any device such as a transceiver to communicate with other devices or communication networks, such as Ethernet, radio access network (RAN), wireless local area networks (WLAN), etc. .

The processor 402 includes but is not limited to a central processing unit (CPU), a network processor (NP), an application-specific integrated circuit (ASIC), or a programmable logic device (programmable logic device, PLD) one or more. The above-mentioned PLD may be a complex programmable logic device (CPLD), a field-programmable gate array (FPGA), a generic array logic (GAL) or any combination thereof. The processor 402 is responsible for the communication line 404 and general processing, and can also provide various functions, including timing, peripheral interfaces, voltage regulation, power management, and other control functions. The memory 403 may be used to store data used by the processor 402 when performing operations.

The memory 403 may be read-only memory (ROM) or other types of static storage devices that can store static information and instructions, random access memory (RAM), or other types that can store information and instructions The dynamic storage device can also be an electrically erasable programmable read-only memory (electricallyer serverable programmable read-only memory, EEPROM), a compact disc (read-only memory, CD-ROM), or other optical disk storage, CD-ROM Storage (including compact discs, laser discs, optical discs, digital versatile discs, Blu-ray discs, etc.), magnetic disk storage media or other magnetic storage devices, or can be used to carry or store desired program codes in the form of instructions or data structures and can be used by Any other medium accessed by the computer, but not limited to this. The memory may exist independently and is connected to the processor 402 through the communication line 404. The memory 403 may also be integrated with the processor 402. If the memory 403 and the processor 402 are independent devices, the memory 403 and the processor 402 are connected, for example, the memory 403 and the processor 402 can communicate through a communication line. The communication interface 401 and the processor 402 can communicate through a communication line, and the communication interface 401 can also be directly connected to the processor 402.

The communication line 404 may include any number of interconnected buses and bridges, and the communication line 404 links various circuits including one or more processors 402 represented by the processor 402 and a memory represented by the memory 403 together. The communication line 404 may also link various other circuits such as peripheral devices, voltage regulators, and power management circuits, etc., which are all known in the art, and therefore, no further description is provided in this application.

In a specific implementation, the node may include: a memory for storing computer-readable instructions;

It also includes a processor coupled with the memory, configured to execute computer-readable instructions in the memory to perform the following operations:

Establish different prediction models for packet loss rate of tree network nodes based on finite queue length according to node types;

The predictive model to estimate the wireless network termination node and the relay node of the monitored packet loss rate α, the data delay time T _A, and the total energy E _A node data processing speed λ _service;

It also includes a communication interface coupled with the processor, which is used for the processor to select to send one or more data packets during the wake-up period according to the optimal value of the data successfully received by the sink node, and notify the uplink through an acknowledgement frame ACK The first level node.

In a specific implementation manner, the processor is specifically configured to:

The Markov chain M/G/1/2 queue model in which the data packet arrival rate obeys the Poisson distribution is extended to the tree network, and the channel state is evaluated by the CCA of short idle channel detection of _CT times, and the result is Terminal node packet loss rate model using single packet transmission and dynamic CCA optimized single packet transmission PST mechanism:

The terminal node packet loss rate model using the PCT mechanism optimized by the continuous transmission of multiple data packets and dynamic CCA:

是上一跳节点执行M+1次退避后数据被丢掉的概率，cg _sum是当前节点执行PST所需要的平均CCA次数，E[Γ _b]是下一跳节点队列中平均数据包数量，

是下一跳节点执行M+1次退避后数据被丢掉的概率，bg _sum是下一跳节点执行动态CCA优化机制所需要的平均CCA次数，T _h是发送数据包头部所需要的时间，T _l是发送数据包有效负载所需要的时间，

a _0c是数据包在当前节点队列中平均停留时间， Where N is the number of nodes, M is the number of retransmissions, α _c is the packet loss rate of the current node, α _b is the packet loss rate of the previous hop node, T _CCA is the time required to perform a CCA, and T _wuc is the wake-up call The time required for the request, S _MCU = _Ton + T _h + T _l + T _SIFS + T _ack is the delay required for the microcontroller MCU to successfully send data and receive ACK, λ _c is the data packet arrival rate of the current node , E[Γ _c ] is the average number of packets in the queue of the current node during busy periods,

Is the probability of data being lost after the previous hop node performs M+1 backoffs, cg _sum is the average number of CCA times required for the current node to perform PST, E[Γ _b ] is the average number of data packets in the queue of the next hop node,

Is the probability of data being lost after the next hop node performs M+1 backoffs, bg _sum is the average number of CCA times required by the next hop node to perform the dynamic CCA optimization mechanism, T _h is the time required to send the header of the data packet, T _l is the time required to send the payload of the packet,

a _0c is the average stay time of the data packet in the current node queue,

When using PST mechanism:

When using the PCT mechanism:

among them,

E[D _HoLc ] is the average time required for a node to perform CCA and backoff, expressed as:

The packet loss rate model of the relay node is:

Among them, α _d is the packet loss rate of the next hop node, dg _sum is the average number of CCA times required by the previous hop node to execute the dynamic CCA optimization PST mechanism, and E[Γ _d ] is the average data packet in the queue of the previous hop node Quantity, the terminal node packet loss rate model of the PCT mechanism using multiple data packets continuous transmission and dynamic CCA optimization is:

In the PST mechanism, a _{0c is} calculated as:

In the PCT mechanism, a _{0c is} calculated as:

The packet loss rate model of the relay node under the PST mechanism is calculated as:

Where overflow is the part of the packet that has not been received, calculated as:

Similarly, the packet loss rate of nodes using the PCT mechanism is calculated as:

In the PST mechanism, a _{0c is} calculated as:

In the PCT mechanism, a _{0c is} calculated as:

In a specific implementation manner, the processor is specifically configured to:

According to the different prediction models, the per-hop transmission delay T _t of the node is determined to be:

T _t =(1-α ^M+1 )(S _WUR +S _MCU )+α ^M+1 D _WUR

The energy consumption per jump is calculated as:

E _t =(1-α ^M+1 )(E _WUR +E _MCU )+α ^M+1 H _WUR

Where S _MCU =T _on +T _h +T _l +T _SIFS +T _ack is the delay required for the microcontroller MCU to successfully send data and receive ACK, E _MCU =E _on +E _h +E _l +E _SIFS + E _ack is the energy consumed when data is successfully sent and ACK is received, where _Ton is the delay required for the node to switch from sleep to normal working status, T _h is the time required to send the header of the data packet, and T _l is the data sent The time required for the packet payload, T _SIFS is the shortest frame interval, T _ack is the time required to receive ACK, E _on is the energy consumed by the node to switch from the sleep state to the normal working state, and E _h is the head of the packet sent Energy consumed, E _l is the energy consumed to send data packet payload, E _SIFS is the energy consumed in the idle state, and E _ack is the energy consumed to receive ACK;

S _WUR is the delay required to successfully send the wake-up request, calculated as:

D _WUR is the delay required for no wake-up request due to the busy channel, and is calculated as:

E _WUR is the energy consumed when the wake-up request is sent successfully, calculated as:

H _WUR is the energy consumed by a busy channel without a wake-up request. It is calculated as:

Where I _CCA is the current of the wireless wake-up transceiver WUR when _CCA is executed, V is the supply voltage, E _wuc is the energy consumed to send the wake-up request, CW is the upper limit of the back-off time, T _BO is the back-off unit time, and E _BO is the back-off unit time Energy consumed, E _CCA is the energy consumed to execute CCA;

The node data packet processing speed is calculated as:

是当前节点检测M+1次后信道还在忙碌状态的概率，λ _x是当前节点的数据包到达速率。 Where λ is the data packet arrival rate of the terminal node,

It is the probability that the channel is still busy after the current node detects M+1 times, and λ _x is the data packet arrival rate of the current node.

In a specific implementation manner, the processor is specifically configured to:

When the node data packet arrival rate is less than the preset value, the continuous data packet transmission mechanism is adopted, and when the data packet arrival rate is greater than the preset value, a single data packet transmission mode is adopted.

In the embodiments of the present application, the communication interface can be regarded as the transceiver unit of the node, the processor with processing function can be regarded as the processing unit of the node, and the memory can be regarded as the storage unit of the node. As shown in FIG. 5, the node includes a transceiver unit 510 and a processing unit 520. The transceiver unit may also be referred to as a transceiver, a transceiver, a transceiver, and so on. The processing unit may also be called a processor, a processing board, a processing module, a processing device, and so on. Optionally, the device for implementing the receiving function in the transceiver unit 510 can be regarded as the receiving unit, and the device for implementing the sending function in the transceiver unit 510 can be regarded as the sending unit, that is, the transceiver unit 510 includes a receiving unit and a sending unit. The transceiver unit may sometimes be called a transceiver, a transceiver, or a transceiver circuit. The receiving unit may sometimes be called a receiver, receiver, or receiving circuit. The transmitting unit may sometimes be called a transmitter, a transmitter, or a transmitting circuit.

In the above embodiments, it may be implemented in whole or in part by software, hardware, firmware or any combination thereof. When implemented by software, it can be implemented in the form of a computer program product in whole or in part.

The computer program product includes one or more computer instructions. When the computer program instructions are loaded and executed on the computer, the processes or functions described in the embodiments of the present application are generated in whole or in part. The computer may be a general-purpose computer, a special-purpose computer, a computer network, or other programmable devices. The computer instructions may be stored in a computer-readable storage medium or transmitted from one computer-readable storage medium to another computer-readable storage medium. For example, the computer instructions may be transmitted from a website, computer, server, or data center. Transmission to another website site, computer, server or data center via wired (such as coaxial cable, optical fiber, digital subscriber line (DSL)) or wireless (such as infrared, wireless, microwave, etc.). The computer-readable storage medium may be any available medium that can be stored by a computer or a data storage device such as a server or data center integrated with one or more available media. The usable medium may be a magnetic medium (for example, a floppy disk, a hard disk, a magnetic tape), an optical medium (for example, a DVD), or a semiconductor medium (for example, a solid state disk (SSD)).

A person of ordinary skill in the art can understand that all or part of the steps in the various methods of the above-mentioned embodiments can be completed by a program instructing relevant hardware. The program can be stored in a computer-readable storage medium, and the storage medium can include: ROM, RAM, magnetic disk or CD, etc.

Claims (14)

A multi-hop wireless wake-up method, characterized in that it comprises: Establish different prediction models for packet loss rate of tree network nodes based on finite queue length according to node types; The predictive model to estimate the wireless network termination node and the relay node of the monitored packet loss rate α, the data delay time T _A, and the total energy E _A node data processing speed λ _service; According to the optimal value of the data receiving rate of the sink node, one or more data packets are selected to be sent during the wake-up period, and the upper-level node is notified through an ACK frame. The multi-hop wireless wake-up method according to claim 1, wherein the establishment of different prediction models of the tree-type network node packet loss rate based on the finite queue length according to the node type comprises: The Markov chain M/G/1/2 queue model is extended to the tree network, and CCA is used for short-term idle channel detection of _CT times to evaluate the channel state, and single data packet transmission and dynamic CCA optimization are obtained. The terminal node packet loss rate model of the single-packet transmission PST mechanism:

The terminal node packet loss rate model using the PCT mechanism optimized by the continuous transmission of multiple data packets and dynamic CCA:

Where N is the number of nodes, M is the number of retransmissions, α _c is the packet loss rate of the current node, α _b is the packet loss rate of the previous hop node, T _CCA is the time required to perform a CCA, and T _wuc is the wake-up call The time required for the request, S _MCU = _Ton + T _h + T _l + T _SIFS + T _ack is the delay required for the microcontroller MCU to successfully send data and receive ACK, λ _c is the data packet arrival rate of the current node , E[Γ _c ] is the average number of packets in the queue of the current node during busy periods,

Is the probability that the data is lost after the previous hop node performs M+1 backoff, cg _sum is the average number of CCA times the current node needs to perform PST, E[Γ _b ] is the average number of data packets in the queue of the next hop node,

Is the probability of data being lost after the next hop node performs M+1 backoffs, bg _sum is the average number of CCA times required by the next hop node to perform the dynamic CCA optimization mechanism, T _h is the time required to send the header of the data packet, T _l is the time required to send the payload of the packet,

a _0c is the average stay time of the data packet in the current node queue, When using PST mechanism:

When using the PCT mechanism:

among them,

E[D _HoLc ] is the average time required for a node to perform CCA and backoff, expressed as:

The packet loss rate model of the relay node is:

Among them, α _d is the packet loss rate of the next hop node, dg _sum is the average number of CCA times required by the previous hop node to execute the dynamic CCA optimization PST mechanism, and E[Γ _d ] is the average data packet in the queue of the previous hop node Quantity, the terminal node packet loss rate model of the PCT mechanism using multiple data packets continuous transmission and dynamic CCA optimization is:

In the PST mechanism, a _{0c is} calculated as:

In the PCT mechanism, a _{0c is} calculated as:

The packet loss rate model of the relay node under the PST mechanism is calculated as:

Where overflow is the part of the packet that has not been received, calculated as:

Similarly, the packet loss rate of nodes using the PCT mechanism is calculated as:

In the PST mechanism, a _{0c is} calculated as:

In the PCT mechanism, a _{0c is} calculated as:

The multi-hop wireless wake-up method according to claim 1, wherein the estimation of the packet loss rate α and the data delay time T _A caused by the terminal node and the relay node in the wireless network monitoring that the channel is busy according to the prediction model , Total energy consumption E _A and node data processing speed λ _service , including: According to the different prediction models, the per-hop transmission delay T _{t of} the node is calculated as: T _t =(1-α ^M+1 )(S _WUR +S _MCU )+α ^M+1 D _WUR The energy consumption per jump is calculated as: E _t =(1-α ^M+1 )(E _WUR +E _MCU )+α ^M+1 H _WUR Where S _MCU =T _on +T _h +T _l +T _SIFS +T _ack is the delay required for the microcontroller MCU to successfully send data and receive ACK, E _MCU =E _on +E _h +E _l +E _SIFS + E _ack is the energy consumed when data is successfully sent and ACK is received, where _Ton is the delay required for the node to switch from sleep to normal working status, T _h is the time required to send the header of the data packet, and T _l is the data sent The time required for the packet payload, T _SIFS is the shortest frame interval, T _ack is the time required to receive ACK, E _on is the energy consumed by the node to switch from the sleep state to the normal working state, and E _h is the head of the packet sent Energy consumed, E _l is the energy consumed to send data packet payload, E _SIFS is the energy consumed in the idle state, and E _ack is the energy consumed to receive ACK; S _WUR is the delay required to successfully send the wake-up request, calculated as:

D _WUR is the delay required for no wake-up request due to the busy channel, and is calculated as:

E _WUR is the energy consumed when the wake-up request is sent successfully, calculated as:

H _WUR is the energy consumed by a busy channel without a wake-up request. It is calculated as:

Where I _CCA is the current of the wireless wake-up transceiver WUR when _CCA is executed, V is the supply voltage, E _wuc is the energy consumed to send the wake-up request, CW is the upper limit of the back-off time, T _BO is the back-off unit time, and E _BO is the back-off unit time Energy consumed, E _CCA is the energy consumed to execute CCA; The node data packet processing speed is calculated as:

Where λ is the data packet arrival rate of the terminal node,

It is the probability that the channel is still busy after the current node detects M+1 times, and λ _x is the data packet arrival rate of the current node. The multi-hop wireless wake-up method according to claim 1, characterized in that: the one or more data packets are selected to be sent during the wake-up period according to the optimal value of the data successful reception rate of the sink node, and the upper data packet is notified by the confirmation frame ACK First-level nodes, including: When the number of queue data overflow does not reach half of the queue length or the processing speed of the second-level node in PCT-based WUR is greater than that of PST-based WUR, the continuous data packet sending mechanism is adopted. When the queue data overflow reaches half of the queue length or PCT-based WUR When the processing speed of the second-level node is lower than the PST-based WUR, a single data packet transmission mode is adopted. A device for multi-hop wireless wake-up, which is characterized in that it comprises: The processing unit is used to establish different prediction models for the packet loss rate of tree network nodes based on the finite queue length according to the node type; The processing unit is further configured to estimate, according to the prediction model established by the processing unit, the packet loss rate α, the data delay time T _A , the total energy consumption E _A and the node monitored by the terminal node and the relay node in the wireless network Data processing speed λ _service ; The transceiver unit is used to select one or more data packets to be sent during the wake-up period according to the optimal value of the data successfully received by the sink node, and notify the upper-level node through an acknowledgement frame ACK. The device according to claim 5, wherein the processing unit is specifically configured to: The Markov chain M/G/1/2 queue model in which the data packet arrival rate obeys the Poisson distribution is extended to the tree network, and the channel state is evaluated by the CCA of short idle channel detection of _CT times, and the result is Terminal node packet loss rate model using single packet transmission and dynamic CCA optimized single packet transmission PST mechanism:

The terminal node packet loss rate model using the PCT mechanism optimized by the continuous transmission of multiple data packets and dynamic CCA:

Where N is the number of nodes, M is the number of retransmissions, α _c is the packet loss rate of the current node, α _b is the packet loss rate of the previous hop node, T _CCA is the time required to perform a CCA, and T _wuc is the wake-up call The time required for the request, S _MCU = _Ton + T _h + T _l + T _SIFS + T _ack is the delay required for the microcontroller MCU to successfully send data and receive ACK, λ _c is the data packet arrival rate of the current node , E[Γ _c ] is the average number of packets in the queue of the current node during busy periods,

Is the probability that the data is lost after the previous hop node performs M+1 backoff, cg _sum is the average number of CCA times the current node needs to perform PST, E[Γ _b ] is the average number of data packets in the queue of the next hop node,

Is the probability of data being lost after the next hop node performs M+1 backoffs, bg _sum is the average number of CCA times required by the next hop node to perform the dynamic CCA optimization mechanism, T _h is the time required to send the header of the data packet, T _l is the time required to send the payload of the packet,

a _0c is the average stay time of the data packet in the current node queue, When using PST mechanism:

When using the PCT mechanism:

among them,

E[D _HoLc ] is the average time required for a node to perform CCA and backoff, expressed as:

The packet loss rate model of the relay node is:

Among them, α _d is the packet loss rate of the next hop node, dg _sum is the average number of CCA times required by the previous hop node to execute the dynamic CCA optimization PST mechanism, and E[Γ _d ] is the average data packet in the queue of the previous hop node Quantity, the terminal node packet loss rate model of the PCT mechanism using multiple data packets continuous transmission and dynamic CCA optimization is:

In the PST mechanism, a _{0c is} calculated as:

In the PCT mechanism, a _{0c is} calculated as:

The packet loss rate model of the relay node under the PST mechanism is calculated as:

Where overflow is the part of the packet that has not been received, calculated as:

Similarly, the packet loss rate of nodes using the PCT mechanism is calculated as:

In the PST mechanism, a _{0c is} calculated as:

In the PCT mechanism, a _{0c is} calculated as:

The device according to claim 5, wherein the processing unit is specifically configured to: According to the different prediction models, the per-hop transmission delay T _{t of} the node is calculated as: T _t =(1-α ^M+1 )(S _WUR +S _MCU )+α ^M+1 D _WUR The energy consumption per jump is calculated as: E _t =(1-α ^M+1 )(E _WUR +E _MCU )+α ^M+1 H _WUR Where S _MCU =T _on +T _h +T _l +T _SIFS +T _ack is the delay required for the microcontroller MCU to successfully send data and receive ACK, E _MCU =E _on +E _h +E _l +E _SIFS + E _ack is the energy consumed when data is successfully sent and ACK is received, where _Ton is the delay required for the node to switch from sleep to normal working status, T _h is the time required to send the header of the data packet, and T _l is the data sent The time required for the packet payload, T _SIFS is the shortest frame interval, T _ack is the time required to receive ACK, E _on is the energy consumed by the node to switch from the sleep state to the normal working state, and E _h is the head of the packet sent Energy consumed, E _l is the energy consumed to send data packet payload, E _SIFS is the energy consumed in the idle state, and E _ack is the energy consumed to receive ACK; S _WUR is the delay required to successfully send the wake-up request, calculated as:

D _WUR is the delay required for no wake-up request due to the busy channel, and is calculated as:

E _WUR is the energy consumed when the wake-up request is sent successfully, calculated as:

H _WUR is the energy consumed by a busy channel without a wake-up request. It is calculated as:

Where I _CCA is the current of the wireless wake-up transceiver WUR when _CCA is executed, V is the supply voltage, E _wuc is the energy consumed to send the wake-up request, CW is the upper limit of the back-off time, T _BO is the back-off unit time, and E _BO is the back-off unit time Energy consumed, E _CCA is the energy consumed to execute CCA; The node data packet processing speed is calculated as:

Where λ is the data packet arrival rate of the terminal node,

It is the probability that the channel is still busy after the current node detects M+1 times, and λ _x is the data packet arrival rate of the current node. The device according to claim 5, wherein the transceiver unit is specifically configured to: When the number of queue data overflow does not reach half of the queue length or the processing speed of the second-level node in PCT-based WUR is greater than that of PST-based WUR, the continuous data packet sending mechanism is adopted. When the queue data overflow reaches half of the queue length or PCT-based WUR When the processing speed of the second-level node is lower than the PST-based WUR, a single data packet transmission mode is adopted. A device for multi-hop wireless wake-up, which is characterized in that it comprises: Memory for storing computer readable instructions; It also includes a processor coupled with the memory, configured to execute computer-readable instructions in the memory to perform the following operations: Establish different prediction models for the packet loss rate of tree network nodes based on the finite queue length according to the node type; The predictive model to estimate the wireless network termination node and the relay node of the monitored packet loss rate α, the data delay time T _A, and the total energy E _A node data processing speed λ _service; It also includes a communication interface coupled with the processor, which is used for the processor to select to send one or more data packets during the wake-up period according to the optimal value of the data successfully received by the sink node, and notify the uplink through an acknowledgement frame ACK The first level node. The device according to claim 9, wherein the processor is specifically configured to: The Markov chain M/G/1/2 queue model in which the data packet arrival rate obeys the Poisson distribution is extended to the tree network, and the channel state is evaluated by the CCA of short idle channel detection of _CT times, and the result is Terminal node packet loss rate model using single packet transmission and dynamic CCA optimized single packet transmission PST mechanism:

The terminal node packet loss rate model using the PCT mechanism optimized by the continuous transmission of multiple data packets and dynamic CCA:

Where N is the number of nodes, M is the number of retransmissions, α _c is the packet loss rate of the current node, α _b is the packet loss rate of the previous hop node, T _CCA is the time required to perform a CCA, and T _wuc is the wake-up call The time required for the request, S _MCU = _Ton + T _h + T _l + T _SIFS + T _ack is the delay required for the microcontroller MCU to successfully send data and receive ACK, λ _c is the data packet arrival rate of the current node , E[Γ _c ] is the average number of packets in the queue of the current node during busy periods,

Is the probability that the data is lost after the previous hop node performs M+1 backoff, cg _sum is the average number of CCA times the current node needs to perform PST, E[Γ _b ] is the average number of data packets in the queue of the next hop node,

Is the probability of data being lost after the next hop node performs M+1 backoffs, bg _sum is the average number of CCA times required by the next hop node to perform the dynamic CCA optimization mechanism, T _h is the time required to send the header of the data packet, T _l is the time required to send the payload of the packet,

a _0c is the average stay time of the data packet in the current node queue, When using PST mechanism:

When using the PCT mechanism:

among them,

E[D _HoLc ] is the average time required for a node to perform CCA and backoff, expressed as:

The packet loss rate model of the relay node is:

Among them, α _d is the packet loss rate of the next hop node, dg _sum is the average number of CCA times required by the previous hop node to execute the dynamic CCA optimization PST mechanism, and E[Γ _d ] is the average data packet in the queue of the previous hop node Quantity, the terminal node packet loss rate model of the PCT mechanism using multiple data packets continuous transmission and dynamic CCA optimization is:

In the PST mechanism, a _{0c is} calculated as:

In the PCT mechanism, a _{0c is} calculated as:

The packet loss rate model of the relay node under the PST mechanism is calculated as:

Where overflow is the part of the packet that has not been received, calculated as:

Similarly, the packet loss rate of nodes using the PCT mechanism is calculated as:

In the PST mechanism, a _{0c is} calculated as:

In the PCT mechanism, a _{0c is} calculated as:

The device according to claim 9, wherein the processor is specifically configured to: According to the different prediction models, the per-hop transmission delay T _t of the node is determined to be: T _t =(1-α ^M+1 )(S _WUR +S _MCU )+α ^M+1 D _WUR The energy consumption per jump is calculated as: E _t =(1-α ^M+1 )(E _WUR +E _MCU )+α ^M+1 H _WUR Where S _MCU =T _on +T _h +T _l +T _SIFS +T _ack is the delay required for the microcontroller MCU to successfully send data and receive ACK, E _MCU =E _on +E _h +E _l +E _SIFS + E _ack is the energy consumed when data is successfully sent and ACK is received, where _Ton is the delay required for the node to switch from sleep to normal working status, T _h is the time required to send the header of the data packet, and T _l is the data sent The time required for the packet payload, T _SIFS is the shortest frame interval, T _ack is the time required to receive ACK, E _on is the energy consumed by the node to switch from the sleep state to the normal working state, and E _h is the head of the packet sent Energy consumed, E _l is the energy consumed to send data packet payload, E _SIFS is the energy consumed in the idle state, and E _ack is the energy consumed to receive ACK; S _WUR is the delay required to successfully send the wake-up request, calculated as:

D _WUR is the delay required for no wake-up request due to the busy channel, and is calculated as:

E _WUR is the energy consumed when the wake-up request is sent successfully, calculated as:

H _WUR is the energy consumed by a busy channel without a wake-up request. It is calculated as:

Where I _CCA is the current of the wireless wake-up transceiver WUR when _CCA is executed, V is the supply voltage, E _wuc is the energy consumed to send the wake-up request, CW is the upper limit of the back-off time, T _BO is the back-off unit time, and E _BO is the back-off unit time Energy consumed, E _CCA is the energy consumed to execute CCA; The node data packet processing speed is calculated as:

Where λ is the data packet arrival rate of the terminal node,

It is the probability that the channel is still busy after the current node detects M+1 times, and λ _x is the data packet arrival rate of the current node. The device according to claim 9, wherein the processor is specifically configured to: When the number of queue data overflow does not reach half of the queue length or the processing speed of the second-level node in PCT-based WUR is greater than that of PST-based WUR, the continuous data packet transmission mechanism is adopted. When the queue data overflow reaches half of the queue length or PCT-based WUR When the processing speed of the second-level node is lower than the PST-based WUR, a single data packet transmission mode is adopted. A computer-readable storage medium, characterized in that, when instructions are executed on a computer device, the computer device executes the method according to any one of claims 1 to 4. A computer program product, when it runs on a computer, enables the computer to execute the method according to any one of claims 1 to 4.

Images