CN110996392B - Channel access control method and device and electronic equipment - Google Patents
Channel access control method and device and electronic equipment Download PDFInfo
- Publication number
- CN110996392B CN110996392B CN201911176723.6A CN201911176723A CN110996392B CN 110996392 B CN110996392 B CN 110996392B CN 201911176723 A CN201911176723 A CN 201911176723A CN 110996392 B CN110996392 B CN 110996392B
- Authority
- CN
- China
- Prior art keywords
- node
- group
- time slot
- accessible
- determines
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/04—Wireless resource allocation
- H04W72/044—Wireless resource allocation based on the type of the allocated resource
- H04W72/0446—Resources in time domain, e.g. slots or frames
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W74/00—Wireless channel access, e.g. scheduled or random access
- H04W74/08—Non-scheduled or contention based access, e.g. random access, ALOHA, CSMA [Carrier Sense Multiple Access]
- H04W74/0833—Non-scheduled or contention based access, e.g. random access, ALOHA, CSMA [Carrier Sense Multiple Access] using a random access procedure
- H04W74/0841—Non-scheduled or contention based access, e.g. random access, ALOHA, CSMA [Carrier Sense Multiple Access] using a random access procedure with collision treatment
- H04W74/085—Non-scheduled or contention based access, e.g. random access, ALOHA, CSMA [Carrier Sense Multiple Access] using a random access procedure with collision treatment collision avoidance
Abstract
The invention relates to a channel access control method, a device and an electronic device, wherein a management node is used for grouping node sets in a network to obtain a group set, and a time slot corresponding to each group of the group set is determined; the management node determines a priority node set from the node sets based on the load value of each node in the network; the management node determines a total load value corresponding to each group based on the load value of each node in each group to obtain a total load value set, determines an accessible group based on the total load value set, and determines a time slot corresponding to the accessible group as an accessible time slot; the nodes of the priority node set access channels in the accessible time slots; thus, the nodes of the priority node set have a cross-time slot function, so that the flexibility of the nodes can be improved, and the throughput of the network is improved.
Description
Technical Field
The present invention relates to the field of communications technologies, and in particular, to a method and an apparatus for controlling channel access, and an electronic device.
Background
The medium access control (Medium Access Control, MAC) protocol determines the access manner of the wireless channel and is a key network protocol for guaranteeing wireless network communication. The MAC protocol can be classified into a fixed allocation channel scheme and a random contention channel scheme: contention-based MAC protocols, scheduling-based MAC protocols, and hybrid protocols. Among them, the contention-based MAC protocol is represented by a carrier sense multiple access protocol with collision avoidance (Carrier Sense Multiple Access/Collision Avoidance, CSMA/CA); the scheduling-based MAC protocols are represented by time division multiple access protocols (Time Division Multiple Address, TDMA) and frequency division multiple access (Frequence Division Multiple Access, FDMA).
The CSMA/CA protocol has the advantages of multiplexing resources and high flexibility; however, as the nodes are densely deployed and the total number of nodes in the network increases, the mutual interference among the nodes increases greatly, the retransmission probability of the packet increases greatly, and thus the throughput of the system is limited. The TDMA protocol nodes have no interference with each other and have stable performance; however, the method has the defects of insufficient expandability, incapability of multiplexing resources and capability of transmitting only one node at the same time. Thus, combining the advantages and disadvantages of both, the current hybrid protocols based on CSMA/CA and TDMA result. Firstly, grouping nodes according to a certain grouping scheme, transmitting each group corresponding to different time slots, competing the nodes of the same group in the same time slot according to a CSMA/CA mechanism, and uniformly dividing the grouping of the nodes into each time slot according to numbers in an 802.11ah protocol. I.e. the competition mechanism of CSMA/CA is used in the group, and the TDMA access mode is adopted between the groups. On one hand, the mixed protocol disperses node competition to each group, so that the defect of high retransmission probability of the CSMA/CA protocol in a dense deployment environment can be relieved; on the other hand, the method can realize resource multiplexing relative to the TDMA, and improves the channel utilization rate.
However, the hybrid protocols based on CSMA/CA and TDMA have the disadvantages that, on the one hand, each node can only transmit in a given time slot, the node has no function of crossing time slots, and the flexibility is poor; on the other hand, the size of the contention window of the nodes in the group is to be optimized, and the network throughput is limited when the backoff waiting time is too long under the condition that the retransmission probability after the grouping is reduced.
Disclosure of Invention
The embodiment of the invention provides a channel access control method and a device, which can improve the flexibility of nodes in a network and the throughput of the network.
In one aspect, an embodiment of the present invention provides a channel access control method, including:
the management node groups node sets in the network to obtain a group set; each group in the set of groups includes at least one node;
the management node determines a time slot corresponding to each group of the group set; the nodes of each group access the channel in the corresponding time slot;
the management node determines a priority node set from the node sets based on the load value of each node in the network;
the management node determines a load total value corresponding to each group based on the load value of each node in each group to obtain a load total value set; the load total value of the load total value set corresponds to the group of the group set one by one;
the management node determines an accessible group based on the load total value set, and determines a time slot corresponding to the accessible group as an accessible time slot; the nodes of the priority node set access channels in the accessible time slots;
the management node sends a control frame to each node in the node set, wherein the control frame comprises a group set, a time slot corresponding to each group of the group set, a priority node set and an accessible time slot.
In another aspect, an embodiment of the present invention provides a channel access control method, including:
the current node receives a control frame, wherein the control frame comprises a group set, time slots corresponding to each group of the group set, a priority node set and an accessible time slot; the priority node set comprises a current node;
when the current time belongs to an accessible time slot or a time slot corresponding to a group to which the current node belongs, the current node performs competition based on a carrier sense multiple access mechanism with collision avoidance so as to access a channel;
the current node sends the load value and the location information to the management node.
In another aspect, an embodiment of the present invention provides a channel access control apparatus, including:
the grouping module is used for grouping the node sets in the network by the management node to obtain a group set; each group in the set of groups includes at least one node;
a first determining module, configured to determine, by a management node, a time slot corresponding to each group of the group set; the nodes of each group access the channel in the corresponding time slot;
the second determining module is used for determining a priority node set from the node sets by the management node based on the load value of each node in the network;
the third determining module is used for determining a total load value corresponding to each group based on the load value of each node in each group by the management node to obtain a total load value set; the load total value of the load total value set corresponds to the group of the group set one by one;
a fourth determining module, configured to determine, by the management node, an accessible group based on the total load value set, and determine a time slot corresponding to the accessible group as an accessible time slot; the nodes of the priority node set access channels in the accessible time slots;
and the sending module is used for sending a control frame to each node in the node set by the management node, wherein the control frame comprises a group set, a time slot corresponding to each group of the group set, a priority node set and an accessible time slot.
In another aspect, an embodiment of the present invention provides a channel access control apparatus, including:
the receiving module is used for receiving a control frame by the current node, wherein the control frame comprises a group set, time slots corresponding to each group of the group set, a priority node set and accessible time slots; the priority node set comprises a current node;
a determining module, configured to, when determining that the current time belongs to an accessible time slot or a time slot corresponding to a group to which the current node belongs, perform contention for access to a channel by the current node based on a carrier sense multiple access mechanism with collision avoidance;
and the sending module is used for sending the load value and the position information to the management node by the current node.
In another aspect, an embodiment of the present invention provides an electronic device, where the device includes a processor and a memory, and the memory stores at least one instruction, at least one section of program, a code set, or an instruction set, where the at least one instruction, the at least one section of program, the code set, or the instruction set is loaded by the processor and executes a channel access control method described above.
The channel access control method, the device and the electronic equipment provided by the embodiment of the invention have the following beneficial effects:
grouping node sets in a network through a management node to obtain a group set, and determining a time slot corresponding to each group of the group set; the management node determines a priority node set from the node sets based on the load value of each node in the network; the management node determines a total load value corresponding to each group based on the load value of each node in each group to obtain a total load value set, determines an accessible group based on the total load value set, and determines a time slot corresponding to the accessible group as an accessible time slot; the nodes of the priority node set access channels in the accessible time slots; thus, the nodes of the priority node set have a cross-time slot function, so that the flexibility of the nodes can be improved, and the throughput of the network is improved.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings required for the description of the embodiments will be briefly described below, and it is apparent that the drawings in the following description are only some embodiments of the present invention, and other drawings may be obtained according to these drawings without inventive effort for a person skilled in the art.
FIG. 1 is a schematic diagram of a network architecture according to an embodiment of the present invention;
fig. 2 is a schematic flow chart of a channel access control method according to an embodiment of the present invention;
fig. 3 is a schematic flow chart of a channel access control method according to an embodiment of the present invention;
fig. 4 is a schematic diagram of accessing a channel by using a CSMA/CA contention mechanism according to an embodiment of the present invention;
fig. 5 is a schematic diagram of a frame structure in a channel access control method according to an embodiment of the present invention;
FIG. 6 is a graph comparing network throughput under different protocols provided by an embodiment of the present invention;
FIG. 7 is a graph showing average delay versus time under different protocols according to an embodiment of the present invention;
fig. 8 is a schematic structural diagram of a channel access control device according to an embodiment of the present invention;
fig. 9 is a schematic structural diagram of a channel access control device according to an embodiment of the present invention.
Detailed Description
The following description of the embodiments of the present invention will be made clearly and completely with reference to the accompanying drawings, in which it is apparent that the embodiments described are only some embodiments of the present invention, but not all embodiments. All other embodiments, which can be made by those skilled in the art based on the embodiments of the invention without making any inventive effort, are intended to be within the scope of the invention.
It should be noted that the terms "first," "second," and the like in the description and the claims of the present invention and the above figures are used for distinguishing between similar objects and not necessarily for describing a particular sequential or chronological order. It is to be understood that the data so used may be interchanged where appropriate such that the embodiments of the invention described herein may be implemented in sequences other than those illustrated or otherwise described herein. Furthermore, the terms "comprises," "comprising," and "having," and any variations thereof, are intended to cover a non-exclusive inclusion, such that a process, method, system, article, or server that comprises a list of steps or elements is not necessarily limited to those steps or elements expressly listed or inherent to such process, method, article, or apparatus, but may include other steps or elements not expressly listed or inherent to such process, method, article, or apparatus.
Referring to fig. 1, fig. 1 is a schematic structural diagram of a network architecture according to an embodiment of the present invention, which includes a management node 101 and a plurality of nodes 102, where the plurality of nodes 102 may perform wireless communication. The plurality of nodes 102 access the wireless channel based on the MAC protocol.
In the invention, a management node 101 groups node sets in a network to obtain a group set; each group in the set of groups includes at least one node 102; the management node 101 determines the time slots corresponding to each group of the set of groups in which the node 102 of each group accesses the channel. The management node 101 determines a priority node set from the node sets based on the load value of each node 102 in the network, and the nodes 102 of the priority node set have a cross-slot function. The management node 101 determines a total load value corresponding to each group based on the load value of each node 102 in each group, and obtains a total load value set, where the total load value of the total load value set corresponds to the group of the group set one to one. The management node 101 determines an accessible group based on the load total value set, and determines a slot corresponding to the accessible group as an accessible slot. In this way, the nodes 102 of the priority node set can access channels in accessible time slots in addition to channels in time slots corresponding to the belonging group. The management node 101 sends a control frame to each node 102 in the set of nodes, the control frame including a set of groups, a time slot corresponding to each group of the set of groups, a set of priority nodes, and an accessible time slot. If the node 102 determines that the set of priority nodes includes the current node 102 according to the received control frame, when it is determined that the current time belongs to an accessible time slot or a time slot corresponding to a group to which the current node 102 belongs, the current node 102 performs contention based on a carrier sense multiple access mechanism with collision avoidance (CSMA/CA) to access a channel. The current node 102 also transmits the load value and the location information to the management node 101.
Alternatively, the network may be a wireless sensor network, and the node 102 may be a wireless sensor node in the wireless sensor network, where the wireless sensor node is configured to collect environmental information within a coverage area of the network, and upload the collected environmental information to the management node 102 for use by a user.
In the following, a specific embodiment of a channel access control method according to the present invention is described, and fig. 2 is a schematic flow chart of a channel access control method according to an embodiment of the present invention, and the present specification provides method operation steps as an example or a flowchart, but may include more or fewer operation steps based on conventional or non-inventive labor. The order of steps recited in the embodiments is merely one way of performing the order of steps and does not represent a unique order of execution. When implemented in a real system or server product, the methods illustrated in the embodiments or figures may be performed sequentially or in parallel (e.g., in a parallel processor or multithreaded environment). As shown in fig. 2, the method may include:
s201: the management node groups node sets in the network to obtain a group set; each group in the set of groups includes at least one node.
S203: the management node determines a time slot corresponding to each group of the group set; the nodes of each group access the channel in corresponding time slots.
In the embodiment of the invention, the management node groups the node sets in the network, all the nodes in the network are distributed to the corresponding groups, the management node gives the time slot corresponding to each group, and the nodes of the groups can access the network channel in the corresponding time slots.
S205: the management node determines a set of priority nodes from the set of nodes based on a load value of each node in the network.
In the embodiment of the invention, a management node determines a load value with the largest value according to the load value of each node in a network, and the management node determines a node corresponding to the load value which is larger than the load value with the largest value by a preset multiple as a priority node to obtain a priority node set; wherein the preset multiple is a positive number less than 1. For example, assuming that there are 15 nodes in the node set in the network, the management node equally divides the 15 nodes into 3 groups according to the number sequence: the node number sequences in the first group are 1, 2, 3, 4 and 5; the node number sequences in the second group are 6, 7, 8, 9 and 10; the node number sequences in the third group are 11, 12, 13, 14, 15. The 5 nodes in each group access the channel in corresponding time slots. The management node determines a set of priority nodes from the 15 nodes. The management node is assumed to determine that the load value corresponding to the node with the number sequence of 11 is maximum, and the preset multiple is 0.8 on the assumption that the value of the maximum load value is 100. And the management node determines the node corresponding to the load value with the value larger than 80 as the priority node, and the obtained priority node set.
S207: the management node determines a load total value corresponding to each group based on the load value of each node in each group to obtain a load total value set; the load total value of the load total value set corresponds one-to-one to the group of the group set.
In the embodiment of the invention, the management node sums the load values of each node in each group, so as to determine the total load value corresponding to each group and obtain a total load value set. The groups of the group set correspond to the load total values of one load total value set. For example, in the above example, the total load value corresponding to the first group is the sum of the load values corresponding to the node number sequences 1, 2, 3, 4, and 5.
S209: the management node determines an accessible group based on the load total value set, and determines a time slot corresponding to the accessible group as an accessible time slot; the nodes of the priority node set access the channel in an accessible time slot.
In the embodiment of the invention, a management node converts each load total value of a load total value set into processing time length; the management node determines the processing time length corresponding to each group of the group set, wherein the processing time length is the total transmission time needed by the total load value of the group. If the processing time length corresponding to the group is smaller than the time slot corresponding to the group, the management node determines the group as an accessible group and determines the time slot of the group as an accessible time slot.
For example, for a certain group G (k), the management node first determines the total load value of the group and converts it into a corresponding processing duration forAnd (3) representing, wherein i represents the number sequence of the node. If the processing duration corresponding to the group and the time slot corresponding to the group satisfy the formula (1), the management node determines G (k) as an accessible group and determines the time slot of the group as an accessible time slot.
Wherein, the liquid crystal display device comprises a liquid crystal display device,representing the processing duration of group G (k); beta represents a constant; t (T) D(k) The slot length corresponding to group G (k) is indicated.
S211: the management node sends a control frame to each node in the node set, wherein the control frame comprises a group set, a time slot corresponding to each group of the group set, a priority node set and an accessible time slot.
In the embodiment of the invention, the management node sends a control frame to all nodes in the network every time a period of time passes, wherein the control frame comprises the group set determined by the management node, a time slot corresponding to each group of the group set, a priority node set and an accessible time slot.
S213: the current node receives the control frame and the set of priority nodes includes the current node.
S215: the current node determines whether the current time belongs to an accessible time slot or a time slot corresponding to a group to which the current node belongs. If the current node determines that the current time belongs to an accessible time slot or a time slot corresponding to the group to which the current node belongs, the step S217 is performed; otherwise, the current node enters a waiting state to wait for an accessible time slot or a time slot corresponding to the group to which the current node belongs.
In which, the current node enters a waiting state to wait for an accessible time slot or a time slot corresponding to the group to which the current node belongs, refer to fig. 3.
In the embodiment of the invention, the description is given on the premise that the current node is a priority node determined by the management node. Thus, the current node may access the channel in an accessible time slot and a time slot corresponding to the belonging group. If the current node determines that the current time does not belong to the accessible time slot and also does not belong to the time slot corresponding to the group to which the current node belongs, the current node enters a waiting state, and other nodes are prevented from being interfered.
S217: the current node contends to access the channel based on a carrier sense multiple access mechanism with collision avoidance.
In the embodiment of the invention, if the current node determines that the current time belongs to an accessible time slot, the current node, other nodes in the priority node set and the nodes of the accessible group compete based on a CSMA/CA mechanism; if the current node determines that the current time belongs to the time slot corresponding to the belonging group, the current node and other nodes in the belonging group compete based on a CSMA/CA mechanism.
In an alternative embodiment in which the current node performs contention for access to the channel based on the carrier sense multiple access mechanism with collision avoidance, referring to fig. 4, fig. 4 is a schematic diagram of access to the channel with the CSMA/CA contention mechanism according to an embodiment of the present invention. The current node listens to the state of the channel, which includes free and busy; if the current node listens to the channel in the first preset time is idle, the current node successfully competes after the initial back-off time. The current node sends a Request To Send (RTS) frame To the receiving node, and occupies the channel, and updates the state of the channel To busy. The current node transmits data To the receiving node via a short inter-frame space (Short interframe space, SIFS) after receiving an Clear To Send (CTS) frame transmitted by the receiving node. The first preset time may be a distributed inter-frame gap (Distributed Inter-frame Spacing, DIFS).
Alternatively, the initial back-off time may be determined according to a contention window function.
In the embodiment of the invention, after the current node sends data to the receiving node, the current node determines that the data is successfully sent according to an acknowledgement frame (ACK) returned by the receiving node. Otherwise, the current node determines that the transmission fails, and determines the data as data to be retransmitted.
In the implementation of the invention, the receiving node determines whether to send the acknowledgement frame to the current node according to the signal-to-noise value. Specifically, the receiving node determines a signal-to-noise ratio value based on the noise value of the receiving node, the ambient noise value, and the noise value between the receiving node and the current node using SNR Nj The expression Nj denotes a receiving node. Wherein the noise value between the receiving node and the current node is determined based on the location information of the receiving node and the location information of the current node. If the signal to noise ratio value SNR Nj And a preset signal to noise ratio value E th3 And (3) satisfying the formula (2), the receiving node transmits an acknowledgement frame to the current node.
SNR Nj >E th3 ……(2)
An alternative receiving node may determine the signal-to-noise value from the noise value of the receiving node, the ambient noise value, and the noise value between the receiving node and the current node according to equation (3):
wherein E is i,j Representing receptionNoise value between the node and the current node; e (E) T Representing an ambient noise value; e (E) H Representing the noise value of the receiving node.
In the embodiment of the invention, if the current node does not receive the acknowledgement frame within the second preset time, the current node determines that the transmission fails. The current node updates the initial backoff time and re-contends. After the updated back-off time, the contention is successful, the current node again transmits a request frame to the receiving node, and transmits data to be retransmitted according to an allowed frame returned by the receiving node.
An alternative current node updates the initial back-off time by doubling the initial back-off time as the updated back-off time. And after each time the current node determines that the transmission fails, doubling the back-off time based on the last update, and not doubling the back-off time until the back-off time reaches a threshold value.
In the embodiment of the invention, if the current node determines that the current time does not belong to the accessible time slot and does not belong to the time slot corresponding to the group to which the current node belongs, the current node restores the updated back-off time to the initial back-off time. Therefore, the current node can avoid the waste of time slots caused by overlong back-off time due to multiple transmission failures, and can improve the network throughput.
In the embodiment of the present invention, the current node often has a plurality of data packets. After the competition of the current node is successful, the data packet with the minimum current residual time delay needs to be selected for transmission. The data packet with the smallest residual delay is the data packet with the fastest expiration. The time for the current node to transmit a complete packet can be denoted as T ACK +T L(i) The method comprises the steps of carrying out a first treatment on the surface of the Wherein T is L(i) Representing the time of transmitting the data packet by the current node; t (T) ACK The occupation time of the redundant frame (ack+sifs+difs) is represented.
Because of the transmission mode of time slots, the current node needs to ensure that the remaining time slot length of the group to which the current node belongs can transmit one data packet, that is, the remaining time slot length of the group to which the current node belongs and the time when the current node transmits one data packet need to satisfy the formula (4):
T ACK +T L(i) <T Remaing ……(4)
wherein T is Remaing Indicating the length of the remaining time slots of the group to which the current node belongs.
In addition, the remaining delay of the data packet and the time of transmitting the data packet by the current node need to satisfy equation (5):
T ACK +T L(i) <T DelayRemaing ……(5)
if the data packet satisfying the formula (4) and the formula (5) does not exist in the current node, the current node restarts the contention.
S219: the current node sends the load value and the location information to the management node.
In the embodiment of the present invention, referring to fig. 5, fig. 5 is a schematic diagram of a frame structure in a channel access control method according to the embodiment of the present invention. And a reporting time slot is reserved at the end part of each frame, and the current node uploads the load capacity and the position information to the management node in the time slot. The reporting transmission of the nodes is in a TDMA mode, and the nodes cannot interfere with each other.
In the embodiment of the invention, the CSMA/CA, TDMA, CSMA/CA and TDMA Hybrid and the method (P-Hybrid) provided by the invention are subjected to simulation verification. The configuration parameters may be referred to in table 1.
Table 1: parameter configuration
Referring to fig. 6 and fig. 7, fig. 6 is a graph showing a comparison of network throughput under different protocols according to the embodiment of the present invention, and fig. 7 is a graph showing an average delay under different protocols according to the embodiment of the present invention. It can be seen that the method provided by the embodiment of the invention has the best network throughput performance, and the average time delay is reduced greatly compared with Hybrid.
The embodiment of the invention also provides a channel access control device, and fig. 8 is a schematic structural diagram of the channel access control device provided by the embodiment of the invention, as shown in fig. 8, the device includes:
a grouping module 801, configured to group a node set in a network by a management node to obtain a group set; each group in the set of groups includes at least one node;
a first determining module 802, configured to determine, by the management node, a time slot corresponding to each group of the group set; the nodes of each group access the channel in the corresponding time slot;
a second determining module 803, configured to determine, by the management node, a priority node set from the node sets based on a load value of each node in the network;
a third determining module 804, configured to determine, by the management node, a total load value corresponding to each group based on a load value of each node in each group, to obtain a total load value set; the load total value of the load total value set corresponds to the group of the group set one by one;
a fourth determining module 805, configured to determine, by the management node, an accessible group based on the total load value set, and determine a time slot corresponding to the accessible group as an accessible time slot; the nodes of the priority node set access channels in the accessible time slots;
a sending module 806, configured to send, by the management node, a control frame to each node in the node set, where the control frame includes a group set, a time slot corresponding to each group of the group set, a priority node set, and an accessible time slot.
The apparatus and method embodiments in the embodiments of the present invention are based on the same inventive concept.
The embodiment of the invention also provides a channel access control device, and fig. 9 is a schematic structural diagram of the channel access control device provided by the embodiment of the invention, as shown in fig. 9, the device includes:
a receiving module 901, configured to receive a control frame by a current node, where the control frame includes a group set, a time slot corresponding to each group of the group set, a priority node set, and an accessible time slot; the priority node set comprises a current node;
a determining module 902, configured to, when it is determined that the current time belongs to an accessible time slot or a time slot corresponding to a group to which the current node belongs, perform contention for accessing a channel by the current node based on a carrier sense multiple access mechanism with collision avoidance;
the sending module 903 is configured to send the load value and the location information to the management node by using the current node.
The apparatus and method embodiments in the embodiments of the present invention are based on the same inventive concept.
The embodiment of the invention also provides electronic equipment, which comprises a processor and a memory, wherein at least one instruction, at least one section of program, a code set or an instruction set is stored in the memory, and the at least one instruction, the at least one section of program, the code set or the instruction set is loaded by the processor and executes the channel access control method.
The embodiments of the channel access control method, the device and the electronic equipment provided by the invention can be seen that in the invention, the node sets in the network are grouped by the management node to obtain a group set, and the time slot corresponding to each group of the group set is determined; the management node determines a priority node set from the node sets based on the load value of each node in the network; the management node determines a total load value corresponding to each group based on the load value of each node in each group to obtain a total load value set, determines an accessible group based on the total load value set, and determines a time slot corresponding to the accessible group as an accessible time slot; the nodes of the priority node set access channels in the accessible time slots; thus, the nodes of the priority node set have a cross-time slot function, so that the flexibility of the nodes can be improved, and the throughput of the network is improved.
It should be noted that: the sequence of the embodiments of the present invention is only for description, and does not represent the advantages and disadvantages of the embodiments. And the foregoing description has been directed to specific embodiments of this specification. Other embodiments are within the scope of the following claims. In some cases, the actions or steps recited in the claims can be performed in a different order than in the embodiments and still achieve desirable results. In addition, the processes depicted in the accompanying figures do not necessarily require the particular order shown, or sequential order, to achieve desirable results. In some embodiments, multitasking and parallel processing are also possible or may be advantageous.
In this specification, each embodiment is described in a progressive manner, and identical and similar parts of each embodiment are all referred to each other, and each embodiment mainly describes differences from other embodiments. In particular, for the apparatus embodiments, since they are substantially similar to the method embodiments, the description is relatively simple, and reference is made to the description of the method embodiments in part.
It will be understood by those skilled in the art that all or part of the steps for implementing the above embodiments may be implemented by hardware, or may be implemented by a program for instructing relevant hardware, where the program may be stored in a computer readable storage medium, and the storage medium may be a read-only memory, a magnetic disk or an optical disk, etc.
The foregoing description of the preferred embodiments of the invention is not intended to limit the invention to the precise form disclosed, and any such modifications, equivalents, and alternatives falling within the spirit and scope of the invention are intended to be included within the scope of the invention.
Claims (9)
1. A method for channel access control, comprising:
the management node groups node sets in the network to obtain a group set; each group in the set of groups includes at least one node;
the management node determines a time slot corresponding to each group of the group set; the nodes of each group access channels in corresponding time slots;
the management node determines a priority node set from the node sets based on the load value of each node in the network;
the management node determines a total load value corresponding to each group based on the load value of each node in each group to obtain a total load value set; the load total value of the load total value set corresponds to the group of the group set one by one;
the management node converts each load total value of the load total value set into a processing time length;
the management node determines the processing time length corresponding to each group of the group set;
if the processing time length corresponding to the group is smaller than the time slot length corresponding to the group, the management node determines the group as an accessible group and determines the time slot of the group as an accessible time slot; the nodes of the priority node set access channels in the accessible time slots; the nodes of the priority node set can access channels in the time slots corresponding to the belonging groups and can also access channels in the accessible time slots;
the management node sends a control frame to each node in the node set, wherein the control frame comprises the group set, a time slot corresponding to each group of the group set, the priority node set and the accessible time slot.
2. The method of claim 1, wherein the managing node determining a set of priority nodes from the set of nodes based on a load value of each node in the network comprises:
the management node determines a load value with the largest value based on the load value of each node in the network;
the management node determines a node corresponding to a load value which is larger than the load value with the maximum value and is a preset multiple as a priority node, and the priority node set is obtained; the preset multiple is a positive number less than 1.
3. A method for channel access control, comprising:
the method comprises the steps that a current node receives a control frame, wherein the control frame comprises a group set, time slots corresponding to each group of the group set, a priority node set and accessible time slots; the priority node set includes the current node;
when the current moment is determined to belong to the accessible time slot, the current node performs competition based on a carrier sense multiple access mechanism with collision avoidance so as to access a channel;
the current node sends a load value and position information to a management node;
the management node groups node sets in a network to obtain a group set; each group in the set of groups includes at least one node; the management node determines a time slot corresponding to each group of the group set; the nodes of each group access channels in corresponding time slots; the management node determines a priority node set from the node sets based on the load value of each node in the network; the management node determines a total load value corresponding to each group based on the load value of each node in each group to obtain a total load value set; the load total value of the load total value set corresponds to the group of the group set one by one; the management node converts each load total value of the load total value set into a processing time length; the management node determines the processing time length corresponding to each group of the group set; if the processing time length corresponding to the group is smaller than the time slot length corresponding to the group, the management node determines the group as an accessible group and determines the time slot of the group as an accessible time slot; the nodes of the priority node set access channels in the accessible time slots; the nodes of the priority node set can access channels in the time slots corresponding to the belonging groups and can also access channels in the accessible time slots.
4. The method of claim 3, wherein the current node contends to access the channel based on a carrier sense multiple access mechanism with collision avoidance, comprising:
the current node listens to the state of the channel; the status of the channel includes free and busy;
if the current node listens to the state of the channel to be idle in a first preset time, the current node sends a request frame to a receiving node after initial back-off time, and updates the state of the channel to be busy;
the current node receives an allowed frame sent by the receiving node;
and the current node sends data to the receiving node according to the permission frame.
5. The method according to claim 4, wherein the method further comprises:
if the current node does not receive the confirmation frame within a second preset time, the current node determines the data as data to be retransmitted;
the current node updates the initial back-off time;
after the updated back-off time, the current node sends the data to be retransmitted to the receiving node.
6. The method of claim 5, wherein after the current node transmits the data to be retransmitted to the receiving node, further comprising:
and if the current node determines that the current time does not belong to the accessible time slot or the time slot corresponding to the group to which the current node belongs, recovering the updated back-off time to the initial back-off time.
7. A channel access control apparatus, comprising:
the grouping module is used for grouping the node sets in the network by the management node to obtain a group set; each group in the set of groups includes at least one node;
a first determining module, configured to determine, by the management node, a time slot corresponding to each group of the group set; the nodes of each group access channels in corresponding time slots;
a second determining module, configured to determine a priority node set from the node sets by using the management node based on a load value of each node in the network;
the third determining module is used for determining a total load value corresponding to each group based on the load value of each node in each group by the management node to obtain a total load value set; the load total value of the load total value set corresponds to the group of the group set one by one;
a fourth determining module, configured to convert, by the management node, each load total value of the load total value set into a processing duration; the management node determines the processing time length corresponding to each group of the group set; if the processing time length corresponding to the group is smaller than the time slot length corresponding to the group, the management node determines the group as an accessible group and determines the time slot of the group as an accessible time slot; the nodes of the priority node set access channels in the accessible time slots; the nodes of the priority node set can access channels in the time slots corresponding to the belonging groups and can also access channels in the accessible time slots;
and the sending module is used for sending a control frame to each node in the node set by the management node, wherein the control frame comprises the group set, a time slot corresponding to each group of the group set, the priority node set and the accessible time slot.
8. A channel access control apparatus, comprising:
the receiving module is used for receiving a control frame by the current node, wherein the control frame comprises a group set, a time slot corresponding to each group of the group set, a priority node set and an accessible time slot; the priority node set includes the current node;
a determining module, configured to, when it is determined that the current time belongs to the accessible time slot, perform contention for accessing a channel by the current node based on a carrier sense multiple access mechanism with collision avoidance;
the sending module is used for sending the load value and the position information to the management node by the current node;
the management node groups node sets in a network to obtain a group set; each group in the set of groups includes at least one node; the management node determines a time slot corresponding to each group of the group set; the nodes of each group access channels in corresponding time slots; the management node determines a priority node set from the node sets based on the load value of each node in the network; the management node determines a total load value corresponding to each group based on the load value of each node in each group to obtain a total load value set; the load total value of the load total value set corresponds to the group of the group set one by one; the management node converts each load total value of the load total value set into a processing time length; the management node determines the processing time length corresponding to each group of the group set; if the processing time length corresponding to the group is smaller than the time slot length corresponding to the group, the management node determines the group as an accessible group and determines the time slot of the group as an accessible time slot; the nodes of the priority node set access channels in the accessible time slots; the nodes of the priority node set can access channels in the time slots corresponding to the belonging groups and can also access channels in the accessible time slots.
9. An electronic device, characterized in that the device comprises a processor and a memory, in which at least one instruction, at least one program, a set of codes or a set of instructions is stored, which at least one instruction, at least one program, a set of codes or a set of instructions is loaded by the processor and carries out the channel access control method according to any one of claims 1-6.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911176723.6A CN110996392B (en) | 2019-11-26 | 2019-11-26 | Channel access control method and device and electronic equipment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911176723.6A CN110996392B (en) | 2019-11-26 | 2019-11-26 | Channel access control method and device and electronic equipment |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110996392A CN110996392A (en) | 2020-04-10 |
| CN110996392B true CN110996392B (en) | 2023-08-11 |
Family
ID=70087154
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201911176723.6A Active CN110996392B (en) | 2019-11-26 | 2019-11-26 | Channel access control method and device and electronic equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110996392B (en) |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104320858A (en) * | 2014-11-06 | 2015-01-28 | 南通大学 | Method and system for optimizing access to wireless sensor network channel |
| CN104756577A (en) * | 2013-04-26 | 2015-07-01 | 华为技术有限公司 | Systems and methods for efficient channel synchronization |
| CN105900512A (en) * | 2014-05-27 | 2016-08-24 | 华为技术有限公司 | Method for determining transmission resources, access point, and station |
| CN108365928A (en) * | 2017-01-26 | 2018-08-03 | 北京三星通信技术研究有限公司 | The sending method of configuration information, the detection method and device of control channel resource |
| CN108430108A (en) * | 2018-02-13 | 2018-08-21 | 西安电子科技大学 | Based on concurrently collection multiple-objection optimization slot allocation method, wireless network control system |
| EP3468262A1 (en) * | 2017-10-09 | 2019-04-10 | Orta Dogu Teknik Universitesi | Energy efficient scheduling method and algorithm for the non-deterministic traffic in ieee 802.15.4e time slotted channel hopping (tsch) medium access control |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9426832B2 (en) * | 2012-04-24 | 2016-08-23 | Intel Corporation | Methods and arrangements to coordinate communications in a wireless network |
| KR102091157B1 (en) * | 2012-07-02 | 2020-03-19 | 한국전자통신연구원 | Apparatus and method for Allocating |
| CA3003597C (en) * | 2015-10-31 | 2022-08-23 | Parallel Wireless, Inc. | Elastic scheduling |
-
2019
- 2019-11-26 CN CN201911176723.6A patent/CN110996392B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104756577A (en) * | 2013-04-26 | 2015-07-01 | 华为技术有限公司 | Systems and methods for efficient channel synchronization |
| CN105900512A (en) * | 2014-05-27 | 2016-08-24 | 华为技术有限公司 | Method for determining transmission resources, access point, and station |
| CN104320858A (en) * | 2014-11-06 | 2015-01-28 | 南通大学 | Method and system for optimizing access to wireless sensor network channel |
| CN108365928A (en) * | 2017-01-26 | 2018-08-03 | 北京三星通信技术研究有限公司 | The sending method of configuration information, the detection method and device of control channel resource |
| EP3468262A1 (en) * | 2017-10-09 | 2019-04-10 | Orta Dogu Teknik Universitesi | Energy efficient scheduling method and algorithm for the non-deterministic traffic in ieee 802.15.4e time slotted channel hopping (tsch) medium access control |
| CN108430108A (en) * | 2018-02-13 | 2018-08-21 | 西安电子科技大学 | Based on concurrently collection multiple-objection optimization slot allocation method, wireless network control system |
Non-Patent Citations (1)
| Title |
|---|
| Performance analysis of opportunistic spectrum access protocol for multi-channel cognitive radio networks;Kyung Jae Kim;《IEEE》;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110996392A (en) | 2020-04-10 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108924945B (en) | A kind of cut-in method and device | |
| JP5807317B2 (en) | System and method for contention management in a wireless communication system | |
| JP4022200B2 (en) | Method and system for optimally serving stations on a wireless LAN using the IEEE 802.11E standard controlled contention / resource reservation protocol | |
| EP3100545B1 (en) | Inter-group control of semi-persistent channel occupation for device-to-device (d2d) wireless communications | |
| US10034121B2 (en) | RAN overload control for M2M communications in LTE networks | |
| US20050025176A1 (en) | Medium access control in wireless local area network | |
| CN102017534A (en) | Deterministic back-off-method and apparatus for peer-to-peer communications | |
| JP6177437B2 (en) | Channel access method, apparatus and system | |
| KR20160039659A (en) | System and method for wlan ofdma design of uplink and downlink transmissions | |
| US9883530B2 (en) | Radio frame receiving method and device | |
| Weerasinghe et al. | Priority-based initial access for URLLC traffic in massive IoT networks: Schemes and performance analysis | |
| US20160295612A1 (en) | Information sending method and apparatus | |
| WO2016184219A1 (en) | Method and device for sharing unauthorized frequency spectrum | |
| KR20230048390A (en) | Channel competition method and related device | |
| JPH10173663A (en) | Communication system | |
| KR20110074872A (en) | Selection of transmission lots of the relaxed deterministic back-off method in the medium access control | |
| CN110996392B (en) | Channel access control method and device and electronic equipment | |
| WO2009069047A1 (en) | Link-based transmission queue structure for wireless networks | |
| JP4549987B2 (en) | Access system and base station apparatus | |
| KR101169993B1 (en) | Apparatus and method for media access control based on competition of csma/ca | |
| CN110958717A (en) | Contention-free random medium access control method and system for centralized wireless local area network | |
| JP2009060621A (en) | Wireless packet data transmission system | |
| US20090074004A1 (en) | Back-off-state assignment for channel throughput maximization of wireless networks | |
| JP2005210210A (en) | Transmission method of wireless packet data, and transmission system of wireless packet data | |
| CN111031525A (en) | Beacon frame sending method and device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |