WO2011050721A1 - 一种无线局域网接入点部署方案的获得方法及系统 - Google Patents

一种无线局域网接入点部署方案的获得方法及系统 Download PDF

Info

Publication number
WO2011050721A1
WO2011050721A1 PCT/CN2010/078147 CN2010078147W WO2011050721A1 WO 2011050721 A1 WO2011050721 A1 WO 2011050721A1 CN 2010078147 W CN2010078147 W CN 2010078147W WO 2011050721 A1 WO2011050721 A1 WO 2011050721A1
Authority
WO
WIPO (PCT)
Prior art keywords
deployment
coverage
information
field strength
terminals
Prior art date
Application number
PCT/CN2010/078147
Other languages
English (en)
French (fr)
Inventor
董明杰
张炜
周元
胡云
杨寿保
胡森
侯冠博
Original Assignee
华为技术有限公司
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 华为技术有限公司 filed Critical 华为技术有限公司
Priority to EP10826084.5A priority Critical patent/EP2434795B1/en
Priority to BR112012010029A priority patent/BR112012010029B8/pt
Publication of WO2011050721A1 publication Critical patent/WO2011050721A1/zh
Priority to US13/339,259 priority patent/US8705405B2/en

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W16/00Network planning, e.g. coverage or traffic planning tools; Network deployment, e.g. resource partitioning or cells structures
    • H04W16/18Network planning tools
    • H04W16/20Network planning tools for indoor coverage or short range network deployment
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W16/00Network planning, e.g. coverage or traffic planning tools; Network deployment, e.g. resource partitioning or cells structures
    • H04W16/18Network planning tools

Definitions

  • the embodiments of the present invention relate to the field of communications, and in particular, to a method and system for obtaining a wireless local area network access point deployment solution.
  • WLAN wireless local area network
  • Internet Internet
  • Internet enterprise network
  • WLAN wireless local area network
  • APs access points
  • the characteristics of the WLAN access point can be determined through the input floor planning data, the coverage data, and the capacity data, such as: the number of access points (APs), the deployment location, and the access point. Configuration, etc.
  • the floor planning data is some building factors, such as size, topology, etc.
  • AP configuration such as location, AP attributes: power, channel, etc.
  • coverage data is based on the characteristics of the WLAN AP at all Floor locations.
  • the connection rate, the coverage area, the transmission rate, and the like are included; the capacity data corresponds to the throughput of the AP, and the throughput may be determined by the number of corresponding active terminals and the like.
  • the configuration of the corresponding AP (such as location, AP attributes: power, channel, etc.) is determined in the computer.
  • the inventor has found that the prior art has at least the following disadvantages:
  • the configuration of the AP is determined by manual manual adjustment, including the location of the AP deployment, the power used by the AP, the channel, and the like. And will result in no cost overhead. Summary of the invention
  • Embodiments of the present invention provide a method and system for obtaining a wireless local area network access point deployment solution, so as to automatically obtain an AP deployment solution and control costs.
  • a method for obtaining a WLAN AP deployment solution includes:
  • the coverage information of each of the APs and the cost information of each of the APs are constrained to obtain an AP deployment plan.
  • an acquisition and verification system for a WLAN AP deployment solution comprising:
  • the WLAN AP deployment solution obtains, by the WLAN AP deployment solution, the coverage information of each AP according to the WLAN competition model and the obtained deployment information, and the coverage information of each AP and the cost of each AP
  • the information constitutes a constraint relationship, and the calculation obtains an AP deployment plan
  • the verification device is configured to verify the rationality of the access requirement of the deployment plan of the AP.
  • the technical solution provided by the embodiment of the present invention obtains the coverage information of the AP according to the WLAN competition model and the deployment information, and constrains the relationship between the coverage and the cost information of the AP, and calculates the deployment plan of the AP, thereby eliminating the need for manual
  • the participation can realize the deployment of the AP, and the cost information of each AP and the coverage of each AP are constrained, so that the cost of the entire deployment can be controlled.
  • FIG. 1 is a general flowchart of a method for obtaining a wireless local area network AP deployment solution according to an embodiment of the present invention
  • FIG. 1 is a detailed flowchart of FIG. 1 according to an embodiment of the present invention
  • FIG. 2 is a flowchart of a specific implementation of step S104 in FIG. 1A according to an embodiment of the present invention
  • FIG. 3 is a flowchart of a specific implementation of a method for obtaining a wireless local area network AP deployment solution according to an embodiment of the present invention
  • 3A is a diagram of a coverage area of an AP in step AA according to an embodiment of the present invention.
  • FIG. 3B is a diagram of a coverage area of an AP in step BB according to an embodiment of the present invention.
  • 3C is a diagram of a coverage area of an AP in step CC according to an embodiment of the present invention.
  • FIG. 4 is a flowchart of a method for fully verifying an AP deployment solution according to an embodiment of the present invention
  • FIG. 5 is a specific flowchart of a first method for verifying an AP deployment solution according to an embodiment of the present invention
  • FIG. 6 is a specific flowchart of a second method for verifying an AP deployment solution according to an embodiment of the present invention.
  • FIG. 8 is a schematic structural diagram of an apparatus for obtaining a WLAN AP deployment scheme according to an embodiment of the present invention
  • FIG. 9 is a structural diagram of an apparatus for obtaining a WLAN AP deployment scheme according to an embodiment of the present invention.
  • FIG. 10 is another structural diagram of a device according to an embodiment of the present invention.
  • the technical solutions in the embodiments of the present invention are clearly and completely described in the following with reference to the accompanying drawings in the embodiments of the present invention. It is obvious that the described embodiments are only a part of the embodiments of the present invention, but not all of the embodiments. All other embodiments obtained by those skilled in the art based on the embodiments of the present invention without creative efforts are within the scope of the present invention.
  • FIG. 1 is a general flowchart of a method for obtaining a wireless local area network AP deployment solution according to an embodiment of the present invention.
  • Step S1 0 Obtain coverage information of each AP according to the WLA competition model and the deployment information.
  • Step S20 Constrain the relationship between the coverage information of each AP and the cost information of each AP, and obtain an AP. Deployment plan.
  • FIG. 1A is a detailed flowchart of FIG. 1 according to an embodiment of the present invention.
  • the deployment information includes scenario information, device specification information of multiple APs, a propagation model, user distribution information, and user requirement information.
  • the scenario information is an area that needs to be covered by the deployment, including length and width information of the area, obstacle information in the area, and attenuation factor information of the obstacle.
  • the device specification information is the configuration information of the AP device deployed in the scenario, including the number of radios, the type, the working frequency band, the cost or price, and the power.
  • the user distribution information is the location information of the user in a given scenario. In this embodiment, it can also be understood as the location information of the terminal in a given scenario. The user needs to request information such as the rate, bandwidth, etc. of the given location of the user in a given scenario.
  • a rectangular grid-like topology can be determined by the scene to be deployed. It can also be understood that the area to be covered is described by a rectangular grid-like topology, wherein the state of each of the grid-like topologies can be idle or an obstacle. Since there may be a plurality of different obstacles in the area, the state of the lattice may be obstacle 1, or obstacle 2, and the like. In this embodiment, it may also be described by a numerical value. For example, if the numerical value information in the lattice is 0, it means that there is no obstacle in the lattice, or is idle; if the numerical information in the lattice is 1, it indicates the lattice. Have Obstacle, and as obstacle 1, and so on.
  • the number of obstacles in the network topology can also be obtained by the state of the grid.
  • step S1 00 it is determined whether each of the grids has a terminal and a size of the required bandwidth of the grid according to user distribution, user requirements, and grid topology.
  • whether the terminal has a terminal by using the location information of the terminal in the user and the grid topology in the user distribution; the location information in the scenario of the terminal in the user distribution, and the terminal in the user requirement
  • the bandwidth information and the grid topology in the scene determine the size of the required bandwidth of the grid. Since in the present embodiment, the signal attenuation value also corresponds to the broadband demand, the grid topology can be determined by the scene. Therefore, it can be understood that the signal attenuation value can be obtained by user distribution, user requirements, and scenes.
  • step S1 00 different propagation models can be selected according to different scenarios.
  • Step S 1 02 Determine a field strength distribution according to device specifications and scenario information in the deployment information.
  • the field strength distribution of each AP can be determined according to each device specification and scenario information in the deployment information.
  • step S102 the signal attenuation value between any two grids can be calculated by the selected propagation model, and the power and signal attenuation values in the device specifications are weighted to obtain the field strength of each grid. Distribution can also be understood as obtaining the field strength distribution of the AP to each grid. In this embodiment, the field strength distribution can also be referred to as signal strength. In this embodiment, the signal attenuation value also forms a corresponding relationship with the bandwidth demand. The signal attenuation value can be obtained through the broadband demand and its corresponding relationship, and the broadband demand can also be obtained through the signal attenuation value and its corresponding relationship.
  • Step S 1 04 according to the WLAN competition model, user distribution in the deployment information, and user requirements and fields
  • the strong distribution obtains the coverage information of the AP.
  • the step is based on the WLAN competition model, the user distribution in the deployment information, and User coverage and each AP field strength distribution obtain the coverage information of each AP, that is, the coverage information of multiple APs can be obtained.
  • the WLAN competition model may also be referred to as a WLAN competition mechanism.
  • Step S 1 Q6 the coverage information and the cost information are combined into a constraint relationship, and the AP deployment solution is obtained.
  • the coverage information of each AP and the cost information of each AP are formed into a constraint relationship, and the AP deployment solution with the lowest deployment cost is calculated.
  • FIG. 2 is a flowchart of a specific implementation of step S104 in FIG. 1A according to an embodiment of the present invention.
  • a device specification AP of a plurality of device specifications APs is obtained for description.
  • Step S200 Determine the number of first terminals that generate interference with the terminal that accesses the AP.
  • the number of terminals in the interference range of the AP and the number of terminals in the interference range of the AP may be determined according to the WLAN competition model, the number of terminals accessing the AP, and the number of terminals in the interference range of the AP. The number of first terminals that interfere with the terminal accessing the AP.
  • the number of terminals in the interference range of the AP includes two parts, one part is the number of terminals in the interference range of the AP and the number of terminals in the interference range of the AP twice, wherein the interference range may be Determined by the power and attenuation of the AP.
  • This range of interference can be understood and obtained by those skilled in the art.
  • the WLAN competition model may be a capacity model for establishing a single or multiple WLAN APs according to the conditions of the number of terminals operating on the same channel, the terminal rate, and the like, and may be expressed by the following inequality.
  • is an adjustment parameter, Take different values.
  • (1) indicates the bandwidth requirement of the terminal i in the access AP
  • 1) indicates the maximum bandwidth requirement of the terminal i to the AP in the access AP
  • the maximum bandwidth requirement of the terminal i to the AP may be It is understood that the AP is the maximum bandwidth provided by the terminal i, that is, the maximum field strength distribution of the grid in which the AP is located to the terminal accessing the AP.
  • n represents the number of first terminals that interfere with the terminal accessing the AP
  • Cos t ( n ) represents the competition overhead
  • n1 represents the number of terminals accessing the AP.
  • n nl / (nl /n2) a ;
  • represents the number of first terminals that interfere with the access terminal
  • n1 represents the number of terminals accessing the port
  • n2 represents the number of terminals in the interference range of the AP
  • n3 represents the interference interference range of the AP.
  • Step S202 Determine the coverage threshold of the AP according to the number of terminals that generate interference with the terminal that accesses the AP, the bandwidth requirement of the terminal that accesses the AP, and the field strength distribution.
  • the number of terminals that generate interference determines the contention cost; and then determines the coverage threshold of the AP according to the contention cost, the bandwidth requirement of the terminal, and the field strength distribution.
  • Step S204 Determine the coverage according to the coverage threshold and the field strength distribution.
  • the coverage of the AP for each grid is determined according to the coverage threshold of the AP and the field strength distribution of each grid.
  • the three-dimensional matrix C [ i, j, g] can be used to indicate the coverage of the AP of the g device specification in the lattice i to the lattice j, where g represents the device specification of the AP, or represents the type of the AP.
  • there are multiple APs of device specifications there are also coverages of multiple APs.
  • FIG. 3 is a flowchart of a specific implementation of a method for obtaining a wireless local area network AP deployment solution according to an embodiment of the present invention.
  • step S300 a rectangular grid-like topology is determined according to the scenario to be deployed.
  • Step S302 preset an upper limit and a lower limit of the field strength distribution covered by the AP.
  • the upper limit of the field strength may be preset to a value greater than or equal to the power of the AP transmit signal
  • the lower limit of the field strength may be preset to be less than or equal to the signal strength value of the minimum received AP of the terminal.
  • Step S304 Determine the number of terminals accessing the AP.
  • the upper or lower limit of the field strength covered by the AP is adjusted, and the number of terminals accessing the AP is determined according to the user distribution and user requirements in the deployment information.
  • the upper or lower limit of the field strength covered by the AP refers to the field strength coverage of all other cells when the AP is in one of the cells.
  • the number of terminals accessing the AP may be determined according to the bandwidth requirement of the terminal of each cell and the dichotomy of the upper and lower field strengths of the AP coverage.
  • the terminal in the grid whose bandwidth requirement is greater than the binary value is used as the terminal of the access AP, that is, the number of terminals in all the grids whose bandwidth requirement is greater than the binary value needs to be collected, and the number of terminals after the collection is collected.
  • the upper limit and the lower limit of the field strength of the grid can be expressed by (field strength upper limit + field strength lower limit) /2.
  • Step S306 Determine the number of first terminals that interfere with the terminal accessing the AP.
  • the number of first terminals that interfere with the terminal accessing the AP may be determined according to the WLAN competition model, the number of terminals accessing the AP, and the number of terminals in the interference range of the AP.
  • the number of terminals in the interference range of the AP includes two parts, one part is the number of terminals in the interference interference range of the AP and the number of terminals in the interference range of the AP twice, wherein the interference range may be Determined by the power and attenuation of the AP.
  • the number of terminals in the interference range includes The number of terminals accessing the AP, and the number of terminals that can receive signals transmitted by the AP but cannot access the AP. This range of interference can be understood and obtained by those skilled in the art.
  • can take different values. When ⁇ takes a different range, it affects the value of the number of first terminals that interfere with the terminal that accesses ⁇ . In this embodiment, the value of a can take a value from 0. It can be expressed by the following formula:
  • n nl/(nl/n2) a ;
  • represents the number of first terminals that interfere with the access terminal
  • n1 represents the number of terminals accessing the port
  • n2 represents the number of terminals in the interference range of the AP
  • n3 represents the interference interference range of the AP. The number of terminals within.
  • Step S308 determining the competition cost.
  • the contention overhead may be determined according to the number of first terminals that generate interference with the terminal accessing the AP.
  • n the number of first terminals that interfere with the terminal accessing the AP
  • Cost (n) represents the contention overhead.
  • the WLAN competing characteristics can be modeled, and the WLAN competing characteristics are expressed in the form of saturated throughput.
  • the saturated throughput refers to the effective time ratio of data transmitted per unit time, which can be determined by the following formula. Indicates:
  • s is the ratio of the time of transmission of valid data / (transmission of valid data time + competition waiting time + competition to generate conflict time)
  • E [P] represents the average packet payload size
  • represents the propagation delay
  • T s represents the detection The average time that the channel is busy (time slot busy) due to successful transmission, T.
  • the transmission RTS ⁇ indicates the duration of the empty time slot
  • Ptr indicates the probability that at least one terminal transmits within a given time slot
  • P S represents The probability that the data packet will be transmitted successfully on the channel
  • represents the probability of occurrence of the data transmitted by the terminal in the randomly selected time slot
  • represents the number of first terminals that interfere with the terminal that is connected to the network.
  • the cost caused by the competition can be 1-S, that is, Cos t (n) is 1-S.
  • since ⁇ takes a different range, it affects the value of the number of first terminals that interfere with the terminal that accesses the UI, and the value of ⁇ affects the cost of deployment, therefore, the value of ⁇ A certain correspondence with the cost of deployment, if the value of ⁇ is smaller, the cost of deployment is lower.
  • step S310 it is verified whether the AP meets the access requirement.
  • the access requirement can be understood as two aspects, one aspect is that the deployed network needs to meet a certain throughput, and the other aspect is that the rate or the broadband rate of each terminal in the deployed network needs to be met.
  • it can be verified whether the access requirement is satisfied by determining whether the following inequality is established. When the inequality is established, the verification meets the access requirements. on the contrary.
  • the inequality is as follows:
  • (1) indicates the bandwidth requirement of the terminal i in the access AP, and 1) indicates the maximum bandwidth requirement of the terminal i to the AP in the access AP.
  • the maximum bandwidth requirement of the terminal i to the AP can be understood as an AP.
  • the maximum bandwidth provided for the terminal i that is, the maximum field strength distribution of the grid in which the AP is located to the terminal accessing the AP.
  • n represents the number of first terminals that interfere with the terminal accessing the AP
  • Cost (n) represents the contention cost
  • n1 represents the number of terminals accessing the AP.
  • step S312 when the inequality is established, that is, the verification satisfies the access requirement, step S312 is performed.
  • step S314 is performed.
  • Step S312 adjusting the value of the upper limit of the field strength covered by the AP.
  • the new field strength upper limit value is adjusted to the old field strength upper limit and the old field strength lower limit.
  • Step S314 adjusting the value of the lower limit of the field strength covered by the AP.
  • the new field strength lower limit is adjusted to the old field strength upper limit and the old field strength lower limit.
  • step S316 is performed.
  • Step S316 determining whether K cycles are completed.
  • This step can be understood as determining whether the first preset number of loops is completed, and the first preset loop number is the number of the K loops. In this embodiment, the K value is decremented by one every cycle. In this embodiment, this step can be understood as determining whether the value of K is 0 or not.
  • step S304 if the value of K is not 0, that is, K cycles are not completed, step S304 is performed, that is, the execution of the first preset cycle number is performed for steps S304 to S314. At this time, the upper limit and the lower limit of the field strength of the lattice in step S304 are also updated accordingly. If the value of K is 0, that is, K cycles are completed, then step S318 is performed.
  • the coverage of the AP is determined.
  • the adjusted upper limit of the field strength is used as the coverage threshold of the AP.
  • the coverage is determined.
  • the coverage is determined according to the coverage threshold and the field strength distribution; in this embodiment, the coverage is determined according to the coverage threshold of the AP and the field strength distribution of each grid.
  • the three-dimensional matrix C [h, j, g] can be used to indicate the coverage of the AP of the g device specification in the grid h to the grid j, where g represents the device specification of the AP, or the type of the AP.
  • the coverage is divided into three cases.
  • the first type is: If the AP is placed on the grid h, the field strength distribution of the AP to the lattice j is greater than the coverage threshold, and the lattice j does not belong to the lattice h.
  • the edge region, then C [h, j, g] is C0, the CO is the edge coverage requirement, wherein the edge region is a technical term familiar to those skilled in the art, and will not be described in detail herein;
  • C [h, j, g] is 1;
  • the third case is : If the AP is placed on the grid h, the field strength distribution of the AP to the grid j is less than the coverage threshold, then C [h, j, g] is 0.
  • the AP coverage There may be a mapping relationship between the coverage of the AP and the coverage area of the capacity or the coverage of the field strength.
  • the AP is placed in a certain grid, and if the coverage satisfies a certain threshold or greater, the AP is considered to be capable of covering the required capacity of all STAs in the threshold range. region.
  • the threshold value may be two.
  • the coverage of the AP at a certain location is known, if the capacity of the AP at the location is less than the product of the coverage of the location and the threshold, the coverage of the AP is considered to be a, if the AP of the location When the capacity is greater than the product range of the capacity coverage and the threshold, the coverage of the AP is considered to be b.
  • the AP is placed in a certain lattice, and if the coverage satisfies a certain threshold or greater, the AP is considered to be able to cover all the STAs in the threshold within the threshold.
  • the threshold value may be 2.
  • Step S322 the coverage information of each AP is combined with the cost information of each AP to form a constraint relationship.
  • the constraint relationship between the coverage of each AP and the cost information of each AP may be described by linear programming, and the coverage of each AP may be described by using graph theory.
  • the constraint relationship of the AP's cost information Of course, you can also use the simplex method in operations research.
  • the target function is established according to the cost information of each g device specification AP device.
  • the deployment cost generated by the AP of the same device specification under the constraint is obtained, and the related information of the AP with the lowest deployment cost is obtained. .
  • Step AA After the AP is deployed at a certain point, a coverage area map of the AP is obtained.
  • the vertices of the graph are understood as AP nodes, and each AP has a certain capacity range or signal. Coverage; See Figure 3A, AP Node 1.
  • Step BB Select the surrounding nodes for deployment to maximize the areas that these nodes add up to.
  • the greedy method is used to find the follow-up.
  • the location of the AP nodes after deploying the locations of these nodes, will achieve the least number of implemented APs, that is, the lowest cost of the entire network. See Figure 3B, AP node 1-1 0.
  • Step CC Iterate according to the rules of step BB until the entire area is covered or meets certain rate requirements. See Figure 3C, AP Node 1-40.
  • Step S324 Calculate the established constraints to obtain an AP deployment solution with the lowest overall deployment cost.
  • the deployment scheme is the location of the AP, the bandwidth requirement, the coverage, the field strength distribution to each grid, and the cost.
  • each AP has a constraint relationship. After each lattice h satisfies the coverage constraint relationship, the deployment cost generated by the AP of the g device specification under the constraint is obtained. Get the deployment plan for the AP with the lowest deployment cost.
  • the deployment scenario may also include the WLAN race model used in step S 306, i.e., the value of a.
  • the method for obtaining a WLAN AP deployment solution determines, according to the obtained deployment information, the number of first terminals that interfere with the terminal that accesses the AP, and the bandwidth of the terminal that accesses the AP according to the number of the first terminal.
  • Demand and field strength distribution to obtain the coverage value of the AP, and then according to the coverage threshold The field strength distribution is used to obtain the coverage, and the constraint is established according to the cost information and the coverage of the device to obtain the deployment plan of the WLAN AP.
  • the manual solution of the WLAN AP is not required.
  • the adjustment can be automated to obtain the deployment plan of the AP; and in the process of obtaining the WLAN AP deployment plan, the cost information of each AP and the coverage of each AP are constrained, so that the cost required for the entire deployment can be controlled. And get the AP deployment solution with the lowest overall deployment cost.
  • FIG. 4 is a flowchart of a method for fully implementing an AP deployment solution according to an embodiment of the present invention.
  • the deployment scheme output by the method of FIG. 3 may be fully verified, and the deployment scheme of the AP output by other deployment methods may be verified.
  • Step S400 performing channel allocation and power control on the AP in the deployment solution.
  • Step S402 after completing channel allocation and power control, selecting an AP as the accessed AP for the terminal;
  • step S404 it is verified whether the access requirement is met.
  • the deployment scenario outputted by the method of FIG. 3 is verified, when the verification meets the access requirement, the deployment plan of the verification is saved first. And determining whether the current competition index is 0. If it is 0, the deployment plan for verifying the output is output. If not, the competition index is adjusted, and the process returns to step S306 in FIG. When the verification does not satisfy the access requirement, the current competition index is adjusted and returns to step S306 in FIG.
  • the deployment scenario is not saved, the result of the no deployment scenario is output.
  • the deployment scheme of the AP output by the other deployment method is verified, if the verification meets the access requirement, the deployment scheme is directly output. If the verification does not meet the access requirements, the result of the wrong or unsuccessful deployment scenario is output. Step S406, the result of the verification is output. In this embodiment, the deployment scheme of the AP that passes the verification is output, or the result of the error or the unsuccessful output is output.
  • FIG. 5 is a specific flow chart of the first case of the verification method of the AP deployment solution according to the embodiment of the present invention.
  • Step S500 performing channel allocation and power control on the AP in the deployment scheme.
  • any channel allocation algorithm may be used to perform channel allocation on the AP in the deployment scheme, or any power control algorithm may be used to perform power control on the AP in the deployment scheme.
  • the channel allocation algorithm mainly selects the channel with the smallest signal strength as the working channel of each AP according to the collected signal strength of the entire network AP, and the power control algorithm is mainly based on the entire network AP. Interference information, reduce the power of one or more APs, and ensure coverage requirements during the low-down process.
  • step S502 after the channel allocation and the power control are completed, an AP is selected as the AP for accessing the terminal.
  • any AP selection algorithm may be used to select an AP as the AP for access.
  • the selection algorithm of the AP is mainly that the terminal selects whether to access the AP according to the received AP signal strength and the load of the AP, where the terminal first selects multiple APs based on the signal strength, and then selects a load according to the load conditions of the APs. The smallest AP access.
  • Step S504 obtaining a neighbor AP of the AP.
  • all neighbor APs that work on the same channel as the AP are obtained within the interference range of the AP.
  • Step S506 obtaining the number of second terminals that generate interference with the terminal accessing the AP.
  • the number of terminals accessing all neighboring APs of the AP and the number of terminals accessing the AP are obtained, and the number of terminals of all neighboring APs that access the AP and the number of terminals accessing the AP are obtained.
  • Weighting is performed to obtain the number of second terminals that interfere with the terminal accessing the AP.
  • the process of channel allocation, power control, and AP selection is performed. Therefore, the actual number of access terminals of the AP and the number of second terminals that interfere with the terminal accessing the AP can be obtained.
  • the difference between the number of the first terminals that interfere with the AP accessing the terminal in FIG. 3 is that the number of the first terminals in FIG. 3 is the result of continuous debugging deployment, and the number of the second terminals changes at any time. Can be considered a practical result.
  • Step S508 determining the competition cost.
  • the contention overhead may be determined according to the number of second terminals that cause interference with the terminal accessing the AP.
  • reference may be made to the calculation method of the competitive pin of FIG.
  • Step S510 verifying whether the AP meets the access requirement, that is, performing plausibility verification.
  • it is verified whether the access requirement is met according to the competition cost, the bandwidth requirement of the terminal accessing the AP, and the field strength distribution of the grid in which the AP is located in the terminal where the AP is located.
  • step S512 when the verification meets the access requirement, step S512 is performed. If the verification does not meet the access requirement, step S518 is performed.
  • step S512 the current AP deployment plan is saved. After saving, step S514 is performed. Step S514, determining whether the competition index is 0. In this embodiment, due to the steps in Figure 3
  • step S 306 in the process of determining the number of the first terminal that interferes with the terminal accessing the AP according to the WLAN competition model, the number of terminals accessing the AP, and the number of terminals in the interference range of the AP,
  • the value of the competition index in the model is set by value, and therefore, in step S514, it is necessary to verify the value of the competition index. If the value of the competition index is not 0, step S516 is performed. If the value of the competition index is 0, step S526 is performed.
  • Step S516 reducing the value of the current competition index.
  • the currently performed loop value d that is, the number of times the step S510 has been executed
  • the competition index is decreased by 1/2.
  • the currently performed loop value d that is, the number of times that the step S510 has been executed, increases the competition index by 1/2.
  • step S520 is performed.
  • Step S520 Determine whether the current loop value reaches a preset value, that is, determine whether the second preset loop number is completed. If the preset value is reached, step S522 is performed. If the preset value is not reached, step S530 is performed, that is, step S 306 in FIG. 3 is executed, that is, the value of the competition index in step S516 or step S518 is output to step S 306 in FIG. 3 to perform Determining the number of first terminals that interfere with the terminal accessing the AP.
  • the second preset number of cycles may be regarded as the number of executions from step S510 to S520, and may also be considered as the threshold number of steps S510. In the step, it can be understood as to judge whether the number of times of execution of step S510 reaches a preset value.
  • Step S522 determining whether there is a deployment plan of the saved AP. If it is determined that there is a deployment plan of the saved AP, step S526 is performed. If there is no saved deployment plan of the AP, step S524 is performed.
  • step S524 it is determined whether the loop of the second preset number of loops is re-executed. If not, step S528 is performed. If yes, step S526 is performed.
  • step S528 the value of the current competition index is adjusted to 1, and the cycle of the second preset cycle number is repeated.
  • the number of current cycles in step S520 is cleared to 0 and re-judgment.
  • step S530 is performed.
  • the deployment plan of the saved AP is output. If the deployment plan of the AP is not saved, that is, the deployment plan that does not meet the access requirements, the result of the deployment plan without the AP is output.
  • the verification method provided by the embodiment of the present invention performs channel allocation and power on the AP in the deployment scheme. Control, and select an AP for the terminal, and then verify the rationality of the selected AP. On the one hand, it can verify the feasibility of the AP deployment scheme. On the other hand, adjust the competition model through the result of the rationality verification, so that the AP is deployed. The solution can meet the minimum cost requirements.
  • FIG. 6 is a specific flow chart of the second case of the verification method of the AP deployment solution according to the embodiment of the present invention.
  • steps S600, S602, S604, S606, S608, and S610 are the same as steps S500, S502, S504, S506, S508, and S510 in FIG. 5, and are not repeatedly described herein.
  • step S610 if the verification meets the access requirement, step S612 is performed. If the verification does not meet the access requirement, step S614 is performed.
  • Step S612 outputting the result of the successful completion of the full certificate, that is, outputting the deployment plan of the AP through which the full certificate passes.
  • step S614 the result of the unsuccessful verification is outputted.
  • the verification method provided by the embodiment of the present invention performs channel allocation and power control on the AP in the deployment scheme, and selects an AP for the terminal, and then performs plausibility verification on the selected AP, so as to verify the feasibility of the AP deployment scheme.
  • FIG. 3 is a schematic diagram of an acquisition and verification system of an AP deployment solution according to an embodiment of the present invention.
  • the deployment and verification system includes a device 8 and a verification device 9 that obtain a WLAN AP deployment plan.
  • the device 8 that obtains the WLAN AP deployment solution is used for the WLAN competition model and the obtained deployment information to obtain the coverage information of each AP, and the coverage information of each of the APs and the foregoing
  • the cost information of an AP constitutes a constraint relationship, and the AP deployment solution with the lowest deployment cost is calculated.
  • the full authentication device 9 is used to verify the plausibility of the deployment plan of the WLAN AP obtained by the device 8 that obtains the WLAN AP deployment solution.
  • FIG. 8 is a structural diagram of an apparatus for obtaining a WLAN AP deployment solution according to an embodiment of the present invention.
  • the device 8 includes a first obtaining unit 80, a first calculating unit 81, a first determining unit 82, a constraining unit 83, and a first output unit 84.
  • the device that obtains the WLAN AP deployment solution may also be a module or a unit, and is deployed on other devices.
  • the first obtaining unit 80 is configured to obtain deployment information.
  • the deployment information includes scenario information, device specification information of a plurality of APs, a propagation model, user distribution information, and user requirement information.
  • each AP since there are multiple device specifications of the AP, each AP has a field strength distribution and a coverage.
  • the first obtaining unit 80 may further determine a rectangular grid topology according to the scenario to be deployed, or determine whether each grid has a terminal according to user distribution, user requirements, and grid topology. And the size of the required bandwidth of the grid.
  • the first calculating unit 81 is configured to determine a field strength distribution according to device specifications and scenario information in the deployment information.
  • the first calculating unit 81 may determine the field strength distribution of each AP according to each device specification and scenario information in the deployment information.
  • the first calculating unit 81 may calculate the signal attenuation value between any two grids by using the selected propagation model, and perform weighting calculation by the power and signal attenuation values in the device specifications to obtain the field strength distribution of each grid, or It is understood to obtain the field strength distribution of the AP to each grid.
  • the field strength distribution can also be referred to as signal strength.
  • the signal attenuation value also forms a corresponding relationship with the broadband demand. The signal attenuation value can be obtained through the broadband demand and its corresponding relationship, and the broadband demand can be obtained through the signal attenuation value and its corresponding relationship.
  • the first calculating unit 81 is further configured to obtain the coverage of the AP according to the WLAN competition model, the user distribution in the deployment information, and the user requirements and the field strength distribution.
  • the first calculating unit 81 since the device specifications of the AP are various, and the field strength distribution of each AP is obtained, the first calculating unit 81 The coverage of each AP can be obtained according to the WLA competition model, the user distribution in the deployment information, and the user requirements and the field strength distribution of each AP.
  • a device specification AP of a plurality of device specifications APs is obtained for description.
  • the first calculating unit 81 is further configured to determine an upper limit or a lower limit of the field strength covered by the AP, and determine the number of terminals accessing the AP according to the user distribution and user requirements in the deployment information. Further, the first calculating unit 81 is further configured to adjust an upper limit or a lower limit of the field strength covered by the AP, and determine whether each of the cells has a terminal according to the user distribution and the grid topology in the deployment information, and when there is a terminal, according to the grid The bandwidth requirement of the terminal and the binary value of the upper and lower field strengths covered by the AP determine the number of terminals accessing the AP.
  • the first calculating unit 81 is further configured to determine the number of terminals that interfere with the terminal accessing the AP.
  • the number of first terminals that interfere with the terminal accessing the AP may be determined according to the WLAN competition model, the number of terminals accessing the AP, and the number of terminals in the interference range of the AP.
  • the number of terminals in the interference range of the AP includes two parts, one part is the number of terminals in the interference interference range of the AP and the number of terminals in the interference range of the AP twice, wherein the interference range may be Determined by the power and attenuation of the AP. This range of interference can be understood and obtained by those skilled in the art.
  • the WLAN competition model can be expressed by the following inequality. o
  • is an adjustment parameter, Take different values. Where (1 ⁇ indicates the bandwidth requirement of the terminal i in the access AP, 1) ⁇ indicates access
  • the maximum bandwidth requirement of the terminal i to the AP in the AP can be understood as the maximum bandwidth provided by the AP for the terminal i, that is, the AP is located at the terminal of the access AP.
  • the maximum field strength distribution of the lattice. n represents the number of first terminals that interfere with the terminal accessing the AP, Cos t ( n ) represents the competition cost, and nl represents the number of terminals accessing the AP.
  • can take different values. When ⁇ takes a different value, it affects the value of the number of first terminals that interfere with the terminal that accesses the port. It can be expressed by the following formula:
  • n nl / (nl /n2) a ;
  • n nl / (nl / n3) ⁇ 1 , where ⁇ represents the number of first terminals that interfere with the access terminal, n1 represents the number of terminals accessing the AP, and n2 represents the AP's 1 The number of terminals in the interference range, n3 represents the number of terminals within 2 times the interference range of the AP.
  • the first calculating unit 81 is further configured to determine the coverage according to the first terminal number, the broadband requirement of the terminal accessing the AP, and the field strength distribution. Further, in this embodiment, the first calculating unit 81 is further configured to determine, according to the number of the first terminals that generate interference with the terminal that accesses the AP, the bandwidth requirement of the terminal that accesses the AP, and the field strength distribution, determine the coverage of the AP. Value, the coverage is determined according to the coverage threshold and the field strength distribution. The first computing unit 81 further determines the contention overhead based on the number of first terminals that generate interference with the terminal accessing the AP.
  • the first determining unit 82 is configured to verify whether the access requirement is met. In this embodiment, the first determining unit 82 may verify whether the access is satisfied according to the contention requirement, the bandwidth requirement of the terminal accessing the AP, and the field strength distribution of the grid in which the AP is located in the terminal where the AP is located. demand.
  • the first calculating unit 81 is further configured to adjust the value of the upper limit of the field strength when the verification meets the access requirement, or adjust the value of the lower limit of the field strength when the verification does not satisfy the access requirement.
  • the first judging unit 82 is further configured to determine whether the K-cycle is completed. When it is determined that the K-cycle is completed, the field strength upper limit currently obtained by the first calculating unit 81 is used as the coverage threshold of the AP.
  • the first calculating unit 81 is further configured to determine the coverage according to the coverage threshold and the field strength distribution.
  • the constraining unit 83 is configured to establish a constraint according to cost information and coverage in the device specification.
  • the linear constraint of the objective function is established according to the cost information in the device specification
  • the coverage linear constraint is established according to the coverage.
  • device position linear constraints and gateway position linear constraints can also be established.
  • the constraint of the coverage, the cost information of the AP may be described by a linear rule, or the constraint of the coverage and the cost information of the AP may be described by a graph theory.
  • the first calculation unit 81 is also used to calculate the constraints established in the constraint unit 83 to obtain the AP deployment plan with the lowest deployment cost.
  • each AP has a constraint relationship. After each lattice h satisfies the coverage constraint relationship, the deployment cost generated by the AP of the g device specification under the constraint is obtained. Get the deployment plan for the AP with the lowest deployment cost.
  • the first output unit 84 is configured to output a deployment plan of the WLAN AP obtained by the first calculating unit 81.
  • the first output unit 84 is further configured to output the WLA competition model used in the first calculation unit 81, that is, output the value of a used in the first calculation unit 81.
  • the device for obtaining a WLAN AP deployment solution determines, according to the obtained deployment information, the number of first terminals that interfere with the terminal that accesses the AP, and the bandwidth of the terminal that accesses the AP according to the number of the first terminal.
  • Demand and field strength distribution to obtain the coverage value of the AP, and then obtain coverage based on the coverage value and field strength distribution, and then linearly plan according to the cost information and coverage of the device to obtain a deployment plan of the WLAN AP.
  • no manual adjustment is needed, and an AP acquisition solution can be automatically obtained; and the cost of each AP is obtained in the process of obtaining the WLAN AP deployment solution.
  • the information and the coverage of each AP establish constraints, so that the cost of the entire deployment can be controlled, and the AP deployment solution with the lowest overall deployment cost can be obtained.
  • FIG. 9 is a structural diagram of a verification apparatus according to an embodiment of the present invention.
  • the verification device 9 The second obtaining unit 90, the channel allocating unit 91, the power control unit 92, the selecting unit 93, the second calculating unit 94, the second determining unit 95, the storage unit 96, the second output unit 97, and the adjusting unit 98 are included.
  • the second obtaining unit 90 is configured to obtain a deployment plan of the WLAN AP output by the device 8 of the WLAN AP deployment solution.
  • the second obtaining unit 90 is further configured to obtain a WLAN competition model used in the device 8 of the WLAN AP deployment solution, that is, a value of ⁇ used in the device 8 that obtains the WLAN AP deployment solution.
  • the channel allocating unit 91 is configured to perform channel allocation on the ⁇ in the deployment scheme obtained by the second obtaining unit 90.
  • the channel allocation algorithm mainly selects the channel with the smallest signal strength as its own working channel for each ⁇ according to the collected signal strength of the entire network.
  • the power control unit 92 is configured to perform power control on the ⁇ in the deployment scheme obtained by the second acquisition unit 90.
  • the power control algorithm mainly reduces the power of one or more ports according to the interference information of the entire network, and ensures the coverage requirement during the process of lowering the frequency.
  • the selecting unit 93 is configured to select a port for the terminal as the access port after the channel allocating unit 91 and the power control unit 92 respectively perform channel allocation and power control.
  • any one of the ⁇ selection algorithms may be used to select a ⁇ as the access AP for the terminal.
  • the selection algorithm of the AP is mainly that the terminal selects whether to access the AP according to the received AP signal strength and the load of the AP, where the terminal first selects multiple APs based on the signal strength, and then selects a load according to the load conditions of the APs. The smallest AP access.
  • the second calculating unit 94 is configured to obtain the neighbor AP of the AP selected by the selecting unit 93. In this embodiment, all neighbor APs that are working on the same channel as the AP are obtained within the interference range of the AP. In this embodiment, the second calculating unit 94 is further configured to obtain, by using a terminal that accesses the AP, interference. The number of two terminals. In this embodiment, the number of terminals accessing all neighboring APs of the AP and the number of terminals accessing the AP are obtained, and the number of terminals of all neighboring APs that access the AP and the number of terminals accessing the AP are obtained. Weighting is performed to obtain the number of second terminals that interfere with the terminal accessing the AP. In this embodiment, the second calculating unit 94 is further configured to determine a competition overhead. In this embodiment, the contention overhead may be determined according to the number of second terminals that generate interference with the terminal accessing the AP.
  • the second judging unit 95 is for verifying whether the access requirement is satisfied. In this embodiment, it is verified whether the access requirement is satisfied according to the contention overhead and the bandwidth requirement of the terminal accessing the AP.
  • the adjusting unit 98 is configured to adjust the value of the competition index ⁇ in the WLAN competition model when the second judging unit 95 verifies that the access requirement is not satisfied.
  • the current cycle value d is obtained, and the competition index is increased by 1/2.
  • the currently performed loop value can be understood as the second judging unit 95 verifies whether the number of verifications required for access is satisfied.
  • the notification storage unit 96 saves the deployment plan of the AP obtained by the second obtaining unit 90, and determines whether the value of the competition index a in the WLAN competition model is 0.
  • the storage unit 96 is configured to save the deployment plan of the AP obtained by the second obtaining unit 90 when the second determining unit 95 verifies that the access requirement is satisfied.
  • the adjusting unit 98 is further configured to adjust the value of the competition index ⁇ in the WLAN competition model when the second judging unit 95 determines that the value of the competition index ⁇ in the WLAN competition model is 0.
  • the current cycle value d is obtained, and the competition index is reduced by 1/2.
  • the second determining unit 95 is further configured to determine whether the current loop value d reaches a preset value after the adjusting unit 98 adjusts the value of the competition index ⁇ . In this embodiment, when the second determining unit 95 determines that the current loop value d reaches the preset value, the second output unit 97 is notified to save the output in the storage unit 96. AP deployment plan. When the second determining unit 95 determines that the current loop value d has not reached the preset value, the device 8 that has obtained the WLAN AP deployment scheme is notified to reset the value of the competition index, and notifies the second output unit 97 to adjust the adjusted unit 98. The value of the competition index is output to the device 8 that obtains the WLAN AP deployment plan.
  • the second determining unit 95 is further configured to determine whether a deployment plan of the saved AP in the storage unit 96 is determined when the current loop value d reaches a preset value. In this embodiment, when the second judging unit 95 is further configured to determine a deployment plan of the AP that is not saved, it is determined whether the loop of the second preset loop number is re-executed. The second judging unit 95 is further configured to notify the adjustment unit 98 that the value of the current competition index is adjusted to 1, and re-determine whether the current loop value d reaches the preset value when the loop of the second preset loop number is not re-executed.
  • the second output unit 97 is configured to output the deployment of the AP saved in the storage unit 96 when the second determining unit 95 determines a deployment scenario of the saved AP in the storage unit 96 or determines a loop in which the second preset number of loops is re-executed. Program. If there is a deployment plan of the saved AP in the storage unit 96, the latest AP deployment plan is output. If the deployment plan of the AP is not saved in the storage unit 96, the deployment plan of the AP without the AP is output, and the deployment plan of the AP in the device 8 that obtains the WLAN AP deployment solution is incorrect or unreasonable.
  • the second output unit 97 is further configured to: when the second determining unit 95 determines that the current loop value d has not reached the preset value, output the value of the adjusted exponential index of the adjusting unit 98 to the device 8 that obtains the WLAN AP deployment solution.
  • the verification method provided by the embodiment of the present invention performs channel allocation and power control on the AP in the deployment scheme, and selects an AP for the terminal, and then performs plausibility verification on the selected AP, and can verify the feasibility of the AP deployment scheme on the one hand.
  • the deployment plan of the AP can meet the minimum cost requirement.
  • FIG. 10 is another structural diagram of a full certificate device according to an embodiment of the present invention.
  • FIG. 10 differs from FIG. 9 in that the configuration unit of the verification apparatus shown in FIG. 10 has no adjustment unit 98 and storage unit 96, and FIG. 10 can obtain not only the obtained embodiment of the present invention.
  • the verification device shown in FIG. 10 does not need to adjust the competition index, and only verifies whether the obtained deployment plan of the WLAN AP is reasonable, or whether the access requirement is met.
  • the second output unit 97 directly outputs the result of the verification pass or success, that is, outputs the deployment plan of the WLAN AP obtained by the second obtaining unit 90.
  • the second output unit 97 directly outputs the result of the verification failure or unsuccess.
  • the functions of the other units are the same as those of the same unit in Fig. 9, and the description will not be repeated here.
  • the verification method provided by the embodiment of the present invention performs channel allocation and power control on the AP in the deployment scheme, and selects an AP for the terminal, and then performs plausibility verification on the selected AP, so as to verify the feasibility of the AP deployment scheme.
  • the storage medium may be a magnetic disk, an optical disk, a read-only memory (ROM), or a random access memory (RAM).

Description

一种无线局域网接入点部署方案的获得方法及系统 技术领域
本发明实施例涉及通信领域,特别是涉及一种无线局域网接入点部署方案 的获得方法及系统。
背景技术
由于以 IEEE 802.11 协议为代表的无线局 i或网 (Wireless Local Area Networks, WLAN )为互联网 (Internet )和企业网 (Intranet )的接入提供了优 良的解决方案, 因而 WLAN当前得到了迅猛的发展。 笔记本、 PDA、 智能手 机等无线终端的普及, 使得 WLAN网络的接入点 ( Access Point, AP )剧增。 由于接入点的不断增加, 因此需要合理的部署规划机制, 以避免随机部署而导 致网络整体性能下降和管理性差的缺点。
在现有技术中, 可以通过输入的场地(Floor )规划数据、 覆盖数据、 容 量(capacity )数据确定 WLAN接入点的特性, 如: 接入点(AP )数量、 部署 位置、 接入点的配置等。 其中场地(Floor )规划数据是一些建筑物因子, 如 大小、 拓朴等, AP的配置如位置、 AP属性: 功率、 信道等; 覆盖数据则是根 据 WLAN的 AP在所有 Floor位置出的特性, 包括连接速率、 覆盖区域、 传输 速率等; 容量(capacity )数据对应 AP的吞吐量, 该吞吐量可由相应的活动终 端数目等确定。 最后基于上述三类数据, 在电脑里仿真确定相应的 AP的配置 (如位置、 AP属性: 功率、 信道等)。
发明人在实现本发明的过程中,发现现有技术至少存在以下缺点: 现有技 术中是通过人工手动的方法调整来确定 AP的配置, 包括 AP部署的位置、 AP 所采用的功率、 信道等, 并且会导致成本开销没有限制。 发明内容
本发明实施例提供一种无线局域网接入点部署方案的获得方法及系统,以 自动获得 AP的部署方案, 并控制成本。
根据本发明的一方面, 提供一种 WLAN AP部署方案的获得方法, 所述方法 包括:
根据 WLA 竟争模型与部署信息获得每一种 AP的覆盖度信息;
将所述每一种 AP的覆盖度信息和所述每一种 AP的成本信息组成约束关 系, 计算获得 AP部署方案。
根据本发明的另一方面,还提供一种 WLAN AP部署方案的获得与验证系统, 所述系统包括:
获得 WLAN AP部署方案的装置, 用于根据 WLAN竟争模型和获得的部署信 息获得每一种 AP的覆盖度信息,将所述每一种 AP的覆盖度信息和所述每一种 AP的成本信息组成约束关系, 计算获得 AP部署方案;
验证装置, 用于对所述 AP的部署方案进行接入需求的合理性验证。
本发明实施例提供的技术方案, 根据 WLAN 竟争模型、 部署信息获得 AP 的覆盖度信息, 将覆盖度与 AP的成本信息的组成约束关系, 及计算以获得 AP 的部署方案, 从而不需要人工的参与就可以实现 AP 的部署, 并将每一种 AP 的成本信息和每一种 AP的覆盖度组成约束关系, 从而可以控制整个部署所需 要成本。 附图说明
为了更清楚地说明本发明实施例中的技术方案, 下面将对实施例描述中 所需要使用的附图作简单地介绍,显而易见地, 下面描述中的附图仅仅是本发 明的一些实施例,对于本领域普通技术人员来讲, 在不付出创造性劳动性的前 提下, 还可以根据这些附图获得其他的附图。
图 1本发明实施例的无线局域网 AP部署方案的获得方法的总体流程图; 图 1 A为本发明实施例的图 1的细化流程图;
图 2为本发明实施例中图 1A中的步骤 S 104的具体实现流程图; 图 3为本发明实施例中的无线局域网 AP部署方案的获得方法的具体实现 流程图;
图 3A为本发明实施例步骤 AA中 AP的覆盖区域图;
图 3B为本发明实施例步骤 BB中 AP的覆盖区域图;
图 3C为本发明实施例步骤 CC中 AP的覆盖区域图;
图 4为本发明实施例的 AP部署方案的 ^全证方法的流程图;
图 5为本发明实施例的 AP部署方案的验证方法的第一种情况下的具体流 程图;
图 6为本发明实施例的 AP部署方案的验证方法的第二种情况下的具体流 程图;
图 Ί为本发明实施例的 AP部署方案的获得与验证系统的示意图; 图 8为本发明实施例的获得 WLAN AP部署方案的装置的结构图; 图 9为本发明实施例的验证装置的结构图;
图 10为本发明实施例的 ^全证装置的另一种结构图。 具体实施方式 下面将结合本发明实施例中的附图,对本发明实施例中的技术方案进行清 楚、 完整地描述, 显然, 所描述的实施例仅仅是本发明一部分实施例, 而不是 全部的实施例。基于本发明中的实施例, 本领域普通技术人员在没有作出创造 性劳动前提下所获得的所有其他实施例, 都属于本发明保护的范围。
图 1本发明实施例的无线局域网 AP部署方案的获得方法的总体流程图。 步骤 S 1 0 : 根据 WLA 竟争模型与部署信息获得每一种 AP的覆盖度信息; 步骤 S20 : 将每一种 AP的覆盖度信息和每一种 AP的成本信息组成约束关 系, 计算获得 AP的部署方案。
图 1A为本发明实施例的图 1的细化流程图。 在本实施例中, 步骤 S 1 00, 获得部署信息。 在本实施例中, 部署信息包括场景信息, 多种 AP的设备规格 信息、 传播模型、 用户分布信息及用户需求信息。 在本实施例中, 场景信息为 部署需要覆盖的区域, 包括区域的长宽高信息, 区域中的障碍物信息, 及障碍 物的衰减因子信息。 设备规格信息为部署在场景中的 AP设备配置信息, 包括 射频个数、 种类、 工作频段、 成本或价格、 功率等信息。 用户分布信息为用户 在给定场景中的位置信息,在本实施例中,也可以理解为终端在给定场景中的 位置信息。用户需要求信息为用户在给定场景中给定位置的速率、带宽等信息。
在步骤 S 1 00中, 可以通过需要部署的场景确定一个矩形的网格状拓朴。 也可以理解为,将需要覆盖的区域用一个矩形的网格状拓朴来进行描述,其中, 网格状拓朴中的每个格子的状态可以空闲,或为障碍物。 由于区域中可以存在 多个不同的障碍物, 因此, 格子的状态可以为障碍物 1, 或障碍物 2等等。 在 本实施例中, 也可以用数值来描述, 比如, 若格子中的数值信息为 0, 则表示 该格子中没有障碍物, 或为空闲; 若格子中的数值信息为 1, 则表示该格子有 障碍物, 且为障碍物 1, 以此类推。
当然, 也可以通过格子的状态来获得网络状拓朴中的障碍物的数目。
在步骤 S 1 00中, 可以根据用户分布、 用户需求和网格状拓朴来确定每个 格子是否有终端及该格子需求带宽的大小。在本实施例中, 通过用户分布中的 终端在场景中的位置信息及网格状拓朴来确定每个格子是否有终端;通过用户 分布中的终端在场景中的位置信息、用户需求中终端在场景中的带宽信息和网 格状拓朴来确定该格子需求带宽的大小。 由于在本实施例中,信号衰减值还与 宽带需求形成对应的关系, 网格状拓朴可以由场景来确定。因此,可以理解为, 可以通过用户分布、 用户需求和场景来获得信号衰减值。
在步骤 S 1 00中, 可以根据不同的场景, 选择不同的传播模型。
步骤 S 1 02, 根据部署信息中的设备规格、 场景信息确定场强分布。 在本 实施例中, 由于 AP的设备规格有多种, 因此, 可以根据部署信息中的每一种 设备规格和场景信息确定每一种 AP的场强分布。
在本实施例中, 由于在步骤 S 1 00中, 可以通过需要部署的场景确定一个 矩形的网格状拓朴, 并根据不同的场景选择不同的传播模型。 因此, 在本步骤 S 102 中, 可以通过选择的传播模型计算出任意两个格子之间的信号衰减值, 再通过设备规格中的功率与信号衰减值进行加权计算以获得每个格子的场强 分布, 也可以理解为获得 AP到每个格子的场强分布。 在本实施例中, 场强分 布也可以称之为信号强度。在本实施例中,信号衰减值还与宽带需求形成对应 的关系。可以通过宽带需求和其对应关系获得信号衰减值,也可以通过信号衰 减值与其对应关系获得宽带需求。
步骤 S 1 04, 根据 WLAN竟争模型、 部署信息中的用户分布及用户需求及场 强分布获得 AP的覆盖度信息。 在本实施例中, 由于 AP的设备规格有多种, 且 步骤 S 1 02中获得了每一种 AP的场强分布, 因此, 本步骤, 根据 WLAN竟争模 型、 部署信息中的用户分布及用户需求及每一种 AP 场强分布获得每一种 AP 的覆盖度信息, 即可以获得多个 AP的覆盖度信息。 在本实施例中, WLAN竟争 模型也可以称为 WLAN竟争机制。
步骤 S 1 Q6, 将覆盖度信息和成本信息组成约束关系, 计算获得 AP部署方 案。在本实施例中, 将每一种 AP的覆盖度信息和每一种 AP的成本信息组成约 束关系, 计算获得部署成本最低的 AP部署方案。
图 2为本发明实施例中图 1A中的步骤 S 1 04的具体实现流程图。在本实施 例中, 以获得多个设备规格 AP中的某一个设备规格 AP进行说明。 步骤 S200、 确定与接入 AP的终端产生干扰的第一终端数量;在本实施例中,可以根据 WLAN 竟争模型、接入 AP的终端数量、该 AP的干扰范围内的终端数量来确定与接入 AP的终端产生干扰的第一终端数量。 在本实施例中, 该 AP的干扰范围内的终 端数量包括两部分, 一部分为该 AP的 1倍干扰范围内的终端数量和该 AP的 2 倍干扰范围内的终端数量, 其中, 干扰范围可以通过该 AP的功率和衰减度来 确定。在本领域的技术人员都可以理解并获得该干扰范围。在本实施例中, WLAN 竟争模型可以为通过根据工作在相同信道的终端数目、终端速率等竟争退化机 制条件, 建立单个或多个 WLAN AP 的容量模型, 可以用下述不等式表示。 ο 在本实施例中, α为一个调整参数, 可
Figure imgf000008_0001
以取不同的值。 其中, (1^表示接入 AP中的终端 i的带宽需求, 1)^表示接入 AP中的该终端 i到 AP的最大带宽需求, 该终端 i到 AP的最大带宽需求可以 理解为 AP为终端 i的提供的最大带宽, 即所述 AP到所述接入 AP的终端所处 的格子的最大场强分布。 n表示与接入 AP的终端产生干扰的第一终端数量, Cos t ( n )表示竟争开销, nl表示接入 AP的终端数量。
当 α取不同的范围时, 会影响到与接入 ΑΡ的终端产生干扰的第一终端数 量的值。 可以用以下公式来表示:
若 α<1, n=nl / (nl /n2) a;
若01 > 1, n=nl / (nl /n3) ^1 ,
其中, η表示与接入 ΑΡ的终端产生干扰的第一终端数量, nl表示接入 ΑΡ 的终端数量, n2表示该 AP的 1倍干扰范围内的终端数量, n3表示该 AP的 2 倍干扰范围内的终端数量。 在本实施例中, 若 α在小于 1的情况下, 没有得到 满足要求的部署方案时, 可以将 α的值设置为 1, 再进行获取部署方案。
步骤 S202、 根据该与接入 AP的终端产生干扰的终端数量、 接入 AP的终 端的带宽需求、 场强分布确定 AP的覆盖阔值; 在本实施例中, 可以根据与接 入 AP的终端产生干扰的终端数量确定竟争开销; 再根据该竟争开销、 终端的 带宽需求和场强分布确定 AP的覆盖阔值。
步骤 S204、 根据覆盖阔值和场强分布确定覆盖度; 在本实施例中, 根据 AP的覆盖阔值和每个格子的场强分布来确定该 AP对每个格子的覆盖度。 在本 实施例中, 可以用三维矩阵 C [ i, j,g]表示 g设备规格的 AP放在格子 i对格子 j的覆盖度, 其中, g表示 AP的设备规格, 或表示 AP的种类。 在本实施例中, 由于有多个设备规格的 AP, 因此, 也有多个 AP的覆盖度。
图 3为本发明实施例中的无线局域网 AP部署方案的获得方法的具体实现 流程图。 在本实施例中, 步骤 S300, 根据需要部署的场景确定一个矩形的网格状 拓朴。
步骤 S 302, 预设 AP覆盖的场强分布上限和下限。 在本实施例中, 场强上 限可以预设为大于等于 AP发射信号功率的一个数值, 场强下限可以预设为小 于等于终端最小接收 AP的信号强度值。
步骤 S 304, 确定接入 AP的终端数量。 在本实施例中, 可以理解为通过调 整 AP覆盖的场强上限或下限, 并根据部署信息中的用户分布及用户需求确定 接入 AP的终端数量。 在本实施例中, AP覆盖的场强上限或下限是指当 AP处 于其中的一个格子时, 对其它所有格子的场强覆盖情况。 当然, 首先得确定格 子中是否有终端, 才能确定该终端是否接入 AP。 在本实施例中, 可以根据用 户分布和网格状拓朴来确定每个格子是否有终端。 进一步, 可以根据每个格子 的终端的带宽需求与该 AP覆盖的场强上限和下限的二分值确定接入 AP的终端 数量。 在本实施例中, 将带宽需求大于该二分值的格子中的终端作为接入 AP 的终端, 即需要搜集带宽需求大于该二分值的所有格子中的终端数量, 将搜集 后的终端数量作为接入 AP的终端数量。 在本实施例中, 该格子的场强上限和 下限的二分值可以用 (场强上限 +场强下限) /2来表示。
步骤 S 306, 确定与接入 AP的终端产生干扰的第一终端数量。 在本实施例 中, 可以根据 WLAN竟争模型、 接入 AP的终端数量、 该 AP的干扰范围内的终 端数量来确定与接入 AP的终端产生干扰的第一终端数量。 在本实施例中, 该 AP的干扰范围内的终端数量包括两部分, 一部分为该 AP的 1倍干扰范围内的 终端数量和该 AP的 2倍干扰范围内的终端数量, 其中, 干扰范围可以通过该 AP 的功率和衰减度来确定。 也可以理解为, 干扰范围内的终端数量包括可以 接入 AP的终端数量,和可以接收 AP发射的信号但不能接入该 AP的终端数量。 在本领域的技术人员都可以理解并获得该干扰范围。
在本实施例中,在本实施例中, α可以取不同的值。 当 α取不同的范围时, 会影响到与接入 ΑΡ 的终端产生干扰的第一终端数量的值。 在本实施例中, a 的值可以从 0开始取值。 可以用以下公式来表示:
若 α<1, n=nl/(nl/n2)a;
若01>1, n=nl/(nl/n3) ^1,
其中, η表示与接入 ΑΡ的终端产生干扰的第一终端数量, nl表示接入 ΑΡ 的终端数量, n2表示该 AP的 1倍干扰范围内的终端数量, n3表示该 AP的 2 倍干扰范围内的终端数量。
步骤 S308, 确定竟争开销。 在本实施例中, 可以根据与接入 AP的终端产 生干扰的第一终端数量确定竟争开销。
在本实施例中, n表示与接入 AP的终端产生干扰的第一终端数量, Cost (n)表示竟争开销。 在本实施例中, 可以通过 WLAN竟争特性来建模, 而 WLAN 竟争特性是以饱和吞吐量的形式来表达,饱和吞吐量是指单位时间内传输数据 的有效时间比例, 可以通过以下公式表示:
(\-Ptr) + PtrPsTs +Ptr(\-Ps) ^
其中,
Figure imgf000011_0001
s 为传输有效数据的时间 / (传输有效数据时间 +竟争等待时间 +竟争产生 沖突时间)的比例值, E [P]表示平均的包载荷大小, δ表示传播延迟, Ts表示 检测到由于成功的传输而导致的信道忙(时隙忙)的平均时间, T。表示在沖突 的过程中每个终端检测到信道忙的平均时间, 即发送 RTS σ表示空时隙的持续 时间长度, Ptr表示在给定的时隙内至少有一个终端发送的概率, PS表示数据包 在信道上发送成功的概率, τ表示终端在随机选择的时隙内发送数据的发生概 率, η表示与接入 ΑΡ的终端产生干扰的第一终端数量。 在本实施例中, 根据 饱和吞吐量的定义, 可以得到竟争造成的开销为 1-S, 即 Cos t ( n )为 1-S。 在本实施例中, 由于当 α取不同的范围时, 会影响到与接入 ΑΡ的终端产生干 扰的第一终端数量的值, 并且 η的值会影响到部署的成本, 因此, α的值跟部 署的成本形成某种对应关系, 如果 α的值越小, 则部署的成本就越低。
步骤 S 310,验证该 AP是否满足接入需求。在本实施例中,根据竟争开销、 接入 AP的终端的带宽需求和所述 AP到所述接入 AP的终端所处的格子的场强 分布验证是否满足接入需求。 在本实施例中, 接入需求可以理解为两个方面, 一个方面为部署的网络需要满足一定的吞吐量,另一个方面是需要满足在这个 部署的网络中的每个终端的速率或宽带速率。在本实施例中, 可以通过判断以 下不等式是否成立验证是否满足接入需求。 当不等式成立时, 则验证满足接入 需求。 反之。 不等式如下:
Figure imgf000012_0001
其中, (1^表示接入 AP中的终端 i的带宽需求, 1)^表示接入 AP中的该 终端 i到 AP的最大带宽需求, 该终端 i到 AP的最大带宽需求可以理解为 AP 为终端 i的提供的最大带宽,即所述 AP到所述接入 AP的终端所处的格子的最 大场强分布。 n表示与接入 AP的终端产生干扰的第一终端数量, Cost (n) 表示竟争开销, nl表示接入 AP的终端数量。
在本实施例中,当不等式成立时,即验证满足接入需求,则执行步骤 S312。 当不等式不成立时, 即验证不满足接入需求, 则执行步骤 S314。
步骤 S312, 调整 AP覆盖的场强上限的值。 在本实施例中, 将新的场强上 限值调整为旧的场强上限与旧的场强下限的二分值。
步骤 S314, 调整 AP覆盖的场强下限的值。 在本实施例中, 将新的场强下 限值调整为旧的场强上限与旧的场强下限的二分值。
当执行完步骤 S312或 S步骤 S314后, 执行步骤 S316。
步骤 S316, 确定是否完成 K次循环。 本步骤可以理解为, 确定是否完成 第一预设循环次数, 该第一预设循环次数为该 K次循环次数。 在本实施例中, 每循环一次, K值就减 1。 在本实施例中, 本步骤可以理解为, 确定 K的值是 否为 0。 在本实施例中, 若 K的值不为 0, 即没有完成 K次循环, 则执行步骤 S304, 即对步骤 S304至步骤 S314进行第一预设循环次数的执行。 此时, 步骤 S304 中的格子的场强上限和下限的二分值也相应的进行更新。 若 K的值为 0 时, 即完成 K次循环, 则执行步骤 S318。
步骤 S318, 确定 AP的覆盖阔值。 在本实施例中, 也可以理解为, 确定 AP 的覆盖范围。 在本实施例中, 若完成了 K次循环后, 将调整后的场强上限值作 为 AP的覆盖阔值。
步骤 S320, 确定覆盖度。 在本实施例中, 根据覆盖阔值和场强分布确定 覆盖度; 在本实施例中, 根据 AP的覆盖阔值和每个格子的场强分布来确定该 AP对每个格子的覆盖度。 在本实施例中, 可以用三维矩阵 C [h, j,g]表示 g设 备规格的 AP放在格子 h对格子 j的覆盖度, 其中, g表示 AP的设备规格, 或 AP的种类。 在本实施例中, 分三种情况的下的覆盖度, 第一种为: 若 AP放在 格子 h, 该 AP对格子 j的场强分布大于覆盖阔值, 并格子 j不属于格子 h覆 盖的边缘区域, 则 C [h, j,g]为 C0, 该 CO为边缘覆盖度需求, 其中, 边缘区域 为本领域的技术人员所熟悉的技术用语, 此处不作详细描述; 第二种情况, 若 AP放在格子 h, 该 AP对格子 j的场强分布大于覆盖阔值, 并格子 j属于格子 h覆盖的边缘区域, 则 C [h,j,g]为 1 ; 第三种情况为: 若 AP放在格子 h, 该 AP对格子 j的场强分布小于覆盖阔值, 则 C [h, j,g]为 0。
在本实施例中,也可以用不同位置的容量覆盖区域或场强覆盖区域来表示
AP的覆盖度。 当 AP的覆盖度与容量覆盖区域或场强覆盖区域之间可以存在映 射关系。 在本实施例中, 将 AP放在某个格子, 若其覆盖度满足大于或等于某 一个门限值时, 则认为 AP在该位置时能够覆盖该门限值范围内所有 STA的需 求的容量区域。 在本实施例中, 该门限值可以为 2。 反过来, 若已知某位置 AP 的容量覆盖范围, 若该位置的 AP的容量小于该容量覆盖范围与该门限值的乘 积范围时, 认为 AP的覆盖度为 a, 若该位置的 AP的容量大于该容量覆盖范围 与该门限值的乘积范围时, 认为 AP的覆盖度是 b。
同理, 在本实施例中, 将 AP放在某个格子, 若其覆盖度满足大于或等于 某一个门限值时, 则认为 AP在该位置时能够覆盖该门限值范围内所有 STA的 需求的场强区域或信号强度区域。在本实施例中, 该门限值可以为 2。反过来, 若已知某位置 AP的场强覆盖范围,若该位置的 AP的场强小于该场强覆盖范围 与该门限值的乘积范围时, 认为 AP的覆盖度为 b, 若该位置的 AP的场强大于 该场强覆盖范围与该门限值的乘积范围时, 认为 AP的覆盖度是 a。 步骤 S322, 将每一种 AP的覆盖度信息与每一种 AP的成本信息组成约束 关系。 在本实施例中, 可以通过线性规划来描述每一种 AP的覆盖度与每一种 AP的成本信息的约束关系, 也可以用图论的方式来描述每一种 AP的覆盖度与 每一种 AP的成本信息的约束关系。 当然, 还可以用运筹学中的单纯形法。 在 本 实 施 例 中 , 对 每 个 格 子 h 需 要 满 足 Sum (i sThere (j, g) *C (h, j, g) ) >=coverageDegree (h) 的 约 束 关 系 , coverageDegree (h)是指格子 h上要求的覆盖度。 在本实施例中, 当满足上述 的这种约束关系后, 再根据每一种 g设备规格 AP设备的成本信息建立目标函 数。该目标函数为 [totalcost] min=Sum (cost (g) *isThere(h, g)), 即需要部署 所有设备的价格之和最小, 这样可以使部署的成本达到最小。 在本实施例中, 当每个格子 h 满足覆盖度的约束关系后, 再获得在这种约束下的同一种设备 规格的 AP所产生的部署成本,再获得其中部署成本最小的 AP的相关信息。在 本实施例中, 也可以理解为, 针对同一个设备规格的 AP, 不仅需要满足覆盖 度的约束关系, 还需要满足成本的约束关系。 在本实施例中, 还可以选择建立 更多的线性约束, 但只是可选方案。 建立覆盖度、 AP 的成本信息的约束关系 为必选的方案。 比如: 建立设备位置线性约束。 在本实施例中, 建立 AP的位 置约束。 将设备放入状态为 0 的格子中, 即对每个格子 h 需要满足 isThere(h, g) *gridstatus (h)=0 的条件, 其中, i sThere (h, g)表示在格子 h 放置了种类 g的设备, gridstatus(h)表示格子 h是否已经有设备, 有该值为 1, 没有该值为 0。 还可以建立网关位置线性约束。 在本实施例中, 对每个网 关位置 d需要满足 Sum ( i sThere (d, g) ) =1。 在本实施例中, 当采用图论的方式来描述覆盖度、 AP 的成本信息的约束 关系时, 可以通过以下方式来实现:
步骤 AA: 将 AP部署在某个点后, 得到一个 AP的覆盖区域图; 在本实步 骤中, 可以理解为, 将图的顶点理解为 AP节点, 则每个 AP有一定的容量范围 或信号覆盖范围; 可以参见图 3A, AP节点 1。
步骤 BB: 选择周围的节点进行部署, 最大化这些节点加起来所能覆盖的 区域。 在本步骤中, 当确定好第一个节点的能够满足的区域之后, 按全覆盖要 求, 即场景内所有点都被无线信号覆盖或者每个点满足一定的速率,按照贪婪 的方法去寻找后续 AP节点的位置, 将这些节点的位置进行部署后, 会达到实 现的 AP的个数最少, 即实现整个网络的成本最低。 可以参见图 3B, AP节点 1-1 0。
步骤 CC: 按照步骤 BB的规则迭代进行, 直至整个区域都被覆盖或都满足 了一定的速率需求。 可以参见图 3C, AP节点 1-40。
步骤 S 324, 对建立的约束进行计算, 以获得整体部署成本最低的 AP部署 方案。 在本实施例中, 部署方案为 AP的位置、 带宽需求、 覆盖范围、 到每个 格子的场强分布和成本。 在本实施例中, 每一种的 AP都一个约束关系, 当每 个格子 h 满足覆盖度的约束关系后, 再获得在这种约束下的该 g设备规格的 AP所产生的部署成本, 再获得其中部署成本最小的 AP的部署方案。 该部署方 案中还可以包括步骤 S 306中使用的 WLAN竟争模型, 即 a的值。
本发明实施例提供的 WLAN AP部署方案的获得方法,根据获得的部署信息, 确定与接入 AP的终端产生干扰的第一终端数量, 并根据该第一终端数量, 接 入 AP的终端的带宽需求及场强分布来获得 AP的覆盖阔值,再根据该覆盖阔值 和场强分布来获得覆盖度,再根据设备的成本信息和覆盖度建立约束, 以获得 WLAN AP的部署方案, 跟现有技术相比, 在获得 WLAN AP的部署方案的过程中 不需要人工的调整, 可以实现自动化的获得 AP的部署方案; 并且在获得 WLAN AP部署方案的过程中, 将每一种 AP的成本信息和每一种 AP的覆盖度建立约 束, 从而可以控制整个部署所需要成本, 并可获得整体部署成本最低的 AP部 署方案。
图 4为本发明实施例的 AP部署方案的 ^全证方法的流程图。在本实施例中, 可以对图 3的方法所输出的部署方案进行 3全证,也可以对通过其它部署方法输 出的 AP的部署方案进行验证。
步骤 S400, 对部署方案中的 AP进行信道分配和功率控制;
步骤 S402, 当完成了信道分配和功率控制后, 为终端选择一个 AP作为接 入的 AP;
步骤 S404, 验证是否满足接入需求; 在本实施例中, 若针对图 3的方法 所输出的部署方案进行验证的情况下, 当验证满足接入需求时, 先保存该验证 通过的部署方案, 并判断当前的竟争指数是否为 0, 若为 0, 则输出验证通过 的部署方案, 若不为 0, 则调整该竟争指数, 并回到图 3中的步骤 S306。 当验 证不满足接入需要时, 则调整当前的竟争指数, 并回到图 3 中的步骤 S306。 当然, 在此过程中, 还需要设定一个循环的次数 V, 当次数 V到达预设值时, 则输出保存中的部署方案。 当然, 如果没有保存部署方案, 则输出没有部署方 案的结果。 在本实施例中, 若针对通过其它部署方法输出的 AP的部署方案进 行验证的情况下, 若验证满足接入需求时, 则直接输出部署方案。 若验证不满 足接入需求时, 则输出错误的或不成功部署方案的结果。 步骤 S406, 输出验证的结果。 在本实施例中, 输出验证通过的 AP的部署 方案, 或输出错误或不成功的结果。
图 5为本发明实施例的 AP部署方案的验证方法的第一种情况下的具体流 程图。
步骤 S500,对部署方案中的 AP进行信道分配和功率控制。在本实施例中, 可以采用任何一种信道分配的算法来对部署方案中的 AP进行信道分配, 也可 以采用任何一种功率控制的算法来对部署方案中的 AP进行功率控制。 在本实 施例中, 信道分配的算法主要根据收集到的全网 AP扫描到的信号强度, 为每 个 AP选择信号强度最小的信道作为自己的工作信道, 功率控制的算法主要根 据整网 AP的干扰信息,调低一个或者多个 AP的功率,调低过程中要保证覆盖 要求。
步骤 S502, 当完成了信道分配和功率控制后, 为终端选择一个 AP作为接 入的 AP; 在本实施例中, 可以采用任何一种 AP的选择算法来为终端选择一个 AP作为接入的 AP。 AP的选择算法主要是终端根据收到的 AP信号强度以及该 AP的负载选择是否接入该 AP, 其中, 终端先以信号强度为依据选择多个 AP, 再根据这些 AP的负载情况, 选择负载最小的 AP接入。
步骤 S504, 获得该 AP的邻居 AP。 在本实施例中, 在该 AP的干扰范围内, 获得与该 AP工作在相同的信道的所有邻居 AP。
步骤 S506, 获得与接入该 AP的终端产生干扰的第二终端数量。 在本实施 例中,先获得接入到该 AP的所有邻居 AP的终端数量和接入该 AP的终端数量, 将接入到该 AP的所有邻居 AP的终端数量和接入该 AP的终端数量进行加权, 来获得与接入该 AP的终端产生干扰的第二终端数量。 在本实施例中, 由于在 步骤 S500和步骤 S502中, 通过信道分配、 功率控制和选择 AP的过程, 因此, 可以获得 AP的实际的接入终端数量和与接入该 AP的终端产生干扰的第二终端 数量。 而与图 3中的与接入 AP的终端产生干扰的第一终端数量不同的是, 在 图 3中第一终端数量是不断的进行调试部署的结果,会随时发生变化, 而第二 终端数量可以认为是一个实际的结果。
步骤 S508, 确定竟争开销。 在本实施例中, 可以根据与接入 AP的终端产 生干扰的第二终端数量确定竟争开销。在本实施例中, 可以参考图 3的竟争销 的计算方法。
步骤 S510, 验证该 AP是否满足接入需求, 即进行合理性验证。 在本实施 例中, 根据竟争开销、 接入 AP的终端的带宽需求和所述 AP到所述接入 AP的 终端所处的格子的场强分布验证是否满足接入需求。在本实施例中,可以参考 图 3的验证方法。 在本实施例中, 当验证满足接入需求时, 执行步骤 S512。 若验证不满足接入需求时, 执行步骤 S518。
步骤 S512,将当前的 AP的部署方案进行保存。保存之后,再执行步骤 S514。 步骤 S514, 确定竟争指数是否为 0。 在本实施例中, 由于在图 3中的步骤
S 306 , 可以根据 WLAN竟争模型、 接入 AP的终端数量、 该 AP的干扰范围内的 终端数量来确定与接入 AP 的终端产生干扰的第一终端数量中的过程中, 对 WLAN竟争模型中的竟争指数的值进行了取值设置, 因此, 在步骤 S514, 需要 验证一下竟争指数的值。 若竟争指数的值不为 0, 则执行步骤 S516。 若竟争指 数的值为 0, 则执行步骤 S526。
步骤 S516, 减小当前的竟争指数的值。 在本实施例中, 获得当前已进行 的循环值 d, 即对步骤 S510已执行的次数, 将竟争指数的减小 1/2 。 步骤 S518, 增加当前的竟争指数的值。 在本实施例中, 获得当前进行的 循环值 d, 即对步骤 S510已执行的次数, 将竟争指数的增加 1/2 。
当执行完步骤 S516或步骤 S518后, 执行步骤 S520。
步骤 S520, 判断当前进行循环值是否达到预设值, 即确定是否完成第二 预设循环次数。 若达到预设值, 则执行步骤 S522。 若没有达到预设值, 则执 行步骤 S530, 即转到执行图 3中的步骤 S 306, 即将步骤 S516或步骤 S518中 的竟争指数的值输出给执行图 3中的步骤 S 306, 以重新确定与接入 AP的终端 产生干扰的第一终端数量。在本实施例中, 该第二预设循环次数可以认为是从 步骤 S510至 S520后的执行次数, 也可以认为是执行步骤 S510的阔值次数。 在步骤可以理解为判断步骤 S510的已执行的次数是否达到预设值。
步骤 S522, 确定是否有保存的 AP的部署方案。 若确定有保存的 AP的部 署方案, 则执行步骤 S526。 若没有保存的 AP的部署方案, 则执行步骤 S524。
步骤 S524, 确定是否重新进行了第二预设循环次数的循环。 若没有, 则 执行步骤 S528。 若有, 则执行步骤 S526。
步骤 S528,将当前的竟争指数的值调整为 1, 并重新进行第二预设循环次 数的循环。 在本实施例中, 即将步骤 S520 中的当前循环的次数清 0, 重新判 断。
执行完步骤 S528后, 执行步骤 S530。
步骤 S526, 输出部署方案的结果。 在本实施例中, 若有保存的 AP的部署 方案, 则输出该保存的 AP的部署方案。 若没有保存 AP的部署方案, 即没有满 足接入需求的部署方案, 则输出没有 AP的部署方案的结果。
本发明实施例提供的验证方法, 对部署方案中的 AP进行信道分配和功率 控制, 及为终端选择一个 AP, 再对选择的 AP进行合理性验证, 一方面可以验 证 AP的部署方案可行性, 另一方面,通过合理性验证的结果以调整竟争模型, 从而 AP的部署方案可以满足最小成本的需求。
图 6为本发明实施例的 AP部署方案的验证方法的第二种情况下的具体流 程图。
在本实施例中, 步骤 S600, S602 , S604 , S606 , S608 , S610 , 分别与图 5 中的步骤 S500, S502 , S504 , S506 , S508 , S510相同, 此处不在重复描述。
在本实施例中,在步骤 S610中,若验证满足接入需求时,执行步骤 S612。 若验证不满足接入需求时, 执行步骤 S614。
步骤 S612, 输出 3全证成功的结果, 即输出该 3全证通过的 AP的部署方案。 步骤 S614, 输出 3全证不成功的结果。
本发明实施例提供的验证方法, 对部署方案中的 AP进行信道分配和功率 控制, 及为终端选择一个 AP, 再对选择的 AP进行合理性验证, 可以验证 AP 的部署方案可行性。
图 Ί为本发明实施例的 AP部署方案的获得与 ^全证系统的示意图。 在本实 施例中,部署与验证系统 Ί包括获得 WLAN AP部署方案的装置 8和验证装置 9。 在本实施例中, 获得 WLAN AP部署方案的装置 8用于 WLAN竟争模型和获得的 部署信息获得每一种 AP的覆盖度信息,将所述每一种 AP的覆盖度信息和所述 每一种 AP的成本信息组成约束关系, 计算获得部署成本最低的 AP部署方案。 在本实施例中, 3全证装置 9用于对获得 WLAN AP部署方案的装置 8获得的 WLAN AP的部署方案进行合理性验证。 在本实施例中, 验证装置 9还可以对其它的 部署装置获得的 WALN AP的部署方案进行合理性验证。 图 8为本发明实施例的获得 WLAN AP部署方案的装置的结构图。 在本实施 例中, 装置 8包括第一获取单元 80、 第一计算单元 8 1、 第一判断单元 82、 约 束单元 8 3及第一输出单元 84。 在本实施例中, 获得 WLAN AP部署方案的装置 也可以为一个模块或单元, 部署在其它的装置上。
在本实施列中, 第一获取单元 80用于获得部署信息。 在本实施例中, 部 署信息包括场景信息, 多种 AP的设备规格信息、 传播模型、 用户分布信息及 用户需求信息。 在本实施例中, 由于 AP的设备规格有多种, 因此, 每一种 AP 都具有一种场强分布, 和一种覆盖度。
在本实施例中, 第一获取单元 80还可以根据需要部署的场景确定一个矩 形的网格状拓朴, 也可以根据用户分布、用户需求和网格状拓朴来确定每个格 子是否有终端及该格子需求带宽的大小。
第一计算单元 81用于根据部署信息中的设备规格、 场景信息确定场强分 布。 在本实施例中, 第一计算单元 81可以根据部署信息中的每一种设备规格 和场景信息确定每一种 AP的场强分布。第一计算单元 81可以通过选择的传播 模型计算出任意两个格子之间的信号衰减值,再通过设备规格中的功率与信号 衰减值进行加权计算以获得每个格子的场强分布, 也可以理解为获得 AP到每 个格子的场强分布。 在本实施例中, 场强分布也可以称之为信号强度。 在本实 施例中,信号衰减值还与宽带需求形成对应的关系。可以通过宽带需求和其对 应关系获得信号衰减值, 也可以通过信号衰减值与其对应关系获得宽带需求。
在本实施例中, 第一计算单元 81还用于根据 WLAN竟争模型、部署信息中 的用户分布及用户需求及场强分布获得 AP的覆盖度。 在本实施例中, 由于 AP 的设备规格有多种, 且获得了每一种 AP的场强分布, 因此, 第一计算单元 81 可以根据 WLA 竟争模型、部署信息中的用户分布及用户需求及每一种 AP的场 强分布获得该每一种 AP的覆盖度。
在本实施例中,以获得多个设备规格 AP中的某一个设备规格 AP进行说明。 在本实施例中,所述第一计算单元 81进一步用于通过调整 AP覆盖的场强 上限或下限, 并根据部署信息中的用户分布及用户需求确定接入 AP的终端数 量。 进一步, 第一计算单元 81还用于调整 AP覆盖的场强上限或下限, 根据所 述部署信息中的用户分布及网格状拓朴确定每个格子是否有终端, 当有终端 时, 根据格子的终端的带宽需求与该 AP覆盖的场强上限和下限的二分值确定 接入 AP的终端数量。
在本实施例中,第一计算单元 81还用于确定与接入 AP的终端产生干扰的 终端数量。 在本实施例中, 可以根据 WLAN竟争模型、 接入 AP的终端数量、 该 AP 的干扰范围内的终端数量来确定与接入 AP 的终端产生干扰的第一终端数 量。 在本实施例中, 该 AP的干扰范围内的终端数量包括两部分, 一部分为该 AP的 1倍干扰范围内的终端数量和该 AP的 2倍干扰范围内的终端数量,其中, 干扰范围可以通过该 AP的功率和衰减度来确定。 在本领域的技术人员都可以 理解并获得该干扰范围。 在本实施例中, WLAN竟争模型可以下述不等式表示。 o 在本实施例中, α为一个调整参数, 可
Figure imgf000023_0001
以取不同的值。 其中, (1^表示接入 AP中的终端 i的带宽需求, 1)^表示接入
AP中的该终端 i到 AP的最大带宽需求, 该终端 i到 AP的最大带宽需求可以 理解为 AP为终端 i的提供的最大带宽, 即所述 AP到所述接入 AP的终端所处 的格子的最大场强分布。 n表示与接入 AP的终端产生干扰的第一终端数量, Cos t ( n )表示竟争开销, nl表示接入 AP的终端数量
在本实施例中, α可以取不同的值。 当 α取不同的值时, 会影响到与接入 ΑΡ的终端产生干扰的第一终端数量的值。 可以用以下公式来表示:
若 α<1, n=nl / (nl /n2) a;
若01 > 1, n=nl / (nl /n3) ^1 , 其中, η表示与接入 ΑΡ的终端产生干扰的第 一终端数量, nl表示接入 AP的终端数量, n2表示该 AP的 1倍干扰范围内的 终端数量, n3表示该 AP的 2倍干扰范围内的终端数量。
在本实施例中,所述第一计算单元 81进一步用于根据所述第一终端数量、 所述接入 AP的终端的宽带需求、 场强分布确定覆盖度。 进一步, 在本实施例 中,第一计算单元 81还用于根据所述与接入 AP的终端产生干扰的第一终端数 量、接入 AP的终端的宽带需求、 场强分布确定 AP的覆盖阔值, 根据所述覆盖 阔值和场强分布确定覆盖度。 所述第一计算单元 81 进一步用根据与接入 AP 的终端产生干扰的第一终端数量确定竟争开销。
第一判断单元 82用于验证是否满足接入需求。 在本实施例中, 第一判断 单元 82可以根据竟争开销、 接入 AP的终端的带宽需求和所述 AP到所述接入 AP的终端所处的格子的场强分布验证是否满足接入需求。
第一计算单元 81还用于当验证满足接入需求时, 调整场强上限的值, 或 验证不满足接入需求时, 调整场强下限的值。
第一判断单元 82还用于确定是否完成 K次循环,当确定完成 K次循环时, 将第一计算单元 81当前得到的场强上限值作为 AP的覆盖阔值。
第一计算单元 81还用于根据覆盖阔值和场强分布确定覆盖度。
约束单元 83用于根据设备规格中的成本信息、 覆盖度建立约束。 在本实 施例中,根据设备规格中的成本信息建立目标函数的线性约束,根据覆盖度建 立覆盖度线性约束。在本实施例中,还可以建立设备位置线性约束及网关位置 线性约束。 在本实施例中, 可以线性规则来描述覆盖度、 AP 的成本信息的约 束, 也可以用图论的方式来描述覆盖度、 AP 的成本信息的约束。 当然, 还可 以用运筹学中的单纯形法。
第一计算单元 81还用于对约束单元 8 3中建立的约束进行计算,以获得部 署成本最低的 AP部署方案。 在本实施例中, 每一种的 AP都一个约束关系, 当 每个格子 h 满足覆盖度的约束关系后, 再获得在这种约束下的该 g设备规格 的 AP所产生的部署成本, 再获得其中部署成本最小的 AP的部署方案。
第一输出单元 84用于输出第一计算单元 81获得的 WLAN AP的部署方案。 在本实施例中, 第一输出单元 84还用于输出第一计算单元 81 中使用的 WLA 竟争模型, 即输出第一计算单元 8 1中使用 a的值。
本发明实施例提供的获得 WLAN AP部署方案的装置,根据获得的部署信息, 确定与接入 AP的终端产生干扰的第一终端数量, 并根据该第一终端数量, 接 入 AP的终端的带宽需求及场强分布来获得 AP的覆盖阔值,再根据该覆盖阔值 和场强分布来获得覆盖度,再根据设备的成本信息和覆盖度进行线性规划, 以 获得 WLAN AP的部署方案, 跟现有技术相比, 在获得 WLAN AP的部署方案的过 程中不需要人工的调整, 可以实现自动化的获得 AP的部署方案; 并且在获得 WLAN AP部署方案的过程中, 将每一种 AP的成本信息和每一种 AP的覆盖度建 立约束, 从而可以控制整个部署所需要成本, 并可获得整体部署成本最低的 AP部署方案。
图 9 为本发明实施例的验证装置的结构图。 在本实施例中, 验证装置 9 包括第二获取单元 90、 信道分配单元 91、 功率控制单元 92、 选择单元 93、 第 二计算单元 94、 第二判断单元 95、 存储单元 96、 第二输出单元 97及调整单 元 98。
在本实施例中, 第二获取单元 90用于获得 WLAN AP部署方案的装置 8输 出的 WLAN AP的部署方案。 在本实施例中, 第二获取单元 90还用于获得 WLAN AP部署方案的装置 8中使用的 WLAN竟争模型, 即获得 WLAN AP部署方案的装 置 8中使用 α的值。
信道分配单元 91用于对第二获取单元 90获得的部署方案中的 ΑΡ进行信 道分配。 在本实施例中, 信道分配的算法主要根据收集到的全网 ΑΡ扫描到的 信号强度, 为每个 ΑΡ选择信号强度最小的信道作为自己的工作信道。
功率控制单元 92用于对第二获取单元 90获得的部署方案中的 ΑΡ进行功 率控制。 在本实施例中, 功率控制的算法主要根据整网 ΑΡ的干扰信息, 调低 一个或者多个 ΑΡ的功率, 调低过程中要保证覆盖要求。
选择单元 93用于当信道分配单元 91和功率控制单元 92分别完成了信道 分配和功率控制后, 为终端选择一个 ΑΡ作为接入的 ΑΡ。 在本实施例中, 可以 采用任何一种 ΑΡ的选择算法来为终端选择一个 ΑΡ作为接入的 AP。 AP的选择 算法主要是终端根据收到的 AP信号强度以及该 AP的负载选择是否接入该 AP, 其中, 终端先以信号强度为依据选择多个 AP, 再根据这些 AP的负载情况, 选 择负载最小的 AP接入。
第二计算单元 94用于获得选择单元 93选择的该 AP的邻居 AP。 在本实施 例中, 在该 AP的干扰范围内, 获得与该 AP工作在相同的信道的所有邻居 AP。 在本实施例中,第二计算单元 94还用于获得与接入该 AP的终端产生干扰的第 二终端数量。在本实施例中,先获得接入到该 AP的所有邻居 AP的终端数量和 接入该 AP的终端数量, 将接入到该 AP的所有邻居 AP的终端数量和接入该 AP 的终端数量进行加权, 来获得与接入该 AP的终端产生干扰的第二终端数量。 在本实施例中, 第二计算单元 94还用于确定竟争开销。 在本实施例中, 可以 根据与接入 AP的终端产生干扰的第二终端数量确定竟争开销。
第二判断单元 95用于验证是否满足接入需求。 在本实施例中, 根据竟争 开销和接入 AP的终端的带宽需求验证是否满足接入需求。
调整单元 98用于当第二判断单元 95验证不满足接入需求时, 调整 WLAN 竟争模型中的竟争指数 α的值。 在本实施例中, 获得当前进行的循环值 d, 将 竟争指数的增加 1/2 。 在本实施例中, 当前进行的循环值可以理解为第二判 断单元 95验证是否满足接入需要的验证次数。
第二判断单元 95用于验证满足接入需求时,通知存储单元 96保存第二获 取单元 90获得的 AP的部署方案, 并确定 WLAN竟争模型中的竟争指数 a的值 是否为 0。
存储单元 96用于当第二判断单元 95验证满足接入需求时,保存第二获取 单元 90获得的 AP的部署方案。
调整单元 98还用于当第二判断单元 95确定 WLAN竟争模型中的竟争指数 α的值为 0时, 调整 WLAN竟争模型中的竟争指数 α的值。 在本实施例中, 获 得当前进行的循环值 d, 将竟争指数的减小 1/2 。
第二判断单元 95还用于当调整单元 98调整完竟争指数 α的值后,确定当 前进行循环值 d是否达到预设值。 在本实施例中, 当第二判断单元 95确定当 前进行循环值 d达到预设值时,通知第二输出单元 97输出存储单元 96中保存 的 AP的部署方案。当第二判断单元 95确定当前进行循环值 d没有达到预设值 时, 通知获得 WLAN AP部署方案的装置 8重新设置竟争指数的值, 并通知第二 输出单元 97将调整单元 98调整后的竟争指数的值输出给获得 WLAN AP部署方 案的装置 8。
第二判断单元 95还用于确定当前进行循环值 d达到预设值时, 确定存储 单元 96中是否有保存的 AP的部署方案。 在本实施例中, 第二判断单元 95还 用于确定没有保存的 AP的部署方案时, 确定是否重新进行了第二预设循环次 数的循环。第二判断单元 95还用于没有重新进行第二预设循环次数的循环时, 通知调整单元 98当前的竟争指数的值调整为 1,并重新确定当前进行循环值 d 是否达到预设值。
第二输出单元 97用于当第二判断单元 95确定存储单元 96中有保存的 AP 的部署方案或确定重新进行了第二预设循环次数的循环时, 输出存储单元 96 中保存的 AP的部署方案。 若存储单元 96中有保存的 AP的部署方案时, 则输 出最新的 AP的部署方案。 若存储单元 96中没有保存 AP的部署方案时, 则输 出没有 AP的部署方案的结果, 也可以认为获得 WLAN AP部署方案的装置 8中 AP的部署方案不正确, 或不合理。
第二输出单元 97还用于第二判断单元 95确定当前进行循环值 d没有达到 预设值时, 将调整单元 98调整后的竟争指数的值输出给获得 WLAN AP部署方 案的装置 8。
本发明实施例提供的验证方法, 对部署方案中的 AP进行信道分配和功率 控制, 及为终端选择一个 AP, 再对选择的 AP进行合理性验证, 一方面可以验 证 AP的部署方案可行性, 另一方面,通过合理性验证的结果以调整竟争模型, 从而 AP的部署方案可以满足最小成本的需求。
图 1 0为本发明实施例的 ^全证装置的另一种结构图。 在本实施例中, 图 10 与图 9的区别在于,图 1 0所示的验证装置的结构图中没有调整单元 98和存储 单元 96, 并且图 1 0不仅可以获得本发明实施例中的获得 WLAN AP部署方案的 装置 8中的 WLAN AP的部署方案, 还可以从其它的部署装置所产生的 WLAN AP 的部署方案。 在实施的过程中, 图 1 0所示的验证装置不需要对竟争指数进行 调整, 只验证所获得的 WLAN AP的部署方案是否合理, 或是否满足接入需求。
在图 1 0中, 当第二判断单元 95验证满足接入需求时, 第二输出单元 97 就直接输出验证通过或成功的结果, 即输出第二获取单元 90获得的 WLAN AP 的部署方案。 在第二判断单元 95 验证不满足接入需求时, 第二输出单元 97 就直接输出验证不通过或不成功的结果。其它单元所涉及的功能与图 9中的相 同单元的功能相同, 此处不再重复描述。
本发明实施例提供的验证方法, 对部署方案中的 AP进行信道分配和功率 控制, 及为终端选择一个 AP, 再对选择的 AP进行合理性验证, 可以验证 AP 的部署方案可行性。
本领域普通技术人员可以理解实现上述实施例方法中的全部或部分流程, 是可以通过计算机程序来指令相关的硬件来完成,所述的程序可存储于一计算 机可读取存储介质中,该程序在执行时,可包括如上述各方法的实施例的流程。 其中,所述的存储介质可为磁碟、光盘、只读存储记忆体(Read-Only Memory, ROM )或随机存储记忆体(Random Access Memory, RAM )等。

Claims

权 利 要 求
1、一种无线局 i或网 ( Wireless Local Area Networks , WLAN )接入点( Access Point, AP )部署方案的获得方法, 其特征在于, 所述方法包括:
根据 WLAN竟争模型与部署信息获得每一种 AP的覆盖度信息; 将所述每一种 AP的覆盖度信息和所述每一种 AP的成本信息组成约束关 系, 计算获得 AP的部署方案。
2、 根据权利要求 1所述的方法, 其特征在于, 所述部署信息包括场景、 AP的设备规格、用户分布及用户需求, 所述根据 WLAN竟争模型与部署信息 获得每一种 AP的覆盖度包括:
根据所述部署信息中的场景和每一种 AP的设备规格确定每一种 AP的场 强分布;
根据所述 WLAN竟争模型、 所述部署信息中的用户分布及每一种 AP的 用户需求及所述每一种 AP的场强分布获得所述每一种 AP的覆盖度。
3、 根据权利要求 2所述的方法, 其特征在于, 所述根据获得的部署信息 中的场景和每一种 AP的设备规格确定每一种 AP的场强分布包括:
根据需要部署的场景确定一个矩形的网格状拓朴;
通过选择的传播模型计算出所述网格状拓朴中任意两个格子之间的信号 衰减值;
根据所述每一种 AP的设备规格中的功率与所述信号衰减值计算获得所述 每一种 AP到每个格子的场强分布。
4、根据权利要求 2所述的方法,其特征在于,所述根据 WLAN竟争模型、 部署信息中的用户分布及用户需求及所述每一种 AP的场强分布获得所述每一 种 AP的覆盖度包括:
通过调整每一种 AP覆盖的场强上限或下限, 并根据部署信息中的用户分 布及用户需求确定接入所述每一种 AP的终端数量;
根据所述 WLAN竟争模型、 所述接入所述每一种 AP的终端数量、 所述 每一种 AP的干扰范围内的终端数量获得与接入所述每一种 AP的终端产生干 扰的第一终端数量;
根据所述第一终端数量、 所述接入 AP的终端的宽带需求、 场强分布确定 所述每一种 AP的覆盖度。
5、 根据权利要求 4所述的方法, 其特征在于, 所述根据所述第一终端数 量、 所述接入 AP的终端的宽带需求、 场强分布确定所述每一种 AP的覆盖度 包括:
根据所述与接入 AP的终端产生干扰的第一终端数量、 接入 AP的终端的 宽带需求、 场强分布确定所述每一种 AP的覆盖阔值;
根据所述每一种 AP的覆盖阔值和场强分布确定所述每一种 AP的覆盖度。
6、 根据权利要求 5所述的方法, 其特征在于, 所述根据所述与接入 AP 的终端产生干扰的第一终端数量、 接入 AP的终端的宽带需求、 场强分布确定 每一种 AP的覆盖阔值包括:
根据与接入 AP的终端产生干扰的第一终端数量确定竟争开销;
根据所述竟争开销、接入 AP的终端的宽带需求和场强分布确定所述每一 种 AP的覆盖阔值。
7、 根据权利要求 6所述的方法, 其特征在于, 所述根据所述竟争开销、 接入 AP的终端的宽带需求和场强分布确定所述每一种 AP的覆盖阔值包括: 根据竟争开销、 接入 AP的终端的带宽需求和所述 AP到所述接入 AP的 终端所处的格子的场强分布验证所述 AP是否满足接入需求;
满足接入需求时调整场强上限的值,或不满足接入需求时调整场强下限的 值;
将上述步骤进行第一预设循环次数的执行;
在完成所述第一预设循环次数时,将所述调整后的场强上限值作为所述每 一种 AP的覆盖阔值。
8、 根据权利要求 1所述的方法, 其特征在于, 所述将所述每一种 AP的 覆盖度信息和所述每一种 AP的成本信息组成约束关系包括:
通过线性规划描述所述每一种 AP的覆盖度信息与每一种 AP的成本信息 的约束关系, 或通过图论的方式描述所述每一种 AP 的覆盖度信息与每一种 AP的成本信息的约束关系。
9、 根据权利要求 1所述的方法, 其特征在于, 所述方法还包括: 对所述 AP的部署方案进行合理性验证。
10、 根据权利要求 9所述的方法, 其特征在于, 所述对所述 AP的部署方 案进行合理性验证包括:
对所述部署方案中的 AP进行信道分配和功率控制;
为终端选择接入的 AP;
验证所述 AP是否满足接入需求;
输出验证的结果。
11、 根据权利要求 10所述的方法, 其特征在于, 所述验证所述 AP是否 满足接入需求包括: 获得所述选择的 AP的邻居 AP;
获得与接入该 AP的终端产生干扰的第二终端数量;
根据与接入 AP的终端产生干扰的第二终端数量确定竟争开销;
根据所述竟争开销、接入 AP的终端的带宽需求和所述 AP到所述接入 AP 的终端所处的格子的场强分布验证所述 AP是否满足接入需求。
12、 根据权利要求 11所述的方法, 其特征在于, 所述邻居 AP为在所述 选择的 AP的干扰范围内,并与所述选择的 AP工作在相同的信道的 AP,所述 获得与接入该 AP的终端产生干扰的第二终端数量包括:
获得接入到该 AP的所有邻居 AP的终端数量和接入该 AP的终端数量; 将接入到该 AP的所有邻居 AP的终端数量和接入该 AP的终端数量进行 计算, 来获得与接入该 AP的终端产生干扰的第二终端数量。
13、 根据权利要求 10所述的方法, 其特征在于, 所述验证所述 AP是否 满足接入需求还包括:
当验证所述 AP满足接入需求时, 将当前的 AP的部署方案进行保存; 确定 WLAN竟争模型中的竟争指数是否为零;
若竟争指数的值不为零时, 减小当前的竟争指数的值, 并确定是否完成第 二预设循环次数;
或若竟争指数的值为零时, 输出保存的当前的 AP的部署方案。
14、 根据权利要求 10所述的方法, 其特征在于, 所述验证所述 AP是否 满足接入需求还包括:
当验证所述 AP不满足接入需求时, 增加当前的竟争指数的值;
确定上述步骤是否完成第二预设循环次数的执行。
15、 根据权利要求 13或 14所述的方法, 其特征在于, 所述确定是否完成 第二预设循环次数包括:
若完成第二预设循环次数时, 输出保存的 AP的部署方案;
若没有完成第二预设循环次数时, 再次执行所述根据 WLAN竟争模型、 部署信息中的用户分布及用户需求及所述每一种 AP 的场强分布获得每一种 AP的覆盖度的步骤。
16、 一种 WLAN AP部署方案的获得与验证系统, 其特征在于, 所述系统 包括:
获得 WLAN AP部署方案的装置, 用于根据 WLAN竟争模型和获得的部 署信息获得每一种 AP的覆盖度信息, 将所述每一种 AP的覆盖度信息和所述 每一种 AP的成本信息组成约束关系, 计算获得 AP的部署方案;
验证装置, 用于对所述 AP的部署方案进行接入需求的合理性验证。
17、 根据权利要求 16所述的系统, 其特征在于, 所述部署信息包括场景、 AP的设备规格、 用户分布及用户需求, 所述获得 WLAN AP部署方案的装置 进一步用于根据所述部署信息中的场景和每一种 AP的设备规格确定所述每一 种 AP的场强分布, 据 WLAN竟争模型、 所述部署信息中的用户分布及用户 需求及所述每一种 AP的场强分布获得所述每一种 AP的覆盖度。
18、 根据权利要求 17所述的系统, 其特征在于, 所述 AP的部署方案包 括 AP的位置、 带宽需求、 覆盖范围、 到每个格子的场强分布、 成本和 WLAN 竟争模型, 所述验证装置进一步用于当验证满足接入需求时, 保存当前的 AP 的部署方案, 并确定所述 WLAN 竟争模型中的竟争指数的值。
19、 根据权利要求 18所述的系统, 其特征在于, 所述验证装置进一步用 于当所述竟争指数的值不为 0或当验证不满足接入需求时,调整当前的竟争指 数的值, 并确定是否完成所述第一预设循环次数。
20、 根据权利要求 19所述的系统, 其特征在于, 所述验证装置进一步用 于当所述竟争指数的值为 0或完成所述第一预设循环次数时,输出所述保存的 当前的 AP的部署方案。
21、 根据权利要求 19所述的系统, 其特征在于, 所述验证装置进一步用 于当没有完成所述第一预设循环次数时,输出调整后的竟争指数的值至所述装 置, 以使所述装置重新调整 AP的部署方案。
PCT/CN2010/078147 2009-10-27 2010-10-27 一种无线局域网接入点部署方案的获得方法及系统 WO2011050721A1 (zh)

