CN107949059A - Method for channel allocation and network system - Google Patents
Method for channel allocation and network system Download PDFInfo
- Publication number
- CN107949059A CN107949059A CN201711163355.2A CN201711163355A CN107949059A CN 107949059 A CN107949059 A CN 107949059A CN 201711163355 A CN201711163355 A CN 201711163355A CN 107949059 A CN107949059 A CN 107949059A
- Authority
- CN
- China
- Prior art keywords
- website
- access point
- competition
- channel
- queue
- 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 40
- 238000004891 communication Methods 0.000 claims abstract description 54
- 230000005540 biological transmission Effects 0.000 claims abstract description 45
- 238000012546 transfer Methods 0.000 claims abstract description 45
- 230000008569 process Effects 0.000 claims description 3
- 238000001514 detection method Methods 0.000 claims 2
- 230000007246 mechanism Effects 0.000 abstract description 12
- 230000002860 competitive effect Effects 0.000 description 10
- 238000010586 diagram Methods 0.000 description 5
- 230000014509 gene expression Effects 0.000 description 4
- 230000008859 change Effects 0.000 description 3
- 238000005516 engineering process Methods 0.000 description 3
- 230000008901 benefit Effects 0.000 description 2
- 238000004364 calculation method Methods 0.000 description 2
- 230000007812 deficiency Effects 0.000 description 2
- 230000005856 abnormality Effects 0.000 description 1
- 238000012790 confirmation Methods 0.000 description 1
- 230000003247 decreasing effect Effects 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 230000004044 response Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
Classifications
-
- 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/0453—Resources in frequency domain, e.g. a carrier in FDMA
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W74/00—Wireless channel access
- H04W74/08—Non-scheduled access, e.g. ALOHA
- H04W74/0833—Random access procedures, e.g. with 4-step access
- H04W74/0841—Random access procedures, e.g. with 4-step access with collision treatment
- H04W74/0858—Random access procedures, e.g. with 4-step access with collision treatment collision detection
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The present invention provides a kind of method for channel allocation and network system.Network system includes being in communication with each other at least one access point of connection and multiple websites, and website includes channel competition stage and data transfer phase according to communication cycle and access point into row data communication, each communication cycle.The described method includes：The multiple websites for transmitting data are needed to carry out channel competition, the website that access point will be provided with channel occupancy condition adds competition queue.At the end of the channel competition stage, access point, which is sent, to be used to inform that the channel competition stage terminates beacon frame that data transfer phase starts to multiple websites.Multiple websites carry out data transmission with access point successively according to the queue sequence of competition queue, until competition queue is sky.Thus, by being two stages by channel competition and data transfer decoupling, each stage has corresponding mechanism of control to be managed, improves the utilization rate of channel and the handling capacity of whole system, ensures the data traffic transmission quality of each website.
Description
Technical field
The present invention relates to wireless communication technology field, in particular to a kind of method for channel allocation and network system.
Background technology
As the continuous development of WLAN (Wireless Local Area Networks, Wireless LAN), WLAN are wide
It is general to be applied to every field.IEEE802.11 series standards are the mainstream standards of wlan system at present, MAC (Medium Access
Control, medium access control) layer be its research one of emphasis.
In current IEEE802.11 series standards, mainly pass through 802.11DCF (Distributed
Coordination Function, distributed coordination function) mechanism realizes Channel Sharing.Generally use BEB (Binary
Exponential Back off, binary exponential backoff) algorithm avoids website from colliding.
In 802.11DCF mechanism, when some website has data to send, which intercepts channel first, if channel
Free time, then continue to intercept a DIFS (Distributed Inter-frame Spacing, distributed interframe gap), (0,
CW random selection back off time in), wherein, CW is contention window size.If interior channel is idle always during this period, the website
When back off time is reduced to 0, mac frame is sent, starts to transmit data.If listening to channel busy during this period, which freezes
Backoff counter is tied, is further continued for successively decreasing after waiting channel idle.In above process, CW often occurs once since minimum value 7
Collision, CW will be doubled and redoubled, until increasing to maximum 255.
It can be seen from the above that in 802.11DCF mechanism, channel utilization is very low, especially when network state tends to saturation,
The channel collision of DCF mechanism under the conditions of high density network can sharply increase, under high collision rate will cause throughput of system significantly
, there is the problems such as property abnormality and time delay increase, it is difficult to ensure the data traffic transmission quality of each website in drop.
The content of the invention
In order to overcome above-mentioned deficiency of the prior art, the present invention provides a kind of method for channel allocation and network system, its
By the way that channel competition and data transfer are decoupled, decouple has for two stages of channel competition and data transfer, each stage
Corresponding mechanism of control, can effectively improve the utilization rate of channel, lift the handling capacity of whole system, ensure the data of each website
Service transmission quality.
First purpose of present pre-ferred embodiments is to provide a kind of method for channel allocation, and the method is applied to network
System, the network system include being in communication with each other at least one access point of connection and multiple websites, and the website is according to communication
Cycle, each communication cycle included channel competition stage and data transfer phase, described with described access point into row data communication
Method includes：
When network system is in the channel competition stage, it is necessary to which the multiple websites for transmitting data carry out channel competition, access
The website that point will be provided with channel occupancy condition adds competition queue；
At the end of the channel competition stage, access point, which is sent, to be used to inform that the channel competition stage terminates data transfer rank
The beacon frame that section starts gives multiple websites；
The multiple website carries out data transmission with described access point successively according to the queue sequence of the competition queue, directly
It is sky to the competition queue.
Second purpose of present pre-ferred embodiments is to provide a kind of network system, and the network system includes phase intercommunication
Believe at least one access point of connection and multiple websites, the website carries out data with described access point according to communication cycle and leads to
Letter, each communication cycle include channel competition stage and data transfer phase；
When network system is in the channel competition stage：
Multiple websites of transmission data are needed, for carrying out channel competition；
Access point, the website for will be provided with channel occupancy condition add competition queue；
At the end of the channel competition stage：
Described access point, is additionally operable to send for informing that the channel competition stage terminates the beacon frame that data transfer phase starts
To multiple websites；
The multiple website carries out data transmission with described access point successively according to the queue sequence of the competition queue, directly
It is sky to the competition queue.
In terms of existing technologies, the invention has the advantages that：
Present pre-ferred embodiments provide a kind of method for channel allocation and network system.The method is applied to network system
System, the network system include being in communication with each other at least one access point of connection and multiple websites, and the website is according to communication week
Phase includes channel competition stage and data transfer phase, the side with described access point into row data communication, each communication cycle
Method includes：When network system is in the channel competition stage, it is necessary to which the multiple websites for transmitting data carry out channel competition, access point
The website that will be provided with channel occupancy condition adds competition queue.At the end of the channel competition stage, access point, which is sent, to be used for
Inform that the channel competition stage terminates beacon frame that data transfer phase starts to multiple websites.The multiple website is according to described competing
The queue sequence for striving queue carries out data transmission with described access point successively, until the competition queue is sky.Thus, pass through by
Channel competition is two stages with data transfer decoupling, and there is corresponding mechanism of control in each stage, can avoid occurring in high density
The situation that the collision of network condition lower channel sharply increases, can effectively improve the utilization rate of channel, lift the handling capacity of whole system,
Ensure the data traffic transmission quality of each website.Also, under the conditions of high density network, this programme is contemplated that extension competition rank
The section cycle, so as to reduce channel competition collision probability.
Brief description of the drawings
In order to illustrate the technical solution of the embodiments of the present invention more clearly, below will be to needed in the embodiment attached
Figure is briefly described, it will be appreciated that the following drawings illustrate only certain embodiments of the present invention, therefore be not construed as pair
The restriction of scope, for those of ordinary skill in the art, without creative efforts, can also be according to this
A little attached drawings obtain other relevant attached drawings.
Fig. 1 is the communication scheme for the network system 10 that present pre-ferred embodiments provide.
Fig. 2 is one of step flow chart of method for channel allocation that present pre-ferred embodiments provide.
Fig. 3 is one of flow diagram of sub-step of step S110 in Fig. 2 that present pre-ferred embodiments provide.
Fig. 4 is two of the flow diagram of the sub-step of step S110 in Fig. 2 that present pre-ferred embodiments provide.
Fig. 5 is that the website in the channel competition stage that present pre-ferred embodiments provide competes schematic diagram.
Fig. 6 is the flow diagram of the sub-step of step S140 in Fig. 2 that present pre-ferred embodiments provide.
Fig. 7 is the queue change schematic diagram for the data transfer phase that present pre-ferred embodiments provide.
Fig. 8 is the two of the step flow chart for the method for channel allocation that present pre-ferred embodiments provide.
Icon：10- network systems；100- access points；200- websites.
Embodiment
To make the purpose, technical scheme and advantage of the embodiment of the present invention clearer, below in conjunction with the embodiment of the present invention
In attached drawing, the technical solution in the embodiment of the present invention is clearly and completely described, it is clear that described embodiment is
Part of the embodiment of the present invention, instead of all the embodiments.
Therefore, below the detailed description of the embodiment of the present invention to providing in the accompanying drawings be not intended to limit it is claimed
The scope of the present invention, but be merely representative of the present invention selected embodiment.Based on the embodiments of the present invention, this area is common
Technical staff's all other embodiments obtained without creative efforts, belong to the model that the present invention protects
Enclose.
It should be noted that：Similar label and letter represents similar terms in following attached drawing, therefore, once a certain Xiang Yi
It is defined, then it further need not be defined and explained in subsequent attached drawing in a attached drawing.
Fig. 1 is refer to, Fig. 1 is the communication scheme for the network system 10 that present pre-ferred embodiments provide.The network
System 10 includes being in communication with each other at least one access point 100 and multiple websites 200 of connection.The website 200 can be according to communication
Cycle includes channel competition stage and data transfer phase with described access point 100 into row data communication, each communication cycle.
In the present embodiment, described access point 100 may be, but not limited to, and (Access Point, wirelessly connect by base station, AP
Access point) etc..The website 200 may be, but not limited to, PC (personal computer, PC), tablet computer, intelligence
Energy mobile phone, personal digital assistant (personal digital assistant, PDA), wearable device etc..
Fig. 2 is refer to, Fig. 2 is one of step flow chart of method for channel allocation that present pre-ferred embodiments provide.Institute
State method and be applied to above-mentioned network system 10, the network system 10 includes being in communication with each other at least one access point of connection
100 and multiple websites 200, each website 200 can be according to communication cycle and described access point 100 into row data communication, Mei Getong
The letter cycle includes channel competition stage and data transfer phase.The idiographic flow of method for channel allocation is explained in detail below
State.
Step S110, when network system 10 is in the channel competition stage, it is necessary to which the multiple websites 200 for transmitting data carry out
Channel competition, the website 200 that access point 100 will be provided with channel occupancy condition add competition queue.
In the present embodiment, the multiple website 200 refers to website 200 associated with described access point 100.
Fig. 3 is refer to, Fig. 3 is the flow signal of the sub-step of step S110 in Fig. 2 that present pre-ferred embodiments provide
One of figure.The step S110 includes sub-step S111, sub-step S112, sub-step S113, sub-step S114, sub-step S115
And sub-step S116.
Sub-step S111 is, it is necessary to which the multiple websites 200 for transmitting data select a backoff value in the range of default backoff value.
In the present embodiment, in the channel competition stage, it is necessary to transmit multiple websites 200 of data in default backoff value scope
(such as：[0, N-1]) in random selection one fixed value as backoff value.Wherein, N values represent to need to transmit in network system 10
The number of the website 200 of data.The default backoff value scope can be set according to the actual requirements.
Whether sub-step S112, each website 200 detect the backoff value of selection for 0.
When there are during the website 200 that backoff value is 0, performing sub-step S113.
When there are backoff value not being 0 website 200, sub-step S116 is performed.
Sub-step S113, the 200 channel request frame of website that the backoff value is 0 are detected to described access point 100
Whether channel confliction is occurred.
In the present embodiment, the channel request frame may be, but not limited to, DTR frames (Data Transaction
Request, data transfer request).The website 200 that the backoff value is 0 is by sending DTR frames, to tell described access point 100
The website 200 has data to need to transmit, can competitive channel carry out data transmission.
In the present embodiment, with traditional DCF mechanism using mac frame come competitive channel compared with, this programme is in channel competition
Stage is using DTR frames come competitive channel.Since DTR frame the space occupied is smaller, DTR data are caused to be lost even if producing channel confliction
Lose, too big loss will not be caused.
If not clashing, sub-step S114 is performed, the website 200 possesses channel occupancy condition.
In the present embodiment, if channel confliction does not occur, show currently without other websites 200 and the website 200
Competitive channel, can determine that the website 200 possesses channel occupancy condition.
If clashing, sub-step S115 is performed, it is competing that the website 200 no longer carries out channel in this communication cycle
Strive.
In the present embodiment, when in network system 10 there are two or more websites 200 at the same time send DTR frames
When, it may occur that channel confliction.At this time, the website 200 of the channel confliction no longer competitive channel in this communication cycle occurs, waits until
Next communication cycle competitive channel again.Thus, it can effectively lower the collision rate between website 200, improve handling up for whole system
Amount.
In the present embodiment, the website 200 of channel confliction occurs in next communication cycle competitive channel, may be selected relatively low
Backoff value, preferentially carry out channel competition.For example it is 10 that the station number N of data transfer is needed in system, presets backoff value model
Enclose for [0,9], the backoff value of some website 200 selection be 5, channel confliction occurs, the website 200 is in the competition of next communication cycle
During channel, backoff value preferably is randomly choosed in the range of [0,4], to improve the successful probability of 200 channel competition of website.
Corresponding backoff value is not often subtracted 1 by sub-step S116, the backoff value for 0 website 200 by a time slot.
In the present embodiment, if the backoff value that website 200 selects not is 0, the website 200 enters backoff procedure, institute
State website 200 and often corresponding backoff value is subtracted 1 by time slot (no matter the time slot in channel whether occupied).Wherein, institute
State the website 200 that time slot (slot) represents that speed is 1Mbps and send the time that DTR frames need.
Fig. 4 is refer to, Fig. 4 is the flow signal of the sub-step of step S110 in Fig. 2 that present pre-ferred embodiments provide
The two of figure.The step S110 is further included：Sub-step S117 and sub-step S118.
Sub-step S117, described access point 100, which receives, possesses the channel request that the website 200 of channel occupancy condition is sent
Frame, and obtain the 200 corresponding site information of website.
In the present embodiment, the site information can include, but not limited to Site ID.Wherein, the Site ID is by right
The MAC Address of website 200 is answered to map to obtain.
The site information of acquisition is added in competition queue by sub-step S118, described access point 100.
In the present embodiment, the competition queue can use, but be not limited to, and CQ queues (Contention Queue, it is competing
Strive queue).CQ queues can be pre-defined by user.User can according to protocol type, message size, protocol port number and
Corresponding Access List rules configuration queue simultaneously distributes respective bandwidth.
Illustrated below by the citing above-mentioned steps S110 more sub-steps included.
For example, refer to Fig. 5, Fig. 5 is the website competition signal in the channel competition stage that present pre-ferred embodiments provide
Figure.There are 5 website 200 (website 1, website 2, website 3, website 4 and the websites for needing to send data in a network system 10
5).Assuming that 1 randomly selected backoff value of website is 0, the backoff value that website 2 selects is 1, the backoff value that website 3 and website 4 select
For 2, the backoff value that website 5 selects is 3.
It is 0 due to there was only the backoff value that website 1 selects, website 1 will be successfully transmitted DTR frames, connect when channel competition starts
The ID of website 1 is added competition queue by access point 100.It has passed through a time slot at this time, website 2, website 3, website 4 and website 5
Backoff value subtracts 1, and at this time, only the backoff value of website 2 is 0, and website 2 is successfully transmitted DTR frames, and access point 100 is by the ID of website 2
Add competition queue.Pass through a time slot again at this time, the backoff value of website 3, website 4 and website 5 subtracts 1, website 3 and website 4
Backoff value be 0, while send DTR frames, channel confliction, website 3 and website 4 occur after conflict is detected in this communication
Will not competitive channel again in cycle.Finally, it is 0 that the backoff value of website 5, which subtracts 1, and no conflict occurred, and website 5 is successfully transmitted DTR
The ID of website 5 is added competition queue by frame, access point 100.
Referring once again to Fig. 2, the method further includes：
Step S130, at the end of the channel competition stage, access point 100, which is sent, to be used to inform that the channel competition stage ties
The beacon frame that the beam data transmission stage starts is to multiple websites 200.
In the present embodiment, terminate when the channel competition stage, access point 100 will send a beacon frame (Beacon frames)
The 200 channel competition stage of website in informing network system 10 terminates, into data transfer phase.Wherein, described access point 100
Beacon frame (Beacon frames) can be sent in network by way of broadcast, each website 200 can receive the beacon frame.
The calculation formula that described access point 100 sends the beacon frame period is as follows.
Tb (t)=Tcp (t)+Tdtp (t-1) (1)
Tdtp=T1+T2+....+Ti (2)
Wherein, the Tb (t) in formula (1) represents that access point 100 sends the cycle of beacon frame, and Tcp (t) represents channel competition
The time in stage, t represent t-th of cycle.Tdtp in formula (2) represents the time of data transfer phase, that is, competes in queue
Whole websites 200 complete data transfer total time.Ti in formula (3), which represents that website i takes in data transmission procedure, to be believed
The time in road, the speed of the website 200 of transmission rate minimum in Rmin expression systems, Numi represent website i in data transfer mistake
The number of the data packet continuously transmitted in journey, SIFS (Short interframe space, short interFrameGap) is IEEE
One kind in 3 kinds of frame periods (IFS) that 802.11 standard recommendations use, highest priority, Tack represent response time, website
After the complete data of 200 Successful transmissions, the confirmation frame time that described access point 100 returns to website 200 corresponds to Tack.
Referring once again to Fig. 2, the method further includes：
Step S140, the multiple website 200 according to it is described competition queue queue sequence successively with described access point 100
Carry out data transmission, until the competition queue is sky.
Fig. 6 is refer to, Fig. 6 is the flow signal of the sub-step of step S140 in Fig. 2 that present pre-ferred embodiments provide
Figure.The step S140 includes sub-step S141, sub-step S142, sub-step S143, sub-step S144, sub-step S145 and son
Step S146.
Sub-step S141, each website 200 obtains the beacon frame that described access point 100 is sent, and detects the letter
Whether the site information carried in mark frame matches with each 200 corresponding site information of website.
In the present embodiment, the site information carried in the beacon frame is first station for being added to the competition queue
Point information.Each website 200 is by obtaining the beacon frame, and by the site information carried in the beacon frame and the station of oneself
Point information is matched.
When there are during the targeted sites 200 of successful match, performing sub-step S142.
When there is the unsuccessful website 200 of matching, sub-step S146 is performed.
Sub-step S142,200 acquisition of communication channels of targeted sites, and determined according to traffic rate to need the number that sends
According to bag quantity and corresponding data packet, the data packet is transferred to described access point 100.
In the present embodiment, 200 acquisition of communication channels of targeted sites of successful match is to carry out data transmission.The target
Website 200 determines to need the data packet number that sends and corresponding data packet according to traffic rate.The data packet number of transmission with
The traffic rate of the targeted sites 200 is directly proportional, and traffic rate is faster, and transmissible data packet is more, is used between data packet
SIFS is separated.The calculation that website 200 sends data packet is as follows.
Wherein, Ri represents the speed of website i, the website speed of transmission rate minimum, Numi expressions in Rmin expression systems
The number for the data packet that website i is continuously transmitted in data transmission procedure.
In the present embodiment, traditional DCF mechanism, website 200 are accomplished that throughput fairness after competing to channel, this
When the handling capacity identical with high-speed website will be realized by resulting in low rate website, the time of busy channel is longer, channel usage
Rate is low, and throughput of system is low.Compared with traditional DCF mechanism, this programme determines to need the data packet sent by traffic rate
Quantity realizes channel time justice, from the statistics angle, when data transfer is completed, during the channel that all websites 200 take
Between it is basically identical.Thus, the utilization rate of channel can be effectively lifted, improves the handling capacity of system.
Sub-step S143, when the targeted sites 200 complete data packet transmission, described access point 100 updates described competing
Queue is striven, and whether the competition queue detected by renewal is empty.
In the present embodiment, when the complete data packet of 200 Successful transmissions of targeted sites of successful match, described access point 100
The site information (such as Site ID) of the targeted sites 200 is removed from the head of competition queue, and detects and competes queue at this time
Whether it is empty.
If not empty, sub-step S144 is performed.
If it is empty, sub-step S145 is performed.
The site information that queue head is competed after renewal is added to institute by sub-step S144, described access point 100
In the acknowledgement frame for stating the reply of targeted sites 200, and by acknowledgement frame described in broadcast transmission, so that the station carried in the acknowledgement frame
The corresponding website 200 of point information carries out data transfer next time.
In the present embodiment, if queue is not sky, described access point 100, which will be competed in queue, is located at the targeted sites
Next site information renewal after 200 is added to competition queue head, and by the site information that queue head is competed after renewal
Into the acknowledgement frame (ACK, Acknowledgement, confirm character) replied the targeted sites 200, and sent out by broadcasting
Send the acknowledgement frame (ACK).
In data communication, if recipient successfully receives data, an ACK can be replied to data sender, table
The data of bright transmission have confirmed that reception is errorless.
In the present embodiment, the website 200 in system (can be in access point in the acknowledgement frame for receiving the transmission of access point 100
100 physical layer is configured, and the associated website 200 of all and described access point 100 in system is received acknowledgement frame)
When, whether the site information that can judge to carry in acknowledgement frame matches with the site information of oneself.If successful match, perform above-mentioned
Sub-step S142.If it fails to match, following sub-step S146 are performed.
Sub-step S145, described access point 100 reply the acknowledgement frame of the targeted sites 200 by broadcast transmission, and sentence
Determine data transfer phase to terminate, into next communication cycle.
In an embodiment of the present embodiment, when it is empty to compete queue, show that the data of this communication cycle pass
The defeated stage terminates.Described access point 100 replys the acknowledgement frame of the targeted sites 200 by broadcast transmission, is taken in the acknowledgement frame
The information terminated with data transfer phase, is terminated with website 200 this communication cycle in the system of informing, into next communication
Cycle, website 200 can carry out channel competition.
In the another embodiment of the present embodiment, described access point 100 is replying the target by broadcast transmission
After the acknowledgement frame of website 200, it can individually send one and be used for the letter for informing that website 200 this communication cycle in system terminates
Mark frame.
The described access point 100 to be received such as sub-step S146, the unsuccessful website 200 of matching send acknowledgement frame with into
The site match of row next time.
Illustrated below by the citing above-mentioned steps S140 more sub-steps included.
For example, refer to Fig. 7, Fig. 7 is the queue change signal for the data transfer phase that present pre-ferred embodiments provide
Figure.Assuming that website i, j, k compete channel successively, that is, the website order competed in queue is website i, website j and site k.
When data transfer phase starts, the ID of website i, website i are carried in the Beacon frames that access point 100 is sent
With success, website j and site k are waited and matched next time.If the traffic rate of website i is the minimum speed limit in system, website i
Send 1 data packet.Access point 100 removes queue after the data packet of website i is received, by the Site ID of website i, at this time,
Queue is not sky, and access point 100 updates queue, by the Site ID renewal of website j to competition queue head, and to website i's
The Site ID of website j is added in acknowledgement frame ACK.Website j gets the acknowledgement frame ACK to website i, successful match, and site k waits
Match next time, if website j speed is 3 times of minimum speed limit, website j sends 3 data packets.Subsequent process similarly, until
Queue is competed as sky, terminates data transfer phase.
Fig. 8 is refer to, Fig. 8 is the two of the step flow chart for the method for channel allocation that present pre-ferred embodiments provide.Institute
The method of stating further includes step S120 and step S125.
Whether step S120, the duration that access point 100 detects the channel competition stage exceed predetermined threshold value.
In the present embodiment, the predetermined threshold value can be set according to the actual requirements.Such as can be by the predetermined threshold value
It is set as the duration in channel competition stage：Tcp, Tcp=N*slot.Wherein, the website of transmission data is needed in N values expression system
Number, slot represent time slot.
Step S125, when more than predetermined threshold value, described access point 100 judges that the channel competition stage terminates, data
The transmission stage starts.
In the present embodiment, if not less than predetermined threshold value, show that the channel competition stage does not terminate, website 200 can continue competing
Strive channel.
In the present embodiment, since the predetermined threshold value can be set according to the actual requirements, when network is in high density
During state, this programme according to the actual requirements can be adjusted the predetermined threshold value, to extend cycle competitive stage, so as to reduce
Channel competition collision probability.
In conclusion present pre-ferred embodiments provide a kind of method for channel allocation and network system.The method application
In network system, the network system includes being in communication with each other at least one access point of connection and multiple websites, and the website is pressed
Include channel competition stage and data transfer rank into row data communication, each communication cycle according to communication cycle and described access point
Section, the described method includes：When network system is in the channel competition stage, it is necessary to which the multiple websites progress channel for transmitting data is competing
Strive, the website that access point will be provided with channel occupancy condition adds competition queue.At the end of the channel competition stage, access point
Send and be used to inform that the channel competition stage terminates beacon frame that data transfer phase starts to multiple websites.The multiple website is pressed
Carry out data transmission successively with described access point according to the queue sequence of the competition queue, until the competition queue is sky.
In traditional DCF mechanism, channel competition and data transfer are merged and synchronously carry out, and this programme will be believed
Road competes and data transfer decoupling, decouples as two stages of channel competition and data transfer.In the channel competition stage, pass through transmission
One less DTR frame carrys out competitive channel, even if producing conflict causes DTR loss of data, too big channel will not be caused to damage
Lose.In data transfer phase, website can according to competition queue sequence successively continuous data transfer, meanwhile, can be according to traffic rate
It is definite to need the data packet number that sends to realize that the time of busy channel between website is fair.It compensate for low speed in DCF mechanism
Rate website is the deficiency for realizing throughput fairness and long-time busy channel.Thus, data transmission efficiency can be effectively improved, is lifted
The utilization rate of channel, improves the handling capacity of system, reduces website conflict.
The foregoing is only a preferred embodiment of the present invention, is not intended to limit the invention, for the skill of this area
For art personnel, the invention may be variously modified and varied.Within the spirit and principles of the invention, that is made any repaiies
Change, equivalent substitution, improvement etc., should all be included in the protection scope of the present invention.
Claims (10)
1. a kind of method for channel allocation, it is characterised in that the method is applied to network system, and the network system includes mutual
At least one access point and multiple websites of communication connection, the website carry out data with described access point according to communication cycle and lead to
Letter, each communication cycle include channel competition stage and data transfer phase, the described method includes：
When network system is in the channel competition stage, it is necessary to which the multiple websites for transmitting data carry out channel competition, access point will
The website for possessing channel occupancy condition adds competition queue；
At the end of the channel competition stage, access point, which is sent, to be used to inform that the channel competition stage terminates data transfer phase and opens
The beacon frame of beginning gives multiple websites；
The multiple website carries out data transmission with described access point successively according to the queue sequence of the competition queue, Zhi Daosuo
Competition queue is stated as sky.
2. according to the method described in claim 1, it is characterized in that, it will be provided with the website of channel occupancy condition in described access point
After the step of adding competition queue, the method further includes：
Whether the duration in access point detection channel competition stage exceedes predetermined threshold value；
When more than predetermined threshold value, described access point judges that the channel competition stage terminates, and data transfer phase starts.
3. according to the method described in claim 1, it is characterized in that, described need the multiple websites progress channel for transmitting data competing
Strive, including：
The multiple websites for transmitting data are needed to select a backoff value in the range of default backoff value；
Whether each website detects the backoff value of selection for 0；
When there are backoff value be 0 website when, the backoff value be 0 website channel request frame to described access point, and
Detect whether that channel confliction occurs；
If not clashing, the website possesses channel occupancy condition；
If clashing, the website no longer carries out channel competition in this communication cycle.
4. according to the method described in claim 3, it is characterized in that, each website detect selection backoff value whether for
It is described to need the multiple websites for transmitting data to carry out channel competition after 0 the step of, further include：
When there are backoff value not being 0 website, the backoff value is not kept out of the way often for 0 website by a time slot by corresponding
Value subtracts 1.
5. the method according to claim 3 or 4, it is characterised in that described access point will be provided with the station of channel occupancy condition
Point adds competition queue, including：
Described access point, which receives, possesses the channel request frame that the website of channel occupancy condition is sent, and it is corresponding to obtain the website
Site information, wherein, the site information includes：Site ID；
The site information of acquisition is added in competition queue by described access point.
6. according to the method described in claim 1, it is characterized in that, the multiple website is suitable according to the queue of the competition queue
Sequence carries out data transmission with described access point successively, and queue is competed as sky until described, including：
The beacon frame that each station for acquiring described access point is sent, and detect the site information that is carried in the beacon frame with
Whether each corresponding site information of website matches, wherein, the site information carried in the beacon frame is added to for first
The site information of the competition queue；
When there are during the targeted sites of successful match, the targeted sites acquisition of communication channels, and need are determined according to traffic rate
The data packet number to be sent and corresponding data packet, described access point is transferred to by the data packet；
When the targeted sites complete data packet transmission, described access point updates the competition queue, and detects by renewal
Competition queue whether be empty；
If not empty, the site information that queue head is competed after renewal is added to the targeted sites by described access point
In the acknowledgement frame of reply, and by acknowledgement frame described in broadcast transmission, so that the site information carried in the acknowledgement frame is corresponding
Website carries out data transfer next time；
If it is empty, described access point replys the acknowledgement frame of the targeted sites by broadcast transmission, and judges data transfer phase
Terminate, into next communication cycle.
7. the according to the method described in claim 6, it is characterized in that, institute sent in each station for acquiring described access point
Beacon frame is stated, and detects the whether matched step of the site information carried in the beacon frame site information corresponding with each website
After rapid, the multiple website carries out data transmission with described access point successively according to the queue sequence of the competition queue, directly
It is sky to the competition queue, further includes：
When existing, when matching unsuccessful website, the described access point to be received such as described unsuccessful website of matching sends acknowledgement frame
To carry out site match next time.
A kind of 8. network system, it is characterised in that the network system include be in communication with each other connection at least one access point and
Multiple websites, for the website according to communication cycle and described access point into row data communication, it is competing that each communication cycle includes channel
Strive stage and data transfer phase；
When network system is in the channel competition stage：
Multiple websites of transmission data are needed, for carrying out channel competition；
Access point, the website for will be provided with channel occupancy condition add competition queue；
At the end of the channel competition stage：
Described access point, is additionally operable to send and is used to inform that the channel competition stage terminates beacon frame that data transfer phase starts to more
A website；
The multiple website carries out data transmission with described access point successively according to the queue sequence of the competition queue, Zhi Daosuo
Competition queue is stated as sky.
9. system according to claim 8, it is characterised in that will be provided with the website of channel occupancy condition in described access point
Add after competition queue：
Whether described access point, the duration for being additionally operable to the detection channel competition stage exceed predetermined threshold value；
When more than predetermined threshold value, described access point, is additionally operable to judge that the channel competition stage terminates, data transfer phase is opened
Begin.
10. system according to claim 8, it is characterised in that the multiple website is according to the queue for competing queue
Order carries out data transmission with described access point successively, until the competition queue includes for empty mode：
Each website, for obtaining the beacon frame of described access point transmission, and detects the website carried in the beacon frame
Whether information site information corresponding with each website matches, wherein, the site information carried in the beacon frame is first
It is added to the site information of the competition queue；
When there are during the targeted sites of successful match, the targeted sites, for acquisition of communication channels, and it is true according to traffic rate
The data packet number that sends and corresponding data packet are needed calmly, and the data packet is transferred to described access point；
When the targeted sites complete data packet transmission, described access point, for updating the competition queue, and detects process
Whether the competition queue of renewal is empty；
If not empty, described access point, for being added to the site information that queue head is competed after renewal to the mesh
In the acknowledgement frame for marking station replies, and by acknowledgement frame described in broadcast transmission, so that the site information carried in the acknowledgement frame
Corresponding website carries out data transfer next time；
If it is empty, described access point, for replying the acknowledgement frame of the targeted sites by broadcast transmission, and judges data transfer
Stage terminates, into next communication cycle.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711163355.2A CN107949059A (en) | 2017-11-21 | 2017-11-21 | Method for channel allocation and network system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711163355.2A CN107949059A (en) | 2017-11-21 | 2017-11-21 | Method for channel allocation and network system |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN107949059A true CN107949059A (en) | 2018-04-20 |
Family
ID=61929402
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201711163355.2A Pending CN107949059A (en) | 2017-11-21 | 2017-11-21 | Method for channel allocation and network system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107949059A (en) |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101068175A (en) * | 2007-06-01 | 2007-11-07 | 东南大学 | Exponential backspace method for radio local network |
| US20120106371A1 (en) * | 2010-05-05 | 2012-05-03 | Qualcomm Incorporated | Collision detection and backoff window adaptation for multiuser mimo transmission |
| CN104066145A (en) * | 2013-03-22 | 2014-09-24 | 华为技术有限公司 | OFDMA competition method and access point |
| CN104320859A (en) * | 2014-11-26 | 2015-01-28 | 中国地质大学（武汉） | Competition and allocation combined MAC access method based on AP control |
-
2017
- 2017-11-21 CN CN201711163355.2A patent/CN107949059A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101068175A (en) * | 2007-06-01 | 2007-11-07 | 东南大学 | Exponential backspace method for radio local network |
| US20120106371A1 (en) * | 2010-05-05 | 2012-05-03 | Qualcomm Incorporated | Collision detection and backoff window adaptation for multiuser mimo transmission |
| CN104066145A (en) * | 2013-03-22 | 2014-09-24 | 华为技术有限公司 | OFDMA competition method and access point |
| CN104320859A (en) * | 2014-11-26 | 2015-01-28 | 中国地质大学（武汉） | Competition and allocation combined MAC access method based on AP control |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| JP4047836B2 (en) | COMMUNICATION DEVICE, COMMUNICATION SYSTEM, COMMUNICATION METHOD, AND COMMUNICATION CONTROL PROGRAM | |
| CN102905309B (en) | A kind of relay communication method based on cooperative MAC protocol in vehicle self-organizing network | |
| KR100560738B1 (en) | method for medium access control in wireless local area network system based on carrier sense multiple access with collision avoidance and station thereof | |
| CN106717053A (en) | Integrated circuit for wireless communication, wireless communication terminal, and wireless communication method | |
| JP2005198214A (en) | Communication device, communication method and communication system | |
| WO2013107398A1 (en) | Node grouping method, node, and access point | |
| US7746837B2 (en) | Overhear-based transmitting control system in WLANS | |
| WO2017000840A1 (en) | Data transmission method and apparatus | |
| EP1453338B1 (en) | Packet data resending control method and apparatus therefor | |
| CN109479324B (en) | Transmission opportunity ownership transfer and extension in Wireless Local Area Networks (WLANs) | |
| CN103428885B (en) | A kind of contention access method and website | |
| CN106879031B (en) | A kind of channel wireless radio multi Mesh network resource negotiation methods based on double receipts single-shots | |
| CN102625367B (en) | Time slot optimized multichannel multiple-access control method in multi-hop Ad Hoc network | |
| WO2022012561A1 (en) | Data transmission method and apparatus | |
| JP4314294B2 (en) | COMMUNICATION DEVICE, COMMUNICATION SYSTEM, COMMUNICATION METHOD, AND COMMUNICATION CONTROL PROGRAM | |
| US9204466B2 (en) | Method and apparatus of channel access in wireless local area network | |
| JP5298294B2 (en) | Wireless communication system | |
| WO2019169959A1 (en) | Data confirmation method and device | |
| US7773627B2 (en) | Method and apparatus for allocating transmission opportunity in communication system | |
| Sheu et al. | An improved data flushing MAC protocol for IEEE 802.11 wireless ad hoc network | |
| CN106686699A (en) | Multiple-AP selection method based on available bandwidth | |
| CN101729132A (en) | Wireless channel access scheme | |
| CN103152834A (en) | Intelligent allocation method for wireless flow | |
| CN107949059A (en) | Method for channel allocation and network system | |
| KR101064440B1 (en) | Method for cooperative communication for ieee 802.11 wireless lans |
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 | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20180420 |
|
| RJ01 | Rejection of invention patent application after publication |