Base station layout method, device, electronic equipment and medium for intelligent node networking
Through the regular hexagonal base station coverage model, combined with the consideration of barrier-free and barrier-free terrain, the optimal layout of base stations is achieved, and the problem that terrain factors in the existing technology are not considered is solved, so as to achieve the purpose of covering the entire work area with the minimum base station, saving Cost and increase applicability.
Patent Information
- Application Number
- CN202111199686.8
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2021-10-14
- Publication Date
- 2024-12-06
- Estimated Expiration
- 2041-10-14
AI Technical Summary
The prior art fails to effectively consider terrain factors in base station site selection, resulting in poor feasibility of base station layout schemes in actual engineering applications, especially in complex terrain conditions, which are difficult to achieve optimal layout.
The base station coverage model of regular hexagonal base station is used to calculate the minimum number of regular hexagons and its center point coordinates to determine the base station location. It is suitable for barrier-free and obstacle-free terrain, delete the base station located in the obstacle area and add the base station around the obstacle area to Achieve full coverage.
It realizes the coverage of the entire work area with the least base station, saves costs and manpower, and provides a wider and more applicable optimal base station layout solution, suitable for complex terrain conditions.
Smart Images

Figure CN115988508B_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to the field of oil and gas geophysical exploration, and more specifically, to a base station arrangement method, device, electronic equipment and medium for intelligent node networking. Background Art
[0002] In order to realize the automatic recovery of seismic data from smart nodes, the communication between the terminal and the smart node needs to be established by deploying base stations. In the process of field networking, a reasonable base station layout plan is particularly important. If the number of base stations is too small, the signal coverage rate will be low and cannot meet industrial needs. If the number of base stations is too large, it will cause cost waste.
[0003] At present, there are many methods for base station site selection, which can be mainly divided into two categories: one is mathematical programming methods. The base station site selection problem is essentially a multi-objective optimization problem, which requires comprehensive consideration of multiple factors such as cost and coverage. Therefore, researchers often use mathematical programming methods to solve it. The main method is to use dynamic programming methods, integer programming, etc. to directly perform mathematical calculations to find a suitable base station layout plan. The other method is intelligent computing methods, such as genetic algorithms, immune algorithms, particle swarm algorithms, simulated annealing algorithms, etc. According to the different needs of researchers, different intelligent algorithms have been used to achieve good results. However, these studies all come from researchers in the fields of telecommunications. In the process of their research, they focus on many professional factors that affect the selection of base station sites, such as link budget, path loss, antenna direction angle, number of carriers, etc. In actual engineering applications, the feasibility of base station layout plans is poor due to the high degree of professionalism. At the same time, topography is also an aspect that cannot be ignored in base station site selection. However, at present, there is almost no research on topographic factors in domestic research on base station site selection. Foreign scholars have considered factors such as terrain, user distribution, user demand, and user growth rate in base station deployment. They have represented a target area where a base station needs to be built with three matrices, which are used to represent terrain, business needs, and base station planning, respectively. Combining these factors, they have proposed a site selection method. However, this method is cumbersome and not very feasible in practical applications.
[0004] Therefore, it is necessary to propose a convenient and feasible optimal layout plan for base station layout in different terrains. Summary of the invention
[0005] The purpose of the present invention is to propose a base station layout method, device, electronic equipment and medium for intelligent node networking, so as to achieve coverage of all work areas with the least base stations, and to perform optimal layout of base stations for barrier-free terrain and barrier-covered terrain respectively.
[0006] To achieve the above objectives, in a first aspect, the present invention proposes a method for arranging base stations in a smart node network, comprising:
[0007] Step S1: obtaining given intelligent node networking work area data, wherein the intelligent node networking work area data includes the length and width of the work area and the terrain data of the work area;
[0008] Step S2: Calculate the minimum number of regular hexagons required to completely cover the work area and the coordinates of the center point of each regular hexagon through a regular hexagon base station coverage model, wherein the regular hexagon represents the coverage range of a base station, the circumscribed circle of the regular hexagon is the circle where the actual base station signal coverage range is located, and the center point coordinates are the base station coordinates. Multiple regular hexagons are arranged in a honeycomb shape and completely cover the work area;
[0009] Step S3: Identify whether there is an obstacle area in the work area where a base station cannot be set up based on the terrain data:
[0010] Step S4: If there is no obstacle area, the number of regular hexagons calculated in step S2 and the base station coordinates corresponding to the center points of each regular hexagon are directly used as the number of base stations actually required to fully cover the work area and the position coordinates of each base station;
[0011] Step S5: If there is an obstacle area, then:
[0012] Delete the base stations whose base station coordinates are located in the obstacle area calculated by the regular hexagonal base station coverage model in step S2, and find all nodes that are not covered by any base station and the boundary points around the obstacle area where base stations can be set up;
[0013] Select at least one boundary point from the boundary points where base stations can be set up as the base station coordinates of the newly added base station, and the regular hexagon corresponding to the newly added base station can completely cover the uncovered nodes;
[0014] The number of newly added base stations and non-deleted base stations and the coordinates of all base stations are taken as the number of base stations actually required to fully cover the work area and the position coordinates of each base station.
[0015] In a second aspect, the present invention provides an electronic device, the electronic device comprising:
[0016] at least one processor; and,
[0017] a memory communicatively connected to the at least one processor; wherein,
[0018] The memory stores instructions that can be executed by the at least one processor, and the instructions are executed by the at least one processor so that the at least one processor can execute the base station deployment method for intelligent node networking described in the first aspect.
[0019] In a third aspect, the present invention proposes a non-transitory computer-readable storage medium, which stores computer instructions, and the computer instructions are used to enable a computer to execute the base station deployment method for intelligent node networking described in the first aspect.
[0020] In a fourth aspect, the present invention provides a base station deployment device for intelligent node networking, comprising:
[0021] A data acquisition module, used to acquire given intelligent node networking work area data, wherein the intelligent node networking work area data includes the length and width of the work area and the terrain data of the work area;
[0022] A full coverage model calculation module calculates the minimum number of regular hexagons required to fully cover the work area and the coordinates of the center point of each regular hexagon through a regular hexagon base station coverage model, wherein the regular hexagon represents the coverage range of a base station, the circumscribed circle of the regular hexagon is the circle where the actual base station signal coverage range is located, and the center point coordinates are the base station coordinates, and multiple regular hexagons are arranged in a honeycomb shape and fully cover the work area;
[0023] Base layout calculation module for:
[0024] Identify, based on the terrain data, whether there is an obstacle area in the work area where a base station cannot be set up:
[0025] If there is no obstacle area, the number of regular hexagons calculated by the full coverage model calculation module and the base station coordinates corresponding to the center points of each regular hexagon are directly used as the number of base stations actually required to fully cover the work area and the position coordinates of each base station;
[0026] If there is an obstruction area, then:
[0027] The base stations whose base station coordinates are calculated by the full coverage model calculation module through the regular hexagonal base station coverage model and are located in the obstacle area are deleted, and all nodes that are not covered by any base station and the boundary points around the obstacle area where base stations can be set up are found;
[0028] Select at least one boundary point from the boundary points where base stations can be set up as the base station coordinates of the newly added base station, and the regular hexagon corresponding to the newly added base station can completely cover the uncovered nodes;
[0029] The number of newly added base stations and non-deleted base stations and the coordinates of all base stations are taken as the number of base stations actually required to fully cover the work area and the position coordinates of each base station.
[0030] The beneficial effects of the present invention are:
[0031] The present invention adopts a regular hexagonal base station coverage model to approximate the signal range transmitted by the base station, which can minimize the overlapping part of the signals transmitted by two base stations. That is, using the regular hexagonal coverage model to solve the barrier-free terrain base station layout is the optimal method, thereby achieving the purpose of covering the entire work area with the least base stations, greatly saving costs and manpower; at the same time, based on considering the complex terrain conditions of the actual work area, the barrier terrain base station layout is further designed, providing a more comprehensive solution for field networking, so that the optimal base station layout method has a wider applicability.
[0032] The system of the present invention has other characteristics and advantages, which will be apparent from the drawings incorporated herein and the following detailed description, or will be described in detail in the drawings incorporated herein and the following detailed description, which together serve to explain the specific principles of the present invention. BRIEF DESCRIPTION OF THE DRAWINGS
[0033] The above and other objects, features and advantages of the present invention will become more apparent through a more detailed description of exemplary embodiments of the present invention in conjunction with the accompanying drawings, in which like reference numerals generally represent like components.
[0034] Figure 1 A step diagram of a base station deployment method for intelligent node networking according to the present invention is shown.
[0035] Figure 2 A schematic diagram of a regular hexagonal coverage model in a base station arrangement method for intelligent node networking according to an embodiment of the present invention is shown.
[0036] Figure 3 A schematic diagram of arranging base stations on an obstacle-free terrain in a base station arrangement method for intelligent node networking according to an embodiment of the present invention is shown.
[0037] Figure 4 A schematic diagram of base station deployment on an obstructed terrain in a base station deployment method for intelligent node networking according to an embodiment of the present invention is shown.
[0038] Figure 5 Shown with Figure 4 Schematic diagram of full coverage of the work area of the corresponding base station circular coverage area. DETAILED DESCRIPTION
[0039] As the research and development of intelligent nodes gradually advances, field networking and other related work are still needed before they can be put into production. In order to automatically recover the seismic data collected by the intelligent nodes, base stations need to be deployed to realize the communication between the terminal and the intelligent nodes. In line with the principle of saving budget costs, the entire work area needs to be covered with the least number of base stations. Therefore, studying the optimal layout of base stations is a crucial link in the networking process and is also of great practical value. At present, the research on the site selection of base stations is basically based on the analysis of barrier-free terrain, without discussing the situation with obstacles. Facing the complex terrain in the actual construction process, it is not universal.
[0040] Therefore, the present invention studies the optimal layout of base stations for both barrier-free terrain and barrier-covered terrain, providing certain theoretical support for practical engineering applications.
[0041] The present invention will be described in more detail below with reference to the accompanying drawings. Although preferred embodiments of the present invention are shown in the accompanying drawings, it should be understood that the present invention can be implemented in various forms and should not be limited by the embodiments set forth herein. On the contrary, these embodiments are provided to make the present invention more thorough and complete, and to fully convey the scope of the present invention to those skilled in the art.
[0042] Figure 1 A step diagram of a base station deployment method for intelligent node networking according to the present invention is shown.
[0043] like Figure 1 As shown, a method for arranging base stations for intelligent node networking according to the present invention includes:
[0044] Step S101: obtaining given intelligent node networking work area data, where the intelligent node networking work area data includes the length and width of the work area and the terrain data of the work area;
[0045] Specifically, generally speaking, the work area where the intelligent node network for seismic data acquisition is located is rectangular, and the terrain of the work area includes flat and barrier-free or with obstacles.
[0046] Step S102: Calculate the minimum number of regular hexagons required to completely cover the work area and the coordinates of the center point of each regular hexagon through the regular hexagon base station coverage model, where the regular hexagon represents the coverage range of a base station, the circumscribed circle of the regular hexagon is the circle where the actual base station signal coverage range is located, and the center point coordinates are the base station coordinates. Multiple regular hexagons are arranged in a honeycomb shape and completely cover the work area;
[0047] Specifically, the regular hexagonal covering model is as follows Figure 2As shown in the figure, for barrier-free terrain, the layout of base stations in the work area can be transformed into a mathematical problem, that is: for a given M×N rectangular area, use the least number of circles with a radius of r to completely cover it. After mathematical calculations, it can be seen that when a circle is approximated with a regular hexagon, the signal overlap range between two circles is the smallest, so it can be covered with a regular hexagon, and the number of regular hexagons used is the minimum number of circles used to cover the rectangle.
[0048] The specific calculation process of this step is:
[0049] Step S201: Calculate the minimum number of regular hexagons required along the length of the work area according to the length of the work area and the radius of the regular hexagon, which can be calculated by the following formula:
[0050]
[0051] Where M is the minimum number of regular hexagons required along the length of the work area, m is the length of the work area, and r is the radius of the regular hexagon;
[0052] Step S202: Calculate the minimum number of regular hexagons required along the width of the work area according to the width of the work area and the radius of the regular hexagon; this can be calculated using the following formula:
[0053]
[0054] Among them, N is the number of regular hexagons required along the width of the work area, n is the width of the work area, and r is the radius of the regular hexagon;
[0055] Step S203: Calculate the minimum number of regular hexagons required to completely cover the work area according to the obtained number of regular hexagons required in the length direction and width direction of the work area, which can be calculated by the following formula:
[0056]
[0057] Among them, Q is the minimum number of regular hexagons of base stations required to fully cover the work area, M is the minimum number of regular hexagons required along the length of the work area, N is the minimum number of regular hexagons required along the width of the work area, m is the length of the work area, and r is the radius of the regular hexagon.
[0058] Step S103: Identify whether there is an obstacle area in the work area where a base station cannot be set up based on the terrain data:
[0059] Specifically, in this embodiment, the obstacle area range can be marked in the given intelligent node networking work area data, or the obstacle area can be automatically identified through the existing geographic image recognition algorithm. It should be noted that the order of step S103 and step S102 is not fixed, that is, the obstacle terrain in the work area can be identified first and then the corresponding full coverage calculation can be performed.
[0060] Step S104: If there is no obstacle area, the number of regular hexagons calculated in step S102 and the base station coordinates corresponding to the center points of each regular hexagon are directly used as the number of base stations actually required for the full coverage area and the position coordinates of each base station;
[0061] Specifically, based on equations (1), (2), and (3), the number of regular hexagons required to cover the rectangular area and the coordinates of the center points of each regular hexagon are obtained. For barrier-free work areas, this result can be directly converted into reality, that is, the number of base stations required for full coverage of the work area and the location coordinates of each base station are obtained.
[0062] The base station layout of the barrier-free working area obtained in this embodiment is as follows: Figure 3 As shown, Figure 3 The geodetic coordinates of the four vertices of the middle work area are:
[0063] Lower right: (545882, 3254658); Lower left: (548849.755809, 3259797.04261);
[0064] Upper left: (569535.179580, 3247857.376785); Upper right: (566567.423771, 3242712.334123).
[0065] The base station coverage radius r=1000m.
[0066] Step S105: If there is an obstacle area, then:
[0067] Delete the base stations whose base station coordinates are located in the obstacle area calculated by the regular hexagonal base station coverage model in step S102, and find all nodes that are not covered by any base station and the boundary points around the obstacle area where base stations can be set up;
[0068] At least one boundary point is selected from the boundary points where base stations can be installed as the base station coordinates of the newly added base station, and the regular hexagon corresponding to the newly added base station can completely cover the uncovered nodes;
[0069] The number of newly added base stations and non-deleted base stations and the coordinates of all base stations are taken as the number of base stations actually required for the full coverage work area and the location coordinates of each base station.
[0070] Specifically, during the deployment of base stations, actual field construction sites often encounter complex terrain with various terrain obstacles, such as rivers, mountains and other insurmountable obstacles. Base stations cannot be set up at these obstacles. The specific steps for the deployment of base stations in terrain with obstacles are as follows:
[0071] Step S501: The base station coordinates of the base stations required to fully cover the work area calculated in step 2 are combined into a set A, and the base station coordinates located in the obstacle area are deleted from the set A;
[0072] Step S502: Find all nodes that are not covered by any base station to form a set B, and find all boundary points of the obstacle area to form a set C;
[0073] Step S503: traverse the set C to find all the boundary points where base stations can be set as candidate base station coordinates to form a set D;
[0074] Step S504: traverse the set D to find the coordinates of the candidate base station that can cover the most uncovered nodes;
[0075] Step S505: putting the candidate base station coordinates found in step S54 into set A, and removing the uncovered nodes that can be covered by the base station where the candidate base station coordinates are located from set B;
[0076] Step S506: Repeat steps S54-S55 until set B is empty, and finally obtain set A, which is the number of base stations actually required to fully cover the work area and the location coordinates of each base station.
[0077] In this embodiment, the base station layout in the obstacle work area obtained by the hexagonal base station coverage model is as follows: Figure 4 As shown, Figure 5 Shown with Figure 4 The corresponding schematic diagram of the full coverage of the base station circular coverage area, Figure 4 , Figure 5 The irregular shapes in the middle working area are terrain obstacle areas. Figure 4 The geodetic coordinates of the four vertices of the middle work area are:
[0078] Lower right: (720492, 3229387); Lower left: (712262, 3234100);
[0079] Upper left: (718826, 3245490); Upper right: (726971, 3240671);
[0080] Base station coverage radius r = 4000m;
[0081] Figure 5 The figure shows that the actual base station coverage has achieved full coverage of the work area.
[0082] In summary, when the signal range transmitted by the base station is approximated by a regular hexagon in this embodiment, the overlapping part of the signals transmitted by the two base stations is the smallest. Therefore, using the regular hexagon coverage model to solve the layout of base stations in barrier-free terrain is the optimal method, thereby achieving the purpose of covering the entire work area with the least base stations, greatly saving costs and manpower. At the same time, based on the complex terrain conditions of the actual work area, the layout of base stations in barrier terrain is further designed, which provides a more comprehensive solution for field networking and makes the optimal layout method of base stations more widely applicable.
[0083] Example 2
[0084] The embodiment of the present invention further provides a base station deployment device for intelligent node networking, including:
[0085] A data acquisition module is used to acquire given intelligent node networking work area data, where the intelligent node networking work area data includes the length and width of the work area and the terrain data of the work area;
[0086] The full coverage model calculation module calculates the minimum number of regular hexagons required to fully cover the work area and the coordinates of the center point of each regular hexagon through the regular hexagon base station coverage model, where the regular hexagon represents the coverage range of a base station, the circumscribed circle of the regular hexagon is the circle where the actual base station signal coverage range is located, and the center point coordinates are the base station coordinates. Multiple regular hexagons are arranged in a honeycomb shape and fully cover the work area;
[0087] Base layout calculation module for:
[0088] Identify whether there are any obstacles in the work area that cannot be used to set up base stations based on terrain data:
[0089] If there is no obstacle area, the number of regular hexagons calculated by the full coverage model calculation module and the base station coordinates corresponding to the center points of each regular hexagon are directly used as the number of base stations actually required for the full coverage area and the location coordinates of each base station;
[0090] If there is an obstruction area, then:
[0091] The base stations whose base station coordinates are calculated by the full coverage model calculation module through the regular hexagonal base station coverage model and are located in the obstacle area are deleted, and all nodes that are not covered by any base station and the boundary points around the obstacle area where base stations can be set up are found;
[0092] At least one boundary point is selected from the boundary points where base stations can be installed as the base station coordinates of the newly added base station, and the regular hexagon corresponding to the newly added base station can completely cover the uncovered nodes;
[0093] The number of newly added base stations and non-deleted base stations and the coordinates of all base stations are taken as the number of base stations actually required for the full coverage work area and the location coordinates of each base station.
[0094] In this embodiment, the full coverage model calculates the minimum number of regular hexagons required to fully cover the work area, including:
[0095] Calculate the minimum number of regular hexagons required along the length of the work area based on the length of the work area and the radius of the regular hexagon;
[0096] The minimum number of regular hexagons required along the width of the work area is calculated based on the width of the work area and the radius of the regular hexagon;
[0097] Based on the obtained number of regular hexagons required in the length and width directions of the work area, calculate the minimum number of regular hexagons required to completely cover the work area.
[0098] Example 3
[0099] An embodiment of the present invention further provides an electronic device, the electronic device comprising:
[0100] at least one processor; and,
[0101] a memory communicatively connected to at least one processor; wherein,
[0102] The memory stores instructions that can be executed by at least one processor, and the instructions are executed by at least one processor so that the at least one processor can execute the base station deployment method for intelligent node networking of Example 1.
[0103] The electronic device according to an embodiment of the present disclosure includes a memory and a processor, and the memory is used to store non-temporary computer-readable instructions. Specifically, the memory may include one or more computer program products, and the computer program product may include various forms of computer-readable storage media, such as volatile memory and / or non-volatile memory. The volatile memory may, for example, include a random access memory (RAM) and / or a cache memory (cache), etc. The non-volatile memory may, for example, include a read-only memory (ROM), a hard disk, a flash memory, etc.
[0104] The processor may be a central processing unit (CPU) or other forms of processing units having data processing capabilities and / or instruction execution capabilities, and may control other components in the electronic device to perform desired functions. In one embodiment of the present disclosure, the processor is used to run the computer-readable instructions stored in the memory.
[0105] Those skilled in the art should be able to understand that in order to solve the technical problem of how to obtain a good user experience, the present embodiment may also include well-known structures such as a communication bus and an interface, and these well-known structures should also be included in the protection scope of the present disclosure.
[0106] For detailed description of this embodiment, reference may be made to the corresponding descriptions in the aforementioned embodiments, which will not be repeated here.
[0107] Example 4
[0108] The embodiment of the present invention further proposes a non-transitory computer-readable storage medium, which stores computer instructions, and the computer instructions are used to enable a computer to execute the base station deployment method for intelligent node networking of embodiment 1.
[0109] According to the computer-readable storage medium of the embodiment of the present disclosure, non-transitory computer-readable instructions are stored thereon. When the non-transitory computer-readable instructions are executed by a processor, all or part of the steps of the above-mentioned methods of each embodiment of the present disclosure are executed.
[0110] The above-mentioned computer-readable storage media include, but are not limited to: optical storage media (e.g., CD-ROM and DVD), magneto-optical storage media (e.g., MO), magnetic storage media (e.g., magnetic tapes or mobile hard disks), media with built-in rewritable non-volatile memory (e.g., memory cards), and media with built-in ROM (e.g., ROM boxes).
[0111] The present invention starts from reality and considers the base station layout problem from two situations: barrier-free terrain and barrier-free terrain. First, for barrier-free terrain, a regular hexagonal coverage model is used to arrange base stations, and the number of base stations required for the barrier-free work area and the location coordinates of each base station are obtained; secondly, for barrier-free terrain, on the basis of the barrier-free terrain base station layout, the result of the barrier-free terrain base station layout is further obtained. The optimal layout of base stations for the intelligent node networking of the present invention achieves the purpose of covering all intelligent nodes in the work area with the least base stations, effectively reducing the budget cost. At the same time, different methods are used for base station layout in different terrain conditions, so that the optimal layout algorithm of base stations has a wider applicability, providing certain technical support for actual engineering personnel.
[0112] The embodiments of the present invention have been described above, and the above description is exemplary, not exhaustive, and is not limited to the disclosed embodiments. Many modifications and changes will be apparent to those skilled in the art without departing from the scope and spirit of the described embodiments.
Claims
1. A method for arranging base stations for intelligent node networking, characterized in that: include: Step S1: obtaining given intelligent node networking work area data, wherein the intelligent node networking work area data includes the length and width of the work area and the terrain data of the work area; Step S2: Calculate the minimum number of regular hexagons required to completely cover the work area and the coordinates of the center point of each regular hexagon through a regular hexagon base station coverage model, wherein the regular hexagon represents the coverage range of a base station, the circumscribed circle of the regular hexagon is the circle where the actual base station signal coverage range is located, and the center point coordinates are the base station coordinates. Multiple regular hexagons are arranged in a honeycomb shape and completely cover the work area; Step S3: Identify whether there is an obstacle area in the work area where a base station cannot be set up based on the terrain data: Step S4: If there is no obstacle area, the number of regular hexagons calculated in step S2 and the base station coordinates corresponding to the center points of each regular hexagon are directly used as the number of base stations actually required to fully cover the work area and the position coordinates of each base station; Step S5: If there is an obstacle area, then: Delete the base stations whose base station coordinates are located in the obstacle area calculated by the regular hexagonal base station coverage model in step S2, and find all nodes that are not covered by any base station and the boundary points around the obstacle area where base stations can be set up; Select at least one boundary point from the boundary points where base stations can be set up as the base station coordinates of the newly added base station, and the regular hexagon corresponding to the newly added base station can completely cover the uncovered nodes; The number of newly added base stations and undeleted base stations and the coordinates of all base stations are used as the number of base stations actually required to fully cover the work area and the position coordinates of each base station; The step 5 specifically includes: Step S51: The base station coordinates of the base stations required to completely cover the work area calculated in step 2 are combined into a set A, and the base station coordinates located in the obstacle area are deleted from the set A; Step S52: Find all nodes that are not covered by any base station to form a set B, and find all boundary points of the obstacle area to form a set C; Step S53: traverse the set C to find all boundary points where base stations can be set as candidate base station coordinates to form a set D; Step S54: traverse the set D to find the coordinates of the candidate base station that can cover the most uncovered nodes; Step S55: putting the candidate base station coordinates found in step S54 into the set A, and removing the uncovered nodes that can be covered by the base station where the candidate base station coordinates are located from the set B; Step S56: Repeat steps S54-S55 until the set B is empty, and finally obtain the number of base stations required by set A to completely cover the work area and the location coordinates of each base station.
2. The method for arranging base stations for intelligent node networking according to claim 1, characterized in that: In step 2, the calculation of the minimum number of regular hexagons required to completely cover the work area includes: Calculating the minimum number of the regular hexagons required along the length direction of the work area according to the length of the work area and the radius of the regular hexagon; Calculating the minimum number of regular hexagons required along the width direction of the work area according to the width of the work area and the radius of the regular hexagon; According to the obtained number of regular hexagons required in the length direction and the width direction of the work area, the minimum number of regular hexagons required to completely cover the work area is calculated.
3. The method for arranging base stations for intelligent node networking according to claim 2, characterized in that: The minimum number of regular hexagons required along the length of the work area is calculated by the following formula: Wherein, M is the minimum number of regular hexagons required along the length direction of the work area, m is the length of the work area, and r is the radius of the regular hexagon.
4. The method for arranging base stations for intelligent node networking according to claim 2, characterized in that: The minimum number of regular hexagons required along the width of the work area is calculated by the following formula: Wherein, N is the number of regular hexagons required along the width direction of the working area, n is the width of the working area, and r is the radius of the regular hexagon.
5. The method for arranging base stations for intelligent node networking according to claim 2, characterized in that: The minimum number of regular hexagons required to completely cover the work area is calculated using the following formula: Among them, Q is the minimum number of regular hexagons of base stations required to completely cover the work area, M is the minimum number of regular hexagons required along the length direction of the work area, N is the minimum number of regular hexagons required along the width direction of the work area, m is the length of the work area, and r is the radius of the regular hexagon.
6. An electronic device, characterized in that: The electronic device comprises: at least one processor; and, a memory communicatively connected to the at least one processor; wherein, The memory stores instructions that can be executed by the at least one processor, and the instructions are executed by the at least one processor so that the at least one processor can execute the base station deployment method for intelligent node networking described in any one of claims 1-5.
7. A non-transitory computer-readable storage medium, characterized in that: The non-transitory computer-readable storage medium stores computer instructions, which are used to enable a computer to execute the base station deployment method for intelligent node networking as described in any one of claims 1-5.
8. A base station deployment device for intelligent node networking, characterized in that: include: A data acquisition module, used to acquire given intelligent node networking work area data, wherein the intelligent node networking work area data includes the length and width of the work area and the terrain data of the work area; A full coverage model calculation module calculates the minimum number of regular hexagons required to fully cover the work area and the coordinates of the center point of each regular hexagon through a regular hexagon base station coverage model, wherein the regular hexagon represents the coverage range of a base station, the circumscribed circle of the regular hexagon is the circle where the actual base station signal coverage range is located, and the center point coordinates are the base station coordinates, and multiple regular hexagons are arranged in a honeycomb shape and fully cover the work area; Base layout calculation module for: Identify, based on the terrain data, whether there is an obstacle area in the work area where a base station cannot be set up: If there is no obstacle area, the number of regular hexagons calculated by the full coverage model calculation module and the base station coordinates corresponding to the center points of each regular hexagon are directly used as the number of base stations actually required to fully cover the work area and the position coordinates of each base station; If there is an obstruction area, then: The base stations whose base station coordinates are calculated by the full coverage model calculation module through the regular hexagonal base station coverage model and are located in the obstacle area are deleted, and all nodes that are not covered by any base station and the boundary points around the obstacle area where base stations can be set up are found; Select at least one boundary point from the boundary points where base stations can be set up as the base station coordinates of the newly added base station, and the regular hexagon corresponding to the newly added base station can completely cover the uncovered nodes; The number of newly added base stations and undeleted base stations and the coordinates of all base stations are used as the number of base stations actually required to fully cover the work area and the position coordinates of each base station; If there are any obstruction areas, they include: Step S51: The calculated base station coordinates of the base stations required to completely cover the work area are used to form a set A, and the base station coordinates located in the obstacle area are deleted from the set A; Step S52: Find all nodes that are not covered by any base station to form a set B, and find all boundary points of the obstacle area to form a set C; Step S53: traverse the set C to find all boundary points where base stations can be set as candidate base station coordinates to form a set D; Step S54: traverse the set D to find the coordinates of the candidate base station that can cover the most uncovered nodes; Step S55: putting the candidate base station coordinates found in step S54 into the set A, and removing the uncovered nodes that can be covered by the base station where the candidate base station coordinates are located from the set B; Step S56: Repeat steps S54-S55 until the set B is empty, and finally obtain the number of base stations required by set A to completely cover the work area and the location coordinates of each base station.
9. The base station arrangement device for intelligent node networking according to claim 8, characterized in that: The full coverage model calculates the minimum number of regular hexagons required to fully cover the work area, including: Calculating the minimum number of the regular hexagons required along the length direction of the work area according to the length of the work area and the radius of the regular hexagon; Calculating the minimum number of regular hexagons required along the width direction of the work area according to the width of the work area and the radius of the regular hexagon; According to the obtained number of regular hexagons required in the length direction and the width direction of the work area, the minimum number of regular hexagons required to completely cover the work area is calculated.
Citation Information
Patent Citations
Method for deploying detection nodes and detecting invasion in wireless sensor network
CN102970687A
