CN105142185A - Full-duplex MAC (Media Access Control) data exchange method based on channel collision and centralized scheduling - Google Patents
Full-duplex MAC (Media Access Control) data exchange method based on channel collision and centralized scheduling Download PDFInfo
- Publication number
- CN105142185A CN105142185A CN201510474339.XA CN201510474339A CN105142185A CN 105142185 A CN105142185 A CN 105142185A CN 201510474339 A CN201510474339 A CN 201510474339A CN 105142185 A CN105142185 A CN 105142185A
- Authority
- CN
- China
- Prior art keywords
- full duplex
- node
- full
- duplex
- data
- 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.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 28
- 238000005516 engineering process Methods 0.000 claims abstract description 10
- 230000005540 biological transmission Effects 0.000 claims description 33
- 239000011159 matrix material Substances 0.000 claims description 27
- 239000000203 mixture Substances 0.000 claims description 6
- 230000033228 biological regulation Effects 0.000 claims description 3
- 230000008878 coupling Effects 0.000 claims description 3
- 238000010168 coupling process Methods 0.000 claims description 3
- 238000005859 coupling reaction Methods 0.000 claims description 3
- 238000005457 optimization Methods 0.000 claims description 3
- 238000012790 confirmation Methods 0.000 abstract description 3
- 230000009897 systematic effect Effects 0.000 abstract 1
- 108700026140 MAC combination Proteins 0.000 description 16
- 230000007246 mechanism Effects 0.000 description 8
- 101100172132 Mus musculus Eif3a gene Proteins 0.000 description 6
- 238000012546 transfer Methods 0.000 description 6
- 230000008569 process Effects 0.000 description 5
- 230000009467 reduction Effects 0.000 description 5
- 230000011664 signaling Effects 0.000 description 5
- 230000007423 decrease Effects 0.000 description 4
- 238000013461 design Methods 0.000 description 4
- 238000011160 research Methods 0.000 description 4
- 239000012141 concentrate Substances 0.000 description 3
- 230000000694 effects Effects 0.000 description 3
- 238000004891 communication Methods 0.000 description 2
- 230000003247 decreasing effect Effects 0.000 description 2
- 238000010586 diagram Methods 0.000 description 2
- 238000002474 experimental method Methods 0.000 description 2
- 230000013011 mating Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 230000004913 activation Effects 0.000 description 1
- 230000015572 biosynthetic process Effects 0.000 description 1
- 238000006243 chemical reaction Methods 0.000 description 1
- 238000010835 comparative analysis Methods 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000001514 detection method Methods 0.000 description 1
- 238000011835 investigation Methods 0.000 description 1
- 230000001105 regulatory effect Effects 0.000 description 1
- 238000004088 simulation Methods 0.000 description 1
- 238000001228 spectrum Methods 0.000 description 1
- 230000007704 transition Effects 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W28/00—Network traffic management; Network resource management
- H04W28/02—Traffic management, e.g. flow control or congestion control
- H04W28/10—Flow control between communication endpoints
-
- 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
- H04W8/00—Network data management
- H04W8/02—Processing of mobility data, e.g. registration information at HLR [Home Location Register] or VLR [Visitor Location Register]; Transfer of mobility data, e.g. between HLR, VLR or external networks
- H04W8/04—Registration at HLR or HSS [Home Subscriber Server]
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Databases & Information Systems (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention relates to a full-duplex MAC (Media Access Control) data exchange method based on channel collision and centralized scheduling. Full-duplex channel collision and full-duplex centralized scheduling are organically combined in the method. The method comprises the following steps: performing full-duplex channel collision and information collection; performing full-duplex centralized scheduling and data exchange; and performing centralized confirmation of multiple data packets. Compared with the prior art, the full-duplex MAC data exchange method disclosed by the invention has the advantages that: full-duplex systematic characteristics are considered sufficiently; the full-duplex technology is utilized maximally; the user channel collision fairness is optimized; the throughput performance of a system is improved, etc.
Description
Technical field
The present invention relates to a kind of wireless communication technology field, especially relate to the method for interchanging data of a kind of full duplex MAC based on channel contention and centralized dispatching.
Background technology
Along with the further investigation of simultaneously co-channel full duplex technology in radio communication, physical layer link design based on full duplex can make the frequency spectrum resource utilization rate of system double, and the reverse link that also full duplex will be utilized to bring brings the lifting of system-level network throughput.Full duplex technology not only by reducing Channel Detection Time, reducing the time span of each rollback, thus can improve the throughput performance of system; But also significant impact will be produced to MAC layer and upper-layer protocol, system-level huge performance gain can be brought, than if to solve in hidden terminal problem in distributed network, multihop network end-to-end long time delay problem etc.
Research at present for full duplex MAC protocol is not also very deep, most research is simply promoted on the basis of CSMA/CA agreement, realize throughput performance by maximum using full duplex transmitting-receiving scheduling to promote, in fact still very low to the utilance of full-duplex channel.Existing document considers node and hides completely or the situation such as collision completely, and but do not consider the interference volume that each node occurs, can reduce channel capacity when the interference that appearance is certain, reality still realizes transmitting by reduction transmission rate.Consider interference level and adjust the full duplex MAC protocol of full duplex transmission speed, but owing to adopting centralized poll, network delay is relatively long when access user is more.In addition consider that full duplex system still exists part self-interference signal remaining, actual full duplex peak transfer rate is compared half-duplex and is had certain decline.
Summary of the invention
Object of the present invention is exactly the method for interchanging data providing a kind of full duplex MAC based on channel contention and centralized dispatching in order to overcome defect that above-mentioned prior art exists.
Object of the present invention can be achieved through the following technical solutions:
Based on a method for interchanging data of the full duplex MAC of channel contention and centralized dispatching, it is characterized in that, full-duplex channel contention and full duplex centralized dispatching organically combine by the method, comprising:
Full-duplex channel contention and information;
Full duplex centralized dispatching and exchanges data;
Many packets are concentrated and are confirmed.
Described full-duplex channel contention and information are:
1) channel contention module sends a contention by AP and starts packet, informs all nodes in AP coverage, in ensuing contention window, and transmitting channel contention request, content comprises the contention window slot length of unlatching;
2) each node transmitting channel contention request, AP then carries out full duplex at once and sends request reply packet, and completes associated traffic data and interference matrix information.
During described contention window, each node does not send business datum, and the business that only sending full duplex dispatching office needs sends request and interference level information.
The service data information that described AP not only needs node to send; Also need the interfere information collecting present node and other non-AP nodes, the interference level information collected is formed an interference level value matrix by AP.
Described interference level value matrix G=[G
j,k],
wherein make node N
jplace receives the signal strength signal intensity P from AP
jwith from node N
kinterference signal intensity I
k,j.
Described AP is receiving the head H DR of packet and after identifying its source node address, utilize full duplex technology to start transmission process rapidly and carry out the reply of full duplex contention, be designated as FDCTS, make channel be in busy condition, thus effectively reduce the collision of other concealed nodes.
Now, for concealed nodes N2, only during N1 launches HDR, channel is in the free time, because HDR part is very short, greatly reduces the probability of collision.Send owing to have employed full duplex, compare half-duplex RTS-CTS pattern, one is the reduction of control signal expense, and RTS-CTS transmitting time is reduced to original half, directly improves MAC channel contention efficiency; Two collision problems being the reduction of concealed terminal, decrease because collide the extra rollback that causes and wait for expense, indirectly promote MAC efficiency.Three is channel contentions, can comprise multiple packet in this node transmit queue, can significantly improve MAC efficiency.
Described contention window slot length calculates at the interstitial content of AP registration according in network.
In full duplex centralized dispatching, sent by AP half versus full-duplex, symmetric and unsymmetric full duplex sends, and at utmost utilizes full duplex send opportunity.Two large factors have been taken into full account in the present invention.One is consider node except hiding completely, completely except the situation such as collision, also contemplate each node and occur disturbing intermediate state.By reducing transmission rate, the transmitting under noisy condition still can be realized.Two is consider full duplex system still to there are part self-interference signal remnants, and actual full duplex peak transfer rate is compared half-duplex and had certain decline, and this is also the key factor affecting physical layer throughput performance.
Described full duplex centralized dispatching and exchanges data are:
First the data sending request composition AP receiving queue will collected from each node, and the data composition AP transmit queue that each node will be issued;
Then according to the interference matrix collected and rate matrix, determine which packet will full duplex send and each Packet Generation order and the transmission rate that adopts;
Finally dispatch situation be distributed to all register node and start exchanges data.
Described full duplex scheduling problem is converted into the NP optimization problem that is searched the shortest deadline T_C, and full duplex regulation goal is by making AP receiving queue and AP transmit queue form best full duplex coupling, making the deadline of packet-switching minimum;
Total following two constraints: constraints 1: node N sends to the transmission rate of AP to be fixing is maximum available bandwidth, owing to can offset its own transmission signal, AP total energy is correct receives this node signal;
Constraints 2:AP sends to the transmission rate of other nodes to need to adjust, and determines according to the most high interference levels value that node N causes.
Compared with prior art, the present invention considers the impact on system such as remaining of self-interference signal in disturbed condition in network topology and full duplex system, a kind of full duplex MAC protocol based on AP network is proposed, by mechanism such as full-duplex channel contention and full duplex centralized dispatching, further elevator system throughput performance.On the one hand by accidental channel contention, ensure the fairness of each user node channel access; Simultaneously AP can utilize full duplex technology to start a transmission process rapidly to carry out contention reply, make channel be in busy condition, thus effectively reduce the collision of other concealed nodes.On the other hand, except consideration node is completely hiding or collide completely, also consider to there is disturbed condition, by full duplex centralized dispatching knot modification sending order and AP full duplex transmission rate between node, carry out maximum using full duplex send opportunity, the throughput performance of elevator system.
Accompanying drawing explanation
Fig. 1 is the exchanges data flow chart of the full duplex MAC protocol that the present invention is based on channel contention and centralized dispatching;
Fig. 2 is full-duplex channel contention schematic diagram of the present invention;
Fig. 3 is full duplex centralized dispatching flow chart of the present invention;
Fig. 4 is the throughput performance comparison diagram of full duplex MAC protocol of the present invention and existing scheme.
Embodiment
Be described further below with reference to the technique effect of accompanying drawing to design of the present invention, concrete structure and generation, to understand object of the present invention, characteristic sum effect fully, but the present invention is not limited to following embodiment.
Fig. 1 is the packet-switching main-process stream based on the full duplex MAC protocol of channel contention and centralized dispatching in wireless network of the present invention, and concrete steps are as follows.
Step one: channel contention module sends a contention by AP and starts packet, informs all nodes in AP coverage, can in ensuing contention window, transmitting channel contention request, and content comprises the contention window slot length L of unlatching
max.Each node transmitting channel contention request, AP then at once full duplex send request and reply packet and avoid concealed nodes to collide, and complete associated traffic data and interference matrix information.
Step 2: scheduler module is according to collecting relevant information, determine which packet will full duplex send and each Packet Generation order and the transmission rate etc. that adopts, and by dispatch situation being distributed to all register node by data dispatching bag and starting exchanges data.
Step 3: carry out packet and concentrate confirmation, complete one and take turns packet-switching.
The present invention is as a kind of full duplex MAC protocol of contention type, and AP is used for channel contention by open one section of widow time, and period, each node did not send business datum, and the business that only sending full duplex dispatching office needs sends request and interference level information.Sending to obtain maximized full duplex, the service data information that scheduler module not only needs node to send, multiple data sending request being concentrated in together and carries out full duplex scheduling transmission; Also need the interfere information collecting present node and other non-AP nodes, the interference level information collected is formed an interference level value matrix by AP.
Fig. 2 is the full-duplex channel access request of the once similar RTS that node N1 initiates, and is designated as FDRTS.AP is receiving the head H DR of this packet and after identifying its source node address, the transmission process utilizing full duplex technology to start a similar CTS rapidly carries out the reply of full duplex contention, be designated as FDCTS, make channel be in busy condition, thus effectively reduce the collision of other concealed nodes.Now, for concealed nodes N2, only during N1 launches HDR, channel is in the free time, because HDR part is very short, greatly reduces the probability of collision.Time different from half-duplex RTS signaling, in FDRTS signaling of the present invention extra increase this node transmit queue information and neighboring node interference level information that this node is received.
Although the probability of collision is smaller, but still unavoidably.If collide, then adopt traditional random backoff mechanism, this is to ensureing that the fairness of subscriber channel access is most important.Throughput performance arranges comparatively responsive to Backoff window CW, the present invention gets compromise value.Send owing to have employed full duplex, compare half-duplex RTS-CTS pattern, one is the reduction of control signal expense, and RTS-CTS transmitting time is reduced to original half, directly improves MAC channel contention efficiency; Two collision problems being the reduction of concealed terminal, decrease because collide the extra rollback that causes and wait for expense, indirectly promote MAC efficiency.Three is channel contentions, can comprise multiple packet in this node transmit queue, can significantly improve MAC efficiency.
The slot length L that channel contention is opened
cand Backoff window CW in avoidance mechanism this how to determine, the present invention calculates according in network at the interstitial content of AP registration.The present invention is for the network of AP and 3 node, and supposing that Backoff window CW is set to 16, DIFS interval time is 4 slot lengths, and each FDRTS duration is 6 slot lengths.Assuming that colliding the average overhead caused is 1 slot length, then node average channel contention time is 27 slot lengths, and this time is multiplied by the nodes of registration, can obtain the slot length L that channel contention is opened
cbe 81 slot lengths.In addition, for reducing the time delay caused because AP centralized dispatching sends, each node channel contention, transmit queue allows the packet that can send to be set to 4.
In the present invention, AP collects two parts information by channel contention: Part I is the data byte length that will send to AP; Part II is the interference level that may there is full duplex transmission perceived from nodes.Information faces the challenge of two aspects: first is the necessary efficient and low expense of information collection machanism, particularly only has when node is in activation and has packet to send, just can increase information exchange expense.Second is that interfere information easily must be measured and calculate accurately, determines so that AP can make best scheduling.
Adopt signal power and interference power ratio SIR to carry out the interference level value of quantisation metric node, adopt the SIR matrix G=[G of a bidimensional
j,k] describe.Make node N
jplace receives the signal strength signal intensity P from AP
jwith from node N
kinterference signal intensity I
k,j, then calculate according to (1) formula.Special circumstances, the SIR when diagonal element of matrix G represents that node sends simultaneously and receives, represents the interference cancellation ability of full duplex system.
The formation of interference matrix G is a process dynamically and gradually accumulated.Interference matrix G determines full duplex packet sending speed, constructs a rate matrix S=[S
j,k].This rate matrix easily calculates and transmits, and full duplex scheduler module only uses rate matrix instead of directly processes interference matrix.Each packet-switching all will upgrade interference matrix, because G may along with time variations.For the system that half-duplex peak transfer rate is 20Mbps, wherein SIR thresholding adopt 10% the bag error rate, its SIR and rate transition as shown in table 1; Affect by full duplex interference cancellation techniques, consider still there is part self-interference signal remaining, cause full duplex peak transfer rate to be 18Mbps.
Table 1
| Signal interference ratio (dB) | 10.1 | 12.5 | 13.6 | 16.3 | 18.5 | 19.7 |
| Speed (Mbps) | 3 | 6 | 8 | 12 | 16 | 18 |
The data sending request composition AP receiving queue that first full duplex scheduler module of the present invention will be collected from each node, and the data composition AP transmit queue that each node will be issued; Then according to the interference matrix collected and rate matrix, determine which packet will full duplex send and each Packet Generation order and the transmission rate that adopts; Finally dispatch situation be distributed to all register node and start exchanges data.The design object of full duplex scheduler module is maximum using full duplex send opportunity, completes exchanges data in the shortest time, thus elevator system throughput.Present invention employs channel contention and random backoff mechanism to ensure that each node channel accesses fairness, ensureing that by regulating the channel contention widow time opened limited channel access postpones.
Table 2
As table 2, full duplex scheduling problem can be converted into one and search the shortest deadline T
cnP optimization problem, this is because epicycle send total byte be fixing, the shortest exchanges data deadline means maximum throughput performance.Full duplex regulation goal is by making AP receiving queue and AP transmit queue form best full duplex coupling, making the deadline of packet-switching minimum.As table 2, total following two constraints: constraints 1: node N sends to the transmission rate of AP to be fixing is maximum available bandwidth, owing to can offset its own transmission signal, AP total energy is correct receives this node signal.Constraints 2:AP sends to the transmission rate of other nodes to need to adjust, and determines according to the most high interference levels value that node N causes.
Scheduling packet be divided into three kinds of states: treat scheduling, scheduled, to be determined.Wherein initial condition is all half-duplex sending mode to be scheduled, and the packet that end-state AP receives and dispatches in queue is all scheduled state, and state to be determined is the middle dispatch state of scheduling process.The basic principle of scheduling: one when being initialization according to first dispatching from AP transmit queue again from AP receiving queue, determine according to the full duplex send window do not utilized in scheduling process; Two is according to first carrying out full-duplex mode scheduling, then carries out semiduplex mode scheduling; Three is that the scheme selecting the deadline shorter is dispatched as full duplex.The packet that the end mark of scheduling: AP receives and dispatches in queue all completes scheduling.
In order to better dispatching algorithm is described, introduce some tolerance below.When carrying out full duplex transmission scheduling for the individual data bag in queue, add full duplex transmitting time, the deadline reduced to system is T
fD.Be switched to full duplex transmission because half-duplex sends, there is the interference from adjacent node, must reduce its transmission rate, the deadline increased to system is LT (T
j), have
Calculate LT (R
i) in like manner can obtain.So, the difference of the deadline of minimizing and the deadline of increase, then for dispatch deadline gain, is designated as Δ T
c, then have
ΔT
C＝T
FD-LT(T
j)(2)
Δ T as can be seen here
cvalue larger, the dispatching effect of this packet is better.Finally, queue is received and dispatched for whole AP, the time that is sent completely T altogether
cto be tending towards minimum.
Fig. 3 is full duplex centralized dispatching system flow of the present invention.Be sent completely time measure according to the basic principle of above-mentioned scheduling and scheduling, full duplex scheduling can be summed up as following three kinds of situations:
(1) as receiving queue data R in scheduling
ithan transmit queue data T
jthe time that is sent completely, time long, what calculate the non-data dispatching of all AP transmit queues was sent completely time gain Δ T
c.If neither one is positive, so current receiving queue data R
icomplete scheduling, without the need to mating transmit queue data again.If have positive, so be sent completely time gain be positive in the middle of, select a LT (T
j) minimum carry out full duplex scheduling, and according to rate matrix adjustment transmission rate.
(2) as receiving queue data R in scheduling
ithan transmit queue data T
jbe sent completely the time in short-term, what calculate the non-data dispatching of all AP receiving queues is sent completely time gain Δ T
c.If neither one is positive, so current transmit queue data T
jcomplete scheduling, without the need to mating receiving queue data again.If have positive, so be sent completely time gain be positive in the middle of, select one can reduce and the receiving queue data of the interference of the non-data dispatching of AP transmit queue dispatched.Otherwise select a LT (R
i) minimum carry out full duplex scheduling, and according to rate matrix adjustment transmission rate.
(3) as receiving queue data R in scheduling
ithan transmit queue data T
jthe time that is sent completely, time equal, dispatches from the non-data dispatching Stochastic choice of AP receiving queue one.Otherwise all non-data dispatchings of AP transmit queue are dispatched according to semiduplex mode.
The present invention is at the end of each circulation, and scheduler module again need be distributed time slot and be confirmed each bag.Packet due to up-downgoing is staggered in together, and node can not confirm at once to the data received, otherwise meeting and ongoing transmission collision.Therefore, all bags confirm all will postpone till concentrated when packet-switching completes carrying out.AP, after full-duplex data exchanges, according to the AP receiving queue order of full duplex scheduler module, sends and confirms that packet tells that each node AP wants the packet confirmed.Whether the packet that each node sends according to it is identified, and sends according to the AP transmit queue order of full duplex scheduler module the packet that it thinks confirmation.Compare in traditional algorithm and often send a packet and will carry out confirming separately fast, the present invention concentrates full duplex affirmation mechanism by many bags, effectively reduces the expense that packet confirms, thus improves the throughput performance of system further.
In a preferred embodiment of the invention, Matlab emulation experiment is carried out with the wireless network of AP and three node.Assuming that CSMA/CA agreement, CW value gets minimum value 16, DIFS, the SIFS time is 4 and 2 time slots, and RTS, CTS duration is 4 time slots, and wherein slot length is 9 μ s.Suppose that in MAC protocol of the present invention, each node physical layer peak transfer rate is 20Mbps, packet frame length is 100-1500 byte, obeys Poisson distribution.Each node receives and transmit queue length is set to N
qindividual packet.And AP is in a packet-switching, each node channel contention request carries out random back after being spaced apart DIFS length again, and in the queue of AP data transmit-receive, each Packet Generation interval is also DIFS length.Same in units of the slot length of 9 μ s, concrete simulation parameter is as table 3.
Table 3
| Parameter | Time slot number |
| FDRTS | 6 |
| RTS/CTS | 4 |
| SIFS | 2 |
| DIFS | 4 |
| CW | 16 |
| L C | 81 |
| N Q | 2-6 |
| ACK | 4 |
The present invention is by the impact of research heterogeneous networks topology on full duplex MAC performance.As table 4, there are three kinds of network topology scenes, do not have line to represent between its interior joint and almost do not disturb; Between node, line is that solid line represents very high interference, fails to carry out asymmetric full-duplex transmission; Between node, line is the interference that represented by dotted arrows is general, by reducing transmission rate, can carry out asymmetric full-duplex transmission.(S1) Hide All terminal scene, all there is not disturbed condition in N1, N2, N3 phase concealed nodes each other.(S2) existence part disturbs scene, there is general interference, there is severe jamming between N2 and N3 between N1 and N3.(S3), all there is severe jamming between N1, N2, N3 in whole severe jamming scene.According to table 4, each node interference level matrix conversion is become rate matrix.
The present invention is by the full duplex dispatching algorithm performance gain under research different service types.As table 5, there are three kinds of types of service.Wherein, all at full capacity, AP and each node are all in full load condition for (T1) AP and node, and the result of full duplex scheduling is based on symmetrical full duplex.(T2) AP and node at full capacity asymmetric, such as the data from N1 are only received for node N1, AP receiving queue, in AP transmit queue, but will not send to the data of N1, now full duplex scheduling result will lay particular stress on asymmetric full-duplex.(T3) AP and node mixing load, AP receiving queue and AP transmit queue asymmetric for the data volume of same node.
Table 4
Table 5
The present invention dispatches by utilizing symmetrical full duplex and asymmetric full-duplex, promotes physical layer throughput performance.Consider the full duplex interference cancellation ability in real system, there is the remaining situation of self-interference signal, node is 20Mbps to the maximum to AP half-duplex transmission speed, and it is 18Mbps that full duplex sends peak transfer rate.Under S3 network topology and T1 type of service, when each node transmitting-receiving queue length is set to 4, throughput performance is as table 6.As seen from the table, MAC protocol of the present invention is compared CSMA/CA and can be obtained 81% physical layer throughput gain.Now, different topological scenes has identical throughput performance, this is because T1 type of service is all at full capacity, means that most full duplex is scheduling to symmetrical full duplex.Distance full duplex system is the physical layer throughput performance of 100% in theory, and wherein performance loss is remaining from the self-interference signal when protection interval time SI FS expense between the full duplex chance do not utilized in full duplex process of transmitting, packet and full duplex transmitting-receiving.
Table 6
| The present invention program | CSMA/CA | Performance gain | |
| Physical layer throughput | 21.7Mbps | 12.0Mbps | 81％ |
| Link layer throughput | 16.24Mbps | 7.35Mbps | 121％ |
Compare CSMA/CA agreement, MAC protocol expense of the present invention greatly reduces.Owing to adopting AP to concentrate full duplex to dispatch, only have each node transmitting channel contention request, AP is then without transmitting channel contention request, and this is the channel contention expense of half with regard to decreased average.A channel contention, can comprise multiple packet in this node transmit queue, can significantly improve MAC efficiency.Each node transmitting-receiving queue length is larger, and mean that average MAC expense is less, throughput performance is higher.In addition, because FDRTS signaling and FDCTS signaling almost send simultaneously, also signaling control overhead is decreased largely.
Compare CSMA/CA agreement, MAC protocol of the present invention also adds additional Section Overhead.Topmost expense is the channel contention window expense of opening to obtain abundant node transmit queue information, and the overhead part increased in addition has: contention start frame expense, full duplex scheduling frame overhead and FDRTS compare RTS frame and add the transmit queue of this node and adjacent node to information such as the interference levels of this node.
Fig. 4 for receiving and dispatching when queue length is set to 4 under T1 type of service when each node, algorithm of the present invention and traditional algorithm link layer throughput performance comparative analysis figure.As we know from the figure, MAC protocol of the present invention compare CSMA/CA link layer throughput performance improve reach 121%.Below MAC protocol of the present invention and the existing full duplex MAC protocol based on channel contention are analyzed.Wherein Contraflow agreement, it is a kind of distributed full duplex MAC protocol without AP, have employed contention mechanism and the avoidance mechanism based on IEEE802.11 amendment, algorithm of the present invention is compared with this agreement and is comparatively had superiority in MAC expense, when S1 network topology, S3 network topology, performance compares lifting 72% and 47% respectively, during S1 network topology, easily there is concealed nodes collision, thus cause keeping out of the way.And FD-MAC agreement, be a kind of full duplex MAC protocol having AP, have employed three large mechanism: share random back, head monitors and virtually to keep out of the way, algorithm of the present invention is compared performance with this agreement and is compared lifting 28%.
More than describe preferred embodiment of the present invention in detail.Should be appreciated that the ordinary skill of this area just design according to the present invention can make many modifications and variations without the need to creative work.Therefore, all technical staff in the art, all should by the determined protection range of claims under this invention's idea on the basis of existing technology by the available technical scheme of logical analysis, reasoning, or a limited experiment.
Claims (9)
1., based on a method for interchanging data of the full duplex MAC of channel contention and centralized dispatching, it is characterized in that, full-duplex channel contention and full duplex centralized dispatching organically combine by the method, comprising:
Full-duplex channel contention and information;
Full duplex centralized dispatching and exchanges data;
Many packets are concentrated and are confirmed.
2. the method for interchanging data of a kind of full duplex MAC based on channel contention and centralized dispatching according to claim 1, it is characterized in that, described full-duplex channel contention and information are:
1) channel contention module sends a contention by AP and starts packet, informs all nodes in AP coverage, in ensuing contention window, and transmitting channel contention request, content comprises the contention window slot length of unlatching;
2) each node transmitting channel contention request, AP then carries out full duplex at once and sends request reply packet, and completes associated traffic data and interference matrix information.
3. the method for interchanging data of a kind of full duplex MAC based on channel contention and centralized dispatching according to claim 2, it is characterized in that, during described contention window, each node does not send business datum, and the business that only sending full duplex dispatching office needs sends request and interference level information.
4. the method for interchanging data of a kind of full duplex MAC based on channel contention and centralized dispatching according to claim 2, is characterized in that, the service data information that described AP not only needs node to send; Also need the interfere information collecting present node and other non-AP nodes, the interference level information collected is formed an interference level value matrix by AP.
5. the method for interchanging data of a kind of full duplex MAC based on channel contention and centralized dispatching according to claim 4, is characterized in that, described interference level value matrix G=[G
j, k],
wherein make node N
jplace receives the signal strength signal intensity P from AP
jwith from node N
kinterference signal intensity I
k,j.
6. the method for interchanging data of a kind of full duplex MAC based on channel contention and centralized dispatching according to claim 2, it is characterized in that, described AP is receiving the head H DR of packet and after identifying its source node address, utilize full duplex technology to start transmission process rapidly and carry out the reply of full duplex contention, be designated as FDCTS, make channel be in busy condition, thus effectively reduce the collision of other concealed nodes.
7. the method for interchanging data of a kind of full duplex MAC based on channel contention and centralized dispatching according to claim 2, is characterized in that, described contention window slot length calculates at the interstitial content of AP registration according in network.
8. the method for interchanging data of a kind of full duplex MAC based on channel contention and centralized dispatching according to claim 1, it is characterized in that, described full duplex centralized dispatching and exchanges data are:
First the data sending request composition AP receiving queue will collected from each node, and the data composition AP transmit queue that each node will be issued;
Then according to the interference matrix collected and rate matrix, determine which packet will full duplex send and each Packet Generation order and the transmission rate that adopts;
Finally dispatch situation be distributed to all register node and start exchanges data.
9. the method for interchanging data of a kind of full duplex MAC based on channel contention and centralized dispatching according to claim 7, it is characterized in that, described full duplex scheduling problem is converted into the NP optimization problem that is searched the shortest deadline T_C, full duplex regulation goal is by making AP receiving queue and AP transmit queue form best full duplex coupling, making the deadline of packet-switching minimum;
Total following two constraints: constraints 1: node N sends to the transmission rate of AP to be fixing is maximum available bandwidth, owing to can offset its own transmission signal, AP total energy is correct receives this node signal;
Constraints 2:AP sends to the transmission rate of other nodes to need to adjust, and determines according to the most high interference levels value that node N causes.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510474339.XA CN105142185A (en) | 2015-08-05 | 2015-08-05 | Full-duplex MAC (Media Access Control) data exchange method based on channel collision and centralized scheduling |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510474339.XA CN105142185A (en) | 2015-08-05 | 2015-08-05 | Full-duplex MAC (Media Access Control) data exchange method based on channel collision and centralized scheduling |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN105142185A true CN105142185A (en) | 2015-12-09 |
Family
ID=54727362
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510474339.XA Pending CN105142185A (en) | 2015-08-05 | 2015-08-05 | Full-duplex MAC (Media Access Control) data exchange method based on channel collision and centralized scheduling |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105142185A (en) |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105554902A (en) * | 2015-12-23 | 2016-05-04 | 南京邮电大学 | Multipoint distributed channel competition method for wireless local area network hybrid duplexing |
| CN107071923A (en) * | 2017-04-24 | 2017-08-18 | 南京邮电大学 | The detection of full-duplex communication and contention solution in a kind of band |
| CN107666489A (en) * | 2017-10-17 | 2018-02-06 | 西安电子科技大学 | A kind of method of media access control protocol based on two benches competition in full duplex radio network |
| CN109756320A (en) * | 2019-01-14 | 2019-05-14 | 厦门大学 | Communication means based on full duplex MAC protocol in wireless network |
| CN111918408A (en) * | 2020-08-06 | 2020-11-10 | 北方工业大学 | Optimization method and device based on CSMA-CA backoff algorithm |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101636989A (en) * | 2007-03-20 | 2010-01-27 | 三星电子株式会社 | Method and system for transmission of different types of information in wireless communication |
| CN103619072A (en) * | 2013-12-02 | 2014-03-05 | 西安电子科技大学 | FD-MAC protocol based on RTS/CTS principle in wireless network |
| CN104219735A (en) * | 2013-05-31 | 2014-12-17 | 中国电信股份有限公司 | Wireless sensor network media access control method based on multipacket reception and communication system |
-
2015
- 2015-08-05 CN CN201510474339.XA patent/CN105142185A/en active Pending
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101636989A (en) * | 2007-03-20 | 2010-01-27 | 三星电子株式会社 | Method and system for transmission of different types of information in wireless communication |
| CN104219735A (en) * | 2013-05-31 | 2014-12-17 | 中国电信股份有限公司 | Wireless sensor network media access control method based on multipacket reception and communication system |
| CN103619072A (en) * | 2013-12-02 | 2014-03-05 | 西安电子科技大学 | FD-MAC protocol based on RTS/CTS principle in wireless network |
Non-Patent Citations (5)
| Title |
|---|
| JAE YOUNG KIM: "Janus: A Novel MAC Protocol for Full Duplex Radio", 《CITESEERX》 * |
| MAYANK JAIN: "Practical, real-time, full duplex wireless", 《PROCEEDINGS OF THE 17TH ANNUAL INTERNATIONAL CONFERENCE ON MOBILE COMPUTING AND NETWORKING》 * |
| SAHAI, ACHALESHWAR: "Pushing the limits of Full-duplex: Design and Real-time Implementation", 《ARXIV》 * |
| SUHUA TANG: "Distributed Multiuser Scheduling for Improving Throughput of Wireless LAN", 《IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS》 * |
| WENCHI CHENG: "RTS/FCTS mechanism based full-duplex MAC protocol for wireless networks", 《GLOBECOM WORKSHOPS》 * |
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105554902A (en) * | 2015-12-23 | 2016-05-04 | 南京邮电大学 | Multipoint distributed channel competition method for wireless local area network hybrid duplexing |
| CN105554902B (en) * | 2015-12-23 | 2019-07-12 | 南京邮电大学 | A kind of multiple spot distributed channel contention method of WLAN mixing duplex |
| CN107071923A (en) * | 2017-04-24 | 2017-08-18 | 南京邮电大学 | The detection of full-duplex communication and contention solution in a kind of band |
| CN107666489A (en) * | 2017-10-17 | 2018-02-06 | 西安电子科技大学 | A kind of method of media access control protocol based on two benches competition in full duplex radio network |
| CN109756320A (en) * | 2019-01-14 | 2019-05-14 | 厦门大学 | Communication means based on full duplex MAC protocol in wireless network |
| CN109756320B (en) * | 2019-01-14 | 2020-07-10 | 厦门大学 | Communication method based on full-duplex MAC protocol in wireless network |
| CN111918408A (en) * | 2020-08-06 | 2020-11-10 | 北方工业大学 | Optimization method and device based on CSMA-CA backoff algorithm |
| CN111918408B (en) * | 2020-08-06 | 2023-06-06 | 北方工业大学 | Optimization method and device based on CSMA-CA backoff algorithm |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101286980B (en) | Distributed media access control protocol for increasing capacity of wireless local area network | |
| CN102056325B (en) | Multiple access method based on multiple-input multiple-output antenna | |
| US9768992B2 (en) | System and method for randomized antenna allocation in asynchronous MIMO multi-hop networks | |
| CN105142185A (en) | Full-duplex MAC (Media Access Control) data exchange method based on channel collision and centralized scheduling | |
| CN106559900B (en) | A kind of multi-channel multi-address access method based on asymmetric bandwidth | |
| CN107666489A (en) | A kind of method of media access control protocol based on two benches competition in full duplex radio network | |
| CN105162568A (en) | Method for node matching and resource competition in full-duplex wireless network | |
| CN103619072A (en) | FD-MAC protocol based on RTS/CTS principle in wireless network | |
| Kim et al. | A new full duplex MAC protocol to solve the asymmetric transmission time | |
| CN103118414A (en) | Wireless access control and timeslot allocation method applicable to ultra-wideband | |
| Hosseinabadi et al. | Token-DCF: An opportunistic MAC protocol for wireless networks | |
| CN103501531B (en) | A kind of Ad Hoc network MAC layer method for channel allocation controlled based on power | |
| Parvez et al. | A spectrum sharing based metering infrastructure for smart grid utilizing LTE and WiFi | |
| US8488574B2 (en) | Wireless network system and association control method thereof | |
| Islam et al. | A Proportional Scheduling Protocol for the OFDMA-Based Future Wi-Fi Network. | |
| Kuo et al. | A CSMA-based MAC protocol for WLANs with automatic synchronization capability to provide hard quality of service guarantees | |
| Feng et al. | Cooperative medium access control based on spectrum leasing | |
| Fihri et al. | A survey on decentralized random access MAC protocols for cognitive radio networks | |
| Islam et al. | Enhanced channel access mechanism for IEEE 802.11 s mesh deterministic access | |
| Zhang et al. | Receiver initiated MAC design for ad hoc networks based on multiuser detection | |
| Acholem | Throughput performance in multihop networks using adaptive carrier sensing threshold | |
| Segata et al. | On the feasibility of collision detection in full-duplex 802.11 radio | |
| Wang et al. | MIMO-OFDM and MAC design for broadband ad hoc network | |
| Ahn et al. | AUB: A full-duplex MAC protocol for the efficient utilization of the idle uplink period in WLAN | |
| Kosek et al. | Thorough analysis of 802.11 e star topology scenarios in the presence of hidden nodes |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20151209 |
|
| RJ01 | Rejection of invention patent application after publication |