A simultaneous same-frequency full-duplex random access method based on dual competition

Abstract

The present invention belongs to the field of communication, and specifically discloses a simultaneous same-frequency full-duplex random access method based on dual competition. When the node has a communication demand, the priority of the node is generated; the node monitors the left-hand channel. If the left-hand channel is idle and the priority of the node is the highest at this time, the node uses the left-hand channel for communication; if the left-hand channel is occupied or even if the left-hand channel is idle but the priority of the node is not the highest, the node monitors the right-hand channel. If the right-hand channel is idle and the priority of the node is the highest at this time, the node uses the right-hand channel for communication; if the right-hand channel is occupied or even if the right-hand channel is idle but the priority of the node is not the highest, the node delays several time slots and re-competes for the left-hand channel, and re-monitors the left-hand channel. Under the premise of solving the interference problem, efficient and accurate data transmission is achieved, thereby greatly improving network throughput and spectrum efficiency.

Description

Technical Field

[0001] The invention belongs to the field of communications, and in particular relates to a simultaneous same-frequency full-duplex random access method based on dual competition. Background Art

[0002] Wireless ad hoc networks are widely used in various scenarios due to their strong network coverage and lack of communication infrastructure support. They are one of the important research topics at present. Polarized antenna technology is also becoming more and more mature. Its advantages of wide communication range and low energy consumption provide conditions for its introduction into wireless ad hoc networks. In addition, network-borne services are becoming more and more diversified, and users have higher and higher requirements for service quality, which requires nodes in the network to communicate accurately and efficiently to meet user needs.

[0003] To achieve large-scale user data access and high-speed data transmission, it is necessary to make full use of limited spectrum resources. Simultaneous same-frequency full-duplex technology, as a current research hotspot of wireless communications and one of the key technologies of 5G, can use the same frequency to send and receive data signals at the same time. In theory, it can double the spectrum utilization rate, which can effectively solve the problem of spectrum resource shortage, but it will face more serious interference problems. Summary of the invention

[0004] The present invention provides a dual-competition-based simultaneous same-frequency full-duplex random access method, which realizes efficient and accurate data transmission under the premise of solving the interference problem, thereby greatly improving network throughput and spectrum efficiency.

[0005] The present invention provides a dual-competition based simultaneous same-frequency full-duplex random access system, which realizes efficient and accurate data transmission under the premise of solving the interference problem, thereby greatly improving network throughput and spectrum efficiency.

[0006] The present invention is achieved through the following technical solutions:

[0007] A dual-competition based simultaneous same-frequency full-duplex random access method, the simultaneous same-frequency full-duplex random access method comprising:

[0008] When a node has communication needs, it obtains real-time information of the left-hand channel. If the left-hand channel cannot be used for communication, it uses the right-hand channel for communication. If the right-hand channel cannot be used for communication either, the node delays for several time slots before competing for the left-hand channel again.

[0009] A dual-competition based simultaneous same-frequency full-duplex random access method, the simultaneous same-frequency full-duplex random access method specifically comprising the following steps:

[0010] Step 1: When the node has a communication demand, the priority of the node is first generated according to the priority algorithm;

[0011] Step 2: This node monitors the left-hand channel. If the left-hand channel is idle and this node has the highest priority, this node uses the left-hand channel for communication. If the left-hand channel is occupied or even if the left-hand channel is idle but this node has not the highest priority, proceed to step 3.

[0012] Step 3: This node monitors the right-hand channel. If the right-hand channel is idle and the priority of this node is the highest, this node uses the right-hand channel for communication. If the right-hand channel is occupied or even if the right-hand channel is idle but the priority of this node is not the highest, proceed to step 4.

[0013] Step 4: This node executes the backoff algorithm, delays for a number of time slots, and then re-competes for the left-hand channel, and returns to step 2 to monitor the left-hand channel.

[0014] A dual-competition-based simultaneous same-frequency full-duplex random access method, wherein the priority algorithm in step 1 comprises the following steps:

[0015] Step 1.1: Input several nodes;

[0016] Step 1.2: Determine whether the process types of each node are the same. If they are the same, proceed to step 1.3; if they are not the same, proceed to step 1.6;

[0017] Step 1.3: Determine whether the importance of each node is the same. If so, proceed to step 1.4; if not, proceed to step 1.6;

[0018] Step 1.4: Determine whether the resource requirements of each node are the same. If they are the same, proceed to step 1.5; if they are not the same, proceed to step 1.6;

[0019] Step 1.5: The level of each priority is the same, which is 1;

[0020] Step 1.6: Nodes with earlier numbers or alphabetical order have higher priority. Arrange the priority levels in numerical or alphabetical order and repeat steps 1.1-1.5 at the same time.

[0021] A dual-competition-based simultaneous same-frequency full-duplex random access method, wherein the plurality of nodes input in step 1.1 are two nodes, and the steps include:

[0022] Step 1.1.1: Input two nodes A and B;

[0023] Step 1.1.2: Determine whether the process types of the two nodes are the same. If they are the same, proceed to step 1.3; if they are not the same, proceed to step 1.6;

[0024] Step 1.1.3: Determine whether the importance of the two nodes is the same. If so, proceed to step 1.4; if not, proceed to step 1.6;

[0025] Step 1.1.4: Determine whether the resource requirements of the two nodes are the same. If they are the same, proceed to step 1.5; if they are not the same, proceed to step 1.6;

[0026] Step 1.1.5: The priority levels of node A and node B are the same;

[0027] Step 1.1.6: Node A has a higher priority, followed by node B, and steps 1.1-1.5 are repeated at the same time.

[0028] A dual-competition based simultaneous same-frequency full-duplex random access method, when the priority levels of node A and node B in step 1.5 are the same, the priority level is determined by time, if the time request time of node A is earlier than that of node B, then the priority level of node A is greater than that of node B, and node A communicates first; if the time request time of node B is earlier than that of node A, then the priority level of node B is greater than that of node A, and node B communicates first.

[0029] A dual-competition-based simultaneous same-frequency full-duplex random access method, the backoff algorithm of step 4 specifically includes the following steps:

[0030] Step 4.1: Determine the priority of the priority mark number M of the current node;

[0031] Step 4.2: Check whether the mark number M is the number of uncommunicated N. If n=M, proceed to step 4.3; if n≠M, proceed to step 4.4;

[0032] Step 4.3: Return to the main program and keep the current round number cnt, and perform steps 4.1 and 4.2 again;

[0033] Step 4.4: Substitute the node probability distribution value λ into the formula (1), and the current round number cnt is increased after calculation, that is, delaying a number of time slots to re-compete for the left-hand channel.

[0034] A dual-competition-based simultaneous same-frequency full-duplex random access method, wherein the formula (1) is specifically:

[0035] t=M+Nn-(cnt+λ)

[0036] Among them, M is the priority mark number, N is the number of uncommunicated nodes, n is the current priority, λ is the node probability distribution value, and cnt is the round number.

[0037] A simultaneous same-frequency full-duplex random access method based on dual competition, wherein the simultaneous same-frequency full-duplex random access method for 5 nodes is specifically as follows:

[0038] Assume that the network consists of 5 nodes, each node is equipped with a left-hand antenna and a right-hand antenna, and the channels are divided into left-hand channels and right-hand channels; at the initial moment, both sets of antennas of the nodes are in receiving mode;

[0039] At this time, all five nodes have communication needs, and the priority algorithm is executed first. The priorities of the five nodes are represented by priorities 1 to 5 respectively;

[0040] Each node monitors the left-hand channel. If the left-hand channel is idle, the node with priority 1 broadcasts through the left-hand channel via the left-hand antenna.

[0041] Nodes with priorities 2 to 4 monitor the right-hand channel. If the right-hand channel is idle, the node with priority 2 broadcasts through the right-hand channel via the right-hand antenna.

[0042] Nodes with priorities 3 to 5 execute the backoff algorithm and compete for the left-hand channel again after several time slots.

[0043] A dual-competition based simultaneous same-frequency full-duplex random access system, the simultaneous same-frequency full-duplex random access system comprising a priority unit, a communication unit and a communication node selection unit;

[0044] A priority unit, used to generate the priority of this node according to a priority algorithm;

[0045] A communication unit, comprising a left-hand channel and a right-hand channel;

[0046] The communication node selection unit is used to monitor the left-hand channel and the right-hand channel, determine the communication channel of the selected communication unit according to the priority of the priority unit, and perform related communications.

[0047] A dual-competition based simultaneous same-frequency full-duplex random access system, wherein the communication node selection unit includes a backoff algorithm for nodes that have not communicated after several time slots to compete for left-hand channels again.

[0048] The beneficial effects of the present invention are:

[0049] The present invention can achieve efficient access of ad hoc network nodes while ensuring anti-interference conditions, thereby improving network throughput and spectrum efficiency.

[0050] The present invention is applicable to the access scenario between nodes of a self-organizing network, requiring the nodes of the self-organizing network to perform simultaneous same-frequency full-duplex communication, and each node of the self-organizing network is equipped with two antennas, namely a left-hand polarized antenna and a right-hand polarized antenna. BRIEF DESCRIPTION OF THE DRAWINGS

[0051] Figure 1 It is a structural schematic diagram of the present invention.

[0052] Figure 2 It is a communication diagram of 5 nodes of the present invention.

[0053] Figure 3 It is a flow chart of the backoff algorithm method of the present invention.

[0054] Figure 4 It is a flow chart of the priority algorithm method of the present invention. DETAILED DESCRIPTION

[0055] The technical solutions in the embodiments of the present invention will be described clearly and completely below in conjunction with the drawings in the embodiments of the present invention. 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.

[0056] A dual-competition based simultaneous same-frequency full-duplex random access method, the simultaneous same-frequency full-duplex random access method comprising:

[0057] When a node has communication needs, it obtains real-time information of the left-hand channel. If the left-hand channel cannot be used for communication, it uses the right-hand channel for communication. If the right-hand channel cannot be used for communication either, the node delays for several time slots before competing for the left-hand channel again.

[0058] A dual-competition based simultaneous same-frequency full-duplex random access method, the simultaneous same-frequency full-duplex random access method specifically comprising the following steps:

[0059] Step 1: When the node has a communication demand, the priority of the node is first generated according to the priority algorithm;

[0060] Step 2: This node monitors the left-hand channel. If the left-hand channel is idle and this node has the highest priority, this node uses the left-hand channel for communication. If the left-hand channel is occupied or even if the left-hand channel is idle but this node has not the highest priority, proceed to step 3.

[0061] Step 3: This node monitors the right-hand channel. If the right-hand channel is idle and the priority of this node is the highest, this node uses the right-hand channel for communication. If the right-hand channel is occupied or even if the right-hand channel is idle but the priority of this node is not the highest, proceed to step 4.

[0062] Step 4: This node executes the backoff algorithm, delays for a number of time slots, and then re-competes for the left-hand channel, and returns to step 2 to monitor the left-hand channel.

[0063] A dual-competition-based simultaneous same-frequency full-duplex random access method, wherein the priority algorithm in step 1 comprises the following steps:

[0064] Step 1.1: Input several nodes;

[0065] Step 1.2: Determine whether the process types of each node are the same. If they are the same, proceed to step 1.3; if they are not the same, proceed to step 1.6;

[0066] Step 1.3: Determine whether the importance of each node is the same. If so, proceed to step 1.4; if not, proceed to step 1.6;

[0067] Step 1.4: Determine whether the resource requirements of each node are the same. If they are the same, proceed to step 1.5; if they are not the same, proceed to step 1.6;

[0068] Step 1.5: The level of each priority is the same, which is 1;

[0069] Step 1.6: Nodes with earlier numbers or alphabetical order have higher priority. Arrange the priority levels in numerical or alphabetical order and repeat steps 1.1-1.5 at the same time.

[0070] A dual-competition-based simultaneous same-frequency full-duplex random access method, wherein the plurality of nodes input in step 1.1 are two nodes, and the steps include:

[0071] Step 1.1.1: Input two nodes A and B;

[0072] Step 1.1.2: Determine whether the process types of the two nodes are the same. If they are the same, proceed to step 1.3; if they are not the same, proceed to step 1.6;

[0073] Step 1.1.3: Determine whether the importance of the two nodes is the same. If so, proceed to step 1.4; if not, proceed to step 1.6;

[0074] Step 1.1.4: Determine whether the resource requirements of the two nodes are the same. If they are the same, proceed to step 1.5; if they are not the same, proceed to step 1.6;

[0075] Step 1.1.5: The priority levels of node A and node B are the same;

[0076] Step 1.1.6: Node A has a higher priority, followed by node B, and steps 1.1-1.5 are repeated at the same time.

[0077] A dual-competition based simultaneous same-frequency full-duplex random access method, when the priority levels of node A and node B in step 1.5 are the same, the priority level is determined by time, if the time request time of node A is earlier than that of node B, then the priority level of node A is greater than that of node B, and node A communicates first; if the time request time of node B is earlier than that of node A, then the priority level of node B is greater than that of node A, and node B communicates first.

[0078] A dual-competition-based simultaneous same-frequency full-duplex random access method, the backoff algorithm of step 4 specifically includes the following steps:

[0079] Step 4.1: Determine the priority of the priority mark number M of the current node;

[0080] Step 4.2: Check whether the mark number M is the number of uncommunicated N. If n=M, proceed to step 4.3; if n≠M, proceed to step 4.4;

[0081] Step 4.3: Return to the main program and keep the current round number cnt, and perform steps 4.1 and 4.2 again;

[0082] Step 4.4: Substitute the node probability distribution value λ (a constant) into the formula (1), and the current round number cnt is increased after calculation, that is, delaying a number of time slots to re-compete for the left-hand channel.

[0083] A dual-competition-based simultaneous same-frequency full-duplex random access method, wherein the formula (1) is specifically:

[0084] t=M+Nn-(cnt+λ)

[0085] Among them, M is the priority mark number, N is the number of uncommunicated nodes, n is the current priority, λ is the node probability distribution value, and cnt is the round number.

[0086] A simultaneous same-frequency full-duplex random access method based on dual competition, wherein the simultaneous same-frequency full-duplex random access method for 5 nodes is specifically as follows:

[0087] Assume that the network consists of 5 nodes, each node is equipped with a left-hand antenna and a right-hand antenna, and the channel is divided into a left-hand channel and a right-hand channel; at the initial moment, both sets of antennas of the node are in receiving mode, such as Figure 2 As shown;

[0088] At this time, all five nodes have communication needs, and the priority algorithm is executed first. The priorities of the five nodes are represented by priorities 1 to 5 respectively;

[0089] Each node monitors the left-hand channel. If the left-hand channel is idle, the node with priority 1 broadcasts through the left-hand channel via the left-hand antenna.

[0090] Nodes with priorities 2 to 4 monitor the right-hand channel. If the right-hand channel is idle, the node with priority 2 broadcasts through the right-hand channel via the right-hand antenna.

[0091] Nodes with priorities 3 to 5 execute the backoff algorithm and compete for the left-hand channel again after several time slots.

[0092] A dual-competition based simultaneous same-frequency full-duplex random access system, the simultaneous same-frequency full-duplex random access system comprising a priority unit, a communication unit and a communication node selection unit;

[0093] A priority unit, used to generate the priority of this node according to a priority algorithm;

[0094] A communication unit, comprising a left-hand channel and a right-hand channel;

[0095] The communication node selection unit is used to monitor the left-hand channel and the right-hand channel, determine the communication channel of the selected communication unit according to the priority of the priority unit, and perform related communications.

[0096] A dual-competition based simultaneous same-frequency full-duplex random access system, wherein the communication node selection unit includes a backoff algorithm for nodes that have not communicated after several time slots to compete for left-hand channels again.

[0097] The present invention is based on a simultaneous same-frequency full-duplex ad hoc network. During the access process of the ad hoc network, under the condition that the ad hoc network nodes have communication needs, channel competition is first performed in a double-competition manner. After the competition is successful, communication can be performed to fully utilize spectrum resources.

[0098] The present invention can give full play to the advantages of simultaneous and same-frequency full-duplex technology, and the use of dual-polarized antennas can effectively avoid interference between nodes. The dual-competition access scheme can effectively reduce the collision frequency and greatly improve network throughput and spectrum efficiency.

Claims

1. A dual-contention based simultaneous same-frequency full-duplex random access method, characterized in that: The simultaneous same-frequency full-duplex random access method comprises: When a node has a communication demand, it obtains real-time information of the left-hand channel. If the left-hand channel cannot communicate, it uses the right-hand channel for communication. If the right-hand channel cannot communicate either, the node delays for a number of time slots and competes for the left-hand channel again. The simultaneous same-frequency full-duplex random access method specifically comprises the following steps: Step 1: When the node has a communication demand, the priority of the node is first generated according to the priority algorithm; Step 2: This node monitors the left-hand channel. If the left-hand channel is idle and this node has the highest priority, this node uses the left-hand channel for communication. If the left-hand channel is occupied or even if the left-hand channel is idle but this node has not the highest priority, proceed to step 3. Step 3: This node monitors the right-hand channel. If the right-hand channel is idle and the priority of this node is the highest, this node uses the right-hand channel for communication. If the right-hand channel is occupied or even if the right-hand channel is idle but the priority of this node is not the highest, proceed to step 4. Step 4: This node executes the backoff algorithm, delays a number of time slots, and then re-competes for the left-hand channel, and returns to step 2 to monitor the left-hand channel; The backoff algorithm of step 4 specifically includes the following steps: Step 4.1: Determine the priority of the current node, whose priority is n and the current priority mark number is M; Step 4.2: Determine whether the current priority is the current priority flag bit M. If n = M, proceed to step 4.3 and return to the main program for communication; if n ≠ M, proceed to step 4.4 Step 4.3: Return to the main program and keep the current round number cnt, and perform steps 4.1 and 4.2 again to determine the current next node; Step 4.4: Substitute the node probability distribution value λ into the formula (1), and the current round number cnt increases, that is, delaying a number of time slots to re-compete for the left-hand channel; The formula (1) is specifically: t=M+Nn-(cnt+λ) Among them, M is the priority mark number, N is the number of uncommunicated nodes, n is the current priority, λ is the node probability distribution value, and cnt is the round number.

2. According to the dual-competition based simultaneous same-frequency full-duplex random access method of claim 1, characterized in that: The priority algorithm in step 1 includes the following steps: Step 1.1: Input several nodes; Step 1.2: Determine whether the process types of each node are the same. If they are the same, proceed to step 1.3; if they are not the same, proceed to step 1.6; Step 1.3: Determine whether the importance of each node is the same. If so, proceed to step 1.4; if not, proceed to step 1.6; Step 1.4: Determine whether the resource requirements of each node are the same. If they are the same, proceed to step 1.5; if they are not the same, proceed to step 1.6; Step 1.5: The level of each priority is the same, which is 1; Step 1.6: Nodes with earlier numbers or alphabetical order have higher priority. Arrange the priority levels in numerical or alphabetical order and repeat steps 1.1-1.5 at the same time.

3. According to claim 2, a dual-competition-based simultaneous same-frequency full-duplex random access method, characterized in that: If the number of nodes input in step 1.1 is two nodes, the steps include: Step 1.1.1: Input two nodes A and B; Step 1.1.2: Determine whether the process types of the two nodes are the same. If they are the same, proceed to step 1.3; if they are not the same, proceed to step 1.6; Step 1.1.3: Determine whether the importance of the two nodes is the same. If so, proceed to step 1.4; if not, proceed to step 1.6; Step 1.1.4: Determine whether the resource requirements of the two nodes are the same. If they are the same, proceed to step 1.5; if they are not the same, proceed to step 1.6; Step 1.1.5: The priority levels of node A and node B are the same; Step 1.1.6: Node A has a higher priority, followed by node B, and steps 1.1-1.5 are repeated at the same time.

4. According to claim 3, a dual-competition-based simultaneous same-frequency full-duplex random access method is characterized in that: When the priority levels of node A and node B in step 1.5 are the same, the priority level is determined by time. If the time request time of node A is earlier than that of node B, then the priority level of node A is greater than that of node B, and node A communicates first; if the time request time of node B is earlier than that of node A, then the priority level of node B is greater than that of node A, and node B communicates first.

5. According to claim 1, a dual-competition-based simultaneous same-frequency full-duplex random access method, characterized in that: The specific method for random access of 5 nodes at the same time and frequency in full duplex is as follows: Assume that the network consists of 5 nodes, each node is equipped with a left-hand antenna and a right-hand antenna, and the channels are divided into left-hand channels and right-hand channels; at the initial moment, both sets of antennas of the nodes are in receiving mode; At this time, all five nodes have communication needs, and the priority algorithm is executed first. The priorities of the five nodes are represented by priorities 1 to 5 respectively; Each node monitors the left-hand channel. If the left-hand channel is idle, the node with priority 1 broadcasts through the left-hand channel via the left-hand antenna. Nodes with priorities 2 to 4 monitor the right-hand channel. If the right-hand channel is idle, the node with priority 2 broadcasts through the right-hand channel via the right-hand antenna. Nodes with priorities 3 to 5 execute the backoff algorithm and compete for the left-hand channel again after several time slots.

6. A dual-competition based simultaneous same-frequency full-duplex random access system, characterized in that: The simultaneous same-frequency full-duplex random access system uses a dual-competition-based simultaneous same-frequency full-duplex random access method as claimed in claim 1, and the simultaneous same-frequency full-duplex random access system includes a priority unit, a communication unit and a communication node selection unit; A priority unit, used to generate the priority of this node according to a priority algorithm; A communication unit, comprising a left-hand channel and a right-hand channel; The communication node selection unit is used to monitor the left-hand channel and the right-hand channel, determine the communication channel of the selected communication unit according to the priority of the priority unit, and perform related communications.

7. A dual-competition based simultaneous same-frequency full-duplex random access system according to claim 6, characterized in that: The communication node selection unit includes a backoff algorithm for nodes that have not communicated after a number of time slots to compete for the left-hand channel again.

Images