CN102665280A - Processing method of client hiding situation and wireless AP (access point) - Google Patents
Processing method of client hiding situation and wireless AP (access point) Download PDFInfo
- Publication number
- CN102665280A CN102665280A CN2012101415760A CN201210141576A CN102665280A CN 102665280 A CN102665280 A CN 102665280A CN 2012101415760 A CN2012101415760 A CN 2012101415760A CN 201210141576 A CN201210141576 A CN 201210141576A CN 102665280 A CN102665280 A CN 102665280A
- Authority
- CN
- China
- Prior art keywords
- sta
- wmm
- value
- priority scheduling
- edca parameter
- 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
Images
Abstract
The invention discloses a processing method of a client hiding situation. The processing method comprises the following steps of: simulating an AP (access point) for each related STA (static timing analysis) through the AP, distributing different Wi-Fi multimedia (WMM) or EDCA (enhanced distributed channel access) parameters, and issuing Beacon frames with the distributed WMM or EDCA parameters to an associated corresponding STA through each virtual AP so that each STA carries out data packet transmission according to the WMM or EDCA parameters carried in the received Beacon frames. Based on the same idea, the invention further provides a wireless AP capable of effectively reducing the proportion of flow confliction in the direction from the STA to the AP and improving the overall performance of the WLAN network.
Description
Technical field
The present invention relates to communication technical field, particularly a kind of processing method of hiding client phenomenon and WAP.
Background technology
WLAN (WLAN) network has characteristics such as the deployment of being easy to, mobility, and range of application more and more widely.Not only enterprise network need be disposed WLAN, aspects such as city wireless network, education, individual office, ubiquitous use wlan network.
In some scene, can there be the phenomenon of hiding each other between the client (STA).For example, disposed WLAN in certain outdoor work environment, its STA is distributed in and has an area of in the scope of hundreds of rice even km around the AP, if the STA special equipment that is some, what for to being distributed in several kilometers the scope.In this environment, become concealed nodes between mutually between the STA.For another example, the wlan network of disposing for the students' dormitory in the educational institution often is that AP is deployed on the corridor, and the STA notebook that to be the student use is distributed in the students' dormitory, and an AP need provide wireless service for several dormitories.In this case, all STA can both hear AP, but do not hear mutually between the STA of two dormitories.Referring to Fig. 1, Fig. 1 is the mutual concealed structure sketch map between the STA.Among Fig. 1, AP101 is that STA102 and STA103 provide wireless service, and STA102 and STA103 can hear AP101, but can not hear mutually between STA102 and the STA103, promptly hide between STA102 and the STA103.
Hiding between the STA can bring very big influence to uplink traffic, because two STA that hide each other when sending message to AP simultaneously, can cause the conflict of AP place, gets nowhere thereby send.A plurality of STA can cause frequent conflict when hiding each other very soon, thereby cause the STA transmission rate to reduce, cause the more conflict of high probability, have not only reduced the bandwidth ability that STA sends to AP, also can seriously consume the time of eating dishes without rice or wine, and cause the performance of whole network very low.
The method that solves concealed nodes in IEEE 802.11 standards is to send the RTS message, behind receiving terminal response CTS message, and the real data message of redispatching.Yet, find that STA does not support this mechanism of RTS/CTS at present in actual the use.
Summary of the invention
In view of this, the present invention provides a kind of processing method and WAP of hiding client phenomenon, can effectively reduce the probability of STA to the flow conflict of AP direction, improves the overall performance of wlan network.
For solving the problems of the technologies described above, technical scheme of the present invention is achieved in that
A kind of processing method of hiding client phenomenon is applied in the WLAN wlan network, and said method comprises:
Wireless access point AP is the virtual AP of each related client STA; Distribute different Wi-Fi multimedia WMM or enhanced channel access parameter EDCA parameter; And carry the WMM of said distribution or the Beacon frame of EDCA parameter to the corresponding STA of association issue through each virtual AP, make each said STA carry out packet and send according to receiving the WMM that carries in the Beacon frame or EDCA parameter.
A kind of AP is applied in the wlan network, and said AP comprises: dummy unit, allocation units and release unit;
Said dummy unit is used to the virtual AP of each related STA;
Said allocation units are used to each related STA and distribute different WMM or EDCA parameter;
Said release unit; Be used for carrying the WMM of said allocation units distribution or the Beacon frame of EDCA parameter to the corresponding STA issue of association, make each said STA carry out the packet transmission according to receiving the WMM or the EDCA parameter of carrying in the Beacon frame through each virtual AP of said dummy unit.
In sum; The present invention is the virtual AP independently of each STA through AP; Distribute different WMM or ECDA parameter, carry the WMM of distribution or the Beacon frame of ECDA parameter to the STA of correspondence issue respectively, send order of priority thereby dispatch each STA through virtual AP; Effectively reduce the probability of STA, improve the overall performance of wlan network to the flow conflict of AP direction.
Description of drawings
Fig. 1 is the mutual concealed structure sketch map between the STA;
Fig. 2 is a process flow sketch map of hiding the client phenomenon in the embodiment of the invention;
Fig. 3 respectively organizes the structural representation of STA for priority scheduling in turn;
Fig. 4 is the time chart of STA access channel;
Fig. 5 is the structural representation of the WAP of the processing that is applied to hide the client phenomenon in the specific embodiment of the invention.
Embodiment
For making the object of the invention, technical scheme and advantage clearer, below with reference to the accompanying drawing embodiment that develops simultaneously, scheme according to the invention is done to specify further.
Propose a kind of processing method of hiding client phenomenon in the embodiment of the invention, be applied in the wlan network, AP is related with a plurality of STA in this wlan network.
Referring to Fig. 2, Fig. 2 is a process flow sketch map of hiding the client phenomenon in the embodiment of the invention.Concrete steps are:
Step 201, AP is the virtual AP of each related STA, distributes different WMM or EDCA parameter.
AP is the virtual AP independently of each related STA, promptly different B SSID, and each virtual AP independently issues the Beacon frame, the virtual AP that different STA is corresponding different; AP distributes different WMM or EDCA parameter for each STA, thereby makes each STA that different channel competition probability arranged.
Step 202, AP carries the WMM of said distribution or the Beacon frame of EDCA parameter through each virtual AP to the corresponding STA issue of association, makes each said STA carry out the packet transmission according to receiving the WMM or the EDCA parameter of carrying in the Beacon frame.
Eat dishes without rice or wine in order to guarantee that the STA justice is used, AP need utilize the Beacon frame to come constantly WMM or the EDCA parameter of each STA of adjustment, thereby makes at several Beacon in the cycle that each STA keeps justice basically to the use of eating dishes without rice or wine.Therefore can take turns each STA of priority scheduling.In order to simplify each STA of priority scheduling in turn, AP divides into groups the current STA related with self.
AP with the method that the current STA related with self divides into groups is: AP divides into groups STA according to the sum of current related STA and the transmission rate of each STA.
AP is to the grouping of STA, according to the sum of the STA of current association, confirms all STA are divided into several groups, according to applied environment and experience division.As: STA adds up to 30, and all STA are divided into 2 or 3 groups.And according to the transmission rate of each STA, the STA that transmission rate is approaching is placed on one group, is assigned to 2 or 3 groups that are divided into.Can let the high STA of transmission rate disturbed by the low user of transmission rate so as far as possible.STA number in every group does not need identical.Because the transmission rate of STA is to change with the distance of wireless environment, STA distance A P etc., therefore, AP is according to the STA sum of current association and the transmission rate of each STA, the grouping of cycle adjustment STA.What are set to as for the cycle, confirm according to concrete practical situations.
After AP divided into groups all STA, scheduling one group of STA wherein in the Beacon cycle was promptly at Beacon all STA in arbitrary said group of the priority scheduling in turn in the cycle, all STA in other groups of non-priority scheduling.After AP divided into groups all STA, the STA in same group had identical WMM or EDCA parameter.
During all STA in needing arbitrary group of priority scheduling, the WMM or the EDCA parameter of in this group, carrying distribution in the Beacon frame of arbitrary STA issue are WMM or the ECDA parameter that is used for priority scheduling; When all STA in arbitrary group of the non-priority scheduling of need, the WMM or the EDCA parameter of the distribution of in the Beacon frame of this STA issue, carrying are WMM or the ECDA parameter that is used for non-priority scheduling.
Suppose that with the current related STA of said AP be 4, be respectively STA1, STA2, STA3 and STA4, it is divided into two groups, wherein STA1 and STA2 are first group, and STA3 and STA4 are second group.Referring to Fig. 3, Fig. 3 respectively organizes the structural representation of STA for priority scheduling in turn.Visible among Fig. 3; At first Beacon STA1 and STA2 in first group of the priority scheduling in the frame period; Therefore the AP through corresponding virtual is that the parameter that STA1 carries during with STA2 issue Beacon frame is WMM or the ECDA parameter that is used for priority scheduling, is WMM or the ECDA parameter that is used for non-priority scheduling and be distributed to the parameter of carrying when STA3 and STA4 issue the Beacon frame.At the 2nd Beacon STA3 and STA4 in second group of the priority scheduling in the frame period; Therefore the AP through corresponding virtual is that the parameter that STA1 carries during with STA2 issue Beacon frame is WMM or the ECDA parameter that is used for non-priority scheduling, is WMM or the ECDA parameter that is used for priority scheduling and be distributed to the parameter of carrying when STA3 and STA4 issue the Beacon frame.
AP is that WMM that is used for priority scheduling or the EDCA parameter that arbitrary STA distributes comprises: transmission duration TXOPpri, ECWmin-pri and the ECWmax-pri of channel; The WMM or the EDCA parameter that are used for non-priority scheduling comprise: TXOPger, ECWmin-ger and ECWmax-ger.
TXOPpri confirms according to preset rules according to the number of the STA in this STA place group; The probability that the difference of the value of ECWmin-pri and ECWmax-pri through the random function of any two STA in this STA place group is not less than TXOPpri guarantees to obtain under the highest situation of channel utilization; The TXOPger basis is confirmed according to preset rules with the sum that this STA is all the STA of non-priority scheduling; The value of ECWmin-ger and ECWmax-ger obtains guaranteeing that the utilance that is all STA access channels of non-priority scheduling with this STA is no more than under the situation of preset value; Wherein, Preset rules is: the number of STA is many more, and the value of TXOPpri or TXOPger is more little.
AP is that WMM that is used for priority scheduling or the EDCA parameter that arbitrary STA distributes also comprises the first preset AIFSN value; Said WMM or the EDCA parameter that is used for non-priority scheduling also comprises the second preset AIFSN value; Wherein, the first preset AIFSN value is less than the second preset AIFSN value.
Consider to hide between the STA the conflict of channel access, just need not only consider the conflict of STA while access channel, more need consider in the whole TXOP duration of certain STA access channel, other STA can not access channel, otherwise will clash.That is to say that suppose one group of n STA, their competition window all is CW; The result of their Random () value is [0 so; CW] in be evenly distributed, wherein CW is in [CWmin, CWmax] interior value; The random valued of the STAi random valued Random (j) as a result of Random (i) and STAj as a result for example, then the difference between Random (i) and the Random (j) is the bigger the better more than or equal to the probability of TXOP on the one hand.On the other hand, if CW is excessive or too small, can cause channel utilization more and more lower.Therefore, CW must get suitable value, and promptly the probability that is not less than TXOP of the difference through the random function of any two STA in the group of arbitrary said STA place guarantees to obtain under the highest situation of channel utilization.
Specify how to confirm WMM or ECDA parameter through specific embodiment below:
If STA adds up to 30; Can be divided into 2 or 3 groups according to practical situations; Suppose to be divided into 3 groups here, then according to the transmission rate of STA 30 STA are added to respectively according to speed phase approximately principle in 3 groups that are divided into, the STA that speed is not more than the first preset rate value is assigned to first group; The STA that is not more than the second preset rate value greater than the first preset rate value is assigned to second group, is assigned to the 3rd group greater than the STA of the second preset rate value.The preset value here can be confirmed according to concrete application and institute's packet count.
AP confirms the duration TXOP of each access channel according to the number of STA in every group for STA.Usually, the STA number is many more, and TXOP is short more good more.When dividing the TXOPpri that is used in priority scheduling, ECWmin-pri and ECWmax-pri for arbitrary STA; If the STA number is 4 or 5 o'clock in this STA place group; TXOPpri can confirm as the duration of 1 to 3 message of transmission rate transmission of this group STA, comprises the ACK response time; If the STA number is 2 to 3 in this STA place group, TXOPpri can be more more.According to number and the TXOPpri of STA in this STA place group, confirm the CWpri of this group STA, CWpri is set to the multiple relation of TXOPpri, and according to STA number in this group, confirms multiple, makes channel utilization reach peak value.When being 4 to 5 like this group STA number, CWpri can confirm as 12 to 20 TXOPpri, is 2 to 3 like this group STA number, and CWpri can confirm as 8 to 10 TXOPpri.The method of confirming ECWmin-pri, ECWmax-pri according to CWpri is following:
Divide the TXOPger that is used in non-priority scheduling for arbitrary STA; During the value of ECWmin-ger and ECWmax-ger; During according to this STA of non-priority scheduling; The sum that is in the STA of non-priority scheduling together with this STA is confirmed the value of TXOPger, confirms that rule and method with above-mentioned definite TXOPpri, give unnecessary details no longer in detail here.The value of ECWmin-ger and ECWmax-ger obtains guaranteeing that the utilance that is all STA access channels of non-priority scheduling with this STA is no more than under the situation of channel utilization preset value.Concrete computational methods are following:
CWger=A/N*M, wherein, A is the channel utilization preset value, confirms in advance according to practical situations, and N is the sum that is all the STA of non-priority scheduling with this STA, and M is the number of 1 Beacon TXOPger in the cycle.
AP is that WMM that is used for priority scheduling or the EDCA parameter that arbitrary said STA distributes also comprises the first preset AIFSN value; Said WMM or the EDCA parameter that is used for non-priority scheduling also comprises the second preset AIFSN value; Wherein, the first preset AIFSN value is less than the second preset AIFSN value.The AIFSN of every group of STA gets smaller value when priority scheduling, as 1; All get bigger value during non-priority scheduling, as 6 or more than.Concrete value is confirmed according to practical application or experience.
STA receives the Beacon frame of AP through corresponding virtual AP issue; The back-off wait time when parameter TXOP that carries according to the Beacon frame, AIFSN, ECWmin-pri and ECWmax-pri obtain priority scheduling self and the transmission duration of channel, or back-off wait time and the transmission duration of channel of the value of the parameter TXOP, AIFSN ECWmin-ger and the ECWmax-ger that carry according to the Beacon frame when obtaining non-priority scheduling self.Concrete acquisition mode is referring to following formula:
CWmin=2
ECWmin-1, CWmax=2
ECWmax-1, CW is in [CWmin, CWmax] interior value;
Backoff Time=Random () * SlotTime, Random () are evenly distributed in [0, CW];
AIFS=AIFSN×SlotTime+SIFS。
The back-off wait time be AIFS and random time (Backoff Time) with, referring to Fig. 4, Fig. 4 is the time chart of STA access channel.During the STA access channel, keep out of the way a period of time earlier according to AIFS and BackoffTime, among Fig. 4 if back-off wait finds after the time that channel is idle, just can send message.STA carries out existing together realization of process that packet sends according to WMM that receives or EDCA parameter, gives unnecessary details no longer in detail here.
Based on same inventive concept, the present invention also proposes a kind of WAP, is applied among the WLAN.Referring to Fig. 5, Fig. 5 is the structural representation of the WAP of the processing that is applied to hide the client phenomenon in the specific embodiment of the invention.This WAP comprises: dummy unit 501, allocation units 502 and release unit 503.
Dummy unit 501 is used to the virtual AP of each related STA.
Preferably,
This AP further comprises: grouped element 504.
Preferably,
Preferably, this AP further comprises: scheduling unit 505.
Preferably,
Preferably,
Preferably,
Preferably,
The unit of the foregoing description can be integrated in one, and also can separate deployment; A unit can be merged into, also a plurality of subelements can be further split into.
In sum; Be the virtual AP independently of each STA through AP in the specific embodiment of the invention; Distribute different WMM or ECDA parameter, carry the WMM of distribution or the Beacon frame of ECDA parameter to the STA of correspondence issue respectively, send order of priority thereby dispatch each STA through virtual AP; Effectively reduce the probability of STA, improve the overall performance of wlan network to the flow conflict of AP direction.
The STA sum of current association of also giving chapter and verse in the specific embodiment of the invention comes for STA divides into groups with transmission rate, and the WMM or the ECDA parameter of pressing group scheduling STA, provides the process of definite priority scheduling and non-priority scheduling WMM or ECDA parameter.Simplified the process of single STA scheduling.
The above is merely preferred embodiment of the present invention, is not to be used to limit protection scope of the present invention.All within spirit of the present invention and principle, any modification of being done, be equal to replacement, improvement etc., all should be included within protection scope of the present invention.
Claims (16)
1. the processing method of a hiding client phenomenon is applied to it is characterized in that in the WLAN wlan network that said method comprises:
Wireless access point AP is the virtual AP of each related client STA; Distribute different Wi-Fi multimedia WMM or enhanced channel access parameter EDCA parameter; And carry the WMM of said distribution or the Beacon frame of EDCA parameter to the corresponding STA of association issue through each virtual AP, make each said STA carry out packet and send according to receiving the WMM that carries in the Beacon frame or EDCA parameter.
2. method according to claim 1 is characterized in that, said method further comprises:
Said AP divides into groups STA according to the sum of the STA of current association and the transmission rate of each STA.
3. method according to claim 2 is characterized in that, said method further comprises:
Said AP is according to the STA sum of current association and the transmission rate of each STA, and the cycle is adjusted the grouping of STA.
4. according to claim 2 or 3 described methods, it is characterized in that said method further comprises:
All STA in arbitrary said group of the priority scheduling in turn in predetermined period.
5. method according to claim 4 is characterized in that, said method further comprises:
When all STA in arbitrary said group of the need priority scheduling, the WMM or the EDCA parameter of in this group, carrying distribution in the Beacon frame of arbitrary STA issue are WMM or the ECDA parameter that is used for priority scheduling; When all STA in arbitrary said group of the non-priority scheduling of need, the WMM or the EDCA parameter of in the Beacon frame of this STA issue, carrying distribution are WMM or the ECDA parameter that is used for non-priority scheduling.
6. method according to claim 5 is characterized in that, said WMM that is used for priority scheduling or EDCA parameter of distributing for arbitrary STA comprises: transmission duration TXOPpri, ECWmin-pri and the ECWmax-pri of channel; Said WMM or the EDCA parameter that is used for non-priority scheduling comprises: TXOPger, ECWmin-ger and ECWmax-ger;
Wherein, TXOPpri confirms according to preset rules according to the number of the STA in this STA place group; The probability that the difference of the value of ECWmin-pri and ECWmax-pri through the random function of any two STA in this STA place group is not less than TXOPpri guarantees to obtain under the highest situation of channel utilization; The TXOPger basis is confirmed according to preset rules with the sum that this STA is all the STA of non-priority scheduling; The value of ECWmin-ger and ECWmax-ger obtains guaranteeing that the utilance that is all STA access channels of non-priority scheduling with this STA is no more than under the situation of preset value.
7. method according to claim 6 is characterized in that, said preset rules is:
The number of STA is many more, and the value of TXOPpri or TXOPger is more little.
8. method according to claim 6 is characterized in that,
Said WMM that is used for priority scheduling or EDCA parameter of distributing for arbitrary STA also comprises the first preset AIFSN value; Said WMM or the EDCA parameter that is used for non-priority scheduling also comprises the second preset AIFSN value; Wherein, the first preset AIFSN value is less than the second preset AIFSN value.
9. a wireless access point AP is applied to it is characterized in that in the WLAN wlan network that said AP comprises: dummy unit, allocation units and release unit;
Said dummy unit is used to the virtual AP of each related client STA;
Said allocation units are used to each related STA and distribute different Wi-Fi multimedia WMM or enhanced channel access parameter EDCA parameter;
Said release unit; Be used for carrying the WMM of said allocation units distribution or the Beacon frame of EDCA parameter to the corresponding STA issue of association, make each said STA carry out the packet transmission according to receiving the WMM or the EDCA parameter of carrying in the Beacon frame through each virtual AP of said dummy unit.
10. AP according to claim 9 is characterized in that said AP further comprises: grouped element;
Said grouped element is used for basis and with the sum of the current related STA of self place AP and the transmission rate of each STA STA is divided into groups.
11. AP according to claim 10 is characterized in that,
Said grouped element is further used for according to the STA sum of current association and the transmission rate of each STA the grouping of cycle adjustment STA.
12., it is characterized in that said AP further comprises: scheduling unit according to claim 10 or 11 described AP;
Said scheduling unit is used in predetermined period all STA in the group that the arbitrary said grouped element of priority scheduling in turn divided.
13. AP according to claim 12 is characterized in that,
Said release unit, when being used for all STA in said scheduling unit needs arbitrary said group of priority scheduling, the WMM or the EDCA parameter of carrying distribution in the Beacon frame that arbitrary STA issues in this group are WMM or the ECDA parameter that is used for priority scheduling; During all STA of moral, the WMM or the EDCA parameter of in the Beacon frame of this STA issue, carrying distribution are WMM or the ECDA parameter that is used for non-priority scheduling in said scheduling unit needs arbitrary said group of non-priority scheduling.
14. AP according to claim 13 is characterized in that,
Said allocation units, the said WMM or the EDCA parameter that is used for priority scheduling of distributing for arbitrary STA comprises: the value of transmission duration TXOPpri, ECWmin-pri and the ECWmax-pri of channel; Said WMM or the EDCA parameter that is used for non-priority scheduling comprises: TXOPger, the value of ECWmin-ger and ECWmax-ger;
Said definite unit is used for confirming according to preset rules according to the number of the STA in this STA place group the value of the TXOPpri that said allocation units distribute; The probability that the difference of the random function through any two STA in this STA place group is not less than TXOPpri guarantees to obtain under the highest situation of channel utilization ECWmin-pri that said allocation units distribute and the value of ECWmax-pri; Confirm the value of the TXOPger that said allocation units are confirmed according to preset rules according to the sum that is all the STA of non-priority scheduling with this STA; Obtain ECWmin-ger that said allocation units distribute and the value of ECWmax-ger under the situation of preset value guaranteeing that the utilance that is all STA access channels of non-priority scheduling with this STA is no more than.
15. AP according to claim 14 is characterized in that,
Said definite unit, confirm that the preset rules of value of value or the said TXOPger of said TXOPpri is: the number of STA is many more, and the value of TXOPpri or TXOPger is more little.
16. AP according to claim 12 is characterized in that,
Said allocation units, the said WMM or the EDCA parameter that is used for priority scheduling of distributing for arbitrary said STA also comprises the first preset AIFSN value; Said WMM or the EDCA parameter that is used for non-priority scheduling also comprises the second preset AIFSN value; Wherein, the first preset AIFSN value is less than the second preset AIFSN value.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN2012101415760A CN102665280A (en) | 2012-05-08 | 2012-05-08 | Processing method of client hiding situation and wireless AP (access point) |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN2012101415760A CN102665280A (en) | 2012-05-08 | 2012-05-08 | Processing method of client hiding situation and wireless AP (access point) |
Publications (1)
Publication Number | Publication Date |
---|---|
CN102665280A true CN102665280A (en) | 2012-09-12 |
Family
ID=46774665
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN2012101415760A Pending CN102665280A (en) | 2012-05-08 | 2012-05-08 | Processing method of client hiding situation and wireless AP (access point) |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN102665280A (en) |
Cited By (7)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN103209418A (en) * | 2013-03-22 | 2013-07-17 | 惠州Tcl移动通信有限公司 | Mobile terminal and wireless fidelity (WIFI) hot spot information updating method thereof |
CN103269502A (en) * | 2013-04-27 | 2013-08-28 | 杭州华三通信技术有限公司 | Method and device for wireless speed automatic regulation |
CN103327649A (en) * | 2013-06-28 | 2013-09-25 | 深圳市普联技术有限公司 | Access equipment site scheduling method and access equipment |
CN104902512A (en) * | 2014-03-06 | 2015-09-09 | 智邦科技股份有限公司 | Method for controlling packet priority, access point and communications systems thereof |
CN105025588A (en) * | 2014-08-07 | 2015-11-04 | 魅族科技(中国)有限公司 | WLAN channel access method, associated equipment and system |
CN109792777A (en) * | 2016-09-22 | 2019-05-21 | 阿尔卡特朗讯 | For controlling the method and system of the access to access net competition-based |
WO2022073512A1 (en) * | 2020-10-10 | 2022-04-14 | 中兴通讯股份有限公司 | Scheduling method and apparatus, and electronic device |
Citations (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN1852193A (en) * | 2005-10-21 | 2006-10-25 | 华为技术有限公司 | Network sharing method in wireless local network |
CN101159648A (en) * | 2007-11-30 | 2008-04-09 | 杭州华三通信技术有限公司 | Method and apparatus for configuring EDCA parameter of WLAN network |
US20080186945A1 (en) * | 2007-02-06 | 2008-08-07 | Lg Eletronics Inc. | Wireless lan system and transmission method of data thereof |
CN101931954A (en) * | 2009-06-22 | 2010-12-29 | 南京中兴软件有限责任公司 | Method for improving quality of service (QoS) of real-time service in wireless local area network based on service differentiation |
CN102238749A (en) * | 2010-04-15 | 2011-11-09 | 杭州华三通信技术有限公司 | Channel competition method and AP (access point) equipment |
-
2012
- 2012-05-08 CN CN2012101415760A patent/CN102665280A/en active Pending
Patent Citations (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN1852193A (en) * | 2005-10-21 | 2006-10-25 | 华为技术有限公司 | Network sharing method in wireless local network |
US20080186945A1 (en) * | 2007-02-06 | 2008-08-07 | Lg Eletronics Inc. | Wireless lan system and transmission method of data thereof |
CN101159648A (en) * | 2007-11-30 | 2008-04-09 | 杭州华三通信技术有限公司 | Method and apparatus for configuring EDCA parameter of WLAN network |
CN101931954A (en) * | 2009-06-22 | 2010-12-29 | 南京中兴软件有限责任公司 | Method for improving quality of service (QoS) of real-time service in wireless local area network based on service differentiation |
CN102238749A (en) * | 2010-04-15 | 2011-11-09 | 杭州华三通信技术有限公司 | Channel competition method and AP (access point) equipment |
Cited By (11)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN103209418A (en) * | 2013-03-22 | 2013-07-17 | 惠州Tcl移动通信有限公司 | Mobile terminal and wireless fidelity (WIFI) hot spot information updating method thereof |
CN103209418B (en) * | 2013-03-22 | 2016-08-17 | 惠州Tcl移动通信有限公司 | Mobile terminal and WIFI hot spot information updating method thereof |
CN103269502A (en) * | 2013-04-27 | 2013-08-28 | 杭州华三通信技术有限公司 | Method and device for wireless speed automatic regulation |
CN103269502B (en) * | 2013-04-27 | 2016-09-28 | 杭州华三通信技术有限公司 | A kind of method and device automatically adjusted without line rate |
CN103327649A (en) * | 2013-06-28 | 2013-09-25 | 深圳市普联技术有限公司 | Access equipment site scheduling method and access equipment |
CN103327649B (en) * | 2013-06-28 | 2016-08-17 | 普联技术有限公司 | The method of a kind of access device scheduling website and access device |
CN104902512A (en) * | 2014-03-06 | 2015-09-09 | 智邦科技股份有限公司 | Method for controlling packet priority, access point and communications systems thereof |
CN105025588A (en) * | 2014-08-07 | 2015-11-04 | 魅族科技(中国)有限公司 | WLAN channel access method, associated equipment and system |
CN105025588B (en) * | 2014-08-07 | 2018-09-14 | 魅族科技(中国)有限公司 | A kind of method, relevant device and the system of Wireless LAN access channel |
CN109792777A (en) * | 2016-09-22 | 2019-05-21 | 阿尔卡特朗讯 | For controlling the method and system of the access to access net competition-based |
WO2022073512A1 (en) * | 2020-10-10 | 2022-04-14 | 中兴通讯股份有限公司 | Scheduling method and apparatus, and electronic device |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US11395367B2 (en) | Method and device for transmitting and receiving information about size of resource unit in wireless local area network system | |
CN102665280A (en) | Processing method of client hiding situation and wireless AP (access point) | |
CN109495974B (en) | Information transferring method and device | |
KR102071564B1 (en) | System and method for setting cyclic prefix length | |
CN107735993A (en) | Stochastic accessing PPDU for wlan system | |
US20200205105A1 (en) | Systems and Methods for Operation of Wireless User Devices with Cellular and Wi-Fi Interfaces | |
CN104202740A (en) | Communication data transmitting method and device and user equipment | |
CN106165513B (en) | For providing the method and apparatus of multi-client access | |
CN108353424A (en) | The method that the uplink frame of multiple users is sent in Wireless LAN system | |
CN103220726B (en) | A kind of dynamic adjusting method of EDCA parameter value and relevant apparatus | |
CN103326914A (en) | Deterministic back-off method and apparatus for peer-to-peer communications | |
CN104202822A (en) | Channel access method, channel access system and stations | |
CN103687044B (en) | A kind of data transmission method and equipment | |
CN105659683A (en) | System and Method for Setting Cyclic Prefix Length | |
ES2867773T3 (en) | Procedure and device for transmission instruction, transmission activation and transmission implementation for multiple stations | |
CN103533584B (en) | A kind of water sound sensor network multichannel media access control method | |
CN107113749A (en) | System and method for power control | |
CN103533653A (en) | Method and device for solving the problem of hidden nodes in local area network | |
WO2015095144A1 (en) | System and method for ofdma resource management in wlan | |
CN102740476B (en) | A kind of method for resource allocation and system | |
CN103430584A (en) | Method and apparatus for reducing interference | |
CN104640230B (en) | A kind of user equipment access method and user equipment | |
CN107888325B (en) | Point-to-multipoint star ad hoc network and frame scheduling method thereof | |
CN109495851A (en) | A kind of user data transmission method, device and the network equipment | |
CN105376830B (en) | The up-link access method that a kind of channel bonding and orthogonal frequency-time multiple access are combined |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
C06 | Publication | ||
PB01 | Publication | ||
C10 | Entry into substantive examination | ||
SE01 | Entry into force of request for substantive examination | ||
C02 | Deemed withdrawal of patent application after publication (patent law 2001) | ||
WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20120912 |