CN106060949B - Co-channel full duplex Radio Link dispatching method while based on TDMA - Google Patents
Co-channel full duplex Radio Link dispatching method while based on TDMA Download PDFInfo
- Publication number
- CN106060949B CN106060949B CN201610344863.XA CN201610344863A CN106060949B CN 106060949 B CN106060949 B CN 106060949B CN 201610344863 A CN201610344863 A CN 201610344863A CN 106060949 B CN106060949 B CN 106060949B
- Authority
- CN
- China
- Prior art keywords
- node
- receiving node
- main receiving
- link
- scheduling
- 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
- 238000000034 method Methods 0.000 title claims abstract description 28
- 238000011144 upstream manufacturing Methods 0.000 claims abstract description 29
- 230000001629 suppression Effects 0.000 claims abstract description 6
- 230000005540 biological transmission Effects 0.000 claims description 5
- 230000008569 process Effects 0.000 claims description 5
- 238000012546 transfer Methods 0.000 claims description 5
- 230000005764 inhibitory process Effects 0.000 claims description 4
- 230000002401 inhibitory effect Effects 0.000 claims description 2
- 230000007246 mechanism Effects 0.000 abstract description 9
- 238000004891 communication Methods 0.000 description 9
- 238000005516 engineering process Methods 0.000 description 8
- 238000010586 diagram Methods 0.000 description 4
- 101100172132 Mus musculus Eif3a gene Proteins 0.000 description 2
- 230000008901 benefit Effects 0.000 description 2
- 230000002860 competitive effect Effects 0.000 description 2
- 238000001228 spectrum Methods 0.000 description 2
- 230000008859 change Effects 0.000 description 1
- 230000007812 deficiency Effects 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 230000008030 elimination Effects 0.000 description 1
- 238000003379 elimination reaction Methods 0.000 description 1
- 230000003993 interaction Effects 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
- 230000002829 reductive effect Effects 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 230000036967 uncompetitive effect Effects 0.000 description 1
Classifications
-
- 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
- H04W74/00—Wireless channel access
- H04W74/02—Hybrid access
-
- 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/56—Allocation or scheduling criteria for wireless resources based on priority criteria
- H04W72/566—Allocation or scheduling criteria for wireless resources based on priority criteria of the information or information source or recipient
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
- Time-Division Multiplex Systems (AREA)
Abstract
Co-channel full duplex Radio Link dispatching method while the invention discloses one kind based on TDMA.It mainly realizes step are as follows: 1. distribution time slots；2. choosing main receiving node；3. sending conflict inhibits information；4. record conflict suppression result；5. judging whether the scheduling of node is suppressed according to conflict suppression result；The service conditions in situation and subqueue is inhibited to be scheduled judgement 6. combining；7. by symmetric links are first dispatched, then dispatching downstream links, the sequence for finally dispatching upstream link completes the scheduling of full-duplex link.The present invention is using TDMA as channel access mode, make full duplex node without competition can ensuring escapement from confliction access channel, introducing business subqueue mechanism and three kinds of schedulable Linktypes, effectively increase while the flexibility and success rate of co-channel full duplex link scheduling.
Description
Technical field
The present invention relates to fields of communication technology, further relate to one of wireless communication field and are based on time division multiple acess skill
Co-channel full duplex Radio Link dispatching method while art (time division multiple access, TDMA).The invention
On the basis of conventional half duplex communication, realize that ensuring escapement from confliction increases a schedulable link, and then improve slot efficiency
And network throughput.
Background technique
For traditional self-organizing network in order to realize duplex communication, node mainly uses frequency division duplex (FDD) and time division duplex
(TDD) operating mode, but this frequency dividing and the technology of timesharing and unrealized full-duplex communication truly.In recent years,
With the development of antenna technology and Digital Signal Processing, the self-interference elimination of node is possibly realized, this is but also same simultaneously
Channel full duplex technology starts the research hotspot as wireless communication field.In ad hoc networks, using co-channel full duplex simultaneously
Technology can realize the communication link of both direction on the same channel, reduce frequency in traditional dual-mode or time interval resource
Expense alleviates frequency spectrum resource problem in short supply to effectively improve spectrum efficiency.
Currently, applying the distributed wireless networks of co-channel full duplex technology simultaneously, channel for realization full-duplex communication
Access way mostly be the CSMA/CA mechanism based on IEEE 802.11, but use this mechanism expend turn-on time generally compared with
Long, channel utilization is lower, and especially when network node density is larger, these problems are become apparent.
Patent " full duplex MAC association in wireless network based on RTS/CTS principle of the Xian Electronics Science and Technology University in its application
View " proposes in (number of patent application: CN201310644293.2, publication number: CN103619072A) a kind of is held using RTS/CTS
The full duplex multiple access method of hand process realization two-way link and one way link.This method interior joint uses traditional C/S MA/CA
Avoidance mechanism competitive channel, the node of channel is successfully accessed after keeping out of the way to destination node and sends RTS information, destination node
Which determined node to send CTS information to according to the destination address of the data grouping of this node, then basis connects surrounding neighbors
RTS the and CTS information received is kept out of the way, and the influence of concealed terminal is avoided.But the shortcoming that this method still has
It is that the time for using the competition mechanism kept out of the way channel access being expended is long, and channel utilization is low, only realizes two kinds of
The flexibility of link, link scheduling is not high, and since storing data is grouped node by the way of single queue, link scheduling at
Power is not high, fails to give full play of while co-channel full duplex technology is applied to the advantage of cordless communication network.
In the patent of its application, " data of the full duplex MAC based on channel contention and centralized dispatching are handed over for Shanghai Communications University
Change method " propose in (number of patent application: CN201510474339.X, publication number: CN105142185A) it is a kind of based on complete double
The method for interchanging data of the AP network of the mechanism such as work channel contention and full duplex centralized dispatching.Network node is divided into this method
AP node and ordinary node, AP node start data packet by transmission contention and the ordinary node in coverage area are notified to send contention
Request, while ordinary node sends service requesting information and interference level information to AP node, AP node utilizes full duplex energy
Power makes requests reply at once, to reduce the collision problem of concealed terminal；The scheduler module of subsequent AP node is according to the letter of collection
Breath carries out the judgement of data packet full duplex quantity forwarded and sequence.But the shortcoming that this method still has is, node is logical
Random competition is crossed to obtain the mode of channel, so that the utilization rate of channel is lower, the mechanism that AP node takes competition to reply is not yet
It can avoid the collision problem between node completely, and AP node will the service requesting information of multiple nodes and dry based on the received
It disturbs information and is scheduled judgement, the expense expended is larger.
Summary of the invention
It is complete with frequency while proposing one kind based on TDMA it is an object of the invention to overcome above-mentioned the deficiencies in the prior art
Duplex radio links dispatching method.Present invention improves over the channel access modes of co-channel full duplex wireless network simultaneously, use
Uncompetitive TDMA mode accesses channel；Conflict suppression mechanism is introduced, the collision rate of link scheduling is reduced；It joined business
Subqueue mechanism increases the number of links that can be scheduled for；It joined three kinds of schedulable Linktypes, improve link scheduling can
It can property and flexibility.
The present invention realizes that the thinking of above-mentioned purpose is: the host node of corresponding specific time slot randomly selects main receiving node, main
Whether receiving node sends conflict and inhibits information, inhibit the reception condition of information to judge the scheduling of node by other by conflict
The grouping for being sent to different nodes is stored in different subqueues by the inhibition of node, by first dispatching symmetric links, then is dispatched down
Link is swum, the priority orders for finally dispatching upstream link realize the scheduling of full-duplex link.
Realize that specific step is as follows for the object of the invention:
(1) booting node accesses channel:
(1a) uses TDMA mode, and network is that booting node distributes unique time slot within the scope of double bounce；
(1b) all nodes broadcast neighbor information and slot occupancy information in the duties time slot of oneself；
(2) main receiving node is chosen:
(2a) time slot scheduling initial time, host node check all business subqueues, filter out the son of wherein all non-emptys
Queue；
(2b) host node selects a non-empty subqueue at random, using the receiving node being grouped in selected non-empty subqueue as
Main receiving node；
(3) host node sends solicited message RTS frame to main receiving node；
(4) node judges oneself for main receiving node:
Destination address node identical with local address in received solicited message RTS frame judges reception section based on oneself
Point；
(5) conflict process of inhibition is initiated:
(5a) main receiving node sends conflict to neighbors around and inhibits information CTS frame；
Other nodes of (5b) in addition to host node, which listen to and receive the conflict that around main receiving node is sent, inhibits information CTS
Frame；
(6) record conflict suppression result:
The conflict that (6a) can be parsed correctly or can not correctly be parsed when node receives inhibits information CTS frame, then by it
The value of internal CTS_FLAG flag bit is set as 1；
(6b) any conflict inhibits information CTS frame when node is not received by, then by its internal CTS_FLAG flag bit
Value be set as 0；
(7) judge whether the value of the CTS_FLAG flag bit inside main receiving node is equal to 0, if so, thening follow the steps
(8), step (15) otherwise, are executed；
(8) whether the subqueue for judging to correspond to host node in the subqueue of main receiving node is sky, if so, thening follow the steps
(9), step (10) otherwise, are executed；
(9) judge whether main receiving node has non-empty in other all subqueues in addition to the subqueue of corresponding host node
Subqueue otherwise, executes step (15) if so, thening follow the steps (12)；
(10) main receiving node sends symmetric links scheduling information SLR frame to host node；
(11) host node receives the symmetric links scheduling information SLR frame for carrying out autonomous receiving node, completes the tune of symmetric links
Degree executes step (21)；
(12) judge whether there are two hop nodes to be multiplexed current business time slot within the scope of main receiving node double bounce, if so,
It executes step (15), otherwise, executes step (13)；
(13) judge whether the corresponding receiving node of all non-empty subqueues of main receiving node is not all that the adjacent of host node is saved
Point otherwise, executes step (15) if so, thening follow the steps (14)；
(14) downstream links receiving node is chosen:
Main receiving node from receiving node be not the neighbors of host node non-empty subqueue in randomly select a sub- team
Column, using the corresponding receiving node of selected subqueue as the receiving node of downstream links, complete the scheduling of downstream links, hold
Row step (21)；
(15) main receiving node sends upstream link scheduling request information SLD frame to host node to request host node to be dispatched
Swim link；
(16) upstream link scheduling grant information ALR frame is broadcasted:
Host node receives the upstream link scheduling request information SLD frame that main receiving node is sent, and broadcasts to surroundings nodes
Upstream link scheduling grant information ALR frame；
(17) judgement receives whether the node of upstream link scheduling grant information ALR frame is main receiving node, if so,
It executes step (21), otherwise, executes step (18)；
(18) judge whether the CTS_FLAG flag bit of intra-node is equal to 0, if so, thening follow the steps (19), otherwise, hold
Row step (21)；
(19) judge to correspond in the subqueue of node host node subqueue whether non-empty, if so, then follow the steps (20),
Otherwise, step (21) are executed；
(20) data grouping is sent at random:
Node uses the method sent with probability P to send data grouping to host node in data slot initial time, completes
The scheduling of upstream link, wherein P indicates a value between 0 < P < 1；
(21) CTS_FLAG flag bit is removed:
Time slot scheduling finish time sets 0 for the CTS_FLAG flag bit of all intra-nodes；
(22) data packet transfer is initiated:
The sending node of the link of data slot initial time, host node and link scheduling stage successful dispatch is initiated simultaneously
Data packet transfer；
(23) current business time slot terminates.
Compared with the prior art, the present invention has the following advantages:
First, since the present invention accesses channel using traditional TDMA technology, overcomes prior art interior joint and pass through base
Conflict collision problem caused by the competitive way of CSMA/CA accesses channel, so that all nodes in the present invention can be at it
Lothrus apterus sends and receives data in assigned time slot, improves the speed and efficiency of access channel.
Second, since all neighbors that the present invention is node all distribute a business subqueue, overcome the prior art
In all neighbors share service queue, caused by the receiving node that service queue stem can only be grouped be scheduled
Problem is scheduled the present invention to the currently corresponding receiving node of all non-empty business subqueues, improves link
The success rate of scheduling.
Third, due to invention introduces three kinds of symmetric links, downstream links and upstream link schedulable Linktypes,
It overcomes and only realizes two kinds of schedulable Linktypes in the prior art, the problem for causing link scheduling flexibility not high, so that
The present invention can have more Linktypes when scheduling judges it can be selected that a possibility that improving link scheduling and flexibility.
Detailed description of the invention
Fig. 1 is flow chart of the invention；
Fig. 2 is three kinds of Linktype schematic diagrames of the invention；
Fig. 3 is TDMA frame structure figure of the invention.
Specific embodiment
With reference to the accompanying drawing, the present invention is described in further detail.
Referring to Fig.1, the implementation steps of the invention is described in further detail.
Step 1. booting node accesses channel.
Using TDMA mode, network is that booting node distributes unique time slot within the scope of double bounce.
All nodes broadcast neighbor information and slot occupancy information in the duties time slot of oneself.
Step 2. chooses main receiving node.
Time slot scheduling initial time, host node check all business subqueues, filter out the subqueue of wherein all non-emptys.
Host node refers to: fixed to occupy some business time-slot and actively initiate link scheduling and data transmission in this timeslot
Node.
Host node selects a non-empty subqueue at random, connects the receiving node being grouped in selected non-empty subqueue as master
Receive node.
Step 3. host node sends solicited message RTS frame to main receiving node.
Step 4. node judges oneself for main receiving node.
Destination address node identical with local address in received solicited message RTS frame judges reception section based on oneself
Point.
Step 5. initiates conflict process of inhibition.
Main receiving node sends conflict to neighbors around and inhibits information CTS frame.
Conflict inhibits information CTS frame to refer to: the frame for inhibiting it to send that main receiving node is broadcasted to neighbors avoids other
The transmission of node interferes the reception of main receiving node.
Other nodes in addition to host node, which listen to and receive the conflict that around main receiving node is sent, inhibits information CTS frame.
Step 6. record conflict suppression result.
Inhibit information CTS frame when node receives the conflict that can correctly parse or can not correctly parse, then it will be inside it
The value of CTS_FLAG flag bit be set as 1.
Inhibit information CTS frame when node is not received by any conflict, then by the value of its internal CTS_FLAG flag bit
It is set as 0.
Step 7. judges whether the value of the CTS_FLAG flag bit inside main receiving node is equal to 0, if so, thening follow the steps
8, otherwise, execute step 15.
Whether the subqueue that step 8. judges to correspond to host node in the subqueue of main receiving node is empty, if so, executing
Step 9, otherwise, step 10 is executed.
It is non-that step 9. judges whether main receiving node has in other all subqueues in addition to the subqueue of corresponding host node
Otherwise empty subqueue, executes step 15 if so, thening follow the steps 12.
The main receiving node of step 10. sends symmetric links scheduling information SLR frame to host node.
Step 11. host node receives the symmetric links scheduling information SLR frame for carrying out autonomous receiving node, completes symmetric links
Scheduling executes step 21.
Referring to the symmetric links schematic diagram of Fig. 2 (a), symmetric links refer to: main receiving node initiates data point to host node
The link that group is sent.Node A in Fig. 2 (a) is a host node, and node B is the main receiving node that node A chooses, main reception
Node B to the link that host node A is sent be symmetric links.
Step 12. judges whether have two hop nodes to be multiplexed current business time slot within the scope of main receiving node double bounce, if so,
15 are thened follow the steps, otherwise, executes step 13.
Step 13. judge the corresponding receiving node of all non-empty subqueues of main receiving node whether be not all host node neighbour
Otherwise node, executes step 15 if so, thening follow the steps 14.
Step 14. chooses downstream links receiving node.
Main receiving node from receiving node be not the neighbors of host node non-empty subqueue in randomly select a sub- team
Column, using the corresponding receiving node of selected subqueue as the receiving node of downstream links, complete the scheduling of downstream links, hold
Row step 21.
Referring to the downstream links schematic diagram of Fig. 2 (b), downstream links refer to: main receiving node is to other in addition to host node
Neighbors initiates the link that data grouping is sent.Node A in Fig. 2 (b) is a host node, and node B is the master that node A chooses
Receiving node, node C be node B a neighbors, main receiving node B to the link that node C is sent be downstream links.
The main receiving node of step 15. sends upstream link scheduling request information SLD frame to host node to request host node tune
Spend upstream link.
Referring to the upstream link schematic diagram of Fig. 2 (c), upstream link refers to: except main receiving node in the neighbors of host node
Other outer nodes initiate the link that data grouping is sent to host node.Node A in Fig. 2 (c) is a host node, node B
For the main receiving node that node A chooses, node C is a neighbors of node A, and node C is to the link that host node A is sent
Upstream link.
Step 16. broadcasts upstream link scheduling grant information ALR frame.
Host node receives the upstream link scheduling request information SLD frame that main receiving node is sent, and broadcasts to surroundings nodes
Upstream link scheduling grant information ALR frame.
Step 17. judgement receives whether the node of upstream link scheduling grant information ALR frame is main receiving node, if
It is to then follow the steps 21, otherwise, executes step 18.
Step 18. judges whether the CTS_FLAG flag bit of intra-node is equal to 0, if so, 19 are thened follow the steps, otherwise,
Execute step 21.
Step 19. judge to correspond in the subqueue of node host node subqueue whether non-empty, if so, thening follow the steps
20, otherwise, execute step 21.
Step 20. sends data grouping at random.
Node uses the method sent with probability P to send data grouping to host node in data slot initial time, completes
Upstream link scheduling, wherein P indicates a value between 0 < P < 1.
Refer in the method that probability P is sent: the node for meeting all upstream link schedulable conditions selects at random between 0 to 1
It takes a value and is greater than compared with the 0 and value P less than 1 with pre-set one, it, can be to if selected value is less than P
Host node sends data grouping, otherwise, cannot send data grouping to host node.
Step 21. removes CTS_FLAG flag bit.
Time slot scheduling finish time sets 0 for the CTS_FLAG flag bit of all intra-nodes.
Step 22. initiates data packet transfer.
The sending node of the link of data slot initial time, host node and link scheduling stage successful dispatch is initiated simultaneously
Data packet transfer；
Step 23. current business time slot terminates.
Referring to Fig. 3, TDMA frame structure of the invention is described in further detail.
In Fig. 3, N number of multi-frame constitutes a frame period, each multi-frame is by a duties time slot and M business time-slot group
At.Wherein, duties time slot is for neighbor table and Time Slot Occupancy table between node within the scope of interaction double bounce, each business time-slot is again
It is divided into a time slot scheduling and a data slot, node completes the scheduling process of link in time slot scheduling, in data
In time slot, the transmission of array grouping is completed.
Claims (5)
1. one kind is based on co-channel full duplex Radio Link dispatching method while TDMA, include the following steps:
(1) booting node accesses channel:
(1a) uses TDMA mode, and network is that booting node distributes unique time slot within the scope of double bounce；
(1b) all nodes broadcast neighbor information and slot occupancy information in the duties time slot of oneself；
(2) main receiving node is chosen:
(2a) time slot scheduling initial time, host node check all business subqueues, filter out the subqueue of wherein all non-emptys；
(2b) host node selects a non-empty subqueue at random, connects the receiving node being grouped in selected non-empty subqueue as master
Receive node；
(3) host node sends solicited message RTS frame to main receiving node；
(4) node judges oneself for main receiving node:
Destination address node identical with local address in received solicited message RTS frame judges oneself for main receiving node；
(5) conflict process of inhibition is initiated:
(5a) main receiving node sends conflict to neighbors around and inhibits information CTS frame；
Other nodes of (5b) in addition to host node, which listen to and receive the conflict that around main receiving node is sent, inhibits information CTS frame；
(6) record conflict suppression result:
The conflict that (6a) can be parsed correctly or can not correctly be parsed when node receives inhibits information CTS frame, then will be inside it
The value of CTS_FLAG flag bit be set as 1；
(6b) any conflict inhibits information CTS frame when node is not received by, then by the value of its internal CTS_FLAG flag bit
It is set as 0；
(7) judge whether the value of the CTS_FLAG flag bit inside main receiving node is equal to 0, if so, (8) are thened follow the steps, it is no
Then, step (15) are executed；
(8) whether the subqueue for judging to correspond to host node in the subqueue of main receiving node is empty, if so, (9) are thened follow the steps,
Otherwise, step (10) are executed；
(9) judge whether main receiving node has the sub- team of non-empty in other all subqueues in addition to the subqueue of corresponding host node
Column otherwise, execute step (15) if so, thening follow the steps (12)；
(10) main receiving node sends symmetric links scheduling information SLR frame to host node；
(11) host node receives the symmetric links scheduling information SLR frame for carrying out autonomous receiving node, completes the scheduling of symmetric links, holds
Row step (21)；
The symmetric links refer to that main receiving node initiates the link that data grouping is sent to host node；
(12) judge whether there are two hop nodes to be multiplexed current business time slot within the scope of main receiving node double bounce, if so, executing
Step (15) otherwise executes step (13)；
(13) judge the corresponding receiving node of all non-empty subqueues of main receiving node whether be not all host node neighbors, if
It is to then follow the steps (14), otherwise, executes step (15)；
(14) downstream links receiving node is chosen:
Main receiving node from receiving node be not the neighbors of host node non-empty subqueue in randomly select a subqueue, will
Receiving node of the corresponding receiving node of selected subqueue as downstream links, completes the scheduling of downstream links, executes step
Suddenly (21)；
(15) main receiving node sends upstream link scheduling request information SLD frame to host node to request host node to dispatch upstream chain
Road；
The upstream link refers to that other nodes in the neighbors of host node in addition to main receiving node initiate number to host node
The link sent according to grouping；
(16) upstream link scheduling grant information ALR frame is broadcasted:
Host node receives the upstream link scheduling request information SLD frame that main receiving node is sent, and broadcasts upstream to surroundings nodes
Link scheduling License Info ALR frame；
(17) judgement receives whether the node of upstream link scheduling grant information ALR frame is main receiving node, if so, executing
Step (21) otherwise executes step (18)；
(18) judge whether the CTS_FLAG flag bit of intra-node is equal to 0, if so, thening follow the steps (19), otherwise, execute step
Suddenly (21)；
(19) judge to correspond in the subqueue of node host node subqueue whether non-empty, it is no if so, then follow the steps (20)
Then, step (21) are executed；
(20) data grouping is sent at random:
Node uses the method sent with probability P to send data grouping to host node in data slot initial time, completes upstream
The scheduling of link, wherein P indicates a value between 0 < P < 1；
(21) CTS_FLAG flag bit is removed:
Time slot scheduling finish time sets 0 for the CTS_FLAG flag bit of all intra-nodes；
(22) data packet transfer is initiated:
The sending node of the link of data slot initial time, host node and link scheduling stage successful dispatch initiates data simultaneously
Grouping transmission；
(23) current business time slot terminates.
2. according to claim 1 be based on co-channel full duplex Radio Link dispatching method while TDMA, it is characterised in that:
Host node described in step (2a) refers to, it is fixed occupy some business time-slot and actively initiate in this timeslot link scheduling with
The node that data are sent.
3. according to claim 1 be based on co-channel full duplex Radio Link dispatching method while TDMA, it is characterised in that:
Conflict described in step (5a) inhibits information CTS frame to refer to, the frame for inhibiting it to send that main receiving node is broadcasted to neighbors.
4. according to claim 1 be based on co-channel full duplex Radio Link dispatching method while TDMA, it is characterised in that:
Downstream links described in step (14) refer to that main receiving node initiates data grouping hair to other neighbors in addition to host node
The link sent.
5. according to claim 1 be based on co-channel full duplex Radio Link dispatching method while TDMA, it is characterised in that:
Refer to described in step (20) in the method that probability P is sent, meet the nodes of all upstream link schedulable conditions 0 to 1 it
Between randomly select a value and with pre-set one be greater than the 0 and value P less than 1 compared with, if selected value be less than P,
Then data grouping can be sent to host node, otherwise, data grouping cannot be sent to host node.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610344863.XA CN106060949B (en) | 2016-05-23 | 2016-05-23 | Co-channel full duplex Radio Link dispatching method while based on TDMA |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610344863.XA CN106060949B (en) | 2016-05-23 | 2016-05-23 | Co-channel full duplex Radio Link dispatching method while based on TDMA |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106060949A CN106060949A (en) | 2016-10-26 |
| CN106060949B true CN106060949B (en) | 2019-06-21 |
Family
ID=57176587
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610344863.XA Active CN106060949B (en) | 2016-05-23 | 2016-05-23 | Co-channel full duplex Radio Link dispatching method while based on TDMA |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106060949B (en) |
Families Citing this family (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106789716B (en) * | 2016-12-02 | 2019-08-13 | 西安电子科技大学 | The MAC layer array dispatching method of TDMA ad hoc network |
| CN108366432B (en) * | 2018-01-03 | 2020-07-14 | 上海交通大学 | Multi-user scheduling method and system for full-duplex cache relay system |
| WO2019157982A1 (en) * | 2018-02-14 | 2019-08-22 | 华为技术有限公司 | Method and device for relay transmission |
| CN109547148B (en) * | 2019-01-18 | 2019-11-15 | 西安电子科技大学 | Based on the dynamic time slot allocating method of service flow path in TDMA ad hoc network |
| CN113395148B (en) * | 2021-05-28 | 2022-07-26 | 西北工业大学 | MAC layer communication method based on asymmetric full-duplex radio network |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101296229A (en) * | 2008-06-10 | 2008-10-29 | 顾士平 | Device for implementing dynamic time-slot TDMA distribution |
| CN103731835A (en) * | 2014-01-10 | 2014-04-16 | 西安电子科技大学 | Multiple input multiple output medium access control (MIMO MAC) protocol method for achieving singlecast and broadcast |
| CN105050117A (en) * | 2015-07-10 | 2015-11-11 | 山东航天电子技术研究所 | Ad-hoc network communication method based on business type competition and coordination time division multiple access (TDMA) |
| CN105744641A (en) * | 2016-01-14 | 2016-07-06 | 南京航空航天大学 | Directional time-division link scheduling method applicable to wireless mesh network |
-
2016
- 2016-05-23 CN CN201610344863.XA patent/CN106060949B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101296229A (en) * | 2008-06-10 | 2008-10-29 | 顾士平 | Device for implementing dynamic time-slot TDMA distribution |
| CN103731835A (en) * | 2014-01-10 | 2014-04-16 | 西安电子科技大学 | Multiple input multiple output medium access control (MIMO MAC) protocol method for achieving singlecast and broadcast |
| CN105050117A (en) * | 2015-07-10 | 2015-11-11 | 山东航天电子技术研究所 | Ad-hoc network communication method based on business type competition and coordination time division multiple access (TDMA) |
| CN105744641A (en) * | 2016-01-14 | 2016-07-06 | 南京航空航天大学 | Directional time-division link scheduling method applicable to wireless mesh network |
Non-Patent Citations (1)
| Title |
|---|
| 基于干扰对齐的多用户全双工通信中干扰消除方法;谢显中;《北京邮电大学学报》;20151231;全文 |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106060949A (en) | 2016-10-26 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Rajandekar et al. | A survey of MAC layer issues and protocols for machine-to-machine communications | |
| CN106060949B (en) | Co-channel full duplex Radio Link dispatching method while based on TDMA | |
| CN108924945B (en) | A kind of cut-in method and device | |
| Bao et al. | Hybrid channel access scheduling in ad hoc networks | |
| KR101607377B1 (en) | channel access method and apparatus using the same in wireless local area network system | |
| CN106888051B (en) | Dynamic, multi-user cut-in method in indoor visible light communication system | |
| Kas et al. | A survey on scheduling in IEEE 802.16 mesh mode | |
| EP2191679B1 (en) | Method of communicating within a mesh network | |
| US20090207769A1 (en) | Method and apparatus for scheduling timing for communication between sensor nodes in wireless sensor network | |
| CN103718600A (en) | Signaling and procedure design for cellular cluster contending on license-exempt bands | |
| CN102695287A (en) | VANET (vehicular ad-hoc network) media access control method | |
| KR100970386B1 (en) | Method and apparatus for scheduling timing between sensor nodes of the Wireless Sensor Network | |
| Ali et al. | A Survey of MAC Protocols Design Strategies and Techniques in Wireless Ad Hoc Networks. | |
| Saadat et al. | License assisted access-WiFi coexistence with TXOP backoff for LTE in unlicensed band | |
| CN105917720B (en) | Wireless communications method, access point and website | |
| CN108834182A (en) | Wireless self-networking MAC layer channel access and method for obligating resource based on token ring | |
| CN106031268B (en) | Communication means, base station and user equipment | |
| CN102625367A (en) | Time slot optimized multichannel multiple-access control method in multi-hop Ad Hoc network | |
| Hu et al. | Efficient, flexible, and scalable inter-network spectrum sharing and communications in cognitive IEEE 802.22 networks | |
| Kiran et al. | Wi-Fi and LTE Coexistence in Unlicensed Spectrum | |
| Benslimane et al. | A new opportunistic MAC layer protocol for cognitive IEEE 802.11-based wireless networks | |
| Derakhshani et al. | Cognitive MAC designs: Background | |
| Sun et al. | Research on scheduling mechanism of control channel in 802.16 mesh mode | |
| CN103731835A (en) | Multiple input multiple output medium access control (MIMO MAC) protocol method for achieving singlecast and broadcast | |
| CN116192305B (en) | Channel access method, communication device, chip, storage medium and program product |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |