CN112566223A - WLAN access point selection method based on multi-attribute weighting - Google Patents

WLAN access point selection method based on multi-attribute weighting Download PDF

Info

Publication number
CN112566223A
CN112566223A CN202011383457.7A CN202011383457A CN112566223A CN 112566223 A CN112566223 A CN 112566223A CN 202011383457 A CN202011383457 A CN 202011383457A CN 112566223 A CN112566223 A CN 112566223A
Authority
CN
China
Prior art keywords
formula
expressed
transmission rate
wsi
apj
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN202011383457.7A
Other languages
Chinese (zh)
Other versions
CN112566223B (en
Inventor
解志斌
翁智辉
秦浩然
卢晓艳
徐桧
刘民东
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Dragon Totem Technology Hefei Co ltd
Original Assignee
Jiangsu University of Science and Technology
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Jiangsu University of Science and Technology filed Critical Jiangsu University of Science and Technology
Priority to CN202011383457.7A priority Critical patent/CN112566223B/en
Publication of CN112566223A publication Critical patent/CN112566223A/en
Application granted granted Critical
Publication of CN112566223B publication Critical patent/CN112566223B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W48/00Access restriction; Network selection; Access point selection
    • H04W48/20Selecting an access point
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W28/00Network traffic management; Network resource management
    • H04W28/02Traffic management, e.g. flow control or congestion control
    • H04W28/08Load balancing or load distribution
    • YGENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02DCLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D30/00Reducing energy consumption in communication networks
    • Y02D30/70Reducing energy consumption in communication networks in wireless communication networks

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Computer Security & Cryptography (AREA)
  • Small-Scale Networks (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

The invention relates to the technical field of wireless communication, in particular to a WLAN access point selection method based on multi-attribute weighting, which comprises the following steps: the method comprises the following steps: giving an initial access point selection policy; step two: in the current access strategy, each WS selects the optimal AP according to the selection of other WS; step three: recording the change condition of the multi-attribute weighting index of the WLAN before and after each WS changes the AP, so that the WS with the maximum increase of the multi-attribute weighting index of the network wins the opportunity of updating the currently associated AP, and the current access strategy is changed; step four: repeating the second step and the third step until the current access strategy is not changed; step five: and outputting the access strategy at the moment, and scheduling the WS according to the access strategy by the AC.

Description

WLAN access point selection method based on multi-attribute weighting
Technical Field
The invention relates to the technical field of wireless communication, in particular to a WLAN access point selection method based on multi-attribute weighting, which is an access point selection method based on multi-attribute weighting and oriented to an IEEE802.11 wireless local area network.
Background
IEEE802.11 Wireless Local Area Network (WLAN) has become a popular networking method due to its features of convenient deployment, low cost and flexibility. Due to the limited coverage of a single Access Point (AP), a plurality of APs are usually deployed in a large site to meet the coverage requirement of the WLAN. In such AP-dense WLANs, how a Wireless device (WS) selects a suitable AP for data transmission becomes a research hotspot.
Existing access point selection strategies can generally be divided into distributed strategies and centralized strategies.
In the distributed strategy, the WS collects some indicators of surrounding APs, such as the number of WS on the AP, signal strength or delay, and then selects a suitable AP according to the indicators. The distributed strategy has the advantage that WS can independently and quickly select an AP according to local information collected by WS, and the cost and structure of networking are relatively cheap and simple. The disadvantage is that after multiple WS selections, the resulting selection policy may cause network performance degradation. IEEE Transactions on Vehicular Technology 60, volume 3, Standard and failure of AP selection gaps in IEEE802.11 access networks IEEE Transactions on Vehicular Technology proposes a distributed strategy to maximize the total throughput of the network without concern for the specific throughput requirements of WS. A distributed strategy for improving experience quality is provided in 'AP Selection with Adaptive CCAT for sense Wireless Networks' on 2017 IEEE Wireless Communications and network Conference, but the load balance degree of the WLAN is not concerned.
The traditional access point selection strategy is that WS selects an AP with the maximum received signal strength based on the received signal strength index of the AP, and belongs to a distributed strategy. This simple selection is not suitable for AP-dense WLANs because it results in overall performance degradation of the network and unbalanced loading on the APs.
In a distributed strategy, it is local information that is collected by WS. In the centralized policy, an Access Point Controller (AC) centrally schedules the WS to select an appropriate AP. The AC has the authority to monitor the whole network and schedule the WS, and can collect global information. A centralized policy for a software defined network as an AC is proposed in Computers & Electrical Engineering, volume 66, A novel AP selection scheme in software defined network enabled WLAN. The centralized policy has the advantage that the AC can obtain global information to centrally control the access of the WS, which is beneficial to improving the performance level of the whole network. Chinese patent CN201910950925.5 discloses an access point adaptive adjustment method based on load balancing and adopting a centralized policy, but does not consider the throughput requirement of WS.
Disclosure of Invention
The invention aims to provide a WLAN access point selection method based on multi-attribute weighting, which is suitable for an IEEE802.11WLAN with dense AP, utilizes AC to carry out centralized scheduling on the AP and the WS, comprehensively considers the actual throughput demand of the WS, the service quality of the WS to the actual associated AP and the load balance degree of the AP, and provides a new multi-attribute weighting index. The overall performance of the network is ensured by maximizing the proposed multi-attribute weighting index through a two-layer cooperative game theory method, and a final access point selection overall strategy is obtained. Compared with the traditional method based on the signal receiving strength, the method can effectively improve the service quality of the WS and effectively balance the load on the AP.
The invention adopts the following specific technical scheme:
a multi-attribute weighted WLAN access point selection method, the WLAN includes an AC, M randomly distributed APs and N randomly distributed Ws (N)>M). By using
Figure BDA0002810303530000021
Figure BDA0002810303530000022
Respectively representing a set of APs and a set of WS. Adjacent APs use non-overlapping frequency bands and therefore there is no adjacent AP interference. The WLAN is based on the IEEE802.11 protocol cluster (e.g., IEEE802.11 b, supporting WS physical layer transmission rates of 11,5.5,2,1 Mbps).The transmission rate is determined according to the channel conditions. The medium access layer protocol (MAC) employs a Distributed Coordination Function (DCF). Consider that WS in the network is in saturation mode, i.e. WS is always transmitting data to AP.
The multi-attribute weighted WLAN access point selection method comprises the following steps:
the method comprises the following steps: given an initial access point selection policy. Each WS in the WS set selects and associates the nearest AP, and the selection sets of all the WS are recorded as an initial access strategy;
step two: in the current access strategy, each WS selects the best AP according to the selection of other WS, and the best AP can maximize the multi-attribute weighting index of the WLAN. Marking the Multi-Attribute weighting Index of the WLAN as WMAI (Weighted Multi-Attribute Index), wherein the calculation method of the WMAI comprises the following steps:
Figure BDA0002810303530000031
(1) in the formula ofi,jDenotes the association of WS i with AP j, λi,j1 denotes WS i selects association AP j, λ i,j0 means WS i does not select association AP j, Qi,jRepresents the service quality of WS i to AP J, J represents a load balancing index, alpha represents the weight of the attribute, and alpha belongs to [0,1]]。
Qi,jCan be expressed as:
Figure BDA0002810303530000032
(2) in the formula Thri,jRepresents the actual throughput, r, obtained after WS i selects the associated AP jiRepresenting the throughput requirement of WS i.
Thr in IEEE802.11 bi,jCan be expressed as:
Figure BDA0002810303530000033
(3) in the formula of Ui,jRepresents the time fraction s occupied by WS i after accessing AP jdIndicating the length of the data frame and having a value of 12272 bits, Ti,jRepresents the total transmission time required for Wsi to transmit a frame, bi,jRepresenting the physical layer transmission rate between WS i and AP j.
Ti,jCan be expressed as:
Ti,j(K)=ttr+tov+tcont(K) (4)
(4) in the formula ttrRepresenting the transmission time, tovRepresents a fixed overhead, tcont(K) Represents the contention time of WS i with other WS on AP j, and K represents the total number of WS on AP j. t is ttrCan be expressed as:
Figure BDA0002810303530000034
tovdepending on the transmission rate used by WS. If transmitted at a rate of 1,2, 5.5, or 11Mbps, t is then at this timeov541, 305, 271, 262 μ s (these parameters apply to 802.11 b).
tcont(K) Can be expressed as:
Figure BDA0002810303530000041
(6) where SLOT is 20 μ s, CW denotes the contention window size, range CWmin31 to CWmax=1023,Pc(K) Indicating the probability of successful acknowledgement at the MAC layer.
Pc(K) Can be expressed as:
Figure BDA0002810303530000042
Ui,jcan be expressed as:
Figure BDA0002810303530000043
(8) in the formula
Figure BDA0002810303530000044
Represents the set of all WS on AP j, tjamRepresenting the average length of time spent in a collision.
tjamRelated to the transmission rate of the participating WS in the collision, it can be expressed as:
tjam=P1T1,j+P2T2,j+P3T3,j+P4T4,j (9)
(9) in the formula T1,j,T2,j,T3,jAnd T4,jRespectively, the total transmission time, P, required for WS with transmission rate of 1,2, 5.5, 11Mbps to transmit a frame1,P2,P3And P4This indicates the probability that the lower transmission rate at the time of collision is 1,2, 5.5, or 11 Mbps.
Figure BDA0002810303530000045
Figure BDA0002810303530000046
Figure BDA0002810303530000047
Figure BDA0002810303530000048
(10) Formula (1) - (13) wherein, K1To represent
Figure BDA0002810303530000049
WS number, K, with a medium transmission rate of 1Mbps2To represent
Figure BDA0002810303530000051
WS number, K, with a medium transmission rate of 2Mbps3To represent
Figure BDA0002810303530000052
WS number, K, with a medium transmission rate of 5.5Mbps4To represent
Figure BDA0002810303530000053
The number of WS with a medium transmission rate of 11 Mbps.
The load balancing index J can reflect the load condition of the network, J belongs to [0,1], and the more J approaches to 1, the more balanced the network load is.
J can be represented as:
Figure BDA0002810303530000054
step three: recording the change condition of the multi-attribute weighting index of the WLAN before and after each WS changes the AP, so that the WS with the maximum increase of the multi-attribute weighting index of the network wins the opportunity of updating the currently associated AP, and the current access strategy is changed;
step four: repeating the second step and the third step until the current access strategy is not changed
Step five: and outputting the access strategy at the moment, and scheduling the WS according to the access strategy by the AC.
The invention has the beneficial effects that: compared with the prior art, the method utilizes the AC to collect global information and carry out comprehensive decision; comprehensively considering the actual throughput demand of the WS, the service quality of the WS to the actual associated AP and the load balancing degree of the AP, and providing a new multi-attribute weighting index; the overall performance of the network is ensured by maximizing the proposed multi-attribute weighting index through a game theory method, and a final access point selection overall strategy is obtained; compared with the traditional method based on the signal receiving strength, the method can effectively improve the service quality of the WS, effectively balance the load on the AP and improve the overall performance of the network.
Drawings
FIG. 1 is a system model diagram of a centralized AP-dense IEEE802.11WLAN of the present invention.
Fig. 2 is a two-dimensional plane distribution diagram of WS and AP in an embodiment of the present invention.
Fig. 3 is a flow chart of the multi-attribute weighted WLAN access point selection method of the present invention.
Detailed Description
For the purpose of enhancing the understanding of the present invention, the present invention will be described in further detail with reference to the accompanying drawings and examples, which are provided for the purpose of illustration only and are not intended to limit the scope of the present invention.
Example (b): fig. 1 shows a system model diagram of a centralized AP-dense ieee802.11wlan according to the present invention.
Method for selecting a multi-attribute weighted WLAN access point, the WLAN comprising an AC, M randomly distributed APs and N randomly distributed Ws (N)>M). By using
Figure BDA0002810303530000061
and
Figure BDA0002810303530000062
Respectively representing a set of APs and a set of WS. Adjacent APs use non-overlapping frequency bands and therefore there is no adjacent AP interference. The WLAN is based on the IEEE802.11 protocol cluster (e.g., IEEE802.11 b, supporting WS physical layer transmission rates of 11,5.5,2,1 Mbps). The transmission rate is determined according to the channel conditions. The medium access layer protocol (MAC) employs a Distributed Coordination Function (DCF). Consider that WS in the network is in saturation mode, i.e. WS is always transmitting data to AP.
In the method for selecting a WLAN access point with multiple attribute weights of the present invention, the distribution of APs and WS of a network is shown in fig. 2, the number N of APs is 4, the number M of WS is 20, the network is based on IEEE802.11 b, and the flow chart of the method is shown in fig. 3:
the method comprises the following steps: given an initial access point selection policy. Each WS in the WS set selects and associates the nearest AP, and the selection sets of all the WS are recorded as an initial access strategy;
the values of the parameters are as follows:
(1)4 APs are sequentially coordinated:
(131,150),(47,147),(195,174),(17,73);
(2)20 WS coordinates in order:
(74,137),(120,158),(73,41),(17,155),(41,78),(110,46),(129,97),(30,157),(20,59),(47,106),(18,81),(21,22),(157,58),(121,193),(86,139),(152,86),(131,22),(187,37),(53,160),(98,154);
(3) the throughput demand vector for 20 WS is:
[7.16805396174300,6.18351035298953,4.29787707256262,9.38635931286922,7.43651567401482,7.61391387923788,8.87885735432173,4.47522637486622,6.52649150671093,10.1817770469035,9.57146391204876,5.00265744887344,5.04121160311539,4.73881870975361,4.06256234855468,7.38487508131333,9.24458539950332,9.78338019753620,8.24967434865951,4.87054350618436 ]; the vector contains 20 elements, each representing the throughput requirement of the corresponding WS in Mbps.
(4) The physical layer transmission rate matrix corresponding to 20 WS and 4 APs is:
[5.5,11,1,2;11,5.5,5.5,1;1,2,0,5.5;2,11,0,2;2,5.5,0,11;2,2,0,2;5.5,2,2,2;2,11,0,2;1,2,0,11;2,11,0,11;1,5.5,0,11;0,1,0,5.5;2,1,1,1;11,2,5.5,0;11,11,2,2;5.5,1,2,1;1,0,0,1;1,0,1,0;5.5,11,1,2;11,5.5,2,2](ii) a The matrix is a 20-by-4 matrix with elements bi,jAnd represents the physical layer transmission rate between WS i and AP j in Mbps.
(5) The initial policy vector is:
[2,1,4,2,4,4,1,2,4,2,4,4,1,3,2,1,4,1,2,1](ii) a The vector contains 20 elements, and the elements in the vector are AiAnd indicates the access point number selected by WS i.
Step two: in the current access strategy, each WS selects the best AP according to the selection of other WS, and the best AP can maximize the multi-attribute weighting index of the WLAN. Marking the Multi-Attribute weighting Index of the WLAN as WMAI (Weighted Multi-Attribute Index), wherein the calculation method of the WMAI comprises the following steps:
Figure BDA0002810303530000071
(1) in the formula ofi,jDenotes the association of WS i with AP j, λi,j1 denotes WS i selects association AP j, λ i,j0 means WS i does not select association AP j, Qi,jRepresents the service quality evaluation of WS i to AP J, J represents the load balance index, alpha represents the weight of the attribute, and alpha belongs to [0,1]]In this case, α is 0.5.
Qi,jCan be expressed as:
Figure BDA0002810303530000072
(2) in the formula Thri,jRepresents the actual throughput, r, obtained after WS i selects the associated AP jiRepresenting the throughput requirement of WS i.
Thr in IEEE802.11 bi,jCan be expressed as:
Figure BDA0002810303530000073
(3) in the formula of Ui,jRepresents the time fraction s occupied by WS i after accessing AP jdIndicating the length of the data frame and having a value of 12272 bits, Ti,jRepresents the total transmission time required for Wsi to transmit a frame, bi,jRepresenting the physical layer transmission rate between WS i and AP j.
Ti,jCan be expressed as:
Ti,j(K)=ttr+tov+tcont(K) (4)
(4) in the formula ttrRepresenting the transmission time, tovRepresents a fixed overhead, tcont(K) Represents the contention time of WS i with other WS on AP j, and K represents the total number of WS on AP j. t is ttrCan be expressed as:
Figure BDA0002810303530000081
tovdepending on the transmission rate used by WS. If transmitted at a rate of 1,2, 5.5, or 11Mbps, t is then at this timeov541, 305, 271, 262 μ s (these parameters apply to 802.11 b).
tcont(K) Can be expressed as:
Figure BDA0002810303530000082
(6) where SLOT is 20 μ s, CW denotes the contention window size, range CWmin31 to CWmax=1023,Pc(K) Indicating the probability of successful acknowledgement at the MAC layer.
Pc(K) Can be expressed as:
Figure BDA0002810303530000083
Ui,jcan be expressed as:
Figure BDA0002810303530000084
(8) in the formula
Figure BDA0002810303530000085
Represents the set of all WS on AP j, tjamRepresenting the average length of time spent in a collision.
tjamRelated to the transmission rate of the participating WS in the collision, it can be expressed as:
tjam=P1T1,j+P2T2,j+P3T3,j+P4T4,j (9)
(9) in the formula T1,j,T2,j,T3,jAnd T4,jRespectively representing the transmission rate of WS with 1,2, 5.5 and 11Mbps required for transmitting one frameTotal transmission time, P1,P2,P3And P4This indicates the probability that the lower transmission rate at the time of collision is 1,2, 5.5, or 11 Mbps.
Figure BDA0002810303530000091
Figure BDA0002810303530000092
Figure BDA0002810303530000093
Figure BDA0002810303530000094
(10) Formula (1) - (13) wherein, K1To represent
Figure BDA0002810303530000095
WS number, K, with a medium transmission rate of 1Mbps2To represent
Figure BDA0002810303530000096
WS number, K, with a medium transmission rate of 2Mbps3To represent
Figure BDA0002810303530000097
WS number, K, with a medium transmission rate of 5.5Mbps4To represent
Figure BDA0002810303530000098
The number of WS with a medium transmission rate of 11 Mbps.
The load balancing index J can reflect the load condition of the network, J belongs to [0,1], and the more J approaches to 1, the more balanced the network load is.
J can be represented as:
Figure BDA0002810303530000099
step three: recording the change condition of the multi-attribute weighting index of the WLAN before and after each WS changes the AP, so that the WS with the maximum increase of the multi-attribute weighting index of the network wins the opportunity of updating the currently associated AP, and the current access strategy is changed; through steps 2,3, WS for the first time13Win the update opportunity and the policy changes to [2,1,4,2,4,4,1,2,4,2,4,4,2,3,2,1,4,1,2,1];
Step four: repeating the second step and the third step until the current access strategy is not changed;
second iteration, WS15Win the update opportunity and the policy changes to [2,1,4,2,4,4,1,2,4,2,4,4,2,3,3,1,4,1,2,1];
In the third iteration, WS6 wins the update opportunity and the strategy changes to [2,1,4,2,4,2,1,2,4,2,4,4,2,3,3,1,4,1,2,1 ];
in the fourth iteration, the current access strategy is not changed and still is [2,1,4,2,4,2,1,2,4,2,4,4,2,3,3,1,4,1,2,1 ];
step five: and outputting the access strategy [2,1,4,2,4,2,1,2,4,2,4,4,2,3,3,1,4,1,2,1] at the moment, and scheduling the WS according to the access strategy by the AC.
The foregoing illustrates and describes the principles, general features, and advantages of the present invention. It will be understood by those skilled in the art that the present invention is not limited to the embodiments described above, which are described in the specification and illustrated only to illustrate the principle of the present invention, but that various changes and modifications may be made therein without departing from the spirit and scope of the present invention, which fall within the scope of the invention as claimed. The scope of the invention is defined by the appended claims and equivalents thereof.

Claims (8)

1. A method for selecting a WLAN access point with multiple attribute weights, comprising the steps of:
the method comprises the following steps: giving an initial access point selection policy;
step two: in the current access strategy, each WS selects the optimal AP according to the selection of other WS;
step three: recording the change condition of the multi-attribute weighting index of the WLAN before and after each WS changes the AP, so that the WS with the maximum increase of the multi-attribute weighting index of the network wins the opportunity of updating the currently associated AP, and the current access strategy is changed;
step four: repeating the second step and the third step until the current access strategy is not changed;
step five: and outputting the access strategy at the moment, and scheduling the WS according to the access strategy by the AC.
2. The method of claim 1, wherein in step two, the WLAN multi-attribute weighting index is denoted as WMAI, and the calculation method of WMAI comprises:
Figure FDA0002810303520000011
(1) in the formula ofi,jDenotes the association of WSi with APj, λi,j1 denotes WSi selection association APj, λi,j0 denotes WSi not selecting association APj, Qi,jRepresents the service quality of WSi to APj, J represents the load balance index, alpha represents the weight of the attribute, and alpha belongs to [0,1]]。
3. The method of claim 2, wherein Q is in the formula (1)i,jCan be expressed as:
Figure FDA0002810303520000012
(2) in the formula Thri,jRepresenting the actual throughput, r, obtained after the WSi selects the association APjiRepresenting the throughput requirements of WSi.
4. The method of claim 3, wherein said equation (2) isMiddle Thri,jCan be expressed as:
Figure FDA0002810303520000021
(3) in the formula of Ui,jRepresents the time fraction s occupied by the WSi after accessing the APjdIndicating the length of the data frame and having a value of 12272 bits, Ti,jRepresenting the total transmission time required for a WSi to transmit a frame, bi,jRepresenting the physical layer transmission rate between WSi and APj.
5. The method of claim 4, wherein T is the formula (3)i,jCan be expressed as:
Ti,j(K)=ttr+tov+tcont(K) (4)
(4) in the formula ttrRepresenting the transmission time, tovRepresents a fixed overhead, tcont(K) Indicating the competition time of WSi with other WS on APj and K indicating the total number of WS on APj.
6. The method of claim 5, wherein t is the equation (4)trCan be expressed as:
Figure FDA0002810303520000022
tovdepending on the transmission rate used by WS.
7. The method of claim 6, wherein t is the equation (4)cont(K) Can be expressed as:
Figure FDA0002810303520000023
(6) where SLOT is 20 μ s, CW denotes the contention window size, range CWmin31 to CWmax=1023,Pc(K) Indicating the probability of successful acknowledgement at the MAC layer.
8. The method of claim 7, wherein P is the formula (6)c(K) Can be expressed as:
Figure FDA0002810303520000024
Ui,jcan be expressed as:
Figure FDA0002810303520000031
(8) in the formula
Figure FDA0002810303520000037
Represents the set of all WS on APj, tjamRepresents the average length of time spent in a collision;
tjamrelated to the transmission rate of the participating WS in the collision, it can be expressed as:
tjam=P1T1,j+P2T2,j+P3T3,j+P4T4,j (9)
(9) in the formula T1,j,T2,j,T3,jAnd T4,jRespectively, the total transmission time, P, required for WS with transmission rate of 1,2, 5.5, 11Mbps to transmit a frame1,P2,P3And P4The probability that the lower transmission rate is 1,2, 5.5, 11Mbps in the event of a collision is shown, wherein,
Figure FDA0002810303520000032
Figure FDA0002810303520000033
Figure FDA0002810303520000034
Figure FDA0002810303520000035
(10) formula (1) - (13) wherein, K1To represent
Figure FDA0002810303520000038
WS number, K, with a medium transmission rate of 1Mbps2To represent
Figure FDA0002810303520000039
WS number, K, with a medium transmission rate of 2Mbps3To represent
Figure FDA00028103035200000310
WS number, K, with a medium transmission rate of 5.5Mbps4To represent
Figure FDA00028103035200000311
The number of WS with a medium transmission rate of 11 Mbps;
the load balancing index J may reflect the load condition of the network, J ∈ [0,1], and the closer J is to 1, which indicates that the network load is more balanced, J may be expressed as:
Figure FDA0002810303520000036
CN202011383457.7A 2020-12-01 2020-12-01 WLAN access point selection method based on multi-attribute weighting Active CN112566223B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202011383457.7A CN112566223B (en) 2020-12-01 2020-12-01 WLAN access point selection method based on multi-attribute weighting

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202011383457.7A CN112566223B (en) 2020-12-01 2020-12-01 WLAN access point selection method based on multi-attribute weighting

