WO2022052489A1 - Procédé et appareil de déploiement de points d'accès sans fil, et support de stockage - Google Patents

Procédé et appareil de déploiement de points d'accès sans fil, et support de stockage Download PDF

Info

Publication number
WO2022052489A1
WO2022052489A1 PCT/CN2021/091758 CN2021091758W WO2022052489A1 WO 2022052489 A1 WO2022052489 A1 WO 2022052489A1 CN 2021091758 W CN2021091758 W CN 2021091758W WO 2022052489 A1 WO2022052489 A1 WO 2022052489A1
Authority
WO
WIPO (PCT)
Prior art keywords
wireless access
access point
access points
target area
deployment
Prior art date
Application number
PCT/CN2021/091758
Other languages
English (en)
Chinese (zh)
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 三维通信股份有限公司
Publication of WO2022052489A1 publication Critical patent/WO2022052489A1/fr

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W16/00—Network planning, e.g. coverage or traffic planning tools; Network deployment, e.g. resource partitioning or cells structures
    • H04W16/18—Network planning tools
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W16/00—Network planning, e.g. coverage or traffic planning tools; Network deployment, e.g. resource partitioning or cells structures
    • H04W16/22—Traffic simulation tools or models
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D30/00—Reducing energy consumption in communication networks
    • Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks

Definitions

  • the present invention relates to the field of communications, and in particular, to a wireless access point deployment method and device, and a storage medium.
  • the embodiments of the present invention provide a wireless access point deployment method and device, and a storage medium, so as to meet more user needs, improve service quality, and reduce operating costs while ensuring lower energy consumption and operating costs .
  • a method for deploying wireless access points including: estimating a first number of wireless access points to be deployed in a target area; deploying the first number of wireless access points to maximize the average energy efficiency and/or total transmit power of the first number of wireless access points within the target area when a preset deployment policy is met minimum.
  • a wireless access point deployment device including: an estimation unit, configured to estimate a first number of wireless access points to be deployed in a target area; a deployment unit, It is set to deploy the first number of wireless access points in the target area based on the multi-target particle swarm algorithm, so that when the preset deployment strategy is satisfied, the first number of wireless access points in the target area are The point of entry has the highest average energy efficiency and/or the lowest total transmit power.
  • a computer-readable storage medium is also provided, where a computer program is stored in the computer-readable storage medium, wherein the computer program is configured to execute the above-mentioned wireless access when running. Access point deployment method.
  • an electronic device including a memory, a processor, and a computer program stored in the memory and running on the processor, wherein the processor executes the above-mentioned computer program through the computer program Wireless access point deployment method.
  • the first number of wireless access points to be deployed in the target area is estimated; based on the multi-target particle swarm algorithm, the first number of wireless access points are deployed in the target area, so that the The first number of wireless access points in the target area have a maximum average energy efficiency and/or a minimum total transmit power when a preset deployment policy is satisfied.
  • a preset deployment strategy can be satisfied during deployment, so as to maximize the average energy efficiency and/or minimize the total transmit power of multiple wireless access points, thereby ensuring lower energy consumption and lower operating costs. meet more user needs, improve service quality, and reduce operating costs.
  • the wireless access point capacity limit should be designed based on the number of people distributed in the current area during deployment, and it is required that the total number of users served by all wireless access points should be greater than or equal to the total number of people in the current area.
  • the maximum transmit power of the wireless access point is limited, and it is stipulated that the transmit power of each wireless access point cannot be higher than this threshold.
  • the present application adopts the multi-objective particle swarm algorithm, which has fast convergence speed and high efficiency, and has many measures to avoid falling into local optimum, and can quickly reach the maximum average energy efficiency and/or total transmit power of wireless access points minimal purpose.
  • FIG. 1 is a schematic diagram of an application scenario of wireless access point deployment provided by an embodiment of the present application
  • FIG. 2A is a schematic diagram of a flow of a wireless access point deployment method provided by an embodiment of the present application
  • 2B is a schematic diagram of establishing a target area-user model provided by an embodiment of the present application.
  • 3A is a schematic flowchart of a multi-target deployment algorithm provided by an embodiment of the present application.
  • 3B is a schematic flowchart of judging whether a preset deployment strategy is satisfied according to an embodiment of the present application
  • FIG. 4 is a schematic structural diagram of an optional wireless access point deployment apparatus according to an embodiment of the present invention.
  • FIG. 5 is a schematic structural diagram of an optional electronic device according to an embodiment of the present invention.
  • PSO particle swarm optimization algorithm
  • PSO bird flock foraging algorithm
  • J. Kennedy and RCEberhart Kernel- EA
  • the PSO algorithm is a kind of evolutionary algorithm. Similar to the simulated annealing algorithm, it also starts from a random solution and finds the optimal solution through iteration. It also evaluates the quality of the solution through fitness, but it is simpler than the genetic algorithm rules. It does not have the "Crossover” (Crossover) and "Mutation” (Mutation) operations of the genetic algorithm, it finds the global optimum by following the current searched optimum value.
  • This algorithm has attracted the attention of academia because of its advantages of easy implementation, high precision and fast convergence, and it has shown its superiority in solving practical problems.
  • Wireless Access Point is the HUB in the traditional wired network, and it is also the most commonly used device when building a small wireless local area network.
  • AP is equivalent to a bridge connecting wired network and wireless network. Its main function is to connect various wireless network clients together, and then connect the wireless network to Ethernet.
  • FIG. 1 is a schematic diagram of an application scenario of wireless access point deployment provided by an embodiment of the present application. As shown in FIG. 1 , it includes: multiple wireless access points AP101 and multiple users 102 .
  • the wireless access point AP101 can be a HUB in a traditional wired network, and is also the most commonly used device when building a small wireless local area network.
  • AP is equivalent to a bridge connecting wired network and wireless network. Its main function is to connect various wireless network clients together, and then connect the wireless network to Ethernet. It is also a wireless switch in a wireless network, and it is the access point for mobile terminal users to enter the wired network.
  • the indoor coverage of an AP is generally 30m to 100m.
  • the AP products of many manufacturers can be interconnected to increase the WLAN coverage area. It is also because the coverage of each AP has certain limitations. Just as mobile phones can roam between base stations, wireless LAN clients can also roam between APs. Therefore, in order to realize wireless Internet access in a large range, it is necessary to deploy multiple APs to ensure that multiple terminal devices in a large range can access the Ethernet through the multiple APs.
  • the user 102 is set to refer to a terminal device that can access the Internet through an AP, and the terminal device can be an input and output device, a device that inputs programs and data to a computer or receives a computer output processing result via a communication facility.
  • Terminal equipment is usually set in a convenient place where communication facilities can be used to connect with a remote computer to work. It is mainly composed of a communication interface control device and a dedicated or selected input and output device. For example: computers, notebooks, smart phones, only watches, smart bracelets, Bluetooth speakers and other terminal devices that can access the Internet through AP.
  • the application scenario of wireless access point deployment in FIG. 1 is only an exemplary implementation in the embodiment of the present invention, and the application scenario of wireless access point deployment in the embodiment of the present invention includes but It is not limited to the above application scenarios of wireless access point deployment.
  • FIG. 2A is a schematic diagram of a flow of a method for deploying a wireless access point provided by an embodiment of the present application. It can be set up as the system in FIG. 1 described above, which will be described below in conjunction with FIG. 2A to deploy the device from one side of the wireless access point.
  • the method may include the following steps S1-S3.
  • Step S1 Establish a target area-user model.
  • the user distribution law corresponding to the target area is obtained, and the target area-user model is established.
  • the number of users in different areas is different, and thus the user density in different areas is different, and the number of terminals held by corresponding users is also different. Therefore, before deploying the wireless access point, it is necessary to obtain the user distribution rule corresponding to the target area, so as to deploy the wireless access point.
  • FIG. 2B is a schematic diagram of establishing a target area-user model provided by an embodiment of the present application.
  • multiple APs are deployed in the target area to ensure that terminal devices held by multiple users in the target area can access the Internet through the deployed APs.
  • a target area with an area of AT may be divided into N subarea sub-areas, and the sub-areas may be divided according to actual conditions.
  • the area of each area is A(k)
  • the user density of each sub-area is A(k).
  • Step S2 estimating the first number of wireless access points to be deployed in the target area.
  • the target area-user model After establishing the target area-user model, it is necessary to estimate the number of wireless access points to be deployed in the target area (ie, the first number), so as to reasonably deploy multiple wireless access points in the target area . For example, given the range of association between access points and users (the range of connections from users to access points), estimate the maximum number of users served by a single access point.
  • the estimating the first number of wireless access points waiting to be deployed in the target area includes: acquiring a second number corresponding to each wireless access point, where the second number is the maximum number of terminal devices allowed to be accessed by the wireless access point; obtain the total number of the terminal devices in the target area; estimate the first number according to the second number and the total number.
  • the method for estimating the maximum number of services of a single wireless access point can be a deployment method based on a random geometric model, which can estimate the maximum service rate that a single access point can provide according to the distance from the user to the access point, and Based on this rate, estimate the maximum number of users that can be served.
  • the estimating the first number of wireless access points waiting to be deployed in the target area includes: acquiring the coverage of each wireless access point, where the coverage is the wireless access point The access point allows the terminal device to access the distance range; the area range of the target area is obtained, and the first number is estimated according to the coverage area of each wireless access point and the area range.
  • the estimating the number of wireless access points waiting to be deployed in the target area includes: acquiring a third number corresponding to each wireless access point, where the third number is the The maximum number of wireless access points allowed to access the terminal devices; obtain the total number of terminal devices in the target area; obtain the coverage of each wireless access point, where the coverage is the wireless access point The distance range that terminal equipment is allowed to access; according to the third number, the total number and the coverage of each wireless access point, estimate the number of wireless access points waiting to be deployed in the target area.
  • the method of joint deployment of coverage area and number of serving persons can be adopted, wherein, the coverage area estimation is to divide the coverage area of the whole AP by the AP coverage of a single access point.
  • the service user estimate is the number of users active in the area divided by the maximum number of service users for a single access point AP.
  • the method of joint deployment of coverage and service population means that the final estimated number is the maximum of the two estimation methods.
  • Step S2 of the present invention is implemented: first, a random geometric model can be used to model a single access point, and the total throughput of a single access point can be calculated, and the calculation formula is as follows:
  • Formulas (1), (2) and (3) represent the wireless access point AP-user signal-to-noise ratio, where P b is the transmit power of the wireless access point AP, g i , g j are the wireless access Rayleigh fading factor for AP i and AP j. r is the distance from the user to the wireless access point serving it, and Rj is the distance from the interfering wireless access point to the user.
  • Formula (2) is actually the signal gain obtained by the user
  • formula (3) is the interference obtained by the user.
  • Equation (4) represents the total throughput that the access point can provide, which is modeled using a random geometric model as follows:
  • R th is the coverage of a single AP.
  • Formula (7) is the number of wireless access points estimated according to the number of people served, N is the number of people in the entire area, and N user is the maximum number of users that a single wireless access point can serve.
  • the calculation formula is as follows:
  • ⁇ th is the minimum throughput threshold that a user can receive.
  • the final estimated number of wireless access points deployed is:
  • Step S3 based on the multi-target particle swarm algorithm, deploy a first number of wireless access points in the target area.
  • the first number of wireless access points are deployed in the target area, so that the first number of wireless access points in the target area meet the preset deployment strategy
  • the access point has the highest average energy efficiency and/or the lowest total transmit power.
  • the deploying the first number of wireless access points in the target area based on the multi-target particle swarm algorithm includes: initializing the location variables of each wireless access point and speed variable, and determine the objective function corresponding to each wireless access point; based on the multi-objective particle swarm algorithm, iteratively update the position variable and speed variable of each wireless access point, so that the The first quantity of wireless access points satisfies the preset deployment policy; the first quantity of wireless access points is deployed in the target area according to the updated position variable and the updated speed variable.
  • the preset deployment strategy includes one or more of the following strategies: the total number of users served by the strategy for the first number of wireless access points is greater than the total number of users in the target area ; the strategy is that the total number of terminal devices covered by the first number of wireless access points is greater than or equal to a first preset threshold, and the first preset threshold corresponds to the number of all terminal devices in the target area; The strategy is that the transmission power of each wireless access point in the first number of wireless access points is less than the maximum preset transmission threshold.
  • the capacity limit should be designed based on the number of people distributed in the current area during deployment, and it is required that the total number of users served by all access points should be greater than or equal to the total number of people in the current area.
  • the present invention considers that the coverage requirement is met.
  • the present invention limits the maximum transmit power of the access point, and stipulates that the transmit power of each access point cannot be higher than the threshold.
  • FIG. 3A is a schematic flowchart of a multi-target deployment algorithm provided by an embodiment of the present application. It should be noted that the particles in the multi-target deployment algorithm mentioned in the embodiments of the present application and the accompanying drawings are wireless access points. As shown in FIG. 3A , based on the multi-target particle swarm algorithm, deploying the first number of wireless access points in the target area may include the following steps:
  • Step S31 Determine the number of particle populations and initialize the position variable and particle velocity variable of each wireless access point according to the pre-deployed number of wireless access points. For example: determine the particle population number L and initialize the position variable W (l) and particle velocity variable V (l) of each AP according to the estimated number of pre-deployed access points (the first number) .
  • x and y are the AP position coordinates
  • p represents the emission power
  • l is the particle swarm to which it belongs.
  • Step S32 Calculate the objective function (overall power and user average energy efficiency) corresponding to each wireless access point, and put some of these wireless access points into an external set. (It can be random or according to preset rules).
  • Step S33 Determine the optimal solution corresponding to each wireless access point, which is called the local optimal solution W( l,local ).
  • Step S34 Divide the target area into many grids, and determine the coordinates of the grid where the target area is located according to the coordinates corresponding to the wireless access point.
  • Step S35 Define an adaptation value for a grid containing at least one wireless access point AP in the external set, select a grid based on the roulette method, and randomly select a wireless access point AP in the external set as the grid.
  • the global optimal solution W global
  • Step S36 Update the position variables and speed variables of all wireless access points. Among them, the formula is as follows:
  • Step S37 Recalculate the objective function value, and update the local optimal solution of the wireless access point.
  • the outer set is updated using the adaptive mesh method.
  • Step S38 Determine whether the wireless access point satisfies the preset deployment policy restrictions, and if not, jump back to step S36 again until the conditions are satisfied.
  • FIG. 3B is a schematic flowchart of judging whether a preset deployment strategy is satisfied according to an embodiment of the present application.
  • step S381 after initializing the variables, determine whether the current deployment meets the capacity limitation requirements, if not, perform location update and power adjustment on the access point and re-determine the capacity limitation, if the requirements are met, proceed to step S382, and do not If satisfied, repeat the above steps.
  • Step S382 Determine whether the current deployment satisfies the coverage requirements, if not, perform location update and power adjustment on the access point and perform coverage limitation judgment again, if the requirements are satisfied, perform step S383, otherwise, repeat the above steps. Determine whether the current deployment meets the requirements of the transmit power threshold. If not, perform location update and power adjustment on the access point and re-determine the transmit power threshold. If the requirements are met, the deployment is completed. If not, repeat the above steps.
  • the conditions for judging whether to preset the deployment strategy can be processed according to the following formula: whether
  • Formula (14) indicates that the serviceable user capacity when the access point is deployed is greater than the number of users existing in the current area, where ⁇ m,k represents the percentage of the current access point coverage area in the entire area, ⁇ represents the adjustment factor,
  • the present invention takes 1.
  • ⁇ n represents the number of users actually served by the access point.
  • Equation (17) indicates that the transmit power of each access point cannot exceed a defined threshold P threshold .
  • Step S4 Based on the greedy algorithm, cancel the deployment of the target wireless access point in the first number of wireless access points.
  • the target wireless access point does not change the first number of wireless access points
  • the total capacity of the access points, the total coverage of the first number of wireless access points, and/or the transmit power of the first number of wireless access points are all access points that do not affect the capacity, coverage and transmission power limitations, ie. After the access point is eliminated, the above formulas (14), (15) and (17) are all established.
  • the average energy efficiency of multiple wireless access points can be maximized, that is, the energy consumption is small, and the total transmission power is minimized, which can satisfy more users while ensuring low energy consumption and operation cost. demand, improve service quality and reduce operating costs.
  • FIG. 4 is a schematic diagram of an optional wireless access point deployment apparatus according to an embodiment of the present invention. Schematic. As shown in Figure 4, the device includes:
  • Estimating unit 401 configured to estimate the first number of wireless access points to be deployed in the target area
  • the deployment unit 402 is configured to deploy the first number of wireless access points in the target area based on the multi-target particle swarm algorithm, so that the first number of wireless access points in the target area is satisfied when the preset deployment strategy is satisfied.
  • the average energy efficiency of each wireless access point is maximum and/or the total transmit power is minimum.
  • first estimate the first number of wireless access points to be deployed in the target area; based on the multi-target particle swarm algorithm, deploy the first number of wireless access points in the target area , so as to maximize the average energy efficiency and/or minimize the total transmit power of the first number of wireless access points in the target area when a preset deployment strategy is met.
  • a preset deployment strategy can be satisfied during deployment, so as to maximize the average energy efficiency and/or minimize the total transmit power of multiple wireless access points, thereby ensuring lower energy consumption and lower operating costs. meet more user needs, improve service quality, and reduce operating costs.
  • the wireless access point capacity limit should be designed based on the number of people distributed in the current area during deployment, and it is required that the total number of users served by all wireless access points should be greater than or equal to the total number of people in the current area.
  • the maximum transmit power of the wireless access point is limited, and it is stipulated that the transmit power of each wireless access point cannot be higher than this threshold.
  • the present application adopts the multi-objective particle swarm algorithm, which has fast convergence speed and high efficiency, and has many measures to avoid falling into local optimum, and can quickly reach the maximum average energy efficiency and/or total transmit power of wireless access points minimal purpose.
  • the estimating unit 401 is specifically configured to: obtain a second quantity corresponding to each wireless access point, where the second quantity is the access point allowed by the wireless access point the maximum number of terminal devices; obtain the total number of the terminal devices in the target area; estimate the first number according to the second number and the total number.
  • the estimating unit 401 is specifically configured to: acquire the coverage of each wireless access point, where the coverage is that the wireless access point allows the terminal device to access The distance range of the target area is obtained; the area range of the target area is obtained, and the first number is estimated according to the coverage area of each wireless access point and the area range.
  • the estimating unit 401 is specifically configured to: obtain a third quantity corresponding to each wireless access point, where the third quantity is the access point allowed by the wireless access point. obtaining the maximum number of the terminal equipment; obtaining the total number of the terminal equipment in the target area; obtaining the coverage of each wireless access point, the coverage being the distance range that the wireless access point allows the terminal equipment to access; According to the third number, the total number, and the coverage of each wireless access point, the number of wireless access points waiting to be deployed in the target area is estimated.
  • the deployment unit 402 is specifically set to: initialize the position variable and speed variable of each wireless access point, and determine the objective function corresponding to each wireless access point ; Based on the multi-objective particle swarm algorithm, iteratively update the position variable and speed variable of each wireless access point, so that the first number of wireless access points meet the preset deployment strategy; According to the updated The location variable and the updated velocity variable are deployed in the target area with the first number of wireless access points.
  • the preset deployment strategy includes one or more of the following strategies: the total number of users served by the strategy for the first number of wireless access points is greater than the total number of users in the target area ; the strategy is that the total number of terminal devices covered by the first number of wireless access points is greater than or equal to a first preset threshold, and the first preset threshold corresponds to the number of all terminal devices in the target area; The strategy is that the transmission power of each wireless access point in the first number of wireless access points is less than the maximum preset transmission threshold.
  • the apparatus further includes: a canceling unit 403, configured to, based on the multi-target particle swarm algorithm, cancel the Deployment of target wireless access points in the first number of wireless access points, the target wireless access point is not to change the total capacity of the first number of wireless access points, the The total coverage of the first number of wireless access points and/or the transmission power of the first number of wireless access points.
  • a canceling unit 403 configured to, based on the multi-target particle swarm algorithm, cancel the Deployment of target wireless access points in the first number of wireless access points, the target wireless access point is not to change the total capacity of the first number of wireless access points, the The total coverage of the first number of wireless access points and/or the transmission power of the first number of wireless access points.
  • a computer-readable storage medium where a computer program is stored in the computer-readable storage medium, wherein the computer program is configured to execute any one of the above when running steps in a method embodiment.
  • the above-mentioned computer-readable storage medium may be configured to store a computer program configured to perform the following steps:
  • a first number of wireless access points to be deployed in the target area is estimated.
  • the multi-target particle swarm algorithm Based on the multi-target particle swarm algorithm, deploy the first number of wireless access points in the target area, so that the first number of wireless access points in the target area meet the preset deployment strategy
  • the average energy efficiency is maximum and/or the total transmitted power is minimum.
  • the storage medium may include: a flash disk, a ROM (Read-Only Memory, read-only memory), a RAM (Random Access Memory, a random access device), a magnetic disk or an optical disk, and the like.
  • FIG. 5 is an optional electronic device according to an embodiment of the present invention.
  • the electronic device includes a memory 502 and a processor 505, the memory 502 stores a computer program, and the processor 504 is configured to execute any one of the above method embodiments through the computer program. A step of.
  • the above-mentioned electronic apparatus may be located in at least one network device among multiple network devices of a computer network.
  • the above-mentioned processor may be configured to execute the following steps through a computer program:
  • Estimate the first number of wireless access points to be deployed in the target area based on the multi-objective particle swarm algorithm, deploy the first number of wireless access points in the target area, so as to meet the preset deployment strategy when the average energy efficiency of the first number of wireless access points in the target area is maximum and/or the total transmit power is minimum.
  • FIG. 5 is for illustration only, and the electronic device may also be a smart phone (such as an Android phone, an iOS phone, etc.), a tablet computer, a handheld computer, and a mobile Internet device (Mobile Internet device). Internet Devices, MID), PAD and other terminal equipment.
  • FIG. 5 does not limit the structure of the above electronic device.
  • the electronic device may also include more or less components than those shown in FIG. 5 (eg, network interfaces, etc.), or have a different configuration than that shown in FIG. 5 .
  • the memory 502 may be configured to store software programs and modules, such as program instructions/modules corresponding to the over-temperature power automatic adjustment method and device in the embodiment of the present invention, and the processor 504 executes the software programs and modules stored in the memory 502 by running the software programs and modules. , so as to perform various functional applications and transmission of original data information, that is, to realize the above-mentioned automatic adjustment method of over-temperature power.
  • Memory 502 may include high-speed random access memory, and may also include non-volatile memory, such as one or more magnetic storage devices, flash memory, or other non-volatile solid-state memory. In some instances, memory 502 may further include memory located remotely from processor 504, and these remote memories may be connected to the terminal through a network.
  • the memory 502 may be specifically, but not limited to, be set to store information such as the target height of the target object.
  • the foregoing memory 502 may include, but is not limited to, the estimation unit 402 , the deployment unit 404 and the elimination unit 403 in the foregoing wireless access point deployment apparatus.
  • it may also include but not be limited to other module units in the above-mentioned over-temperature power automatic adjustment device, which will not be repeated in this example.
  • the above-mentioned transmission device 506 is configured to receive or send data via a network.
  • Specific examples of the above-mentioned networks may include wired networks and wireless networks.
  • the transmission device 506 includes a network adapter (Network Interface Controller, NIC), which can be connected to other network devices and routers through a network cable so as to communicate with the Internet or a local area network.
  • the transmission device 506 is a radio frequency (RF) module, which is configured to communicate with the Internet in a wireless manner.
  • RF radio frequency
  • the above-mentioned electronic device further includes: a connection bus 508 configured to connect various module components in the above-mentioned electronic device.
  • the above-mentioned terminal or server may be a node in a distributed system, wherein the distributed system may be a blockchain system, and the blockchain system may be communicated by the multiple nodes through a network A distributed system formed by formal connections.
  • a peer-to-peer (P2P, Peer To Peer) network can be formed between nodes, and any form of computing equipment, such as servers, terminals and other electronic devices can become a node in the blockchain system by joining the peer-to-peer network.
  • the storage medium may include: a flash disk, a read-only memory (Read-Only Memory, ROM), a random access device (Random Access Memory, RAM), a magnetic disk or an optical disk, and the like.
  • the integrated units in the above-mentioned embodiments are implemented in the form of software functional units and sold or used as independent products, they may be stored in the above-mentioned computer-readable storage medium.
  • the technical solution of the present invention is essentially or the part that contributes to the prior art, or all or part of the technical solution can be embodied in the form of a software product, and the computer software product is stored in a storage medium,
  • Several instructions are included to cause one or more computer devices (which may be personal computers, servers, or network devices, etc.) to perform all or part of the steps of the methods of various embodiments of the present invention.
  • the disclosed client terminal may be implemented in other manners.
  • the device embodiments described above are only illustrative, for example, the division of units is only a logical function division. In actual implementation, there may be other division methods, for example, multiple units or components may be combined or integrated into Another system, or some features can be ignored, or not implemented.
  • the shown or discussed mutual coupling or direct coupling or communication connection may be through some interfaces, indirect coupling or communication connection of units or modules, and may be in electrical or other forms.
  • Units described as separate components may or may not be physically separated, and components shown as units may or may not be physical units, that is, may be located in one place, or may be distributed to multiple network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution in this embodiment.
  • each functional unit in each embodiment of the present invention may be integrated into one processing unit, or each unit may exist physically alone, or two or more units may be integrated into one unit.
  • the above-mentioned integrated units may be implemented in the form of hardware, or may be implemented in the form of software functional units.
  • a wireless access point deployment method, device, and storage medium provided by the embodiments of the present invention have the following beneficial effects: the multi-objective particle swarm algorithm is adopted, which has fast convergence speed and high efficiency, and there are many measures to avoid Falling into a local optimum can quickly achieve the goal of maximizing the average energy efficiency of the wireless access point and/or minimizing the total transmit power.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

Sont divulgués un procédé et un appareil de déploiement de points d'accès sans fil et un support de stockage. Le procédé comprend : l'estimation d'un premier nombre de points d'accès sans fil à déployer dans une zone cible ; et le déploiement du premier nombre de points d'accès sans fil dans la zone cible sur la base d'un algorithme d'optimisation multiobjectif par essaim particulaire, de manière à maximiser l'efficacité énergétique moyenne du premier nombre de points d'accès sans fil dans la zone cible et/ou à minimiser la puissance d'émission totale lorsqu'une politique de déploiement prédéfinie est satisfaite. Lorsqu'une consommation d'énergie relativement faible et des coûts de fonctionnement faibles sont garantis, davantage d'exigences utilisateur sont satisfaites, la qualité de service est améliorée, et les coûts de fonctionnement sont réduits.
PCT/CN2021/091758 2020-09-08 2021-04-30 Procédé et appareil de déploiement de points d'accès sans fil, et support de stockage WO2022052489A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN202010936448.X 2020-09-08
CN202010936448.XA CN112020074B (zh) 2020-09-08 2020-09-08 无线访问接入点部署方法和装置、存储介质

Publications (1)

Publication Number Publication Date
WO2022052489A1 true WO2022052489A1 (fr) 2022-03-17

