CN109996342A - Channel resource allocation method and its equipment in wireless self-organization network - Google Patents
Channel resource allocation method and its equipment in wireless self-organization network Download PDFInfo
- Publication number
- CN109996342A CN109996342A CN201711497461.4A CN201711497461A CN109996342A CN 109996342 A CN109996342 A CN 109996342A CN 201711497461 A CN201711497461 A CN 201711497461A CN 109996342 A CN109996342 A CN 109996342A
- Authority
- CN
- China
- Prior art keywords
- node
- frame
- feedback
- noise ratio
- resource allocation
- 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.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 71
- 238000013468 resource allocation Methods 0.000 title claims abstract description 27
- 230000005540 biological transmission Effects 0.000 claims abstract description 64
- 230000002860 competitive effect Effects 0.000 claims description 11
- 230000011218 segmentation Effects 0.000 claims description 8
- 238000004590 computer program Methods 0.000 claims description 3
- 238000012546 transfer Methods 0.000 abstract description 2
- 230000004044 response Effects 0.000 description 21
- 238000010586 diagram Methods 0.000 description 12
- 101000741965 Homo sapiens Inactive tyrosine-protein kinase PRAG1 Proteins 0.000 description 6
- 102100038659 Inactive tyrosine-protein kinase PRAG1 Human genes 0.000 description 6
- 230000007246 mechanism Effects 0.000 description 5
- 101100465000 Mus musculus Prag1 gene Proteins 0.000 description 4
- 238000004891 communication Methods 0.000 description 3
- 238000007796 conventional method Methods 0.000 description 3
- 238000013461 design Methods 0.000 description 3
- 230000006870 function Effects 0.000 description 3
- 230000008569 process Effects 0.000 description 3
- 235000013399 edible fruits Nutrition 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 230000008713 feedback mechanism Effects 0.000 description 2
- 238000012795 verification Methods 0.000 description 2
- 241000208340 Araliaceae Species 0.000 description 1
- 235000005035 Panax pseudoginseng ssp. pseudoginseng Nutrition 0.000 description 1
- 235000003140 Panax quinquefolius Nutrition 0.000 description 1
- 230000003044 adaptive effect Effects 0.000 description 1
- 230000008901 benefit Effects 0.000 description 1
- 230000001413 cellular effect Effects 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 238000012790 confirmation Methods 0.000 description 1
- 238000001514 detection method Methods 0.000 description 1
- 235000008434 ginseng Nutrition 0.000 description 1
- 230000002452 interceptive effect Effects 0.000 description 1
- 239000011159 matrix material Substances 0.000 description 1
- 238000012544 monitoring process Methods 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
- 230000008439 repair process Effects 0.000 description 1
- 230000011664 signaling Effects 0.000 description 1
- 230000002195 synergetic effect Effects 0.000 description 1
- 239000013598 vector Substances 0.000 description 1
- 238000005303 weighing Methods 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/12—Arrangements for detecting or preventing errors in the information received by using return channel
- H04L1/16—Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
- H04L1/18—Automatic repetition systems, e.g. Van Duuren systems
- H04L1/1812—Hybrid protocols; Hybrid automatic repeat request [HARQ]
- H04L1/1816—Hybrid protocols; Hybrid automatic repeat request [HARQ] with retransmission of the same, encoded, message
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/12—Arrangements for detecting or preventing errors in the information received by using return channel
- H04L1/16—Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
- H04L1/18—Automatic repetition systems, e.g. Van Duuren systems
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/12—Arrangements for detecting or preventing errors in the information received by using return channel
- H04L1/16—Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
- H04L1/18—Automatic repetition systems, e.g. Van Duuren systems
- H04L1/1812—Hybrid protocols; Hybrid automatic repeat request [HARQ]
- H04L1/1819—Hybrid protocols; Hybrid automatic repeat request [HARQ] with retransmission of additional or different redundancy
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/04—Wireless resource allocation
-
- 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
- H04W72/00—Local resource management
- H04W72/20—Control channels or signalling for resource management
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/50—Allocation or scheduling criteria for wireless resources
- H04W72/54—Allocation or scheduling criteria for wireless resources based on quality criteria
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/50—Allocation or scheduling criteria for wireless resources
- H04W72/54—Allocation or scheduling criteria for wireless resources based on quality criteria
- H04W72/542—Allocation or scheduling criteria for wireless resources based on quality criteria using measured or perceived quality
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W74/00—Wireless channel access
- H04W74/08—Non-scheduled access, e.g. ALOHA
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W74/00—Wireless channel access
- H04W74/08—Non-scheduled access, e.g. ALOHA
- H04W74/0808—Non-scheduled access, e.g. ALOHA using carrier sensing, e.g. carrier sense multiple access [CSMA]
- H04W74/0816—Non-scheduled access, e.g. ALOHA using carrier sensing, e.g. carrier sense multiple access [CSMA] with collision avoidance
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04B—TRANSMISSION
- H04B7/00—Radio transmission systems, i.e. using radiation field
- H04B7/02—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas
- H04B7/022—Site diversity; Macro-diversity
- H04B7/026—Co-operative diversity, e.g. using fixed or mobile stations as relays
-
- 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
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Quality & Reliability (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses the channel resource allocation methods and its equipment in a kind of wireless self-organization network.Wherein, first node issues trigger frame to second node, and in trigger frame, first node sends frame to first node in earliest time slot from the maximum second node of Signal to Interference plus Noise Ratio according to the size of the Signal to Interference plus Noise Ratio of the channel between first node and second node.Using the present invention, data re-transmission can be improved is properly received probability, also can improve data transfer reliability, effectively reduce the time delay of data transmission.
Description
Technical field
The present invention relates to the channel resource allocation methods in a kind of wireless self-organization network, also relate to corresponding channel
Resource allocation apparatus belongs to wireless communication technology field.
Background technique
Currently, for the data packet retransmission in mobile Ad hoc network, it is thus proposed that the technical idea of cooperative retransmission, specifically
There are following three kinds of methods.
First method is the neighbor discovery packet of direct link when destination node is retransmitted using nack message requirement
Exchange, and occurring to retransmit the data packet when data packet receives wrong (detecting NACK).This method does not account for data packet
The reason of error of transmission.If data packet receives the channel matter that mistake is not due to direct link between source node and destination node
Caused by amount difference, but due to other reasons (such as generating serious error of transmission due to conflicting or interfering) caused by, that
Successful re-transmission can be carried out using direct link at this time, cooperative retransmission need not be carried out.And in the method, source is had received
Those of node DATA data packet and nack message adjacent node can all participate in cooperation transmission automatically, do not account for node selection and ask
Topic.However at this point, unnecessary many nodes participate in cooperative retransmission, therefore a large amount of Internet resources will be wasted.
Second method is that the handling capacity of multihop network is improved by the re-transmission of adjacent node.However, this method is chosen
Receiving node of the node nearest apart from final purpose node as current transmission, therefore, even if there is multiple nodes to can be carried out association
It transmits, also only selects wherein some node progress data re-transmission.It can be seen that this method only selects a node by data packet
It is transmitted to destination node, does not ensure that data packet can be properly transferred to destination node by the node.
The third method combines data packet retransmission with user collaboration.When destination node receives data packet and by anti-
When feedforward information (i.e. NACK) requires re-transmission, collaboration retransmission node have received from selection by monitoring packet switch information
Those of DATA frame and NACK frame node will all participate in retransmitting automatically.But this method still has following shortcoming:
(1) cooperation biography can be participated in automatically by having received those of source node DATA data packet and nack message adjacent node all
It is defeated.At this point, each collaboration retransmission node is not aware that the number of nodes for participating in cooperation transmission, and the transmission power of each collaboration retransmission node
All voluntarily choose.In this way, each node all can may send data packet with biggish power (is not necessarily to so big function in fact
Rate), cause the power consumption of node to increase.(2) channel state information and cooperative retransmission of the hypothesis destination node to collaboration retransmission node
The channel of node to destination node is identical, the consistency without considering RF channel.But actually in wireless Ad Hoc
In net, the inconsistency of RF channel is than more serious in cellular network, therefore this method is difficult to realize relevant merging in receiving end,
It is difficult to ensure the gain of multiple node cooperative retransmissions.
Summary of the invention
Primary technical problem to be solved by this invention is to provide the channel resource point in a kind of wireless self-organization network
Method of completing the square.
Another technical problem to be solved by this invention is to provide the channel resource point in a kind of wireless self-organization network
With equipment.
For achieving the above object, the present invention uses following technical solutions:
According to a first aspect of the embodiments of the present invention, the channel resource allocation side in a kind of wireless self-organization network is provided
Method distributes time slot to second node for first node, and this method comprises the following steps:
The first node issues trigger frame to the second node,
In the trigger frame, the first node is according to the channel between the first node and the second node
The size of Signal to Interference plus Noise Ratio is sent in the earliest time slot to the first node from the maximum second node of Signal to Interference plus Noise Ratio
Frame.
Wherein more preferably, the first node sets Signal to Interference plus Noise Ratio threshold value, by the first node and second section
The Signal to Interference plus Noise Ratio of channel between point is divided into different zones,
Signal to Interference plus Noise Ratio is bigger, and the second node corresponding with the Signal to Interference plus Noise Ratio sends the frame in more early time slot.
Wherein more preferably, the time slot is divided into competitive stage and feedback stage,
In the competitive stage, the DIFS time, followed by competition window before this,
In the feedback stage, the second node sends the frame.
Wherein more preferably, after the DIFS of the time slot, by feeding back waiting time, the second node just starts to send out
The frame is sent,
The transmission waiting time is determined by the Signal to Interference plus Noise Ratio between the second node and the first node.
Wherein more preferably, if time slot 1 sorts to time slot X according to Signal to Interference plus Noise Ratio from big to small, the transmission waiting
Time are as follows:
Twait=(m+n) × slotmini
Wherein, total section of the Signal to Interference plus Noise Ratio is divided into M sections, is subdivided into N number of cell in described M sections of each section
Section；slotminiIt is the smallest time slot units in self-organization network, m=1,2 ... M, n=1,2 ... N, the Signal to Interference plus Noise Ratio are got over
Greatly, then corresponding m value is smaller, and corresponding n value is smaller.
Wherein more preferably, the competition window length are as follows: CW=(M+N) × slotmini,
Wherein, total section of the Signal to Interference plus Noise Ratio is divided into M sections, is subdivided into N number of cell in described M sections of each section
Section；slotminiIt is the smallest time slot units in self-organization network.
Wherein more preferably, the trigger frame is used to limit the structure of time slot that the second node is sent, including feedback slot
Number and feedback slot provide field.
Wherein more preferably, the structure of time slot further comprises SINR segmentation regulation.
Wherein more preferably, the first node first sends clear data packet announcement frame and NDP frame, then sends the triggering
Frame.
Wherein more preferably, the SINR segmentation regulation field includes segments, each section of start-stop point and each section of subsegment
Number；
The feedback slot provides that field includes the rule of competition window length, feedback time length and feedback latencies
It is fixed.
According to a second aspect of the embodiments of the present invention, the channel resource allocation provided in a kind of wireless self-organization network is set
It is standby, time slot is distributed to second node for first node；Wherein, which includes processor and memory,
It is stored with computer program in the memory, together with the processor, the equipment is made to execute following operation:
The first node issues trigger frame to the second node,
In the trigger frame, the first node is according to the channel between the first node and the second node
The size of Signal to Interference plus Noise Ratio sends frame to the first node in earliest time slot from the maximum second node of Signal to Interference plus Noise Ratio.
For the present invention in wireless self-organization network, destination node receives letter caused by the data of multiple source nodes simultaneously
Number superposition problem；And dynamics of channels variation greatly, does not have the problem of channel reciprocity, mentions between destination node and source node
A kind of effective channel resource competition mechanism is gone out.Using the present invention, data re-transmission can be improved is properly received probability, also can
The time delay of data transmission is effectively reduced in the reliability of improve data transfer.
Detailed description of the invention
Fig. 1 is the smart collaboration repeating method schematic diagram of wireless self-organization network；
Fig. 2 is the time diagram of the smart collaboration repeating method of wireless self-organization network；
Fig. 3 is the flow diagram of the smart collaboration repeating method of wireless self-organization network；
Fig. 4 is the flow diagram of the smart collaboration repeating method of purpose node；
Fig. 5 is the frame structure schematic diagram of retransmission mode trigger frame in the present invention；
Fig. 6 is the frame structure schematic diagram of feedback request trigger frame；
Fig. 7 is the feedback slot structural schematic diagram in feedback request trigger frame；
Fig. 8 is the frame structure schematic diagram of feedback response frame；
Fig. 9 is the frame structure schematic diagram for retransmitting starting frame；
Figure 10 is the frame structure schematic diagram of cooperative retransmission ACK frame；
Figure 11 is the structural schematic diagram of channel resource allocation equipment (destination node).
Specific embodiment
Detailed specific description is carried out to technology contents of the invention in the following with reference to the drawings and specific embodiments.
For the data packet retransmission demand in mobile Ad hoc network, present invention firstly provides a kind of smart collaboration re-transmission sides
Method.In the method, the reason of destination node analysis mistake in data packet reception mistake, and provide a kind of intelligence re-transmission association
View.The Protocol Design new NACK-Retransmission retransmission mode trigger frame " is retransmitted with a field in the frame
Mode " (with a bit indication: 0: source node retransmits, 1: multiple node cooperative retransmissions).In this way, when sending node or neighbouring section
Point receives NACK-Retransmission retransmission mode trigger frame, can automatically choose correct transmission method.
Moreover, " multi-node collaboration re-transmission " mode of being directed to, in order to overcome the shortcoming of existing collaboration retransmission method, this hair
Bright to devise new cooperative retransmission agreement and collaboration retransmission method, particular content includes: that (1) devises new CQI
(Channel Quality Indicator) and CSI (Channel Status Information) feedback request trigger frame, and
It is sent by destination node: to make destination node can determine that the number of users and cooperation transmission method of participation cooperation transmission, devising CQI
Trigger frame is requested with CSI feedback, feeds back CQI and CSI for the adjacent node with preferable channel condition (CQI/SINR higher)
(between source node that highest node of CQI will forward ACK to source node for information and its CQI information between source node
Information)；(2) new CQI and CSI feedback response frame are devised, for adjacent node feedback CQI and CSI information；(3) cooperation weight
Pass the selection of node and the design of repeating method: after destination node receives the CQI and CSI feedback response frame of adjacent node,
Determine optimal collaboration retransmission node number, select optimal collaboration retransmission node, determine each node optimal launching technique (including
Transmission power, transmitting weighted value, sending time advance value etc.), it then sends the cooperative retransmission comprising above- mentioned information and starts frame；
(4) each collaboration retransmission node carries out cooperative retransmission: after each node receives cooperative retransmission starting frame, starting in frame according to retransmitting
Specified information, according to specified parameter (including transmission power, transmitting weighted value, sending time advance value, etc.) send data
Packet.In this way, the data packet that each node is sent there will be maximum diversity to merge gain at destination node, data are greatlyd improve
The detection probability of packet；(5) transmission of ACK information: after destination node is received correctly the data packet of cooperative retransmission, first will
" retransmitting ACK frame ", which is sent to some collaboration retransmission node, (has optimal channel condition, also referred to as between the node and source node
Cooperative node), then the collaboration retransmission node " will retransmit ACK frame " and be forwarded to source node.The intelligence retransmission protocol can be greatly
That improves re-transmission data packet is properly received probability, to improve the overall performance of network.The intelligence repeating method was both applicable in
In the re-transmission of data packet segmentation, and it is suitable for the re-transmission that data packet is not segmented.
Above-mentioned adaptive collaboration retransmission method can adaptively choose following number according to the reason that data packet receives mistake
According to retransmission mode: (1) being retransmitted by source node；Or (2) multi-node collaboration retransmits.Then, it is retransmitted for multi-node collaboration, this
Invention further provides a kind of multi-node collaboration repeating method, includes the following steps: (1) to determine which adjacent node can join
With cooperative retransmission, devises CSI and CQI feedback requests trigger frame.Moreover, being defined in feedback request trigger frame dry based on letter
The feedback mechanism made an uproar than SINR enables those of Signal to Interference plus Noise Ratio SINR high node that CSI and CQI information are preferentially fed back to purpose section
Point.(2) destination node determines the number of nodes for participating in cooperative retransmission according to the feedback information of node, and determines which node participates in association
It retransmits.Moreover, according to a certain criterion (such as: emission maximum diversity, maximum ratio transmission, etc.) determine participate in retransmit each cooperation
Transmission power, transmitting weighted value, the sending time of retransmission node shift to an earlier date (TA) value, etc..(3) cooperative retransmission starting frame is devised,
And destination node sends cooperative retransmission starting frame and each collaboration retransmission node is notified to retransmit data packet.(4) each collaboration retransmission node is received
Maximum point can be obtained at destination node end in this way according to the information re-transmission data packet indicated in frame to cooperative retransmission starting frame
Diversity gain.(5) after destination node, which is received correctly, retransmits data packet, ACK information will be sent.This method can obtain maximum
Diversity gain, the specific steps are as follows:
Step 1:RTS is sent
As shown in Figure 1, sending RTS (Request To destination node D when source node S competition to channel uses chance
Send it) wraps.The RTS packet includes transmitting terminal address, receiving end address, sends data time, and RTS sends the information such as power.
Step 2:CTS is sent
After destination node D receives RTS packet, CTS (Clear To Send) packet is sent to source node S.The CTS packet
Including transmitting terminal address, receiving end address, data time is sent, RTS sends the information such as power.
Step 3:DATA packet is sent
After source node S receives CTS packet, data packet Data is sent to destination node D.Data packet include transmitting terminal address,
Receiving end address sends data time, and Data packet sends the information such as power.
Step 4: according to data packet error reason, selecting retransmission mode
Destination node D receives the data packet from source node S.If destination node D is properly received data packet
Data then sends an ACK confirmation message to source node S.If destination node D is not properly received the number of source node S transmission
According to packet, then smart collaboration repeating method provided by the present invention is used.
Illustrate smart collaboration repeating method provided by the present invention below with reference to Fig. 2~Figure 10.
As shown in Figure 2 to 4, according to the data packet from source node S received, destination node D uses conventional method
The reason of judging data packet error, for example whether being error caused by the channel condition between source node and destination node.Such as
Fruit is not that is, the channel condition between source node and destination node is good enough, then selects source node retransmission mode (mode 1)；Such as
Fruit is then to select cooperative retransmission mode (mode 2).Then, NACK retransmission mode trigger frame is formed according to the retransmission mode of selection,
And it sends.Then, source node or adjacent node adaptively choose retransmission mode according to retransmission mode trigger frame.
No matter which kind of retransmission mode is used, destination node is all that the frame is sent in the form of broadcast, i.e. the neighbour of destination node
Nearly node or source node can receive, and the processing mode after only receiving is different.Adjacent node receives retransmission mode
After trigger frame, if it find that the transmission mode field in the frame is " source node re-transmission " (value is 0), then it is not involved in cooperative retransmission；
If it find that transmission mode is " cooperative retransmission " (value is 1), then it is actively engaged in re-transmission, and prepare to receive from destination node
CSI feedback requests trigger frame.
Two kinds of retransmission modes are specifically described below.
Mode 1: source node retransmits (retransmission mode field value is 0)
Channel condition between source node and destination node is preferable, and only for example following factors cause the reception of data frame wrong
Accidentally: 1. causing data packet since the transmission power of data frame is too low and receive mistake, or 2. since destination node receives number
According to when collided.If it is reason 1. caused by data frame reception mistake, then destination node can notify source node to increase
Send power；If it is reason 2. caused by data frame receipt mistake, then destination node passes through NACK-
Retransmission retransmission mode trigger frame notifies source node to send power without increasing when retransmitting.
Mode 2: adjacent node cooperation transmission (retransmission mode field value is 1)
Channel condition between source node and destination node is poor, and one side source node is transmitted several times may also can not be just
It really unpacks, another aspect source node possibly can not correctly demodulate the nack message of destination node transmission.At this moment purpose section is just needed
Point notifies adjacent node in NACK-Retransmission retransmission mode trigger frame, needs to carry out cooperative retransmission.
Step 5: destination node generates and sends retransmission mode trigger frame
According to the retransmission mode selected in previous step, destination node generates retransmission mode trigger frame.
In the present invention, novel NACK-Retransmission retransmission mode triggering frame structure (see Fig. 5) not only includes frame control
System, duration, sending node address, destination node address, error data packet number, TP (transmission power) adjustment, PNACK(hair
The transmission power for sending NACK frame to use) and the fields such as FCS (verification), further include " retransmission mode " field:
Retransmission mode (Retransmission Mode) field can use a bit indication, and there are two value, one is 0,
Indicate source node retransmission mode；One is 1, indicates cooperative retransmission mode.
PNACKField is that destination node sends the transmission power used when NACK frame.
Step 5A sends the NACK-Retransmission weight that retransmission mode field is 0 (that is, source node retransmission mode)
Arq mode trigger frame passes through transmission power adjustment message (the TP adjustment Δ P) word being arranged in retransmission mode trigger frame
How section, notice source node adjust transmission power when data retransmit.Retransmission mode trigger frame is transmitted directly to by destination node
Source node is not necessarily to cooperative retransmission, enters step 6.
Step 5B sends the retransmission mode trigger frame that retransmission mode field is 1 (that is, cooperative retransmission mode), saves when sending
Point or adjacent node receive NACK-Retransmission retransmission mode trigger frame, can automatically choose correct re-transmission side
Method, into next step step 7.
Step 6: receiving the re-transmission data packet from source node
When " retransmission mode " in NACK-Retransmission retransmission mode trigger frame is that source node retransmits, show
Data packet is retransmitted by source node.At this point, source node receives NACK-Retransmission retransmission mode trigger frame, it will
Its transmission power is adjusted according to " transmission power " specified in NACK-Retransmission retransmission mode trigger frame, is sent out again
Send data packet.
Destination node receives the data packet that source node is retransmitted, and ACK acknowledgement frame is sent after being properly received data packet.When neighbouring
After node listens to ACK frame, its DATA frame listened to will be abandoned.
Step 7: sending feedback request trigger frame
When the retransmission mode in NACK-Retransmission retransmission mode trigger frame is " multi-node collaboration re-transmission ",
Show that data packet is retransmitted the requirement that destination node is not achieved and correctly demodulates by source node, needs to be assisted using adjacent node at this time
It retransmits.
The cooperative retransmission parameter of the node and each node that participate in cooperative retransmission to can determine that destination node, a side of the invention
Face devises CQI and CSI feedback requests trigger frame, enables adjacent node feedback channel information, for destination node selection ginseng
With the node of re-transmission；On the other hand, the mechanism for devising new time slotted competitive channel resource, makes CQI/SINR higher neighbouring
Node priority feedback its CQI and CSI.Using the design of these two aspects, it can make have preferable channel condition (that is, and purpose
CQI/SINR higher between node) adjacent node priority feedback CQI and CSI information and its between source node CQI letter
Breath (that highest node of CQI, will forward ACK information to source node between source node), allows destination node preferentially to select these
Adjacent node participates in cooperative retransmission.
Specifically, as shown in Fig. 2, destination node first sends clear data packet announcement frame (NDP-A, null data
Packet announcement) and NDP frame, then send feedback request trigger frame (Trigger).Later, adjacent node passes through
Feedback frame (feedback frame) comes feedback channel CSI and CQI information.Finally, destination node is fed back according to each adjacent node
CSI and CQI information determine participate in cooperative retransmission node and repeating method.
Wherein, feedback request trigger frame (Trigger) defines the structure of time slot of feedback, specifically as shown in fig. 6, not only wrapping
The fields such as frame control, duration, destination node address and verification (FCS) are included, further include " feedback slot number ", " SINR points
Section regulation " and " feedback slot regulation " field.Wherein, " SINR segmentation regulation " field include segments M, each section of start-stop point with
And the information such as each section subsegment number N；" feedback slot regulation " field includes competition window length, feedback time length and feedback etc.
The information such as the regulation to the time.
In order to allow the higher adjacent node of CQI/SINR preferentially to send, CQI and CSI information is fed back, invention provides for bases
In the time slotted competition feedback mechanism of CQI, the corresponding relationship in the section CQI and feedback slot, as shown in Figure 7.Since CQI is root
It is obtained according to SINR, the two has corresponding relationship, so being only illustrated by taking SINR as an example in following explanation.
In feedback slot structure shown in the figure, according to Signal to Interference plus Noise Ratio SINR threshold T H0,TH1……TH5(TH0> TH1…
> TH5), from big to small, by the feedback response frame arrangement of adjacent node to time slot 1, time slot 2 ... time slot X (X=6 in figure).Often
A feedback slot is divided into competitive stage and feedback stage.In the competitive stage, before this when DCF Interframe Space (DIFS)
Between, followed by competition window.Feedback information is sent in feedback stage adjacent node.
By feedback waiting time after each frame DIFS, specific adjacent node to be feedback just starts to send feedback letter
Breath.Feedback waiting time is determined by the Signal to Interference plus Noise Ratio SINR between the adjacent node and destination node.
Assuming that total SINR is divided into M section, each section SINR is further divided into N number of subinterval.At this point, contention window
Mouth length may be configured as:
CW=M × slotmini+N×slotmini (1)
Assuming that the SINR value between adjacent node and destination node to be feedback is located at n-th of m-th of section of SINR
In subinterval, then in order to make node priority feedback CQI and the CSI information of SINR high, the feedback waiting time of the node is arranged
Are as follows:
Twait=(m+n) × slotmini (2)
Wherein, it is divided into M sections according to total section of Signal to Interference plus Noise Ratio SINR, each section i is subdivided into N number of small in M sections of section
Section；It divides M sections of Signal to Interference plus Noise Ratio threshold T h and meets Thi,n=(Thi-1-Thi)；slotminiWhen being the smallest in self-organization network
Gap unit.Wherein, m=1,2 ... M, n=1,2 ... N, Signal to Interference plus Noise Ratio SINR is bigger, then m value is smaller, and n value is smaller (to repair
After changing formula, Signal to Interference plus Noise Ratio is bigger, and m is smaller, and feedback waiting time is shorter).Therefore, according to formula (2) it is recognised that letter is dry
It makes an uproar bigger than SINR, feedback waiting time is smaller (that is, the feedback waiting time of the node of CQI high is designed shorter), is easier to
The chance of feedback information is sent to destination node in acquisition.To realize the node priority feedback CQI and CSI that make CQI/SINR high
Information.
It will appreciated by the skilled person that formula (1) and formula (2) can also have alternative:
CW=M × slotmini (1A)
Twait=m × slotmini (2A)
In addition, if time slot 1 to time slot X according to Signal to Interference plus Noise Ratio SINR (or CQI information) from small to large come sort (that is,
SINR arrow is reversed in Fig. 7), that is, meet TH0< TH1... < TH5, then if the SINR of a certain adjacent node is located at m area
N-th subregion can then be calculated using the following equation feedback waiting time:
Twait=(M-m+1) × slotmini+(N-n+1)×slotmini (2B)
As it can be seen that the maximum adjacent node of Signal to Interference plus Noise Ratio SINR between destination node, the time slotted competition based on CQI are anti-
Infeed mechanism can be assigned to time slot 0, and feed back that waiting time Twait is most short, so being the earliest neighbouring section for sending feedback
Point.
It should be noted that the mechanism of time slotted competitive channel resource is not limited to feedback request triggering provided by the present invention
Frame.It can be applied to the channel resource allocation in wireless self-organization network, so that the good node of channel condition preferentially distributes letter
Road resource.The mechanism of time slotted competitive channel resource provided by the present invention should be described above when channel resource allocation
" feedback waiting time " can be various control frames " sending waiting time ", be not limited to feedback waiting time.
Step 8: destination node receives feedback response frame
It after adjacent node receives feedback request trigger frame, synchronizes, estimates the channel of adjacent node and destination node
Status information CSI and CQI calculate its time difference for receiving timing RX and transmission timing TX, determination feeds back CQI in which time slot
And CSI, and feedback waiting time.
Specifically, being requested after adjacent node receives CSI and CQI feedback request trigger frame using CSI and CQI feedback
The frame originating point information of trigger frame synchronizes, and estimates its SINR/CQI and CSI between destination node according to the frame originating point information
Information.This is conventional method, is not described in detail.
According to its SINR/CQI between destination node estimated, adjacent node can be according to feedback request trigger frame
In feedback slot structural information (SINR segmentation regulation, feedback slot regulation etc.), judge that the SINR of adjacent node belongs to Fig. 7
Shown in which time slot (i.e. should that time slot feed back CQI and CSI, send feedback response frame), also according to formula (2) calculate
Waiting time is fed back out.
As for the calculating of its time difference for receiving timing RX and transmission timing TX, the CSI and CQI sent from destination node is anti-
Synchronization signal in feedback request trigger frame, which, which can determine, receives timing STA_RX_t.Assuming that the adjacent node to
The transmission timing that destination node sends CSI and CQI feedback response frame is STA_TX_t, then the reception timing RX of the adjacent node with
The time difference (STA_RX_TXtimedifference) of transmission timing TX calculates as follows:
STA_RX_TXtimedifference=STA_RX_t-STA_TX_t, (3)
The feedback waiting time that adjacent node is calculated according to it, in the feedback response frame sending time slots that it is determined, using anti-
Response frame (as shown in Figure 8) is presented by its SINR/CQI and CSI information between destination node, and its between source node
SINR/CQI information feeds back to destination node.
Feedback response frame is as shown in figure 8, include following information: destination node address, the duration, retransmission node address,
The time difference of CQI information, reception timing RX and transmission timing TX between CQI information and CSI information and source node.Wherein, it retransmits
Node address is exactly the address for sending the adjacent node of the feedback response frame；CQI information and CSI information are to send feedback response frame
Adjacent node estimation its CQI and CSI information between destination node；CQI information between source node refers to that transmission is anti-
Present its CQI information between source node of the adjacent node estimation of response frame.
Defined feedback slot structure, receives from neighbouring section when destination node is according to its generation feedback request trigger frame
The feedback response frame of point.
Step 9: destination node selectes collaboration retransmission node, determines collaboration retransmission method, and forms re-transmission starting frame
In this step, the hair that destination node determines the node for participating in retransmitting, determines collaboration retransmission method and each node
Send timing advance value.
Destination node determines optimal according to the information in the feedback response frame of each node in conjunction with the size for retransmitting data packet
Collaboration retransmission node and repeating method (transmission power, transmitting weighting coefficient etc. when being retransmitted including each node), such as Fig. 9 institute
Show.
The cooperation transmission method of (such as LTE system) can be used in conventional wireless communication system in collaboration retransmission method, includes
Maximum ratio transmission method, maximum space diversity transmitting method etc..
Such as, it is assumed that it has chosen L node and participates in cooperation transmission, and using conventional maximum ratio transmission method.Assuming that L
Node may be expressed as: to the channel matrix (CSI) between destination node
In formula, αrd,lAnd hrd,lRespectively indicate the large scale path loss and channel coefficients of synergistic link l.When using maximum
When than launching technique, transmitting weight vectors should are as follows:
Therefore, destination node can determine the transmitting weighting coefficient and transmitting function of each collaboration retransmission node according to formula (5)
Rate.Here conventional method can be used.
Destination node is described further below and determines timing advance (TA) of each collaboration retransmission node when retransmitting data packet
The process of value.
When multiple collaboration retransmission nodes retransmit data packet to destination node simultaneously, it is desirable that different collaboration retransmission nodes are sent
Signal achieve the goal node time be alignment and same Xiang Xiangjia, such destination node could be to the weight from different nodes
Communication number carries out relevant merging, reaches maximum merging gain.Therefore, destination node needs to suitably control each cooperative retransmission section
Point makes the signal of different STA while reaching destination node in timing advance (TA) value for retransmitting data packet.That is, purpose
Timing advance (TA) value that each collaboration retransmission node retransmits data packet is notified each collaboration retransmission node by node.
Firstly, destination node receives the CQI of each node with after CSI feedback response frame, estimated according to the leading part of frame head
Its CSI and SINR/CQI between each node is counted, and is determined according to the synchronization signal in frame head and receives timing D_STA_RX_t.
Assuming that the transmission timing that destination node sends feedback request trigger frame (Trigger) is D_STA_TX_t.At this point, destination node
Receive time difference (the D_STA_RX_TX time between timing D_STA_RX_t and transmission timing D_STA_TX_t
Difference it) calculates are as follows:
D_STA_RX_TX time difference=D_STA_RX_t-D_STA_TX_t (6)
According to formula (3) and (6), the transmission timing that each collaboration retransmission node retransmits data packet shifts to an earlier date (TA, time
Advance) the determination method of value is as follows:
TA=(STA_RX_t-STA_TX_t)+(D_STA_RX_t-D_STA_TX_t) (7)
In collaboration retransmission method provided by the present invention, compared with the channel quality between destination node and source node
Difference, source node possibly can not receive the ACK information of destination node transmission at this time.Therefore, destination node needs participating in cooperating
In the node of re-transmission, the best node of channel quality between determining and source node forwards destination node from the node to source node
ACK information.To reach this purpose, destination node can be believed according to its SINR/CQI between source node of each node feeding back
Breath, the best node of channel quality between determination and source node.
Step 10: destination node sends cooperative retransmission to selected retransmission node and starts frame
At this point, the retransmission mode triggering frame information for surely receiving destination node since source node is different, destination node need
Will be according to the feedback information of each collaboration retransmission node, that maximum collaboration retransmission node of CQI between determining and source node, and
It notifies that node source node of passing on retransmits the data packet of mistake in cooperative retransmission starting frame, and terminates in correct re-transmission
Afterwards, data packet has been carried out correct re-transmission by the destination node source node that also to be passed on by the node.
Finally, to make each collaboration retransmission node retransmit data packet to destination node, destination node is to each collaboration retransmission node
It sends cooperative retransmission and starts frame, as shown in Figure 9.The field that cooperative retransmission starting frame includes has: source node address, destination node
Location, the repeating method of collaboration retransmission node TX1, the repeating method ... of node TX2, the repeating method of collaboration retransmission node P, ACK
The address of forward node, data packet sending time retransmit duration etc..Wherein, the repeating method of collaboration retransmission node includes:
The address of each collaboration retransmission node and its transmission power emit weighting coefficient and transmission timing advance value TA.
The address of each collaboration retransmission node, the feedback response frame being initially received by destination node according to it, selection can
The node that can reach is jumped by 2 between destination node and source node, as collaboration retransmission node, then destination node should
Address of the address of selected multiple collaboration retransmission nodes as each collaboration retransmission node in cooperative retransmission starting frame.Letter speech
It, destination node receives the time order and function of feedback response frame according to it, 2 hop nodes more early received is selected, as cooperation weight
Node is passed, the address of corresponding collaboration retransmission node is included in cooperative retransmission starting frame.
The transmission power and transmitting weighting coefficient of each collaboration retransmission node, pass through its selected cooperative retransmission by destination node
The CSI information in feedback response frame that node is sent, is calculated, such as be calculated using formula (5).
Transmission timing advance value TA is calculated in step 9 according to formula (7) by destination node.
Step 11: destination node sends cooperative retransmission ACK frame after correctly demodulation retransmission data packet
After each adjacent node receives the cooperative retransmission starting frame of destination node transmission, according in cooperative retransmission mode trigger frame
Collaboration retransmission node address, judge whether the node participates in retransmitting.If cooperative retransmission starts the ground in frame comprising the node
Location, then the node participates in retransmitting as collaboration retransmission node；If cooperative retransmission, which starts, does not include the address of node in frame,
The node is not involved in cooperative retransmission.
If being judged as collaboration retransmission node, which, which further starts in frame according to cooperative retransmission, is advised
The fixed node transmitting power, transmitting weighting coefficient and transmission timing advance value etc., retransmit data packet to destination node.
Finally, destination node, which receives demodulation, obtains the data packet that cooperation is retransmitted.If destination node correctly demodulates association
Make the data packet retransmitted, just sends cooperative retransmission to ACK forward node (the best node of the channel quality selected in step 9)
ACK information.
Cooperative retransmission ACK frame structure is as shown in Figure 10, address, frame control, duration, hair including ACK forward node
Send node address, destination node address, error data packet number and FCS.Wherein, the address of ACK forward node is exactly in step
The best address of node of the channel quality selected in rapid 9 by destination node.
Moreover, when the node specified in cooperative retransmission ACK, ACK forward node, after receiving cooperative retransmission ACK, with regard to Xiang Yuanjie
Point forwarding cooperative retransmission ACK indicates that data packet successfully retransmits to destination node to source node.
The specific structure of the channel resource allocation equipment of node 100 as a purpose is described below.Figure 11 is the channel resource
The structural schematic diagram of distributing equipment.The equipment includes the devices such as processor, memory and interface.Wherein, it is stored in memory
Computer program, for making the equipment be able to carry out the process of 1~step 11 of abovementioned steps, to realize together with processor
The smart collaboration repeating method of wireless self-organization network provided by the present invention.
In the present invention, retransmission mode trigger frame, feedback request trigger frame, feedback response frame, cooperative retransmission starting frame and
Cooperative retransmission ACK frame belongs to control frame, is transmitted using the custom interface that the control frame in wireless self-organization network uses.
In addition, retransmitting data frame is transmitted using the custom interface that the control frame in wireless self-organization network uses.
The present invention by increase additional CQI obtain process (including CQI feedback requests trigger frame, CQI feedback response frame,
Cooperative retransmission starts frame etc.), bring following technical performance gain:
(a) in collaboration retransmission node selection, the node that channel condition is best has been selected, and optimal number of nodes has been determined
And node.In addition, being determined that optimal launching technique (including transmission power, sends weighting coefficient and sending time for each node
Lead etc.).In this way, ensure that the signal that each node retransmits while reaching destination node, and it ensure that maximum merging increases
Benefit.As it can be seen that present invention greatly enhances what data retransmitted to be properly received probability, the reliability of data transmission is also improved.
(b) in existing cooperation transmission method, the re-transmission signal of each node is difficult to reach destination node simultaneously, and is difficult to reality
Now it is concerned with and merges.Therefore, the transmission performance of data packet is difficult to ensure.In contrast, although the present invention increases some signalings and opens
Pin, but greatly improve data re-transmission be properly received probability, and improve data transmission reliability.In this way, this method
By guaranteeing the reliability of data transmission, the time delay of data transmission is significantly reduced.
In short, compared with prior art, present invention greatly enhances what data retransmitted to be properly received probability, improve data
The reliability of transmission.In this way, effectively reducing the time delay of data transmission, delay sensitive business more can be suitably used for.
Above in wireless self-organization network provided by the present invention channel resource allocation method and its equipment carry out
Detailed description.For those of ordinary skill in the art, appoint under the premise of without departing substantially from essence of the present invention to what it was done
What obvious change, the infringement for all weighing composition to the invention patent will undertake corresponding legal liabilities.
Claims (15)
1. the channel resource allocation method in a kind of wireless self-organization network distributes time slot to second node for first node,
It is characterized by:
The first node issues trigger frame to the second node,
In the trigger frame, the first node is dry according to the letter of the channel between the first node and the second node
It makes an uproar the size of ratio, sends frame to the first node in the earliest time slot from the maximum second node of Signal to Interference plus Noise Ratio.
2. channel resource allocation method as described in claim 1, it is characterised in that:
The first node sets Signal to Interference plus Noise Ratio threshold value, by the letter of the channel between the first node and the second node
It is dry to make an uproar than being divided into different zones,
Signal to Interference plus Noise Ratio is bigger, and the second node corresponding with the Signal to Interference plus Noise Ratio sends the frame in more early time slot.
3. channel resource allocation method as claimed in claim 2, it is characterised in that:
The time slot is divided into competitive stage and feedback stage,
In the competitive stage, the DIFS time, followed by competition window before this,
In the feedback stage, the second node sends the frame.
4. channel resource allocation method as claimed in claim 3, it is characterised in that:
After the DIFS time of the time slot, by feeding back waiting time, the second node just starts to send the frame,
The transmission waiting time is determined by the Signal to Interference plus Noise Ratio between the second node and the first node.
5. channel resource allocation method as claimed in claim 4, it is characterised in that:
If time slot 1 sorts to time slot X according to Signal to Interference plus Noise Ratio from big to small, transmission waiting time are as follows:
Twait=(m+n) × slotmini
Wherein, total section of the Signal to Interference plus Noise Ratio is divided into M sections, is subdivided into N number of away minor segment in described M sections of each section；
slotminiIt is the smallest time slot units in self-organization network, m=1,2 ... M, n=1,2 ... N, the Signal to Interference plus Noise Ratio is bigger, then
Corresponding m value is smaller, and corresponding n value is smaller.
6. channel resource allocation method as claimed in claim 4, it is characterised in that:
The competition window length are as follows: CW=(M+N) × slotmini,
Wherein, total section of the Signal to Interference plus Noise Ratio is divided into M sections, is subdivided into N number of away minor segment in described M sections of each section；
slotminiIt is the smallest time slot units in self-organization network.
7. channel resource allocation method as described in claim 1, it is characterised in that:
The trigger frame is used to limit the structure of time slot that the second node is sent, including feedback slot number and feedback slot rule
Determine field.
8. channel resource allocation method as claimed in claim 7, it is characterised in that:
The structure of time slot further comprises SINR segmentation regulation.
9. channel resource allocation method as claimed in claim 8, it is characterised in that:
The first node first sends clear data packet announcement frame and NDP frame, then sends the trigger frame.
10. channel resource allocation method as described in claim 1, it is characterised in that:
The SINR segmentation regulation field includes segments, each section of start-stop point and each section of subsegment number；
The feedback slot provides that field includes the regulation of competition window length, feedback time length and feedback latencies.
11. the channel resource allocation equipment in a kind of wireless self-organization network distributes time slot to second node for first node,
It is characterized by comprising processors and memory；
It is stored with computer program in the memory, together with the processor, the equipment is made to execute following operation:
The first node issues trigger frame to the second node,
In the trigger frame, the first node is dry according to the letter of the channel between the first node and the second node
It makes an uproar the size of ratio, sends frame to the first node in earliest time slot from the maximum second node of Signal to Interference plus Noise Ratio.
12. channel resource allocation equipment as claimed in claim 11, it is characterised in that:
The processor makes first node setting Signal to Interference plus Noise Ratio threshold value, by the first node and the second node it
Between the Signal to Interference plus Noise Ratio of channel be divided into different zones,
Signal to Interference plus Noise Ratio is bigger, and the second node corresponding with the Signal to Interference plus Noise Ratio sends the frame in more early time slot.
13. channel resource allocation equipment as claimed in claim 12, it is characterised in that:
The time slot is divided into competitive stage and feedback stage,
In the competitive stage, the DIFS time, followed by competition window before this,
In the feedback stage, the second node sends the frame.
14. channel resource allocation equipment as claimed in claim 13, it is characterised in that:
The processor makes the second node, after the DIFS time of the time slot, by feeding back waiting time, just starts
The frame is sent,
The transmission waiting time is determined by the Signal to Interference plus Noise Ratio between the second node and the first node.
15. channel resource allocation equipment as claimed in claim 13, it is characterised in that:
The trigger frame is used to limit the structure of time slot that the second node is sent, including feedback slot number, SINR segmentation rule
Fixed and feedback slot provides field.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711497461.4A CN109996342B (en) | 2017-12-31 | 2017-12-31 | Channel resource allocation method and device in wireless self-organizing network |
| PCT/CN2018/095515 WO2019128192A1 (en) | 2017-12-31 | 2018-07-12 | Channel resource allocation method and device thereof in wireless self-organizing network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711497461.4A CN109996342B (en) | 2017-12-31 | 2017-12-31 | Channel resource allocation method and device in wireless self-organizing network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109996342A true CN109996342A (en) | 2019-07-09 |
| CN109996342B CN109996342B (en) | 2023-05-23 |
Family
ID=67063005
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201711497461.4A Active CN109996342B (en) | 2017-12-31 | 2017-12-31 | Channel resource allocation method and device in wireless self-organizing network |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN109996342B (en) |
| WO (1) | WO2019128192A1 (en) |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101801026A (en) * | 2009-02-11 | 2010-08-11 | 华为技术有限公司 | Method, device and system for selecting collaboration retransmission node |
| CN101868030A (en) * | 2010-05-25 | 2010-10-20 | 华南理工大学 | Distributed wireless network wireless resource distribution method |
| CN102026299A (en) * | 2009-09-14 | 2011-04-20 | 华为技术有限公司 | Method and system for consulting time frequency resource, and node equipment |
| CN106714115A (en) * | 2016-12-21 | 2017-05-24 | 厦门大学 | Security message single-hop cooperative broadcasting method applied to Internet of Vehicles |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101212285B (en) * | 2007-12-25 | 2010-08-18 | 中国人民解放军理工大学 | Opportunity synergy based automatic retransmission request method |
| CN103326769B (en) * | 2013-06-18 | 2017-02-08 | 北京航空航天大学 | Multi-node cooperative transmission method and system |
-
2017
- 2017-12-31 CN CN201711497461.4A patent/CN109996342B/en active Active
-
2018
- 2018-07-12 WO PCT/CN2018/095515 patent/WO2019128192A1/en active Application Filing
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101801026A (en) * | 2009-02-11 | 2010-08-11 | 华为技术有限公司 | Method, device and system for selecting collaboration retransmission node |
| CN102026299A (en) * | 2009-09-14 | 2011-04-20 | 华为技术有限公司 | Method and system for consulting time frequency resource, and node equipment |
| CN101868030A (en) * | 2010-05-25 | 2010-10-20 | 华南理工大学 | Distributed wireless network wireless resource distribution method |
| CN106714115A (en) * | 2016-12-21 | 2017-05-24 | 厦门大学 | Security message single-hop cooperative broadcasting method applied to Internet of Vehicles |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109996342B (en) | 2023-05-23 |
| WO2019128192A1 (en) | 2019-07-04 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109995477A (en) | Smart collaboration repeating method and its equipment and system in wireless self-organization network | |
| US8155013B2 (en) | Synchronized multi-link transmission in an ARQ-enabled multi-hop wireless network | |
| US9780842B2 (en) | Mobile device assisted coordinated multipoint transmission and reception | |
| US9143450B2 (en) | Communication system and method for assisting with the transmission of TCP packets | |
| EP1253736A2 (en) | Data link transmission control for mobile communications | |
| KR101153970B1 (en) | Routing method for wireless mesh networks and wireless mesh network system using the same | |
| US8352822B2 (en) | Method and arrangement relating to communications network | |
| JP2008524898A (en) | Multicast communication system with power control | |
| CN102821361B (en) | Communication equipment, communication means and communication system | |
| CN102123020A (en) | Distributed cooperative multiple access method and system providing guarantee for quality of service | |
| US9007978B2 (en) | Method and apparatus for improved multicast service | |
| US20070195813A1 (en) | Multicast packet transmitting method of wireless network | |
| Antonopoulos et al. | Effect of realistic channel conditions on the energy efficiency of network coding-aided cooperative MAC protocols | |
| CN102123011A (en) | Medium access control (MAC) method and device of multirate cooperation | |
| CN114303411B (en) | TS operation for RTA session management | |
| CN102821428B (en) | Communication equipment, communication means and communication system | |
| CN108259132B (en) | Bidirectional cooperative access method based on self-adaptive multi-decoding | |
| Villalon et al. | ARSM: a cross-layer auto rate selection multicast mechanism for multi-rate wireless LANs | |
| Wang et al. | Supporting MAC layer multicast in IEEE 802.11 n: Issues and solutions | |
| US7613191B2 (en) | Packet transmission method of wireless network | |
| CN102378390A (en) | Fast collaborative access control method and fast collaborative access control system | |
| EP2844000A1 (en) | Cooperative relaying for dynamic networks | |
| CN116546447A (en) | Improved BLE Mesh routing method based on neighbor information | |
| CN109996342A (en) | Channel resource allocation method and its equipment in wireless self-organization network | |
| Santos et al. | A new ARQ mechanism for multicast traffic over IEEE 802.11 WLANs |
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 |