Publications (2)

Publication Number Publication Date
CN112566223A true CN112566223A (en) 2021-03-26
CN112566223B CN112566223B (en) 2022-11-15

Family

ID=75045991

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202011383457.7A Active CN112566223B (en) 2020-12-01 2020-12-01 WLAN access point selection method based on multi-attribute weighting

Country Status (1)

Country Link
CN (1) CN112566223B (en)

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104780614A (en) * 2015-04-27 2015-07-15 上海交通大学 Channel distribution and user correlation strategy based on AMAB model
CN109526042A (en) * 2019-01-23 2019-03-26 重庆邮电大学 A kind of network access point selection method of the LWA system based on OWMAD

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104780614A (en) * 2015-04-27 2015-07-15 上海交通大学 Channel distribution and user correlation strategy based on AMAB model
CN109526042A (en) * 2019-01-23 2019-03-26 重庆邮电大学 A kind of network access point selection method of the LWA system based on OWMAD

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
徐玉滨、陈佳美等: "《基于Q学习的WLAN/WIMAX接入控制网络选择策略》", 《华南理工大学学报》 *

Also Published As

Publication number Publication date
CN112566223B (en) 2022-11-15

Similar Documents

Publication Publication Date Title
US11889557B2 (en) Wireless communication system, wireless communication method, wireless LAN access point, and wireless LAN station
JP5695183B2 (en) Wireless communication system, wireless communication method thereof, and wireless station
KR101038804B1 (en) Method for cooperative communication in wireless lans
CN104025691B (en) Dynamic channel reuse in multi-access communication systems
Gong et al. AP association in 802.11 n WLANs with heterogeneous clients
US20160037559A1 (en) Method and system for estimating available capacity of an access point
CN107094060A (en) Distributed super-intensive heterogeneous network disturbance coordination method based on non-cooperative game
CN108093411A (en) Scheduling of resource optimization method based on channel signature in D2D communication networks
EP2936912A1 (en) Dynamically splitting a wi-fi access point into virtual access points according to the number of transmitting stations
CN107949025A (en) A kind of network selecting method based on non-cooperative game
CN102665219B (en) Dynamic frequency spectrum allocation method of home base station system based on OFDMA
Song et al. Adaptive and distributed radio resource allocation in densely deployed wireless LANs: A game-theoretic approach
CN107432039A (en) The method and system that adaptive channel accesses in unlicensed spectrum
Chang et al. A novel relay placement mechanism for capacity enhancement in IEEE 802.16 j WiMAX networks
CN112566223B (en) WLAN access point selection method based on multi-attribute weighting
JP7385869B2 (en) Optimization method for wireless communication system, wireless communication system and program for wireless communication system
CN113329439A (en) Resource allocation method based on transmission delay
CN106304267B (en) A kind of virtual subdistrict selection method of customer-centric
KR20050064267A (en) Data transmitting method for wireless network using access point
CN104581910B (en) Small base station asynchronous Poewr control method in towards the cooperative cluster of the amorphous covering of cell
Hosseinabadi et al. Concurrent-MAC: Increasing concurrent transmissions in dense wireless LANs
CN110312320A (en) Decoupling multi-access method based on evolutionary game theory in a kind of super-intensive network
KR100853695B1 (en) Wireless lan apparatus based on multiple queues
KR101064440B1 (en) Method for cooperative communication for ieee 802.11 wireless lans
CN116133052A (en) Bandwidth allocation and resource scheduling combined optimization algorithm in space-space heterogeneous network

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant
TR01 Transfer of patent right
TR01 Transfer of patent right

Effective date of registration: 20231214

Address after: 230000 floor 1, building 2, phase I, e-commerce Park, Jinggang Road, Shushan Economic Development Zone, Hefei City, Anhui Province

Patentee after: Dragon totem Technology (Hefei) Co.,Ltd.

Address before: 212003, No. 2, Mengxi Road, Zhenjiang, Jiangsu

Patentee before: JIANGSU University OF SCIENCE AND TECHNOLOGY