A multi-parameter linkage adaptive transmission method for new wireless local area networks
By dynamically adjusting the channel gain and time slots in the wireless LAN, the balance between transmission reliability and battery life of the new wireless LAN is solved, and more efficient energy management and battery life are achieved.
Patent Information
- Application Number
- CN202411156929.3
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2024-08-22
- Publication Date
- 2024-11-19
- Estimated Expiration
- 2044-08-22
AI Technical Summary
The new wireless LAN faces the challenges of complex deployment environments, variable nodes, high transmission power consumption, high battery life requirements and multi-dimensional QoS requirements, which makes the battery life of leaf nodes difficult to meet.
By mining the correlation of wireless channels, dynamically control the wireless transmission power and transmission time slots of nodes, and using channel gain prediction and slot scheduling optimization algorithms, the exclusive upload time slot and transmission power of leaf nodes are adjusted to achieve transmission reliability and network Balancing life span.
It effectively reduces the energy consumption of leaf nodes, improves the battery life of the network, and ensures transmission reliability.
Smart Images

Figure CN118695367B_ABST
Abstract
Description
Technical Field
[0001] The invention relates to the technical field of computer networks and communications, and in particular to a multi-parameter linkage adaptive transmission method for a novel wireless local area network. Background Art
[0002] In recent years, due to the continuous improvement and innovation of MEMS (Micro Electro Mechanical Systems) manufacturing technology and the miniaturization of RF devices, a number of new wireless local area network technologies represented by wireless sensor networks, wireless body area networks, high-fidelity motion tracking networks and single-soldier battlefield combat networks have developed rapidly. New wireless local area networks often face challenges such as complex and changeable deployment environments, a large number of wireless nodes with changing locations, limited transmission power consumption of wireless nodes, high overall battery life requirements for wireless networks, and multi-dimensional QoS requirements. In addition, due to the large amount of node energy consumed during transmission, the battery life of leaf nodes is difficult to meet the requirements. Summary of the invention
[0003] In view of the problems existing in the prior art, the purpose of the present invention is to provide a multi-parameter linkage adaptive transmission method, which achieves a better balance between transmission reliability and network endurance in the new wireless local area network by mining the correlation of wireless channels and dynamically controlling the wireless transmission power and transmission time slot of the node.
[0004] To achieve the above object, the present invention provides a multi-parameter linkage adaptive transmission method for a new wireless local area network, wherein the local area network includes a central node and leaf nodes, the leaf nodes are used for data collection and uploading to the central node; the central node is used to collect data from the leaf nodes and coordinate communication channel resources; the method comprises the following steps:
[0005] S1. Channel information collection; the central node continuously records the channel gain information between it and all leaf nodes in the superframe;
[0006] S2. Channel gain prediction: Based on the channel gain information of each node and the central node updated after each superframe, the central node continuously updates and calculates the time autocorrelation coefficients of all leaf nodes within the superframe range;
[0007] S3. Time slot scheduling optimization: maximize the expected sum of channel gains from all leaf nodes to the central node, providing more room for subsequent transmit power adjustment;
[0008] S4. Transmit power optimization. The channel gain prediction formula is used, and the statistical standard deviation of the channel data and the time slot scheduling sequence are included in the algorithm input to dynamically adjust the wireless transmission power of each leaf node in its exclusive upload time slot. .
[0009] Further, step S1 comprises:
[0010] S1.1. The time resource is divided into repeated superframes with equal intervals. Each superframe is divided into a configuration broadcast phase and a management access phase. The management access phase consists of an equal number of data time slots and sample time slots.
[0011] S1.2. During the management access phase, data slot resources are allocated to leaf nodes, and leaf nodes send their data packets to the central node in their exclusive data slots;
[0012] S1.3. During the configuration broadcast phase and sample time slot, all leaf nodes are in the receiving state and receive broadcast messages from the central node. After receiving the broadcast messages, the leaf nodes record the RSSI values of the messages in the order of reception.
[0013] S1.4. In the exclusive upload time slot of the management access phase, the corresponding leaf node not only uploads the collected data information, but also packages the RSSI values of all broadcast messages recorded in the previous superframe and feeds them back to the central node;
[0014] S1.5. Based on the network deployment environment and the storage and computing capabilities of the central node, the central node sets a historical superframe number threshold , earlier than The channel gain information before superframes will be deleted; based on the latest The central node uses the Pearson product-moment correlation coefficient to quantify the temporal autocorrelation coefficient of the channel gain information within a superframe.
[0015] S1.6. After the last exclusive upload time slot of each superframe, the central node updates the local channel gain data set and synchronously calculates and updates the autocorrelation coefficient of each channel to predict the data transmission packet loss rate of different time slots in the next superframe stage.
[0016] Further, in step S1.5, the Pearson product-moment correlation coefficient is used to quantify and analyze the temporal autocorrelation coefficient of the channel gain. The formula is as follows:
[0017]
[0018] in yes Channel gain value The statistical mean of The amount by which the data points in the record series are shifted to adjust the magnitude of the time lag.
[0019] Further, step S2 comprises:
[0020] S2.1. The channel gain between the central node and the leaf node is described by a Gaussian random variable (rv):
[0021]
[0022] in and are the mean and standard deviation of the channel gain, and The value is affected by the wireless network deployment environment and node topology factors;
[0023] S2.2. Channel gain between the central node and leaf node i and It remains unchanged within a certain time range, and the channel gain during this period conforms to the same probability distribution description:
[0024]
[0025] in, and Separate moments and The channel gain of
[0026] S2.3. The joint probability distribution of two channel gains recorded at different times can be expressed as:
[0027] in Indicates that the time lag is The autocorrelation coefficient when ; In addition, The conditional probability distribution of can be derived as:
[0028]
[0029] use The mathematical expectation of As The predicted value of the uplink channel gain after time is the core dependent variable of subsequent time slot scheduling and transmit power adjustment;
[0030] S2.4. Calculate the channel gain prediction value: .
[0031] Further, in step S2.4, in order to calculate the channel gain prediction value, the central node needs the following parameters: , and ; Select the latest channel gain value in the previous superframe as ; Update calculation based on historical channel gain data collected by the central node; The historical channel gain average recorded in the central node ( ) estimate, standard deviation It can also be calculated by the historical channel gain standard deviation ( ) estimation; therefore, the channel gain prediction value is recorded as .
[0032] Further, step S3 includes:
[0033] S3.1. At the beginning of each superframe, the scheduling of all exclusive upload time slots in the current superframe MAP is optimized based on the following criteria:
[0034]
[0035] in is the total number of data time slots available in the current superframe MAP, is the total number of leaf nodes that apply for exclusive upload time slots in the current network topology. It is represented as the exclusive upload time slot sequence number assigned to node i; is the floor rounding symbol; express The average channel gain prediction value of the leaf node to central node channel in the data time slot is based on the formula Estimate; Vector represents the scheduling order of all exclusive upload time slots in a MAP, so the time slot scheduling optimization problem can be equivalent to finding the optimal scheduling vector ;
[0036] S3.2. Find the optimal The process is transformed into a typical minimum cost matching problem in a bipartite graph; the bipartite graph is represented as ,in and Represent the leaf node set and data slot set respectively, represents an edge between two subsets; A leaf node in The edge length between a certain data time slot in is the channel gain prediction value of the leaf node in the data time slot;
[0037] S3.3. Using the channel gain prediction algorithm, we establish a The adjacency matrix is used to represent the bipartite graph, and the elements in the matrix are the predicted channel gain values; and Respectively represent sets and The size of the Hungarian algorithm is used to obtain the optimal time slot scheduling vector , to minimize the sum of PLRs of all channels.
[0038] Further, the optimal scheduling vector is obtained Afterwards, the optimal scheduling vector Together with the next step of transmit power adjustment information, it is added as a load in the configuration message. The configuration message is broadcast to all leaf nodes in the configuration broadcast phase of the next superframe. The leaf nodes are scheduled according to the time slot of the broadcast message and only send data messages in their corresponding exclusive upload time slots.
[0039] Furthermore, in the transmission power optimization stage, when the channel deeply fades, the message loss rate is reduced by increasing the wireless transmission power.
[0040] Furthermore, when the channel quality is high, the energy consumption of the leaf nodes can be effectively reduced by reducing the transmission power.
[0041] Furthermore, the communication between leaf nodes and central nodes only uses single-hop transmission.
[0042] Beneficial effects:
[0043] The present invention achieves a better balance between transmission reliability and network lifespan of a novel wireless local area network by mining the correlation of wireless channels and dynamically controlling the wireless transmission power and transmission time slot of a node.
[0044] The present invention focuses on dynamically adjusting the wireless transmission power and upload time slot of the leaf nodes, thereby effectively reducing the energy consumption of the leaf nodes while ensuring a certain transmission reliability, thereby achieving a longer battery life.
[0045] In the present invention, the leaf node must include channel information in the data message it uploads, and adjust the transmission power and transmission timing according to the broadcast configuration message. All other control algorithm execution and channel information storage are located in the central node, which is beneficial to improving the lifespan of energy-sensitive leaf nodes. BRIEF DESCRIPTION OF THE DRAWINGS
[0046] Figure 1 It shows a flow chart of a multi-parameter linkage adaptive transmission method for a novel wireless local area network according to the present invention;
[0047] Figure 2 A superframe structure diagram according to an embodiment of the present invention is shown;
[0048] Figure 3 A schematic diagram showing an example of a sending behavior according to an embodiment of the present invention is shown;
[0049] Figure 4 A schematic diagram of a dynamic scheduling problem according to an embodiment of the present invention is shown;
[0050] Figure 5 A matrix schematic diagram of optimal time slot scheduling according to an embodiment of the present invention is shown;
[0051] Figure 6 A schematic diagram of executing the Hungarian algorithm for optimal time slot scheduling according to an embodiment of the present invention is shown. DETAILED DESCRIPTION
[0052] The technical solution of the present invention will be described clearly and completely below in conjunction with the accompanying drawings. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present invention.
[0053] In the description of the present invention, it should be noted that the terms "center", "upper", "lower", "left", "right", "vertical", "horizontal", "inner", "outer", etc., indicating the orientation or positional relationship, are based on the orientation or positional relationship shown in the drawings, and are only for the convenience of describing the present invention and simplifying the description, rather than indicating or implying that the device or element referred to must have a specific orientation, be constructed and operated in a specific orientation, and therefore cannot be understood as limiting the present invention. In addition, the terms "first", "second", and "third" are used for descriptive purposes only, and cannot be understood as indicating or implying relative importance.
[0054] In the description of the present invention, it should be noted that, unless otherwise clearly specified and limited, the terms "installed", "connected", and "connected" should be understood in a broad sense, for example, it can be a fixed connection, a detachable connection, or an integral connection; it can be a mechanical connection or an electrical connection; it can be a direct connection, or it can be indirectly connected through an intermediate medium, or it can be the internal communication of two components. For ordinary technicians in this field, the specific meanings of the above terms in the present invention can be understood according to specific circumstances.
[0055] The following combination Figure 1-Figure 6 The specific embodiments of the present invention are described in detail. It should be understood that the specific embodiments described herein are only used to illustrate and explain the present invention, and are not used to limit the present invention.
[0056] The present invention provides a multi-parameter linkage adaptive transmission method for a new wireless local area network. The network nodes in the wireless local area network are divided into two categories: one is the leaf node, which mainly collects and uploads data to the central node; the second is the central node, which is responsible for coordinating communication channel resources and collecting data from the leaf nodes for subsequent algorithm control and data processing according to application scenario requirements. The single-hop star network topology composed of two types of nodes is the most typical network topology structure in new wireless local area networks such as wireless body area networks and wireless sensor networks.
[0057] In a specific embodiment, there is a central node and N leaf nodes, and the central node is numbered as ID=0; the leaf nodes are numbered from ID=1 to ID=n. As end nodes, the core task of the leaf nodes is to upload the collected data to the central node; the leaf node design tends to be small and easy to deploy, with limited computing power, storage resources and energy reserves; the wireless transmission power of the leaf node can be adjusted in a set of candidate power values.
[0058] The core task of the central node is to collect the data sent by the leaf nodes, and provide it for subsequent algorithm control and data processing according to the application scenario requirements; the central node has stronger computing, storage and endurance capabilities, and is responsible for coordinating and scheduling all channel resources. The central node is usually not limited by energy consumption, and its transmission power level is higher than that of the leaf node; therefore, the present invention does not consider data loss caused by poor quality of the downlink channel (from the central node to the leaf node). In the new wireless LAN, leaf nodes usually have the characteristics of miniaturization, decentralized deployment and battery power supply, so there are strict restrictions on wireless transmission power and battery life. The present invention focuses on dynamically adjusting the wireless transmission power and upload time slot of the leaf node, while ensuring a certain transmission reliability, effectively reducing the energy consumption of the leaf node, and achieving a longer battery life.
[0059] The communication between leaf nodes and central nodes only uses single-hop transmission, and does not use multi-hop transmission of relay nodes, that is, the wireless LAN is a single-hop star network.
[0060] The wireless channel from the leaf node to the central node is called the uplink channel, and the wireless channel from the central node to the leaf node is called the downlink channel. Since the central node has relatively unlimited energy resources, the successful transmission of wireless data on the downlink channel can be guaranteed by increasing the wireless transmission power. The present invention focuses on improving the data transmission success rate of the uplink channel (i.e., the transmission link from the leaf node to the central node).
[0061] The central node allocates wireless channel resources based on time division multiple access (TDMA), and the central node divides time resources into superframes with the same interval.
[0062] The central node divides the time resources into superframes with equal intervals, and each superframe is divided into the configuration broadcast phase (CBP) and the management access phase (MAP). ) is located at the beginning of the superframe. In this time slot, each leaf node is in a receiving state and receives the broadcast configuration message from the central node. The message contains the exclusive upload time slot scheduling allocation plan and the transmission power setting value of all leaf nodes in this superframe. MAP consists of m data time slots of the same length ( ) and m sample time slots ( ), each data slot is followed by a sample slot, and the length of the sample slot is significantly smaller than the length of the data slot. All data slot resources are allocated to leaf nodes as their exclusive upload slots based on time division multiple access (TDMA). Leaf nodes upload data to the central node in the transmission slots allocated to them (i.e., exclusive upload slots).
[0063] The multi-parameter linkage adaptation in the present invention refers to adjusting the two parameters of the transmission power and upload time slot of the wireless node through dynamic linkage, thereby reducing the packet loss rate caused by uplink channel attenuation and reducing the energy consumption of the leaf node to achieve a longer battery life. Dynamic adjustment of wireless transmission power means that when a leaf node uploads its data message, its wireless transmission power is not fixed. The central node uses the superframe as the control granularity and controls the wireless transmission power of the leaf node in its exclusive upload time slot by broadcasting configuration messages. Dynamic scheduling of upload time slots means that the position of the exclusive upload time slot of the leaf node in the MAP is not fixed. The central node also dynamically schedules the exclusive upload time slot of each leaf node in each superframe through configuration messages.
[0064] like Figure 1 As shown, the multi-parameter linkage adaptive transmission method for a novel wireless local area network according to the present invention includes the following four main steps:
[0065] S1. Channel information collection;
[0066] S2. Channel gain prediction;
[0067] S3. Time slot scheduling optimization;
[0068] S4. Transmit power optimization.
[0069] In the present invention, the leaf node must include channel information in the data message it uploads, and adjust the transmission power and transmission timing according to the broadcast configuration message. All other control algorithm execution and channel information storage are located in the central node, which is beneficial to improving the lifespan of energy-sensitive leaf nodes.
[0070] Among them, step S1. Channel information collection: The core purpose of collecting channel information is to allow the central node to continuously record the channel gain information between it and all leaf nodes in the superframe. ) and sample time slots ( ), the central node broadcasts the configuration message or sample message to all nodes. After the leaf node receives the message, it records the RSSI of the message ( ) value; in the next superframe MAP phase, the leaf node will package the RSSI values of the data packets received during each time slot of the previous superframe MAP in its exclusive upload time slot and feed it back to the central node. Since the central node knows its transmission power , so the channel gain value between it and each leaf node can be estimated .
[0071] According to the network deployment environment and the storage and computing capabilities of the central node, the central node records the past time period. We use the Pearson product-moment correlation coefficient to quantify the temporal autocorrelation coefficient of the channel gain.
[0072]
[0073] in, yes Channel gain values (i.e. ), The amount of movement of the data points in the record sequence is used to adjust the magnitude of the time lag.
[0074] Indicates that a total of Channel gain data valid at equal time intervals, Indicates that the wireless channel is The channel gain at time is the serial number.
[0075] Specifically, step S1 includes the following sub-steps:
[0076] S1.1. Divide the time resources into repeated superframes with the same interval. Each superframe is divided into the configuration broadcast phase (CBP) and the management access phase (MAP). The CBP phase is located at the beginning of each superframe, and the time slot length is , MAP is composed of Sample time slots of equal length (length )and Data slots (length ), each sample time slot is followed by a data time slot, and the length of the sample time slot is significantly smaller than the length of the data time slot, such as Figure 2shown.
[0077] S1.2. Data slots in the management access phase (MAP) ) resources are allocated to the leaf nodes, and the leaf nodes send their data messages to the central node during their exclusive data time slots.
[0078] S1.3. During the configuration broadcast phase ( ) and sample time slots ( ), all leaf nodes are in the receiving state, receiving broadcast messages from the central node. Configuration messages are broadcast in the management access phase, and sample messages are broadcast in the sample time slot. After receiving the broadcast message, the leaf node records the RSSI value of the message in the order of reception. In order to maintain the time uniformity of the channel gain information, .
[0079] S1.4. In the exclusive upload time slot of MAP, the corresponding leaf node not only uploads the data information it has collected, but also is responsible for recording the RSSI of all broadcast messages recorded in the previous superframe ( ) values are packaged and fed back to the central node; since it is the RSSI information of the downlink channel and the central node knows its transmission power , so the following formula can be used Estimate the channel gain value between it and each leaf node; it should be pointed out that the channel gain value Must be a negative value.
[0080] S1.5. Based on the network deployment environment and the storage and computing capabilities of the central node, the central node sets a historical superframe number threshold , earlier than The channel gain information before superframes will be deleted; based on the latest The central node uses the Pearson product-moment correlation coefficient to quantify the temporal autocorrelation coefficient of the channel gain within a superframe.
[0081]
[0082] For a single downlink channel, assuming that the central node can receive Channel gain data, corresponding to superframe, the amount of data corresponding to each channel ; yes Channel gain values (i.e. ), The amount of movement of the data points in the record sequence is used to adjust the amount of time lag. For example, if , Also corresponds to The time lag amplitude.
[0083] S1.6. After the last exclusive upload time slot of each superframe, the central node updates the local channel gain data set and synchronously calculates and updates the autocorrelation coefficient of each channel to predict the data transmission packet loss rate of different time slots in the next superframe stage.
[0084] Combination Figure 3 The example illustrates the channel information collection process. Figure 3 The wireless LAN shown in the figure has 1 central node and 3 leaf nodes, and there are 5 data time slots in the superframe MAP ( ) and 5 sample time slots ( ),Right now Assumptions They are assigned to leaf nodes 1-3 as their exclusive upload time slots. Broadcast the configuration message to the three leaf nodes. During these five time slots, the sample messages are broadcast to the three leaf nodes. After receiving the broadcast messages, the leaf nodes record the receiving RSSI values of the six messages in sequence and upload them to the central node as data message payloads in the exclusive upload time slot of the next superframe.
[0085] Step S2. Channel gain prediction: Based on the channel gain information of each node and the central node updated after each superframe, the central node continuously updates and calculates the time autocorrelation coefficients of all leaf nodes within the superframe. As a leaf node i in Channel value increase expectation for time slot ,in Indicates that leaf node i is The channel gain value at time Indicates that the time lag is The channel gain autocorrelation coefficient at is the historical channel gain mean, is the standard deviation of the historical channel gain.
[0086] Specifically, step S2 includes the following sub-steps:
[0087] S2.1. The channel gain between the central node and the leaf node is described by a Gaussian random variable (rv):
[0088]
[0089] in and are the mean and standard deviation of the channel gain, and The value is affected by factors such as the wireless network deployment environment and node topology.
[0090] S2.2. Channel gain between the central node and leaf node i and It remains unchanged within a certain time range, that is, the channel gain during this period conforms to the same probability distribution description:
[0091]
[0092] in, and Separate moments and The channel gain.
[0093] S2.3. The joint probability distribution of two channel gains recorded at different times can be expressed as:
[0094] in Indicates that the time lag is The channel gain autocorrelation coefficient at . In addition, The conditional probability distribution of can be derived as:
[0095]
[0096] use The mathematical expectation of As The predicted value of the uplink channel gain after time is the core dependent variable for subsequent time slot scheduling and transmit power adjustment.
[0097] S2.4. To calculate the channel gain prediction: , the central node requires the following parameters: , and The latest channel gain value in the previous superframe is selected as ; Update calculation based on historical channel gain data collected by the central node; The historical channel gain average recorded in the central node can be ) estimate, similarly, the standard deviation It can also be calculated by the historical channel gain standard deviation ( ) estimation. Therefore, the channel gain prediction value can be recorded as:
[0098] .
[0099] Step S3. Time slot scheduling optimization: The goal of time slot scheduling optimization is to maximize the expected sum of channel gains from all leaf nodes to the central node, providing more room for subsequent transmission power adjustment. data time slots, In a network with leaf nodes, the exclusive upload time slot scheduling scheme in MAP has a total of There are several choices, and the goal of scheduling optimization is to select an arrangement that can minimize the loss of uploaded data packets from leaf nodes to central nodes. Figure 4 As shown, , , in the last superframe period, leaf nodes 1 to 3 obtain As its exclusive upload time slot; in the current superframe; the central node has a total of 60 scheduling combinations allocate data time slots to a leaf node or set it to idle state.
[0100] Specifically, step S3 includes the following sub-steps:
[0101] S3.1. At the beginning of each superframe, the scheduling of all exclusive upload time slots in the current superframe MAP is optimized based on the following criteria:
[0102]
[0103] in is the total number of data time slots available in the current superframe MAP, is the total number of leaf nodes that apply for exclusive upload time slots in the current network topology. It is represented as the exclusive upload time slot sequence number assigned to node i, Represented as assigned to a node Exclusive upload time slot sequence number; is the floor rounding symbol; express The average channel gain prediction value of the leaf node to central node channel in the data time slot is based on the formula It should be noted that the With The variables in brackets represent slightly different absolute times. represents the scheduling order of all exclusive upload time slots in a MAP, so the time slot scheduling optimization problem can be equivalent to finding the optimal scheduling vector .
[0104] S3.2. Find the optimal The process is transformed into a typical minimum cost matching problem in a bipartite graph. The bipartite graph can be expressed as ,in and Represent the leaf node set and data slot set respectively, represents an edge between two subsets. A leaf node in The edge length between a certain data time slot in is the channel gain prediction value of the leaf node in the data time slot.
[0105] S3.3. Using the channel gain prediction algorithm, we establish a The adjacency matrix is used to represent the bipartite graph, and the elements in the matrix are the predicted channel gain values. and Respectively represent sets and The classic Hungarian algorithm (also known as the Kuhn-Munkres algorithm) is used to solve the minimum cost matching of the bipartite graph. After the last sample time slot of each superframe, the central node updates the local channel gain data set and updates the channel gain expectations of each uplink channel in the next superframe period. The adjacency matrix constructed based on these channel expectations calculates the optimal scheduling vector , the scheduling vector and the next transmission power adjustment information are added as load in the configuration message, which will be broadcast to all leaf nodes in the configuration broadcast phase (CBP) of the next superframe. The leaf nodes will send data messages only in their corresponding exclusive upload time slots according to the time slot scheduling of the broadcast message. The optimal time slot scheduling vector is obtained through the Hungarian algorithm , to minimize the sum of PLRs of all channels.
[0106] Figure 5 and Figure 6 The process of finding the lowest cost match is explained through an example. There are three leaf nodes in the network ( ), there are 5 data slots in a superframe MAP ( ). Figure 5 The unit of the values in the matrix is dBm; the coordinates The entry at Leaf nodes during time slot The channel gain prediction value to the central node. By executing the Hungarian algorithm on this matrix, the selected edges are Figure 6 The optimal time slot scheduling is to , and Assigned to , , As its exclusive upload time slot, the scheduling vector After the last sample time slot of each superframe, the central node updates the local channel gain data set and updates the channel gain expectations of each uplink channel in the next superframe period. The adjacency matrix constructed based on these channel expectations calculates the optimal scheduling vector The scheduling vector and the next transmission power adjustment information are added as loads in the configuration message. The message will be broadcast to all leaf nodes in the configuration broadcast phase (CBP) of the next superframe. The leaf nodes are scheduled according to the time slot of the broadcast message and only send data messages in their corresponding exclusive upload time slots.
[0107] Step S4. Transmit power optimization: After adopting the time slot scheduling optimization, implement the wireless transmit power dynamic adjustment strategy for each leaf node. When the channel is deeply faded, the message loss rate can be reduced by increasing the wireless transmit power; when the channel quality is high, the energy consumption of the leaf node can be effectively reduced by reducing the transmit power, thereby improving the node lifespan.
[0108] The power threshold for the central node to receive wireless messages is , that is, when The key to optimizing the transmission power is to dynamically adjust the wireless transmission power of each leaf node in its exclusive upload time slot. The present invention adopts the channel gain prediction formula and incorporates the statistical standard deviation of the channel data and the time slot scheduling sequence into the algorithm input to dynamically adjust the wireless transmission power of each leaf node in its exclusive upload time slot. .
[0109] In a superframe, the leaf node will switch between the following three states. The first is the wireless receiving state, which is entered to receive broadcast messages from the central node, namely the configuration message in the CBP phase and the sample message in the sample time slot; the second is in the exclusive upload time slot of a leaf node, the leaf node enters the wireless transmission state, sends data messages to the central node at the specified transmission power, and attaches the channel RSSI information collected in the previous superframe; the third category is the sleep state, in other superframe times except for the above-mentioned CBP, sample time slot and exclusive upload time slot, the leaf node enters the sleep state to reduce energy consumption and extend battery life.
[0110] Figure 4 The example not only illustrates the dynamic scheduling of time slots, but also the dynamic adjustment of transmit power. Assume that there are 5 levels of transmit power available for leaf nodes. In the last superframe period, leaf nodes 1 to 3 will and As for the wireless transmission power in the exclusive upload time slot, the problem to be solved by dynamic power adjustment is: to which gear should the three nodes adjust the transmission power in the exclusive upload time slot of the next superframe to minimize the energy consumption of the leaf nodes and ensure the data packet arrival rate required by the application.
[0111] Specifically, step S4 includes the following sub-steps:
[0112] S4.1. Define the adjustable transmission power range of the leaf node as a discrete array of size v Then the transmission power of leaf node i in the next exclusive upload time slot is Determined by the following formula:
[0113]
[0114] The core of the above formula is the discrete array of transmit power. Select one of the minimum values, that is , so that it satisfies the value of the inequality in the braces; It is the receiving power threshold of the central node. When the receiving power of the wireless message is less than the threshold, the data message is lost; is the channel gain prediction value, The value of should be based on the result of dynamic time slot scheduling to select the corresponding delay value; It is a reserved compensation amount that can be modified according to the application characteristics. Its function is to increase the transmission power value to a certain extent and reduce the data loss caused by too low transmission power.
[0115] S4.2. Leaf Node Compensation Calculated by the following formula:
[0116] in, For leaf nodes The standard deviation of historical channel gain data; It is represented as the exclusive upload time slot sequence number assigned to leaf node i in the next superframe, The value is always less than the total number of data slots available in the superframe; and These are two modifiable constants. If the application scenario has high requirements for data transmission reliability, you can increase and On the contrary, if the leaf node life is high, it can be reduced and .
[0117] Use the standard deviation of the gain data The reason for using the first multiplication parameter of the compensation amount is that the larger the standard deviation, the greater the fluctuation of the channel gain. A larger transmit power compensation amount should be used to increase the transmit power and eliminate the data loss caused by channel attenuation. In addition, The compensation calculation formula also uses As The multiplication factor is because The larger the delay coefficient is, the The larger the value, the lower the prediction accuracy will be. This can be compensated by appropriately increasing the transmit power.
[0118] Any process or method description in the flowchart of the present invention or described in other ways herein can be understood as a module, segment or part of a code including one or more executable instructions for implementing the steps of a specific logical function or process, which can be implemented in any computer-readable medium for use by an instruction execution system, device or equipment, and the computer-readable medium can be any medium containing storage, communication, propagation or transmission programs for use by execution systems, devices or equipment, including read-only memories, magnetic disks or optical disks, etc.
[0119] In the description of this specification, the description with reference to the terms "embodiment", "example", etc. means that the specific features, structures, materials or characteristics described in conjunction with the embodiment or example are included in at least one embodiment or example of the present invention. In this specification, the schematic representations of the above terms do not necessarily refer to the same embodiment or example. In addition, those skilled in the art can combine or combine different embodiments or examples described in this specification and the features therein without causing any contradiction.
[0120] Although the above content has shown and described the embodiments of the present invention, it can be understood that the above embodiments are exemplary and cannot be understood as limitations of the present invention. Ordinary technicians in the field can change, modify, replace, modify and other update operations on the above embodiments within the scope of the present invention.
Claims
1. A multi-parameter linkage adaptive transmission method for new wireless local area networks, It is characterized in that The local area network includes a central node and leaf nodes. The leaf nodes are used to collect data and upload it to the central node. The central node is used to collect data from the leaf nodes and coordinate communication channel resources. The method includes the following steps: S1. Channel information collection; the central node continuously records the channel gain information between it and all leaf nodes in the superframe; S2. Channel gain prediction: Based on the channel gain information of each node and the central node updated after each superframe, the central node continuously updates and calculates the time autocorrelation coefficients of all leaf nodes within the superframe range; S3. Time slot scheduling optimization: maximize the expected sum of channel gains from all leaf nodes to the central node, providing more room for subsequent transmit power adjustment; S4. Transmit power optimization: using the channel gain prediction value, and incorporating the statistical standard deviation of the channel data and the time slot scheduling sequence into the algorithm input, dynamically adjust the wireless transmit power of each leaf node in its exclusive upload time slot ; Step S1 includes: S1.
1. The time resource is divided into repeated superframes with equal intervals. Each superframe is divided into a configuration broadcast phase and a management access phase. The management access phase consists of an equal number of data time slots and sample time slots. S1.
2. During the management access phase, data slot resources are allocated to leaf nodes, and leaf nodes send their data packets to the central node in their exclusive data slots; S1.
3. During the configuration broadcast phase and sample time slot, all leaf nodes are in the receiving state and receive broadcast messages from the central node. After receiving the broadcast messages, the leaf nodes record the RSSI values of the messages in the order of reception. S1.
4. In the exclusive upload time slot of the management access phase, the corresponding leaf node not only uploads the collected data information, but also packages the RSSI values of all broadcast messages recorded in the previous superframe and feeds them back to the central node; S1.
5. Based on the network deployment environment and the storage and computing capabilities of the central node, the central node sets a historical superframe number threshold , earlier than The channel gain information before superframes will be deleted; based on the latest The central node uses the Pearson product-moment correlation coefficient to quantify the temporal autocorrelation coefficient of the channel gain information within a superframe. S1.
6. After the last exclusive upload time slot of each superframe, the central node updates the local channel gain data set and synchronously calculates and updates the autocorrelation coefficient of each channel to predict the data transmission packet loss rate of different time slots in the next superframe stage.
2. According to claim 1, a multi-parameter linkage adaptive transmission method for a new wireless local area network, It is characterized in that In step S1.5, the Pearson product-moment correlation coefficient is used to quantify the temporal autocorrelation coefficient of the channel gain. The formula is as follows: in yes Channel gain value The statistical mean of The moving amplitude of the data points in the recording sequence is used to adjust the amplitude of the time lag. w means that a total of w valid channel gain data with equal time intervals are recorded. Indicates that the wireless channel is The channel gain at time.
3. According to claim 1, a multi-parameter linkage adaptive transmission method for a new wireless local area network, It is characterized in that Step S2 includes: S2.
1. The channel gain between the central node and the leaf node is described by a Gaussian random variable: in and are the mean and standard deviation of the channel gain, and The value is affected by the wireless network deployment environment and node topology factors; S2.
2. Channel gain between the central node and leaf node i and It remains unchanged within a certain time range, and the channel gain during this period conforms to the same probability distribution description: in, and Separate moments and The channel gain of S2.
3. The joint probability distribution of two channel gains recorded at different times is expressed as: in The time lag is The autocorrelation coefficient when ; In addition, The conditional probability distribution of is derived as: use The mathematical expectation of As The predicted value of the uplink channel gain after time is the core dependent variable of subsequent time slot scheduling and transmit power adjustment; S2.
4. Calculate the channel gain prediction value: .
4. The multi-parameter linkage adaptive transmission method for a novel wireless local area network according to claim 3, It is characterized in that In step S2.4, in order to calculate the channel gain prediction value, the central node needs the following parameters: , and ; The latest channel gain value in the previous superframe is selected as ; Update calculation based on historical channel gain data collected by the central node; The historical channel gain average recorded in the central node Estimate, standard deviation By historical channel gain standard deviation Estimate; therefore, the channel gain prediction value is recorded as: 。 5. According to claim 4, a multi-parameter linkage adaptive transmission method for a new wireless local area network, It is characterized in that Step S3 includes: S3.
1. At the beginning of each superframe, the scheduling of all exclusive upload time slots in the current superframe MAP is optimized based on the following criteria: in is the total number of data time slots available in the current superframe MAP, is the total number of leaf nodes that apply for exclusive upload time slots in the current network topology. It is represented as the exclusive upload time slot sequence number assigned to node i; is the floor rounding symbol; express The predicted value of the average channel gain from the leaf node to the central node in the data time slot is estimated based on the following formula: ; vector represents the scheduling order of all exclusive upload time slots in a MAP, so the time slot scheduling optimization problem is equivalent to finding the optimal time slot scheduling vector ; S3.
2. Find the optimal time slot scheduling vector The process is transformed into a typical minimum cost matching problem in a bipartite graph; the bipartite graph is represented as ,in and Represent the leaf node set and data slot set respectively, represents an edge between two subsets; A leaf node in The edge length between a certain data time slot in is the channel gain prediction value of the leaf node in the data time slot; S3.
3. Using the channel gain prediction algorithm, we establish a The adjacency matrix is used to represent the bipartite graph, and the elements in the matrix are the predicted channel gain values; and Respectively represent sets and The size of the Hungarian algorithm is used to obtain the optimal time slot scheduling vector , to minimize the sum of PLRs of all channels.
6. A multi-parameter linkage adaptive transmission method for a novel wireless local area network according to claim 5, It is characterized in that Get the optimal time slot scheduling vector Then, the optimal time slot scheduling vector Together with the next step of transmit power adjustment information, it is added as a load in the configuration message. The configuration message is broadcast to all leaf nodes in the configuration broadcast phase of the next superframe. The leaf nodes are scheduled according to the time slot of the broadcast message and only send data messages in their corresponding exclusive upload time slots.
7. The multi-parameter linkage adaptive transmission method for a novel wireless local area network according to claim 1, It is characterized in that During the transmission power optimization phase, when the channel deeply fades, the message loss rate is reduced by increasing the wireless transmission power.
8. The multi-parameter linkage adaptive transmission method for a novel wireless local area network according to claim 7, It is characterized in that When the channel quality is high, the energy consumption of leaf nodes can be effectively reduced by reducing the transmission power.
9. A multi-parameter linkage adaptive transmission method for a novel wireless local area network according to any one of claims 1 to 8, It is characterized in that The communication between leaf nodes and central nodes only uses single-hop transmission.