Priority Applications (3)

Application Number Priority Date Filing Date Title
EP10826084.5A EP2434795B1 (en) 2009-10-27 2010-10-27 Method and system for obtaining wireless local area network access point deployment plan
BR112012010029A BR112012010029B8 (pt) 2009-10-27 2010-10-27 método para obter um esquema de implementação de pontos de acesso a rede de área local sem fio
US13/339,259 US8705405B2 (en) 2009-10-27 2011-12-28 Method and system for obtaining a deployment scheme of wireless local area network access points

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN200910110374.8 2009-10-27
CN2009101103748A CN102056180B (zh) 2009-10-27 2009-10-27 一种无线局域网接入点部署方案的获得方法及系统

Related Child Applications (1)

Application Number Title Priority Date Filing Date
US13/339,259 Continuation US8705405B2 (en) 2009-10-27 2011-12-28 Method and system for obtaining a deployment scheme of wireless local area network access points

Publications (1)

Publication Number Publication Date
WO2011050721A1 true WO2011050721A1 (zh) 2011-05-05

Family

ID=43921337

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2010/078147 WO2011050721A1 (zh) 2009-10-27 2010-10-27 一种无线局域网接入点部署方案的获得方法及系统

Country Status (5)

Country Link
US (1) US8705405B2 (zh)
EP (1) EP2434795B1 (zh)
CN (1) CN102056180B (zh)
BR (1) BR112012010029B8 (zh)
WO (1) WO2011050721A1 (zh)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105744536A (zh) * 2014-12-09 2016-07-06 富士通株式会社 无线网络部署方法和装置
CN112218302A (zh) * 2020-08-31 2021-01-12 全讯汇聚网络科技(北京)有限公司 基于云平台的无线网络管理方法及装置
US11445379B2 (en) * 2020-09-29 2022-09-13 At&T Intellectual Property I, L.P. Facilitating heterogeneous network analysis and resource planning for advanced networks

Families Citing this family (29)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8953488B2 (en) * 2010-12-13 2015-02-10 At&T Intellectual Property I, L.P. Method and apparatus for optimal interconnection of telecommunication nodes via a reliable microwave clustering
WO2013075330A1 (zh) * 2011-11-25 2013-05-30 华为技术有限公司 Wi-Fi热点部署规划阶段的精确选点方法及模型
CN102497667B (zh) * 2011-12-20 2014-03-05 中国电信股份有限公司 WiFi应用聚焦区域的定位方法、信号采集终端及系统
CN102547758A (zh) * 2011-12-21 2012-07-04 上海工程技术大学 一种wlan接入点部署方法
CN102572841A (zh) * 2011-12-26 2012-07-11 华中科技大学 Wlan室内覆盖规划方法
US20130286888A1 (en) * 2012-04-30 2013-10-31 Fabiel Zuniga Gallegos Generating trial wireless access point (wap) configurations
WO2013165337A1 (en) * 2012-04-30 2013-11-07 Hewlett-Packard Development Company, L.P. Determining a primary wireless access point (wap) object from coverage predictions for trial wap configurations
CN103634807B (zh) * 2012-08-24 2017-03-22 中国移动通信集团四川有限公司 Wifi数据热点小区数据监测方法、wlan部署排序方法及装置
CN102932803B (zh) * 2012-10-22 2015-04-01 华为技术有限公司 自动布放无线接入装置的方法和设备
CN102984712A (zh) * 2012-11-02 2013-03-20 王攀 一种基于移动互联网业务感知的wlan精确建站方法
WO2014073706A1 (ja) 2012-11-12 2014-05-15 日本電信電話株式会社 無線通信装置、無線通信システム及び無線通信方法
CN103188694B (zh) * 2013-03-28 2016-06-22 浙江金之路信息科技有限公司 一种提升wlan分流效果和规划准确率的方法及系统
CN104427516B (zh) * 2013-08-22 2018-02-16 武汉飞沃科技有限公司 一种无线局域网络ap布设规划的方法
JP5901586B2 (ja) * 2013-08-27 2016-04-13 アラクサラネットワークス株式会社 中継装置、通信システム、及びノードの設定情報の取得方法
CN104902491B (zh) * 2014-03-06 2018-11-13 精英电脑(苏州工业园区)有限公司 决定无线存取点位置方法、无线存取点及无线存取点组合
CN104053215B (zh) * 2014-06-11 2018-04-17 西安中兴新软件有限责任公司 一种选择接入点的最佳位置的方法及装置
CN104703193B (zh) * 2015-03-25 2018-11-09 新华三技术有限公司 网格网络部署方法及装置
JP6126649B2 (ja) * 2015-07-02 2017-05-10 ヤフー株式会社 サーバ、分布情報作成方法、およびプログラム
CN106488547B (zh) * 2015-08-27 2020-02-14 华为技术有限公司 一种sta的认证数据管理方法、装置及设备
CN105933243B (zh) * 2016-04-15 2019-03-29 西南交通大学 一种无线多跳网络缓冲队列的部署方法
CN107786986B (zh) * 2016-08-30 2020-02-11 新华三技术有限公司 Ap放置方法及装置
WO2018200604A1 (en) * 2017-04-25 2018-11-01 Center For Medical Interoperability Inc. Improved wireless network system with multiple access point layers
JP7144186B2 (ja) * 2018-05-13 2022-09-29 Necネッツエスアイ株式会社 置局場所候補選定システム
CN108810915B (zh) * 2018-05-29 2022-01-25 努比亚技术有限公司 WiFi热点流量控制方法、装置及计算机可读存储介质
EP3939375A4 (en) * 2019-03-12 2022-12-14 Omnifi Inc. FLEXIBLE AND EXTREMELY LOW COST WIRELESS DEPLOYMENT SYSTEM AND METHOD
CN110620625A (zh) * 2019-09-20 2019-12-27 深圳小鱼儿科技有限公司 一种高密度wifi系统的布置方法
US11290481B2 (en) 2020-07-09 2022-03-29 Bank Of America Corporation Security threat detection by converting scripts using validation graphs
CN115988516A (zh) * 2023-02-17 2023-04-18 杭州海兴电力科技股份有限公司 一种无线Mesh网络及接入点规划方法
CN117077235B (zh) * 2023-10-18 2024-03-08 北京林业大学 近自然森林群落设计和优化方法、装置和电子设备

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1691624A (zh) * 2004-04-28 2005-11-02 阿瓦雅技术公司 用于为任意位置的接入点生成信号强度模型的方法和设备
CN101310488A (zh) * 2005-12-23 2008-11-19 英特尔公司 无线网状网络中的路由
CN101442754A (zh) * 2008-12-26 2009-05-27 阿德利亚科技(北京)有限责任公司 一种城区环境中无线网状网的部署方法及装置

Family Cites Families (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6317599B1 (en) 1999-05-26 2001-11-13 Wireless Valley Communications, Inc. Method and system for automated optimization of antenna positioning in 3-D
US7085697B1 (en) 2000-08-04 2006-08-01 Motorola, Inc. Method and system for designing or deploying a communications network which considers component attributes
US6625454B1 (en) * 2000-08-04 2003-09-23 Wireless Valley Communications, Inc. Method and system for designing or deploying a communications network which considers frequency dependent effects
US6973622B1 (en) 2000-09-25 2005-12-06 Wireless Valley Communications, Inc. System and method for design, tracking, measurement, prediction and optimization of data communication networks
US7295960B2 (en) * 2003-01-22 2007-11-13 Wireless Valley Communications, Inc. System and method for automated placement or configuration of equipment for obtaining desired network performance objectives
US20050059405A1 (en) 2003-09-17 2005-03-17 Trapeze Networks, Inc. Simulation driven wireless LAN planning
US20050073980A1 (en) * 2003-09-17 2005-04-07 Trapeze Networks, Inc. Wireless LAN management
US7567822B2 (en) * 2005-10-11 2009-07-28 Cisco Technology, Inc. Automated configuration of RF WLANs via selected sensors
US20090043666A1 (en) 2007-08-10 2009-02-12 Symbol Technologies, Inc. Generation of wireless network planning reports with sku and pricing data

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1691624A (zh) * 2004-04-28 2005-11-02 阿瓦雅技术公司 用于为任意位置的接入点生成信号强度模型的方法和设备
CN101310488A (zh) * 2005-12-23 2008-11-19 英特尔公司 无线网状网络中的路由
CN101442754A (zh) * 2008-12-26 2009-05-27 阿德利亚科技(北京)有限责任公司 一种城区环境中无线网状网的部署方法及装置

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
See also references of EP2434795A4 *

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105744536A (zh) * 2014-12-09 2016-07-06 富士通株式会社 无线网络部署方法和装置
CN112218302A (zh) * 2020-08-31 2021-01-12 全讯汇聚网络科技(北京)有限公司 基于云平台的无线网络管理方法及装置
US11445379B2 (en) * 2020-09-29 2022-09-13 At&T Intellectual Property I, L.P. Facilitating heterogeneous network analysis and resource planning for advanced networks

Also Published As

Publication number Publication date
EP2434795A1 (en) 2012-03-28
US20120099481A1 (en) 2012-04-26
BR112012010029B1 (pt) 2021-04-13
EP2434795A4 (en) 2012-04-18
BR112012010029B8 (pt) 2021-07-20
US8705405B2 (en) 2014-04-22
EP2434795B1 (en) 2013-08-07
CN102056180B (zh) 2013-12-18
BR112012010029A2 (pt) 2020-08-18
CN102056180A (zh) 2011-05-11

Similar Documents

Publication Publication Date Title
WO2011050721A1 (zh) 一种无线局域网接入点部署方案的获得方法及系统
Yang et al. Offloading time optimization via Markov decision process in mobile-edge computing
Yi et al. Cooperative communication-aware spectrum leasing in cognitive radio networks
US7826366B2 (en) Joint channel assignment and routing in wireless networks
CN101873674B (zh) 移动装置、基站、后端网络装置及用于移动装置的方法
JP2007037135A (ja) 無線自己組織ネットワークにおけるジョイントパワーとレート制御方法と装置
CN111034235A (zh) 小波长无线网络中的信标
CN109699033B (zh) 面向成本和负载均衡的LoRa电力物联网基站部署方法及装置
JP2007300620A (ja) 異種無線ネットワークにおける分散型無線資源管理システム及び方法
Zhang et al. Cost-and energy-aware multi-flow mobile data offloading using Markov decision process
US20150131481A1 (en) Node discovery in a communication network
WO2023197671A1 (zh) 多跳组网方法、装置、设备、介质及程序产品
Galinina et al. Assessing system-level energy efficiency of mmwave-based wearable networks
JP6689388B2 (ja) セルラー移動体無線網における端末機器間の通信方法及びその関連システム
JP2012175592A (ja) 制御装置
Rodenas-Herraiz et al. On the improvement of wireless mesh sensor network performance under hidden terminal problems
Xie et al. Effective collaboration to maximize throughput based on multiuser cooperative mobility in social-physical ad hoc networks
CN103648105A (zh) 一种无线局域网接入点部署方案的获得方法及系统
Zhao et al. Dynamic and non-centric networking approach using virtual gateway platforms for low power wide area systems
US20090003284A1 (en) Call Admission Control in an Ad Hoc Network
Lin et al. Joint optimization of offloading and resource allocation for sdn-enabled iov
EP2908597A1 (en) Wireless communication network node and method
Coll-Perales et al. Next generation opportunistic networking in beyond 5G networks
WO2015110910A1 (en) Method and system for distributed channel probing and sequential access
Kosek-Szott et al. A new busy signal-based MAC protocol supporting QoS for ad-hoc networks with hidden nodes

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 10826084

Country of ref document: EP

Kind code of ref document: A1

WWE Wipo information: entry into national phase

Ref document number: 2010826084

Country of ref document: EP

WWE Wipo information: entry into national phase

Ref document number: 9576/CHENP/2011

Country of ref document: IN

NENP Non-entry into the national phase

Ref country code: DE

REG Reference to national code

Ref country code: BR

Ref legal event code: B01A

Ref document number: 112012010029

Country of ref document: BR

ENP Entry into the national phase

Ref document number: 112012010029

Country of ref document: BR

Kind code of ref document: A2

Effective date: 20120427