Family

ID=73521231

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2021/091758 WO2022052489A1 (fr) 2020-09-08 2021-04-30 Procédé et appareil de déploiement de points d'accès sans fil, et support de stockage

Country Status (2)

Country Link
CN (1) CN112020074B (fr)
WO (1) WO2022052489A1 (fr)

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112020074B (zh) * 2020-09-08 2023-11-17 三维通信股份有限公司 无线访问接入点部署方法和装置、存储介质
CN114143809B (zh) * 2021-11-18 2024-09-20 锐捷网络股份有限公司 一种无线网络优化方法、装置、计算机设备及存储介质
CN114697976B (zh) * 2022-02-25 2023-12-22 成都市联洲国际技术有限公司 确定室内网路分布的方法、装置、设备及存储介质

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107493578A (zh) * 2016-06-13 2017-12-19 富士通株式会社 无线网络部署方法和装置
JP2017225119A (ja) * 2016-06-13 2017-12-21 富士通株式会社 無線ネットワークの配備方法及び装置
CN107635239A (zh) * 2017-09-25 2018-01-26 北京邮电大学 无人机基站部署方法、装置、电子设备及可读存储介质
CN109275094A (zh) * 2018-11-02 2019-01-25 北京邮电大学 一种高能效无人机覆盖点连续覆盖方法和装置
CN111510932A (zh) * 2020-03-21 2020-08-07 杭州迪普科技股份有限公司 无线接入点部署方法、装置、电子设备及计算机可读介质
CN112020074A (zh) * 2020-09-08 2020-12-01 三维通信股份有限公司 无线访问接入点部署方法和装置、存储介质

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2018043600A1 (fr) * 2016-09-02 2018-03-08 日本電信電話株式会社 Système de communication sans fil, et procédé de communication sans fil
CN110798851B (zh) * 2019-10-25 2021-02-02 西安交通大学 无线异构网络的能量效率和负载均衡的联合优化方法

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107493578A (zh) * 2016-06-13 2017-12-19 富士通株式会社 无线网络部署方法和装置
JP2017225119A (ja) * 2016-06-13 2017-12-21 富士通株式会社 無線ネットワークの配備方法及び装置
CN107635239A (zh) * 2017-09-25 2018-01-26 北京邮电大学 无人机基站部署方法、装置、电子设备及可读存储介质
CN109275094A (zh) * 2018-11-02 2019-01-25 北京邮电大学 一种高能效无人机覆盖点连续覆盖方法和装置
CN111510932A (zh) * 2020-03-21 2020-08-07 杭州迪普科技股份有限公司 无线接入点部署方法、装置、电子设备及计算机可读介质
CN112020074A (zh) * 2020-09-08 2020-12-01 三维通信股份有限公司 无线访问接入点部署方法和装置、存储介质

Also Published As

Publication number Publication date
CN112020074A (zh) 2020-12-01
CN112020074B (zh) 2023-11-17

Similar Documents

Publication Publication Date Title
WO2022052489A1 (fr) Procédé et appareil de déploiement de points d'accès sans fil, et support de stockage
CN107465748B (zh) 移动边缘云计算系统中基于演进博弈的动态资源分配方法
CN107766135B (zh) 移动朵云中基于粒子群和模拟退火优化的任务分配方法
US10051494B2 (en) Optimization of distributed Wi-Fi networks
Song et al. Game-theoretic resource allocation methods for device-to-device communication
CN107040399A (zh) 一种升级文件下载方法、设备及系统
CN108112037B (zh) 基于雾计算和协作通信网络的负载均衡方法
CN111182570A (zh) 提高运营商效用的用户关联和边缘计算卸载方法
US10051455B2 (en) Systems and methods for changing topology and firmware in distributed wi-fi networks
JP2007037135A (ja) 無線自己組織ネットワークにおけるジョイントパワーとレート制御方法と装置
Al Mamun et al. A channel assignment extension of active access-point configuration algorithm for elastic WLAN system and its implementation using Raspberry Pi
Almeida et al. Traffic-aware multi-tier flying network: Network planning for throughput improvement
WO2024113974A1 (fr) Procédé et appareil d'attribution de routage de réseau électrique informatique, dispositif électronique et support de stockage
CN113891426A (zh) 一种分布式多节点组网方法及装置
CN115396953A (zh) 移动边缘计算中一种基于改进粒子群算法的计算卸载方法
CN112929223A (zh) 一种基于联邦学习方式训练神经网络模型的方法及系统
Liu et al. Distributed relay selection for heterogeneous UAV communication networks using a many-to-many matching game without substitutability
CN107820295B (zh) 一种基于用户需求的分布式中继资源分配方法
Atya et al. Bolt: Realizing high throughput power line communication networks
CN106358302B (zh) 一种无线传感器网络多收发器多信道分配算法
CN104735796B (zh) 一种无线通信网络中多源单中继系统的协作中继方法
Ghasri et al. Novel relay selection algorithms for machine-to-machine communications with static RF interfaces setting
Diaz et al. Daca-disjoint path and clustering algorithm for self-healing wsn
JP6171600B2 (ja) 負荷分散システム、負荷分散装置、負荷分散方法およびプログラム
Jia et al. Energy Efficiency Optimization in U2U Multicast Networks: A Hypergraph-Based Matching Approach

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: 21865550

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 21865550

Country of ref document: EP

Kind code of ref document: A1

122 Ep: pct application non-entry in european phase

Ref document number: 21865550

Country of ref document: EP

Kind code of ref document: A1