CN112888081B - Multiple access method based on fast feedback mechanism - Google Patents
Multiple access method based on fast feedback mechanism Download PDFInfo
- Publication number
- CN112888081B CN112888081B CN202110022487.3A CN202110022487A CN112888081B CN 112888081 B CN112888081 B CN 112888081B CN 202110022487 A CN202110022487 A CN 202110022487A CN 112888081 B CN112888081 B CN 112888081B
- Authority
- CN
- China
- Prior art keywords
- frame
- uplink data
- slave node
- channel
- data frame
- 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
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W74/00—Wireless channel access, e.g. scheduled or random access
- H04W74/002—Transmission of channel access control information
- H04W74/006—Transmission of channel access control information in the downlink, i.e. towards the terminal
-
- 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/0808—Non-scheduled or contention based access, e.g. random access, ALOHA, CSMA [Carrier Sense Multiple Access] using carrier sensing, e.g. as in CSMA
-
- 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/0808—Non-scheduled or contention based access, e.g. random access, ALOHA, CSMA [Carrier Sense Multiple Access] using carrier sensing, e.g. as in CSMA
- H04W74/0825—Non-scheduled or contention based access, e.g. random access, ALOHA, CSMA [Carrier Sense Multiple Access] using carrier sensing, e.g. as in CSMA carrier sensing with collision detection
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Abstract
The invention discloses a multiple access method based on a fast feedback mechanism. The scheme is as follows: in a star topology network consisting of a central node and a plurality of subordinate nodes, a downlink broadcast channel is divided into an announcement period with a fixed length in time; at the beginning of each notification period, the central node transmits a downlink notification frame by using a downlink broadcast channel; the slave node analyzes the channel state information in the downlink notification frame and the confirmation information of the slave node, determines whether to send an uplink data frame when the uplink data frame is waiting to be sent, and judges whether the uplink data frame conflicts when the uplink data frame is being sent; and after the transmission of the uplink data frame is finished, judging whether the uplink data frame is correctly received, and if the uplink data frame is correctly received, the access is successful. The invention reduces the uplink data frame conflict and the waste of channel resources, improves the utilization rate of the channel, and can be used for the random access of the slave nodes of the star topology structure in the scene of the access network which can not monitor the channel.
Description
Technical Field
The invention belongs to the technical field of communication, and further relates to a multiple access method which can be used for random access of slave nodes of a star topology structure in a scene of an access network which cannot monitor a channel.
Background
In shared medium based access networks, a star topology consisting of one central node and several slave nodes is often used. In such a network structure, the central node and each of the slave nodes can directly perform data communication, and in the frequency division duplex mode, a channel used from the central node to each of the slave nodes is referred to as a downlink channel, and a channel used from each of the slave nodes to the central node is referred to as an uplink channel. The uplink channel is shared by a plurality of slave nodes, so a multiple access, namely a Medium Access Control (MAC) method is needed to solve the problem of sharing channel resources when the plurality of slave nodes transmit data to the central node. Multiple access methods in communication systems are generally of two types: a contention-free multiple access method and a contention-based multiple access method. In contention-free multiple access methods, four are common: fixed multiple access methods based on frequency division multiple access FDMA or time division multiple access TDMA, node polling-based methods, token passing-based methods, and dynamic reservation-based methods. Common contention-based multiple access methods are generally divided into two categories: ALOHA and carrier sense multiple access technique CSMA.
Under the scene that the number of the slave nodes is large and the number of the nodes with access requirements changes at any time, the contention-free multiple access method has the obvious defects: firstly, the number of the subordinate nodes changes frequently, so that the central node is inconvenient to manage; secondly, when the number of the slave nodes changes, the contention-free multiple access method needs a relatively large channel resource overhead, which easily causes the waste of channel resources. Therefore, when there are many slave nodes and the node traffic randomness changes greatly, a contention-based multiple access method is often used.
Common contention-based multiple access methods typically have both ALOHA protocols and carrier sense multiple access, CSMA. The CSMA technique senses the channel before transmission, and thus is applicable only in a scenario where the slave node can monitor the status of the uplink channel. The ALOHA protocol does not need to monitor the channel condition before transmission, and is applicable to the scene that the node can not monitor the channel. Generally, the ALOHA protocol is divided into two basic technologies, namely a pure ALOHA protocol and a slotted ALOHA protocol, and the slotted ALOHA protocol has higher throughput compared with the pure ALOHA protocol, so that in practical application, the slotted ALOHA protocol is adopted more. However, the slotted ALOHA protocol has three disadvantages: firstly, similar to pure ALOHA, a node does not monitor a channel before sending data, so that the data sending is blind, and the probability of collision is high; secondly, under the scene of longer transmission delay of uplink data frames, the time slot set by the time slot ALOHA mechanism is longer, and larger channel resource waste is caused when collision occurs; thirdly, the time slot ALOHA specifies that when the slave node sends data, only one time slot is occupied, and the requirement that the slave node sends data frames with different lengths cannot be met.
Disclosure of Invention
The present invention aims to provide a multiple access method based on a fast feedback mechanism to reduce the collision probability when each slave node competes for a channel and the serious waste of channel resources after collision under the condition that each slave node cannot monitor the uplink channel state, and to realize that each slave node can send data frames with different lengths.
In order to achieve the purpose, the technical scheme of the invention is as follows:
(1) dividing a downlink channel into a plurality of continuous and non-overlapping time periods in time, and taking each time period as an announcement cycle;
(2) the central node sends a downlink notification frame at the beginning of each notification period, and when the system is initialized, the central node sends an idle non-acknowledgement downlink notification frame;
(3) after receiving the downlink notification frame, each slave node analyzes a channel busy and idle state field in the downlink notification frame and determines whether to send an uplink data frame:
if the channel busy-idle state field is idle and the slave node has an uplink data frame to wait for transmission, starting to transmit the uplink data frame;
if the channel busy-free state field is busy, waiting and analyzing a downlink notification frame in the next notification period, and then determining whether to send an uplink data frame;
(4) the central node determines the type of the downlink announcement frame sent in the next announcement period according to whether the frame header sent by a certain subordinate node can be correctly analyzed on the uplink channel:
if the central node can correctly analyze a frame header sent by a certain slave node on an uplink channel, the slave node is considered to compete for the channel successfully, information such as identity information and channel occupying time of the slave node is analyzed from the frame header, the channel occupying time of the slave node is recorded, and a 'busy confirmation' downlink notification frame is sent in the next notification period;
if the central node fails to correctly analyze the frame header sent by a certain slave node on the uplink channel, the central node considers that no slave node on the channel is sending a data frame, and sends an idle non-acknowledgement downlink notification frame in the next notification period;
(5) the central node judges whether the uplink data frame of the slave node is sent completely according to the recorded channel occupying time of the slave node:
if the recorded time of the channel occupied by the slave node is expired, the uplink data frame of the slave node is considered to be sent completely;
if the recorded time of the channel occupied by the slave node is not up, the uplink data frame of the slave node is considered not to be sent completely;
(6) the central node determines the type of the downlink announcement frame sent in the next announcement cycle according to whether the uplink data frame of a certain subordinate node is sent completely and whether the uplink data frame is received correctly:
if the uplink data frame of the slave node is not sent completely, sending a busy acknowledgement downlink notification frame in the next notification period;
if the uplink data frame of the slave node is sent completely and the uplink data frame is received correctly, sending an idle confirmation downlink notification frame in the next notification period;
if the uplink data frame of the slave node is sent completely but the uplink data frame is not received correctly, a busy non-acknowledgement downlink notification frame is sent in the next notification period;
(7) and the subordinate node which does not finish sending the uplink data frame analyzes the downlink notification frame and judges whether the competition channel is successful:
if the downlink notification frame is a busy acknowledgement downlink notification frame, the slave node considers that the channel competition is successful, and continues to send the rest of the uplink data frame in the next notification period;
if the downlink notification frame is an idle non-acknowledgement downlink notification frame, the slave node considers that the channel competition is failed, the sent uplink data frame conflicts, the sending of the uplink data frame is immediately stopped, and retransmission is waited according to the backoff rule;
(8) and (3) the channel competition is successful, and the slave node which finishes the sending of the uplink data frame analyzes the downlink notification frame and judges whether the sending of the uplink data frame is successful:
if the downlink notification frame is an idle confirmation downlink notification frame, the slave node considers that the current uplink data frame is successfully sent;
if the downlink notification frame is a busy non-acknowledgement downlink notification frame, the slave node considers that the current uplink data frame is failed to be sent, and resends the current uplink data frame in the next notification period.
Compared with the prior art, the invention has the following advantages:
first, the busy-idle state of the uplink channel is notified through a fast feedback mechanism, so that each slave node can know the busy-idle state of the uplink channel before sending an uplink data frame, the problem that the slave node cannot monitor the channel state in the prior art is solved, the blindness of the slave node when sending the uplink data frame is reduced, and the collision probability is reduced.
Secondly, the central node can quickly analyze the frame header information of the uplink data frame in the current notification period, so that when the uplink data frame of each slave node is not sent completely, the central station can judge the channel state by analyzing the frame header of the uplink data frame and quickly feed back the channel state, so that the slave node can quickly know whether the uplink data frame currently sent conflicts or not, and if the uplink data frame conflicts, the slave node immediately stops sending the uplink data frame, thereby reducing invalid occupation of channel resources, reducing channel resource waste caused by the conflict and improving the channel utilization rate.
Thirdly, because the invention bears the occupied channel time of the frame in the frame header of the uplink data frame sent by the slave node, the central node can make the busy/idle state field of the channel always busy in the downlink announcement frame sent by the central node before the time is over, the transmission confirmation field of the slave node contains the identity information of the slave node which is currently sending the uplink data frame, and other slave nodes can not send the uplink data frame after receiving the downlink announcement frame, therefore, the slave node which competes for the channel successfully can continuously send the uplink data frame without conflict in a plurality of subsequent periods until the uplink data frame is sent completely.
Fourthly, because the slave node of the invention can flexibly set the time for occupying the channel in the frame header of the uplink data frame, compared with the prior art, the invention ensures that the uplink data frames with various lengths can occupy proper channel resources, thereby reducing unnecessary waste.
Drawings
FIG. 1 is a flow chart of an implementation of the present invention;
fig. 2 is a schematic diagram of a slave node access process in embodiment 1 of the present invention.
Fig. 3 is a schematic diagram of a slave node access process in embodiment 2 of the present invention.
Detailed Description
The invention is further described with reference to the following figures and examples.
Example 1: the star access network is formed by 1 central node and 2 subordinate nodes, and the access is carried out under the scene that the number of uplink channels is 1 and the number of downlink broadcast channels is 1.
Referring to fig. 1 and 2, implementation steps of embodiment 1 of the present invention are as follows:
step 1, dividing a downlink channel into a plurality of continuous and non-overlapping time periods in time, and taking each time period as an announcement cycle.
When the announcement period is divided, the following two conditions are carried out:
firstly, the subordinate node can correctly receive and analyze the downlink notification frame;
secondly, the central node can correctly receive and analyze the head of the uplink data frame;
the time length is as short as possible under the condition that the two conditions are met, so that the waste of channel resources caused by the collision of uplink data frames during channel competition is reduced.
In this embodiment 1, the length of the notification period is set as the sum of the transmission delay of the downlink notification frame and the transmission delay of the header part of the uplink data frame, that is, the propagation delay and the processing delay are ignored, and the length is smaller than the transmission delay of the uplink data frame.
And 2, the central node sends a downlink notification frame at the beginning of each notification period.
The downlink notification frame comprises a channel busy and idle state field and a slave node transmission confirmation field, and the downlink notification frame comprises four types: idle non-acknowledgement, busy acknowledgement, idle acknowledgement, busy non-acknowledgement, wherein:
the 'idle non-confirmation' downlink notification frame means that a channel busy-idle state field is idle, and a slave node transmits confirmation field non-confirmation information;
the 'busy acknowledgement' downlink notification frame means that a channel busy and idle state field is busy, and a slave node transmission acknowledgement field contains corresponding slave node identity information and an acknowledgement character ACK;
the 'idle confirmation' downlink notification frame means that a channel busy-idle state field is idle, and a transmission confirmation field of a slave node comprises corresponding slave node identity information and a confirmation character ACK;
the 'busy/no-confirmation' downlink notification frame means that the channel busy/idle status field is busy, and the slave node transmission confirmation field contains corresponding slave node identity information and a no-confirmation character NACK.
When the system is initialized, the central node sends an idle non-acknowledgement downlink notification frame.
In this embodiment 1, the central node sends an "idle non-acknowledgement" downlink advertisement frame in the advertisement period i.
And 3, the slave node determines whether to send the uplink data frame.
After receiving the downlink notification frame, each slave node analyzes a channel busy and idle state field in the downlink notification frame and determines whether to send an uplink data frame:
if the busy-idle state field of the uplink channel is idle and the slave node has an uplink data frame to wait for sending, starting to send the uplink data frame by taking the time of receiving and analyzing the downlink notification frame as a reference;
if busy-idle state field of up channel is busy, then wait and analyze down announcement frame in next announcement period, and then decide whether to send up data frame.
The uplink data frame comprises a frame header and a load. The frame header carries the identity information of each slave node and the occupied channel time of the frame. The slave node identity information, including the user ID and the user MAC address, is used as a unique identifier for distinguishing the slave node identity. And respectively carrying out coding and cyclic redundancy check on the frame header part and the load part of the uplink data frame so as to ensure that the frame header part can be independently analyzed by the central node from the load part.
In this embodiment 1, at the beginning of the announcement cycle i, both the slave node a and the slave node B have uplink data frames waiting to be sent, and after analyzing the downlink announcement frame in the announcement cycle i, the two slave nodes find that the channel busy/idle state field is idle, so that the slave nodes start sending the uplink data frames at the same time with the time of receiving the downlink announcement frame as a reference.
And 4, the central node determines the type of the downlink announcement frame sent in the next announcement period according to whether the frame header sent by a certain subordinate node can be correctly analyzed on the uplink channel.
4.1) the central node receives the frame head part of the uplink data frame and carries out cyclic redundancy check:
if the check result is correct, the frame header sent by a certain slave node is considered to be correctly analyzed, namely the slave node successfully competes for the channel, and 4.2) is executed;
otherwise, the frame header of a certain slave node is not considered to be correctly analyzed, namely no slave node on the uplink channel is sending the data frame, and 4.3) is executed.
4.2) the central node analyzes the information of the identity information and the time of occupying the channel of the slave node from the frame header, records the time of occupying the channel of the slave node as t, and records the time of finishing sending the downlink notification frame in the current notification period as k, and sends a 'busy confirmation' downlink notification frame in the next notification period;
4.3) the central node sends an idle non-acknowledgement downlink notification frame in the next notification period.
In this embodiment 1, since the slave node a and the slave node B simultaneously transmit the uplink data frames in the advertisement period i, and the two uplink data frames collide, the central node does not correctly resolve the frame header of any slave node in the advertisement period i, and transmits the "idle non-acknowledgement" downlink advertisement frame in the advertisement period i + 1. Meanwhile, as the uplink data frames sent by the slave node A in the notification period i +1 do not conflict, the central node correctly analyzes the frame header of the slave node A in the notification period i +1, and considers that the slave node A successfully competes for the channel in the notification period i +1, so that the time occupied by the channel is analyzed and recorded in the frame header of the slave node A as t, the time when the downlink notification frame is sent in the current notification period is finished as k, and a 'busy acknowledgement' downlink notification frame is sent in the notification period i + 2.
And 5, the central node judges whether the uplink data frame of the slave node is sent completely according to the recorded channel occupation time of the slave node.
The central node calculates the difference m between the end time of the current announcement cycle and the k in the step 4, and compares the difference with the recorded channel occupation time t of the slave node:
if m is larger than t, the central node considers that the time of the channel occupied by the slave node is cut off, and the uplink data frame of the slave node is judged to be sent completely;
if m is less than or equal to t, the central node considers that the time of the channel occupied by the slave node is not cut off, and the fact that the uplink data frame of the slave node is not sent is judged.
In this embodiment 1, in the announcement period i +3, the central node calculates and compares that the occupied channel time of the slave node a is not expired, and considers that the uplink data frame of the slave node a is not completely sent. In the notification period i +4, the central node calculates and compares the channel occupation time of the slave node a to find that the channel occupation time of the slave node a is expired, and considers that the uplink data frame of the slave node a is sent completely.
And 6, the central node determines the type of the downlink notification frame sent in the next notification period.
The central node determines the type of the downlink notification frame sent in the next notification period according to whether the uplink data frame of a certain subordinate node is sent completely and whether the uplink data frame is received correctly:
if the uplink data frame of the slave node is not sent completely, a 'busy acknowledgement' downlink notification frame is sent in the next notification period;
if the uplink data frame of the slave node is sent completely, the central node performs cyclic redundancy check on the received uplink data frame:
if the check result is correct, the uplink data frame is considered to be correctly received, and the central node sends an idle confirmation downlink notification frame in the next notification period;
otherwise, the central node considers that the uplink data frame is not correctly received, and sends a busy non-acknowledgement downlink notification frame in the next notification period.
In this embodiment 1, in the announcement period i +3, if the uplink data frame of the slave node a is not completely sent, the central node sends a "busy acknowledgement" downlink announcement frame in the announcement period i + 3. In the notification period i +4, the uplink data frame of the slave node a has been sent out, and the uplink data frame has been correctly received, so that the central node sends an "idle acknowledgement" downlink notification frame in the notification period i + 4.
And 7, the slave node judges whether the competition channel is successful or not.
The subordinate node analyzes the downlink notification frame when the uplink data frame is not sent, and judges whether the competition channel is successful:
if the downlink notification frame is a busy acknowledgement downlink notification frame, the slave node considers that the channel competition is successful, and continues to send the rest of the uplink data frame in the notification period;
if the downlink notification frame is an idle non-acknowledgement downlink notification frame, the collision of the transmitted uplink data frames is indicated, and the slave node considers that the contention channel fails, namely immediately stops transmitting the uplink data frames and waits for retransmission according to the backoff rule.
The backoff rule may be set according to a scene and a demand, and in this embodiment 1, a binary exponential backoff algorithm is used, where the backoff of the slave node a is finished in the notification period i +1, and the backoff of the slave node B is finished at the notification period i + 3.
In this embodiment 1, in an announcement period i +1, each slave node receives and analyzes a downlink announcement frame, and finds that the announcement frame is an "idle non-acknowledged" downlink announcement frame, so that both the slave node a and the slave node B consider that channel contention fails, and an uplink data frame currently being transmitted has a collision, immediately stops transmitting the current uplink data frame, and waits for retransmission according to a backoff rule. In the announcement period i +2, the slave node a receives and analyzes the downlink announcement frame, finds that the announcement frame is a 'busy acknowledgement' downlink announcement frame, and the slave node transmission acknowledgement field contains the identity information and acknowledgement character ACK of the slave node a, and the slave node a considers that the contention channel is successful and continues to send the uplink data frame.
And 8, judging the transmission condition of the uplink data frame by the slave node.
After the channel competition is successful and the uplink data frame is sent, the slave node analyzes the downlink notification frame and judges whether the uplink data frame is sent successfully:
if the downlink notification frame is an idle confirmation downlink notification frame, the slave node considers that the current uplink data frame is successfully sent;
if the downlink notification frame is a busy non-acknowledgement downlink notification frame, the slave node considers that the current uplink data frame is unsuccessfully transmitted and retransmits the uplink data frame in the notification period.
In this embodiment 1, the slave node a successfully contends for the channel, and the uplink data frame is already transmitted in the announcement period i +3, and in the announcement period i +4, the downlink announcement frame is analyzed, and the announcement frame is found to be an "idle acknowledgement" downlink announcement frame, so that the slave node a considers that the uplink data frame is successfully transmitted.
In embodiment 2, the star access network is composed of 1 central node and 1 slave node, and has 1 uplink channel and 1 downlink broadcast channel.
Referring to fig. 1 and 3, the implementation steps of embodiment 2 of the present invention are as follows:
step one, dividing a downlink channel into a plurality of continuous and non-overlapping time periods in time, and taking each time period as an announcement cycle.
This step is implemented in the same manner as step 1 of example 1.
And step two, the central node sends a downlink notification frame at the beginning of each notification period.
This step is implemented in the same manner as step 2 of example 1.
And step three, the slave node determines whether to send the uplink data frame.
The determination was made in the same manner as in step 3 of example 1.
In this embodiment, at the beginning of the notification period i, the slave node C has an uplink data frame to wait for transmission, and after analyzing the downlink notification frame in the notification period i, it finds that the channel busy/idle state field is idle, so that the slave node C starts to transmit the uplink notification frame based on the time of receiving the downlink notification frame.
And step four, the central node determines the type of the downlink notification frame sent in the next notification period according to whether the frame header sent by a certain slave node can be correctly analyzed on the uplink channel.
The determination was made in the same manner as in step 4 of example 1.
In this embodiment, since the uplink data frame sent by the slave node C in the announcement period i does not collide, the central node correctly parses the frame header of the slave node C in the announcement period i, and considers that the slave node C competes for the channel successfully in the announcement period i, so that the time of occupying the channel is parsed and recorded in the frame header of the slave node C as t, the time of finishing sending the downlink announcement frame in the current announcement period is k, and the downlink announcement frame of "busy acknowledgement" is sent in the announcement period i + 1.
Meanwhile, as the uplink data frames sent by the slave node C in the announcement period i +2 do not collide, the central node correctly resolves the frame header of the slave node C in the announcement period i +2, and considers that the slave node C competes for the channel successfully in the announcement period i +2, so that the time occupied by the channel is resolved and recorded in the frame header of the slave node C as t, the time when the downlink announcement frame is sent in the current announcement period is finished as k, and the downlink announcement frame of 'busy acknowledgement' is sent in the announcement period i + 3.
And step five, the central node judges whether the uplink data frame of the slave node is sent completely according to the recorded channel occupation time of the slave node.
The judgment was made in the same manner as in step 5 of example 1.
In the announcement cycle i +1 and the announcement cycle i +3, the central node calculates a difference m between the end time of the current announcement cycle and k, and compares m with t, and finds that m is less than or equal to t, that is, the occupied channel time of the slave node C is not expired, so that the central node considers that the uplink data frame of the slave node C is not completely transmitted. In the announcement periods i +2 and i +4, the central node calculates a difference m between the end time of the current announcement period and k, compares m with t, and finds that m is greater than t, that is, the occupied channel time of the slave node C is expired, so that the central node considers that the uplink data frame of the slave node C has been completely transmitted.
And step six, the central node determines the type of the downlink notification frame sent in the next notification period.
The determination was made in the same manner as in step 6 of example 1.
The specific implementation of this embodiment is:
in the notification period i +1, if the uplink data frame of the slave node C is not sent completely, the central node sends a busy acknowledgement downlink notification frame in the notification period i + 1;
in the notification period i +2, the uplink data frame of the slave node C is sent completely, but the uplink data frame is not received correctly, and then the central node sends a busy non-acknowledgement downlink notification frame in the notification period i + 2;
in the notification period i +3, if the uplink data frame of the slave node C is not sent completely, the central node sends a busy acknowledgement downlink notification frame in the notification period i + 3;
in the notification period i +4, the uplink data frame of the slave node C has been sent out, and the uplink data frame has been correctly received, so that the central node sends an "idle acknowledgement" downlink notification frame in the notification period i + 4.
And step seven, the slave node judges whether the competition channel is successful.
The judgment was made in the same manner as in step 7 of example 1.
In the present embodiment, in the announcement period i +1 and the announcement period i +3, the slave node C receives and analyzes the downlink announcement frame, and finds that the announcement frame is a "busy acknowledgement" downlink announcement frame, and the slave node transmission acknowledgement field includes the identity information and the acknowledgement character ACK of the slave node C, and then the slave node C considers that the contention channel is successful, and continues to send the uplink data frame.
And step eight, the slave node judges the sending condition of the uplink data frame.
The judgment was made in the same manner as in step 8 of example 1.
In this embodiment, since the slave node C successfully contends for the channel, and the uplink data frame has been sent in the announcement period i +1, and the announcement frame is found to be a "busy non-acknowledgement" downlink announcement frame by analyzing the downlink announcement frame in the announcement period i +2, the slave node C considers that the uplink data frame has failed to be sent, and therefore, the slave node C resends the uplink data frame in the announcement period;
after the uplink data frame is sent in the notification period i +3, the slave node C that retransmits and competes for the channel successfully analyzes the downlink notification frame in the notification period i +4, and finds that the notification frame is an idle acknowledgement downlink notification frame, so that the slave node C considers that the uplink data frame is sent successfully.
Claims (10)
1. A multiple access method based on a fast feedback mechanism is characterized by comprising the following steps:
(1) dividing a downlink channel into a plurality of continuous and non-overlapping time periods in time, and taking each time period as an announcement cycle;
(2) the central node sends a downlink notification frame at the beginning of each notification period, and when the system is initialized, the central node sends an idle non-acknowledgement downlink notification frame;
(3) after receiving the downlink notification frame, each slave node analyzes a channel busy and idle state field in the downlink notification frame and determines whether to send an uplink data frame:
if the channel busy-idle state field is idle and the slave node has an uplink data frame to wait for transmission, starting to transmit the uplink data frame;
if the channel busy and idle state field is busy, waiting and analyzing a downlink notification frame in the next notification period, and then determining whether to send an uplink data frame;
(4) the central node determines the type of the downlink announcement frame sent in the next announcement period according to whether the frame header sent by a certain subordinate node can be correctly analyzed on the uplink channel:
if the central node can correctly analyze a frame header sent by a certain slave node on an uplink channel, the slave node is considered to compete for the channel successfully, information such as identity information and channel occupying time of the slave node is analyzed from the frame header, the channel occupying time of the slave node is recorded, and a busy confirmation downlink notification frame is sent in the next notification period;
if the central node fails to correctly analyze the frame header sent by a certain slave node on the uplink channel, the central node considers that no slave node on the uplink channel is sending a data frame, and sends an idle non-acknowledgement downlink notification frame in the next notification period;
(5) the central node judges whether the uplink data frame of the slave node is sent completely according to the recorded channel occupying time of the slave node:
if the recorded time of the slave node occupying the channel is expired, the uplink data frame of the slave node is considered to be sent completely;
if the recorded time of the slave node occupying the channel is not expired, the uplink data frame of the slave node is considered not to be sent completely;
(6) the central node determines the type of the downlink announcement frame sent in the next announcement cycle according to whether the uplink data frame of a certain subordinate node is sent completely and whether the uplink data frame is received correctly:
if the uplink data frame of the slave node is not sent completely, a busy confirmation downlink notification frame is sent in the next notification period;
if the uplink data frame of the slave node is sent completely and the uplink data frame is received correctly, sending an idle confirmation downlink notification frame in the next notification period;
if the uplink data frame of the slave node is sent completely but the uplink data frame is not received correctly, sending a busy non-acknowledgement downlink notification frame in the next notification period;
(7) the subordinate node which does not finish sending the uplink data frame analyzes the downlink notification frame and judges whether the competition channel is successful:
if the downlink notification frame is a busy acknowledgement downlink notification frame, the slave node considers that the channel competition is successful, and continues to send the rest of the uplink data frame in the notification period;
if the downlink notification frame is an idle non-acknowledgement downlink notification frame, the slave node considers that the channel competition is failed, the sent uplink data frame conflicts, the sending of the uplink data frame is immediately stopped, and retransmission is waited according to the backoff rule;
(8) and (3) the channel competition is successful, and the slave node which finishes the sending of the uplink data frame analyzes the downlink notification frame and judges whether the sending of the uplink data frame is successful:
if the downlink notification frame is an idle confirmation downlink notification frame, the slave node considers that the current uplink data frame is successfully sent;
if the downlink notification frame is a busy non-acknowledgement downlink notification frame, the slave node considers that the current uplink data frame is failed to be sent, and resends the current uplink data frame in the notification period.
2. The method of claim 1, wherein the downlink channel is divided in time into a plurality of consecutive and non-overlapping time segments in (1) according to the following two conditions:
firstly, the subordinate node can correctly receive and analyze the downlink notification frame;
secondly, the central node can correctly receive and analyze the head of the uplink data frame.
3. The method of claim 1 wherein said downlink advertisement frame in (2) comprises a channel busy and idle status field and a slave node transmission acknowledgement field.
4. The method of claim 1, wherein the "idle non-acknowledgement" downlink advertisement frame in (2), (4) and (7) means that the channel busy idle status field is idle, and the slave node transmits the acknowledgement field without acknowledgement information.
5. The method as claimed in claim 1, wherein the "busy acknowledgement" downlink advertisement frame in (4), (6) and (7) means that the channel busy/idle status field is busy, and the slave node transmission acknowledgement field contains the corresponding slave node identity information and acknowledgement character ACK.
6. The method of claim 1, wherein the "idle acknowledgement" downlink advertisement frame in (6) and (8) means that the channel busy/idle status field is idle, and the slave node transmission acknowledgement field contains corresponding slave node identity information and an acknowledgement character ACK.
7. The method of claim 1, wherein the "busy not acknowledge" downlink advertisement frame in (6) and (8) means that the channel busy/idle status field is busy, and the transmission acknowledge field of the slave node contains the corresponding slave node identity information and the not acknowledge character NACK.
8. The method according to claim 1, wherein the header of the upstream data frame in (3) carries the identity information of each slave node and the occupied channel time of the frame, and the header part can be independently analyzed by the central node independently from the payload part.
9. The method of claim 1, wherein the time when the slave node starts to transmit the uplink data frame in (3) is based on the time when the slave node receives and analyzes the downlink advertisement frame, and the slave node cannot transmit the uplink data frame until receiving the downlink advertisement frame.
10. The method of claim 1, wherein the identity information of the slave node in (3) includes a user ID and a user MAC address in various forms.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110022487.3A CN112888081B (en) | 2021-01-08 | 2021-01-08 | Multiple access method based on fast feedback mechanism |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110022487.3A CN112888081B (en) | 2021-01-08 | 2021-01-08 | Multiple access method based on fast feedback mechanism |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112888081A CN112888081A (en) | 2021-06-01 |
| CN112888081B true CN112888081B (en) | 2022-08-30 |
Family
ID=76047241
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110022487.3A Active CN112888081B (en) | 2021-01-08 | 2021-01-08 | Multiple access method based on fast feedback mechanism |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112888081B (en) |
Citations (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2007028550A (en) * | 2005-07-21 | 2007-02-01 | Toyota Central Res & Dev Lab Inc | Communication terminal device |
| CN101399833A (en) * | 2008-12-09 | 2009-04-01 | 中国人民解放军理工大学 | Hybrid media access control method based on collaborative collision decomposition |
| EP2106166A1 (en) * | 2008-03-26 | 2009-09-30 | THOMSON Licensing | Relaxed deterministic back-off method for medium access control |
| CN103051410A (en) * | 2013-01-25 | 2013-04-17 | 南京航空航天大学 | Method for enhancing utilization ratio of time slot of self-organization time division multiple access protocol |
| KR101484059B1 (en) * | 2013-09-17 | 2015-01-20 | 성균관대학교산학협력단 | Method and apparatus for high speed wlan using multi-rate aware partitioning and cooperative transmission |
| WO2017025004A1 (en) * | 2015-08-07 | 2017-02-16 | 中兴通讯股份有限公司 | Method and device for competing for access |
| CN107295566A (en) * | 2017-07-19 | 2017-10-24 | 北京航空航天大学 | It faces classification multiple access method and device with conflict avoidance in the car network of vacant lot |
| CN108616952A (en) * | 2018-03-23 | 2018-10-02 | 华南理工大学 | MAC layer data transmission method based on neighbor node collaboration communication in a kind of car networking |
| CN108696944A (en) * | 2018-03-15 | 2018-10-23 | 西安电子科技大学 | Data transmission method based on Quick-return ACK in a kind of wireless sensor network |
| CN108696945A (en) * | 2018-05-11 | 2018-10-23 | 西安空间无线电技术研究所 | A kind of accidental access method towards LEO satellite communication systems |
| CN111669789A (en) * | 2020-05-29 | 2020-09-15 | 西安空间无线电技术研究所 | Communication method and device suitable for satellite-ground link |
Family Cites Families (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102056324B (en) * | 2010-12-22 | 2013-02-06 | 中国人民解放军理工大学 | Cooperative carrier sense multiple access (CSMA) method based on token control conflict analysis |
| CN106304390A (en) * | 2015-06-05 | 2017-01-04 | 中兴通讯股份有限公司 | A kind of channel access method, website and system |
| EP3369281B1 (en) * | 2015-11-27 | 2020-07-29 | Huawei Technologies Co., Ltd. | Network nodes and methods thereof |
| CN109831831B (en) * | 2019-03-07 | 2022-03-04 | 西安电子科技大学 | Node admission method based on competition sequencing |
-
2021
- 2021-01-08 CN CN202110022487.3A patent/CN112888081B/en active Active
Patent Citations (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2007028550A (en) * | 2005-07-21 | 2007-02-01 | Toyota Central Res & Dev Lab Inc | Communication terminal device |
| EP2106166A1 (en) * | 2008-03-26 | 2009-09-30 | THOMSON Licensing | Relaxed deterministic back-off method for medium access control |
| CN101399833A (en) * | 2008-12-09 | 2009-04-01 | 中国人民解放军理工大学 | Hybrid media access control method based on collaborative collision decomposition |
| CN103051410A (en) * | 2013-01-25 | 2013-04-17 | 南京航空航天大学 | Method for enhancing utilization ratio of time slot of self-organization time division multiple access protocol |
| KR101484059B1 (en) * | 2013-09-17 | 2015-01-20 | 성균관대학교산학협력단 | Method and apparatus for high speed wlan using multi-rate aware partitioning and cooperative transmission |
| WO2017025004A1 (en) * | 2015-08-07 | 2017-02-16 | 中兴通讯股份有限公司 | Method and device for competing for access |
| CN107295566A (en) * | 2017-07-19 | 2017-10-24 | 北京航空航天大学 | It faces classification multiple access method and device with conflict avoidance in the car network of vacant lot |
| CN108696944A (en) * | 2018-03-15 | 2018-10-23 | 西安电子科技大学 | Data transmission method based on Quick-return ACK in a kind of wireless sensor network |
| CN108616952A (en) * | 2018-03-23 | 2018-10-02 | 华南理工大学 | MAC layer data transmission method based on neighbor node collaboration communication in a kind of car networking |
| CN108696945A (en) * | 2018-05-11 | 2018-10-23 | 西安空间无线电技术研究所 | A kind of accidental access method towards LEO satellite communication systems |
| CN111669789A (en) * | 2020-05-29 | 2020-09-15 | 西安空间无线电技术研究所 | Communication method and device suitable for satellite-ground link |
Non-Patent Citations (5)
| Title |
|---|
| Efficient Distributed Algorithms for Dynamic Access to Shared Multiuser Channels in SINR-Constrained Wireless Networks;Stepan Kucera等;《 IEEE Transactions on Mobile Computing》;20111025;全文 * |
| Enhanced Busy-Tone-Assisted MAC Protocol for Wireless Ad Hoc Networks;Ahmad Ali Abdullah等;《 2010 IEEE 72nd Vehicular Technology Conference - Fall》;20101004;全文 * |
| 一种基于实时优化思想的多址接入协议性能分析;何宏等;《电子与信息学报》;20060520(第05期);全文 * |
| 一种机载网络动态TDMA协议设计;韩勇等;《计算机工程与科学》;20100815(第08期);全文 * |
| 下一代WLAN中面向QoS/QoE的多址接入技术研究;周虎;《中国优秀博硕士学位论文全文数据库(博士)信息科技辑》;20180515;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112888081A (en) | 2021-06-01 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US6999441B2 (en) | Method and apparatus for contention management in a radio-based packet network | |
| US4672608A (en) | Multiple access communications system | |
| US8254975B2 (en) | Method for uplink access transmissions in a radio communication system | |
| EP1109356B1 (en) | Collision-free multiple access reservation scheme for burst communications using a plurality of frequency tones | |
| US8274992B2 (en) | Communication method for wireless lans | |
| US9577838B2 (en) | Device and method for multicast in wireless local access network | |
| EP3035767B1 (en) | Method, apparatus and system for channel access | |
| US20050025131A1 (en) | Medium access control in wireless local area network | |
| KR101162709B1 (en) | Distributed medium access scheduling with implicit ordering | |
| EP2485436A1 (en) | Communication method in a profinet communication system | |
| US20070165665A1 (en) | System and method for access control in wireless networks | |
| CN107645759B (en) | Response method and device for multicast data transmission | |
| EP3247165B1 (en) | Station (sta) | |
| CN108347788B (en) | Data concurrent transmission method based on Slotted-FAMA protocol and utilizing propagation delay | |
| Muir et al. | Supporting real-time multimedia traffic in a wireless LAN | |
| CN112888081B (en) | Multiple access method based on fast feedback mechanism | |
| WO2015074574A1 (en) | Power-line communication network channel access control method and system | |
| Garcia-Luna-Aceves et al. | Queue-sharing multiple access | |
| Muir et al. | Group allocation multiple access in single-channel wireless LANs | |
| CN112969241B (en) | Multi-user competition communication method | |
| Chao et al. | A reservation-based distributed MAC scheme for infrastructure wireless networks | |
| Garcia-Luna-Aceves et al. | ALOHA with queue sharing | |
| WO2018171501A1 (en) | Data transmission method and apparatus | |
| TWI817816B (en) | Method, apparatus, storage medium and program product for data transmission | |
| US20230189327A1 (en) | Wireless Device for Achieving Low Latency Transmission of Time-Sensitive Data |
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 |