Base station updating method, device, electronic device and computer readable medium

Abstract

The embodiments of the present disclosure provide a base station update method, device, electronic device and computer-readable medium; and relate to the field of computer network technology. The base station update method includes: obtaining the location information of the base station to be updated; dividing the base station to be updated according to regular polygons with preset side lengths according to the location information to obtain multiple regular polygon areas; coloring the multiple regular polygon areas, and coloring adjacent regular polygon areas with different colors to obtain a set of areas with the same color; updating the regular polygon areas included in the same area set in parallel, and serially updating the base stations to be updated included in the same regular polygon area. The technical solution of the embodiments of the present disclosure can update the base stations in parallel without affecting the base station services, thereby improving the efficiency of base station maintenance.

Description

Technical Field

[0001] The present disclosure relates to the field of computer network technology, and in particular to a base station updating method, a base station updating device, an electronic device, and a computer-readable medium. Background Art

[0002] In order to provide high-precision positioning for user terminals, it is not enough to rely solely on satellite positioning systems. A large number of base stations need to be built within the service range, and differential positioning is performed using the base stations to calibrate and correct the position of user terminals, thereby achieving more accurate positioning.

[0003] After the construction of the base station is completed, the base station equipment needs to be frequently upgraded, restarted and other maintenance operations. The base station cannot provide services during the maintenance process. In order to maintain stable services during base station maintenance, it is usually necessary to perform individual maintenance on the base stations one by one through manual evaluation. This method can ensure that the differential positioning service will not be affected by the change of base stations when there are redundant base stations nearby. However, there are many base stations within the service range, and the duration of changing one by one is very long, which occupies a lot of human and material resources and is too inefficient.

[0004] It should be noted that the information disclosed in the above background technology section is only used to enhance the understanding of the background of the present disclosure, and therefore may include information that does not constitute the prior art known to ordinary technicians in the field. Summary of the invention

[0005] The purpose of the embodiments of the present disclosure is to provide a base station update method, a base station update device, an electronic device and a computer-readable medium, which can divide the base stations to be updated into area sets by coloring, realize parallel update of the area sets, thereby reducing the base station update cycle and improving the update efficiency.

[0006] Other features and advantages of the present disclosure will become apparent from the following detailed description, or may be learned in part by the practice of the present disclosure.

[0007] According to a first aspect of an embodiment of the present disclosure, a base station updating method is provided, comprising: obtaining location information of a base station to be updated; dividing the base station to be updated into regular polygons with preset side lengths according to the location information to obtain a plurality of regular polygon areas; coloring the plurality of regular polygon areas, and coloring adjacent regular polygon areas with different colors respectively to obtain a set of areas with the same color; updating the regular polygon areas included in the same area set in parallel, and serially updating the base stations to be updated included in the same regular polygon area.

[0008] In an exemplary embodiment of the present disclosure, serially updating the base stations to be updated contained in the same regular polygon area includes: for each regular polygon area, using a dynamic programming algorithm to calculate the update order of each base station to be updated contained in the regular polygon area; and sequentially updating the base stations to be updated contained in the same regular polygon area according to the update order.

[0009] In an exemplary embodiment of the present disclosure, sequentially updating the base stations to be updated contained in the same regular polygon area according to the update order includes: obtaining the update interval of the base stations to be updated; updating the base stations to be updated contained in the same regular polygon area according to the update interval and the update order of each regular polygon area.

[0010] In an exemplary embodiment of the present disclosure, using a dynamic programming algorithm to calculate the update order of each base station to be updated contained in the regular polygon area includes: converting the update state of each base station to be updated contained in the regular polygon area into a binary first state number to obtain a first state number corresponding to each update period, wherein the update period is the time period required to update a base station to be updated; converting the first state number into a decimal second state number; using the dynamic programming algorithm to calculate the penalty value corresponding to the second state number of each update period to obtain a target second state number corresponding to the target penalty value, and using the target second state number as the update order.

[0011] In an exemplary embodiment of the present disclosure, using the dynamic programming algorithm to calculate the penalty values ​​corresponding to the second state number of each update period includes: obtaining the update conditions of the base station to be updated, and determining the preset penalty values ​​corresponding to the update conditions; using the preset penalty values ​​corresponding to the update conditions and the dynamic programming algorithm to calculate the penalty values ​​corresponding to the second state number of each update period.

[0012] In an exemplary embodiment of the present disclosure, the regular polygon includes a regular hexagon.

[0013] In an exemplary embodiment of the present disclosure, the update status includes at least updated and not updated; the update condition includes: when the base station to be updated is updated, there are other base stations to be updated whose update status is updated or not updated within the baseline length of the base station to be updated; wherein the preset side length is not greater than the baseline length.

[0014] According to a second aspect of an embodiment of the present disclosure, a base station updating device is provided, which may include an information acquisition module, a region division module, a coloring module and an updating module.

[0015] The information acquisition module is used to acquire the location information of the base station to be updated.

[0016] The area division module is used to divide the base station to be updated into regular polygons with preset side lengths according to the location information to obtain multiple regular polygon areas.

[0017] The coloring module is used to color the multiple regular polygonal regions, and the adjacent regular polygonal regions are respectively colored with different colors to obtain a set of regions with the same color.

[0018] The updating module is used to update the regular polygonal areas contained in the same area set in parallel, and to update the base stations to be updated contained in the same regular polygonal area in series.

[0019] In an exemplary embodiment of the present disclosure, the updating module includes a sequence determining module and a sequence updating module.

[0020] The sequence determination module is used to calculate the update sequence of each to-be-updated base station contained in each regular polygon region by using a dynamic programming algorithm.

[0021] The sequential updating module is used to sequentially update the base stations to be updated contained in the same regular polygon area according to the updating sequence.

[0022] In an exemplary embodiment of the present disclosure, the sequential updating module includes an interval acquiring module and an interval updating module.

[0023] The interval acquisition module is used to acquire the update interval of the base station to be updated.

[0024] The interval updating module is used to update the base stations to be updated contained in the same regular polygon area according to the update interval and the update order of each regular polygon area.

[0025] In an exemplary embodiment of the present disclosure, the sequence determination module includes a state determination module, a data conversion module, and a penalty value calculation module.

[0026] Among them, the state determination module is used to convert the update state of each base station to be updated contained in the regular polygon area into a binary first state number to obtain the first state number corresponding to each update period, wherein the update period is the time period required to update a base station to be updated.

[0027] A data conversion module is used to convert the first state number into a decimal second state number.

[0028] The sequence determination module is used to calculate the penalty value corresponding to the second state number of each update period by using the dynamic programming algorithm to obtain the target second state number corresponding to the target penalty value, and use the target second state number as the update sequence.

[0029] In an exemplary embodiment of the present disclosure, the sequence determination module includes an update condition determination module and a penalty value calculation module.

[0030] The update condition determination module is used to obtain the update condition of the base station to be updated and determine a preset penalty value corresponding to the update condition.

[0031] The penalty value calculation module is used to calculate the penalty value corresponding to the second state number of each update period by using the preset penalty value corresponding to the update condition and the dynamic programming algorithm.

[0032] In an exemplary embodiment of the present disclosure, the regular polygon includes a regular hexagon.

[0033] In an exemplary embodiment of the present disclosure, the update status includes at least updated and not updated; the update condition includes: when the base station to be updated is updated, there are other base stations to be updated whose update status is updated or not updated within the baseline length of the base station to be updated; wherein the preset side length is not greater than the baseline length.

[0034] According to the third aspect of an embodiment of the present disclosure, an electronic device is provided, comprising: one or more processors; a storage device for storing one or more programs, wherein when the one or more programs are executed by the one or more processors, the one or more processors implement the base station update method as described in the first aspect of the above embodiment.

[0035] According to a fourth aspect of an embodiment of the present disclosure, a computer-readable medium is provided, on which a computer program is stored. When the program is executed by a processor, the base station update method as described in the first aspect of the above embodiment is implemented.

[0036] In the base station update method, base station update device, electronic device and computer-readable medium provided in the embodiments of the present disclosure, the base station to be updated is divided into multiple regular polygonal areas by using the location information of the base station to be updated, and the multiple regular polygonal areas are divided into multiple area sets by coloring, and then the base stations to be updated contained in the same area set are updated in parallel, which can shorten the base station update cycle, improve the base station update efficiency, and reduce the manpower and time cost of base station maintenance.

[0037] It is to be understood that the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the present disclosure. BRIEF DESCRIPTION OF THE DRAWINGS

[0038] The drawings herein are incorporated into the specification and constitute a part of the specification, showing embodiments consistent with the present disclosure, and together with the specification, are used to explain the principles of the present disclosure. Obviously, the drawings described below are only some embodiments of the present disclosure, and for ordinary technicians in this field, other drawings can be obtained based on these drawings without creative work. In the drawings:

[0039] Figure 1 A schematic diagram of an exemplary system architecture of a base station updating method or a base station updating device applied to an embodiment of the present disclosure is schematically shown;

[0040] Figure 2 The flowchart of the base station updating method according to an embodiment of the present disclosure is schematically shown;

[0041] Figure 3 A schematic diagram of a regular polygonal region according to an embodiment of the present disclosure is schematically shown;

[0042] Figure 4 A schematic diagram schematically shows a regular polygon coloring result according to another embodiment of the present disclosure;

[0043] Figure 5 A block diagram of a base station updating device according to an embodiment of the present disclosure is schematically shown;

[0044] Figure 6 A schematic diagram of the structure of a computer system suitable for implementing an electronic device of an embodiment of the present disclosure is shown. DETAILED DESCRIPTION

[0045] Example embodiments will now be described more fully with reference to the accompanying drawings. However, example embodiments can be implemented in a variety of forms and should not be construed as limited to the examples set forth herein; rather, these embodiments are provided so that this disclosure will be more comprehensive and complete and will fully convey the concept of the example embodiments to those skilled in the art.

[0046] In addition, the described features, structures or characteristics may be combined in one or more embodiments in any suitable manner. In the following description, many specific details are provided to provide a full understanding of the embodiments of the present disclosure. However, those skilled in the art will appreciate that the technical solutions of the present disclosure may be practiced without one or more of the specific details, or other methods, components, devices, steps, etc. may be adopted. In other cases, known methods, devices, implementations or operations are not shown or described in detail to avoid blurring the various aspects of the present disclosure.

[0047] The block diagrams shown in the accompanying drawings are merely functional entities and do not necessarily correspond to physically independent entities. That is, these functional entities may be implemented in software form, or in one or more hardware modules or integrated circuits, or in different networks and / or processor devices and / or microcontroller devices.

[0048] The flowcharts shown in the accompanying drawings are only exemplary and do not necessarily include all the contents and operations / steps, nor must they be executed in the order described. For example, some operations / steps can be decomposed, and some operations / steps can be combined or partially combined, so the actual execution order may change according to actual conditions.

[0049] In this specification, the terms "a", "an", "the", "said" and "at least one" are used to indicate the presence of one or more elements / components / etc.; the terms "comprising", "including" and "having" are used to express an open-ended inclusion, and mean that there may be additional elements / components / etc. in addition to the listed elements / components / etc.; the terms "first", "second", "third", etc. are used only as labels and are not intended to limit the quantity of their objects.

[0050] The exemplary embodiments of the present disclosure are described in detail below with reference to the accompanying drawings.

[0051] Figure 1 A schematic diagram showing a system architecture of an exemplary application environment that can be applied to the base station updating method or the base station updating device of the embodiments of the present disclosure.

[0052] like Figure 1 As shown, the system architecture 100 may include one or more of terminal devices 101, 102, 103, a network 104, and a server 105. The network 104 is used to provide a medium for communication links between the terminal devices 101, 102, 103 and the server 105. The network 104 may include various connection types, such as wired, wireless communication links, or optical fiber cables, etc.

[0053] Users can use terminal devices 101, 102, 103 to interact with server 105 through network 104 to receive or send messages, etc. Terminal devices 101, 102, 103 can be various electronic devices with display screens and supporting web browsing, including but not limited to desktop computers, portable computers, smart phones and tablet computers, wearable devices, virtual reality devices, smart homes, etc.

[0054] The server 105 may be a server that provides various services, such as a background management server that provides support for devices operated by users using the terminal devices 101, 102, and 103. The background management server may analyze and process the received request data, and feed back the processing results to the terminal device.

[0055] For example, the server 105 may obtain the location information of the base station to be updated; divide the base station to be updated into regions according to the location information to obtain a plurality of regular polygonal regions; then color the plurality of regular polygonal regions to obtain a set of regions with the same color; and then perform parallel updates on the base stations to be updated contained in the same set of regions.

[0056] It should be understood that Figure 1 The number of terminal devices, networks and servers in the embodiment is only for illustration. According to the implementation requirements, there may be any number of terminal devices, networks and servers. For example, the server 105 may be a server cluster composed of multiple servers.

[0057] The base station update method provided in the embodiment of the present disclosure is generally executed by the server 105, and accordingly, the base station update device is generally set in the server 105. However, it is easy for those skilled in the art to understand that the base station update method provided in the embodiment of the present disclosure can also be executed by the terminal devices 101, 102, and 103, and accordingly, the base station update device can also be set in the terminal devices 101, 102, and 103, which is not particularly limited in this exemplary embodiment.

[0058] RTK (Real-time kinematic) carrier phase differential technology, also known as differential positioning technology, can provide users with stable and real-time differential data services, but it is necessary to build a large number of base stations within the service range to calculate satellite positioning corrections, thereby improving the accuracy of satellite positioning and providing users with high-precision positioning. The base station cannot provide external services during the upgrade process. In order to maintain stable and real-time differential positioning services during the base station upgrade process, the base stations need to be upgraded in batches. How to schedule to reduce the time and labor costs of base station upgrades is the main problem in the base station upgrade and maintenance process.

[0059] Based on this, the embodiment of the present disclosure provides a technical solution for a base station update method, which can plan the base stations to be updated into multiple area sets by using polygon coloring, thereby realizing parallel update of the area sets, shortening the time and labor cost of base station changes, and improving the maintenance efficiency of the base stations.

[0060] like Figure 2 As shown, the base station updating method provided by the embodiment of the present disclosure may include step S21, step S22, step S23 and step S24.

[0061] In step S21, the location information of the base station to be updated is obtained.

[0062] A base station refers to a base station that provides a data source for a network RTK system. The base station to be updated may be multiple base stations that need to be updated within the service range, or all base stations. Location information refers to the geographical location coordinates of the base station, such as latitude and longitude coordinates, three-dimensional coordinates, etc., or may also include other information that can identify the location, such as country, city, street, etc., which is not limited in this embodiment.

[0063] There are a large number of base stations to be updated, and their locations are spread all over the country. By querying the RTK system, the location information of all the base stations to be updated within the service range can be obtained, and other information related to the base stations to be updated, such as the type of base station upgrade, the time required for the upgrade, etc.; the obtained information can be saved in the form of a table. Alternatively, the interface allows maintenance personnel to upload the location information of the base stations to be updated, such as uploading a list or other types of files containing the location information of the base stations to be updated and other information, so as to obtain the uploaded file through the interface and read the location information of the base stations to be updated from the file. In addition, obtaining the base stations to be updated can also be achieved in other ways, such as obtaining through a server request, etc., which is not limited in this embodiment.

[0064] In step S22, the base station to be updated is divided into regular polygons with preset side lengths according to the location information to obtain a plurality of regular polygon areas.

[0065] The preset side length can be determined according to actual needs, and the preset side length cannot be greater than the baseline length of the base station. For example, if the baseline length is 200 kilometers, the preset side length can include 100 kilometers, 150 kilometers, etc. The baseline length refers to the range of the base station at a certain accuracy, which is determined according to different accuracy requirements or base station performance. Within the baseline length range, the base station accuracy can be guaranteed to be within a certain error range. For example, when the baseline length is 50 kilometers, the base station accuracy is 1 centimeter.

[0066] The service range corresponding to the base station can be determined based on the location information of all base stations to be updated, and then the service range is divided into regular polygons with preset side lengths to obtain multiple regular polygon areas. Among them, the regular polygon can be a regular hexagon, a regular triangle, a regular quadrilateral, etc. Figure 3 As shown, the area where the base station to be updated is located can be divided into regular hexagons, thereby obtaining regular hexagonal areas A, B, C, D, E... and so on.

[0067] In step S23, the plurality of regular polygonal regions are dyed with different colors, and adjacent regular polygonal regions are dyed with different colors, so as to obtain a set of regions with the same color.

[0068] In this embodiment, by writing an algorithm and using a computer, it is easy to calculate the coloring results of regular polygons, such as which color each regular polygon is dyed, how many colors are needed for all regular polygons, etc. After the coloring is completed, the regular polygon area can be divided, and the regular polygons with the same color can be divided into the same set to obtain a region set. The number of region sets can include multiple, and the polygon areas in different region sets are different colors, that is, the regular polygons in different region sets are not adjacent to each other. Since the side length of the regular polygon is less than the baseline length, the base stations to be updated in the same regular polygon area can replace each other to provide positioning services for users, and the base stations to be updated in different regular polygon areas can be updated in parallel, thereby reducing the update time cycle.

[0069] For example, to color a regular hexagon, at least three colors are needed to color all the regular hexagons, and each regular hexagon has a different color from its adjacent regular hexagons. Figure 4 As shown, regular hexagon A is dyed color 1, B is dyed color 2, C is dyed color 3, D is dyed color 2, E is dyed color 3, F is dyed color 2, G is dyed color 3, and so on; after dyeing, a region set consisting of regular hexagons of the same color can be obtained; among which, the region sets with the same color can include 3, namely, the region set of color 1, the region set of color 2, and the region set of color 3; regular hexagons A, H, J, L, N, P, and R all belong to the region set of color 1.

[0070] It can be understood that in other embodiments of the present disclosure, the base station to be updated can be divided by other regular polygons, such as regular triangles, regular quadrilaterals, etc.; all of which belong to the protection scope of the present disclosure.

[0071] Continue to refer Figure 2 In step S24, the regular polygonal areas included in the same area set are updated in parallel, and the base stations to be updated included in the same regular polygonal area are updated in series.

[0072] Parallel update can be understood as updating within the same update time, that is, the second base station to be updated can be updated when the first base station to be updated is updated, that is, the update time of multiple base stations to be updated overlaps. Serial update can be understood as updating another base station to be updated only after the update of one base station to be updated is completed, and the update time of each base station to be updated does not overlap. Since different polygonal areas in the same area set are not adjacent to each other, base station updates do not affect each other, so different polygonal areas in the same area set can be updated in parallel.

[0073] In this implementation, the regular polygonal area where the base station to be updated is located can be determined based on the location information of the base station to be updated, so that the base stations to be updated in non-adjacent polygonal areas are updated simultaneously, and the base stations to be updated in the same regular polygonal area are updated serially. Figure 4 , when the area set corresponding to color 1 is updated, the update of regular polygon areas such as A, H, J, L, N, P, and R can be performed simultaneously according to the location information of the base station to be updated. For example, the base station a to be updated in the regular polygon area A and the base station b to be updated in the regular polygon area H are updated simultaneously; the base stations to be updated in the same regular polygon area are updated serially, so that the update of regular polygon areas such as A, H, J, L, N, P, and R can be completed in the same time period. In addition, the area set can include multiple areas, and multiple different area sets can be updated serially in a random or specific order, for example, according to the number of base stations to be updated contained in each area set from large to small, according to the distance between each area set and the server from small to large, etc., which is not limited in this embodiment. For example, a total of four area sets A1, A2, A3, and A4 can be updated in a specific order such as the order of A1, A2, A3, and A4, or in a random order, such as the order of A1, A3, A4, and the like.

[0074] Since the fewer the number of polygon sides, the more types of colors are needed to make adjacent polygons different in color, the more area sets are divided, and the fewer base stations to be updated are divided into the same area set. For example, dyeing an equilateral triangle area requires at least six colors to make adjacent areas different in color, and a regular quadrilateral requires at least four colors to make adjacent areas different in color, etc. In order to maximize the update time of the base stations to be updated, it is necessary to enable as many base stations to be updated as possible to be updated in parallel. Therefore, the more the number of sides of the divided polygonal area, the higher the update efficiency.

[0075] In an exemplary embodiment, when the same area set is updated in parallel, the following method may be included: for each regular polygon area, a dynamic programming algorithm is used to calculate the update order of each base station to be updated contained in the regular polygon area; according to the update order, the base stations to be updated contained in the same regular polygon area are sequentially updated.

[0076] The dynamic programming algorithm is an optimization method used to solve dynamic processes divided into stages by time. It can decompose the problem to be solved into several sub-problems, solve the sub-problems first, and then obtain the solution to the original problem from the solution of the sub-problems. Therefore, the dynamic programming algorithm can be used to transform a multi-dimensional decision-making problem into multiple one-dimensional problems, and then solve them one by one to achieve the purpose of solving complex problems.

[0077] The same regular polygon area may include multiple base stations to be updated, and different base stations to be updated have different impacts on the service when updated. When the base station to be updated near the center of the regular polygon area is updated, the service is interrupted. Since there are many base stations to choose from around, other base stations can be selected to provide services to users, which can ensure the stability of the service; when the base station to be updated at the edge of the regular polygon area is updated, there will be a risk of service interruption due to the small number of base stations that may be selected around; the optimal update order in each regular polygon area can be calculated through the dynamic programming algorithm. The update order of each regular polygon area is different, and multiple regular polygon areas in the same area set are updated at the same time; each regular polygon area is updated serially according to the update order calculated by the dynamic programming algorithm.

[0078] In an exemplary embodiment, when the base stations to be updated contained in the same regular polygon area are updated, in order to ensure that they do not affect each other, an update interval can be set; the base stations to be updated in the same regular polygon area are updated according to the update interval. The update interval can be preset and saved, and when the update of the base stations to be updated is executed, the update interval is obtained from the corresponding storage directory. For example, the update interval is 10 minutes. For multiple base stations to be updated contained in the same regular polygon area, the first base station to be updated is updated first, and the second base station to be updated is updated 10 minutes later, and so on, until the update of a regular polygon area is completed. In addition, when updating the same regular polygon area, the update can be combined with the update interval and the update order calculated by the dynamic programming algorithm.

[0079] The method for calculating the update order of base stations to be updated using a dynamic programming algorithm includes: converting the update states of multiple base stations to be updated contained in a regular polygon area into a binary first state number to obtain a first state number corresponding to each update period, wherein the update period is the time period required to update a base station to be updated; converting the first state number into a decimal second state number; calculating the penalty values ​​corresponding to multiple second state numbers using a dynamic programming algorithm to obtain a target second state corresponding to the target penalty value, and using the target second state number as the update order.

[0080] In order to calculate the update order of the base stations to be updated using the dynamic programming algorithm, it is necessary to encode the update status of the base stations to be updated. In this embodiment, the update status of the base stations to be updated is represented by binary "0" or "1", for example, 0 means not updated, 1 means updated, and then each base station to be updated in the regular polygon area is encoded as 0 or 1. By encoding all the base stations to be updated in the regular polygon area according to 0 and 1, the update status of each update period can be represented, and multiple first state numbers are obtained. For example, for five base stations to be updated, a, b, c, d, and e, the change of a base station is completed in the first minute, then the current first state number is described as 10000; for another example, the update of three base stations a, b, and e is completed in the eighth minute, then the first state number corresponding to the eighth minute is described as 11001. Each regular polygon area A includes n base stations to be updated, then the possible combination of the update order of all base stations to be updated in A is 2 to the power of n combinations. By representing the update status of each base station to be updated in each update period as a binary first state number, a computer can be used to calculate the first state number in different situations without manual enumeration and calculation, which can improve calculation speed and accuracy.

[0081] After determining the first state number, the first state number may be converted into a decimal second state number. For example, the decimal second state number corresponding to 11001 is 25, the decimal second state number corresponding to 10000 is 10000, and so on.

[0082] The converted decimal second state number is used as the state of the dynamic programming algorithm, and the dynamic programming algorithm is used to search all the states, and the penalty value corresponding to each state is calculated, so as to find the target second state number corresponding to the target penalty value. Optionally, after calculating the penalty value corresponding to each state, the minimum or maximum penalty value can be used as the target penalty value. Specifically, the method for calculating the penalty value is as follows: obtain the update condition of the base station to be updated, and determine the preset penalty value corresponding to the update condition; use the preset penalty value corresponding to the update condition to execute the dynamic programming algorithm to calculate the penalty value corresponding to the second state number of each update period.

[0083] The update condition is a condition that needs to be met during the update process of the base station to be updated, and can be pre-set by the base station maintenance personnel. In addition, a penalty value can be set for each update condition. When the penalty value corresponding to each second state number is calculated using the dynamic programming algorithm, the final penalty value is calculated by judging whether each base station to be updated under the second state number meets the update condition. For example, if each base station to be updated in an update period meets the update condition, the penalty value can be 0; if one of the base stations to be updated does not meet the update condition x1, the calculated penalty value can be the penalty value corresponding to x1; if there is a base station to be updated that does not meet the update condition x1, and another base station to be updated does not meet the update condition x2, then the penalty value finally calculated for the update period can be the value of x1+x2.

[0084] Optionally, the update condition may include that when the base station to be updated is updated, there are other base stations to be updated whose update status is updated or not updated within the baseline length of the base station to be updated. This implementation can meet the normal base station service and ensure that the base station service is not interrupted.

[0085] In other embodiments of the present disclosure, the update conditions may also include the existence of base stations to be updated whose update status is updated or not updated in the same regular polygon area; the number of selectable base stations to be updated within the baseline length is not less than a specific value; the update time between adjacent base stations to be updated is not less than a specific time threshold, etc.; all of these belong to the protection scope of the present disclosure.

[0086] The dynamic programming algorithm can be implemented through code programming. For example, the algorithm for dynamically calculating the penalty value for each update period can be f(t, b), where t represents the update period, and b represents the update status of each base station to be updated corresponding to the update period. For example, f(8,25) can represent the penalty value corresponding to the update status of 11001 in the 8th update period. Exemplarily, the specific algorithm for calculating the penalty value is as follows:

[0087]

[0088]

[0089] Among them, 10 is the update interval, t+10 can make the update interval between adjacent base stations greater than 10, i is the i-th base station to be updated in the current update, and i is a positive integer. The dynamic programming algorithm can be used to recurse for each update state in each update period. After all update states in the current update period are recursively completed, the next update period is looped to continue recursion, so as to calculate the update order corresponding to the optimal penalty value (target penalty value).

[0090] In this implementation, the base stations to be updated in the regular polygonal areas of the same color are updated in parallel, and multiple regular polygonal areas can be updated in the same time period. In the polygonal areas, the update is performed in sequence according to the optimal update sequence calculated by the dynamic programming algorithm, which can further improve the update efficiency and reduce the time cost required for base station updates. Figure 4 For a regular hexagon, three area sets can be obtained after division, the area set corresponding to color 1 (A, H, J, L, N, P, R), the area set corresponding to color 2 (B, D, F, O, S, K), the area set corresponding to color 3 (C, E, G, I, Q, M), etc. The area set corresponding to color 1 can be updated first. For example, in the first minute, the base stations to be updated included in the regular hexagonal areas A, H, J, L, N, P, and R are respectively executed. For example, the regular hexagonal area A contains base stations a and b to be updated, and the regular hexagonal area H contains base stations c and d to be updated, then The base stations a and c to be updated can be updated first. If the update of a is completed, the next base station to be updated in the same regular hexagonal area, such as c, will be updated in the update order, and the update order of the regular hexagonal area A will be followed by analogy until the update of the regular hexagonal area A is completed; similarly, if the update of the base station c to be updated is completed, the next one, such as d, will be updated in the update order of the regular hexagonal area H, and so on until the update of all the base stations to be updated contained in the regular hexagonal area H is completed; after the overall update of the area set is completed, the update of the next area set can be executed until all area sets are updated. It can be seen that the updates of the regular polygonal areas in the same area set do not affect each other, and can be updated in parallel. When updating, the update can be performed according to the optimal update order calculated by dynamic programming, which can ensure that the changes are made as quickly as possible without affecting the base station service to the greatest extent, thereby improving efficiency.

[0091] Different base stations to be updated can perform different updates. The updates of the base stations to be updated can be divided into multiple types, such as firmware upgrade, board upgrade, receiver replacement, antenna type replacement, coordinate update, etc., and may also include other types, such as single base station line switching, receiver restart, etc. This embodiment does not limit this.

[0092] The following describes an apparatus embodiment of the present disclosure, which can be used to execute the base station update method described above. Figure 5 The base station updating device 50 provided in the embodiment of the present disclosure may include: an information acquisition module 51, a region division module 52, a coloring module 53 and an updating module 54.

[0093] The information acquisition module 51 is used to acquire the location information of the base station to be updated.

[0094] The area division module 52 is used to divide the base station to be updated into regular polygons with preset side lengths according to the location information to obtain a plurality of regular polygon areas.

[0095] The coloring module 53 is used to color the multiple regular polygonal regions, and the adjacent regular polygonal regions are respectively colored with different colors to obtain a set of regions with the same color.

[0096] The updating module 54 is used to update the regular polygonal areas included in the same area set in parallel, and to update the base stations to be updated included in the same regular polygonal area in series.

[0097] In an exemplary embodiment of the present disclosure, the updating module 54 includes a sequence determining module and a sequence updating module.

[0098] The sequence determination module is used to calculate the update sequence of each to-be-updated base station contained in each regular polygon region by using a dynamic programming algorithm.

[0099] The sequential updating module is used to sequentially update the base stations to be updated contained in the same regular polygon area according to the updating sequence.

[0100] In an exemplary embodiment of the present disclosure, the sequential updating module includes an interval acquiring module and an interval updating module.

[0101] The interval acquisition module is used to acquire the update interval of the base station to be updated.

[0102] The interval updating module is used to update the base stations to be updated contained in the same regular polygon area according to the update interval and the update order of each regular polygon area.

[0103] In an exemplary embodiment of the present disclosure, the sequence determination module includes a state determination module, a data conversion module, and a penalty value calculation module.

[0104] Among them, the state determination module is used to convert the update state of each base station to be updated contained in the regular polygon area into a binary first state number to obtain the first state number corresponding to each update period, wherein the update period is the time period required to update a base station to be updated.

[0105] A data conversion module is used to convert the first state number into a decimal second state number.

[0106] The sequence determination module is used to calculate the penalty value corresponding to the second state number of each update period by using the dynamic programming algorithm to obtain the target second state number corresponding to the target penalty value, and use the target second state number as the update sequence.

[0107] In an exemplary embodiment of the present disclosure, the sequence determination module includes an update condition determination module and a penalty value calculation module.

[0108] The update condition determination module is used to obtain the update condition of the base station to be updated and determine a preset penalty value corresponding to the update condition.

[0109] The penalty value calculation module is used to calculate the penalty value corresponding to the second state number of each update period by using the preset penalty value corresponding to the update condition and the dynamic programming algorithm.

[0110] In an exemplary embodiment of the present disclosure, the regular polygon includes a regular hexagon.

[0111] In an exemplary embodiment of the present disclosure, the update status includes at least updated and not updated; the update condition includes: when the base station to be updated is updated, there are other base stations to be updated whose update status is updated or not updated within the baseline length of the base station to be updated; wherein the preset side length is not greater than the baseline length.

[0112] Since the various functional modules of the base station update device in the example embodiment of the present disclosure correspond to the steps of the example embodiment of the base station update method described above, for details not disclosed in the example embodiment of the base station update device in the present disclosure, please refer to the example embodiment of the base station update method described above in the present disclosure.

[0113] Reference below Figure 6 , which shows a schematic diagram of the structure of a computer system 600 suitable for implementing an electronic device of an embodiment of the present disclosure. Figure 6 The computer system 600 of the electronic device shown is only an example and should not bring any limitation to the functions and scope of use of the embodiments of the present disclosure.

[0114] like Figure 6 As shown, the computer system 600 includes a central processing unit (CPU) 601, which can perform various appropriate actions and processes according to the program stored in the read-only memory (ROM) 602 or the program loaded from the storage part 608 to the random access memory (RAM) 603. In the RAM 603, various programs and data required for system operation are also stored. The CPU 1201, ROM 602 and RAM 603 are connected to each other through a bus 604. An input / output (I / O) interface 605 is also connected to the bus 604.

[0115] The following components are connected to the I / O interface 605: an input section 606 including a keyboard, a mouse, etc.; an output section 607 including a cathode ray tube (CRT), a liquid crystal display (LCD), etc., and a speaker, etc.; a storage section 608 including a hard disk, etc.; and a communication section 609 including a network interface card such as a LAN card, a modem, etc. The communication section 609 performs communication processing via a network such as the Internet. A drive 610 is also connected to the I / O interface 605 as needed. A removable medium 611, such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, etc., is installed on the drive 610 as needed, so that a computer program read therefrom is installed into the storage section 608 as needed.

[0116] In particular, according to an embodiment of the present disclosure, the process described above with reference to the flowchart can be implemented as a computer software program. For example, an embodiment of the present disclosure includes a computer program product, which includes a computer program carried on a computer-readable medium, and the computer program includes a program code for executing the method shown in the flowchart. In such an embodiment, the computer program can be downloaded and installed from a network through a communication part 609, and / or installed from a removable medium 611. When the computer program is executed by a central processing unit (CPU) 601, the above-mentioned functions defined in the system of the present application are executed.

[0117] It should be noted that the computer-readable medium shown in the present disclosure may be a computer-readable signal medium or a computer-readable storage medium or any combination of the above two. The computer-readable storage medium may be, for example, but not limited to, an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, device or device, or any combination of the above. More specific examples of computer-readable storage media may include, but are not limited to: an electrical connection with one or more wires, a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the above. In the present disclosure, a computer-readable storage medium may be any tangible medium containing or storing a program that can be used by or in combination with an instruction execution system, device or device. In the present disclosure, a computer-readable signal medium may include a data signal propagated in a baseband or as part of a carrier wave, in which a computer-readable program code is carried. This propagated data signal may take a variety of forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination of the above. Computer-readable signal media may also be any computer-readable medium other than computer-readable storage media, which may send, propagate or transmit a program for use by or in conjunction with an instruction execution system, apparatus or device. The program code contained on the computer-readable medium may be transmitted using any appropriate medium, including but not limited to: wireless, wire, optical cable, RF, etc., or any suitable combination of the above.

[0118] The flow charts and block diagrams in the accompanying drawings illustrate the possible architecture, functions and operations of the systems, methods and computer program products according to various embodiments of the present disclosure. In this regard, each box in the flow chart or block diagram can represent a module, a program segment, or a part of a code, and the above-mentioned module, program segment, or a part of a code contains one or more executable instructions for realizing the specified logical function. It should also be noted that in some alternative implementations, the functions marked in the box can also occur in a different order from the order marked in the accompanying drawings. For example, two boxes represented in succession can actually be executed substantially in parallel, and they can sometimes be executed in the opposite order, depending on the functions involved. It should also be noted that each box in the block diagram or flow chart, and the combination of the boxes in the block diagram or flow chart can be implemented with a dedicated hardware-based system that performs a specified function or operation, or can be implemented with a combination of dedicated hardware and computer instructions.

[0119] The units involved in the embodiments described in the present disclosure may be implemented by software or hardware, and the units described may also be arranged in a processor. The names of these units do not, in some cases, constitute limitations on the units themselves.

[0120] As another aspect, the present application also provides a computer-readable medium, which may be included in the electronic device described in the above embodiment; or may exist independently without being assembled into the electronic device. The above computer-readable medium carries one or more programs, and when the above one or more programs are executed by an electronic device, the electronic device implements the base station update method described in the above embodiment.

[0121] For example, the electronic device can implement Figure 2 As shown in: Step S21, obtaining the location information of the base station to be updated; Step S22, dividing the base station to be updated according to the location information into regular polygons with preset side lengths to obtain multiple regular polygon areas; Step S23, coloring the multiple regular polygon areas, and coloring adjacent regular polygon areas with different colors to obtain a set of areas with the same color; Step S24, updating the regular polygon areas included in the same area set in parallel, and serially updating the base stations to be updated included in the same regular polygon area.

[0122] It should be noted that, although several modules or units of the device for action execution are mentioned in the above detailed description, this division is not mandatory. In fact, according to the embodiments of the present disclosure, the features and functions of two or more modules or units described above can be embodied in one module or unit. On the contrary, the features and functions of one module or unit described above can be further divided into multiple modules or units to be embodied.

[0123] Through the description of the above implementation, it is easy for those skilled in the art to understand that the example implementation described here can be implemented by software, or by software combined with necessary hardware. Therefore, the technical solution according to the implementation of the present disclosure can be embodied in the form of a software product, which can be stored in a non-volatile storage medium (which can be a CD-ROM, a USB flash drive, a mobile hard disk, etc.) or on a network, including several instructions to enable a computing device (which can be a personal computer, a server, a touch terminal, or a network device, etc.) to execute the method according to the implementation of the present disclosure.

[0124] Those skilled in the art will readily appreciate other embodiments of the present disclosure after considering the specification and practicing the invention disclosed herein. This application is intended to cover any variations, uses, or adaptations of the present disclosure that follow the general principles of the present disclosure and include common knowledge or customary techniques in the art that are not disclosed in the present disclosure. The specification and examples are intended to be exemplary only, and the true scope and spirit of the present disclosure are indicated by the following claims.

[0125] It should be understood that the present disclosure is not limited to the exact structures that have been described above and shown in the drawings, and that various modifications and changes may be made without departing from the scope thereof. The scope of the present disclosure is limited only by the appended claims.

Claims

1. A base station updating method, characterized in that: include: Obtaining the location information of the base station to be updated; Dividing the base station to be updated according to the location information into regular polygons with preset side lengths to obtain a plurality of regular polygon areas; Coloring the multiple regular polygonal regions, and coloring adjacent regular polygonal regions with different colors, respectively, to obtain a set of regions with the same color; The regular polygonal areas included in the same area set are updated in parallel, and the base stations to be updated included in the same regular polygonal area are updated in series.

2. The method according to claim 1, characterized in that: Serially updating the base stations to be updated contained in the same regular polygon area includes: For each regular polygon area, a dynamic programming algorithm is used to calculate an update order of each to-be-updated base station contained in the regular polygon area; According to the update sequence, the base stations to be updated contained in the same regular polygon area are updated sequentially.

3. The method according to claim 2, characterized in that According to the update sequence, sequentially updating the base stations to be updated contained in the same regular polygon area includes: Obtaining an update interval of the base station to be updated; According to the update interval and the update order of each regular polygon area, the base stations to be updated contained in the same regular polygon area are updated.

4. The method according to claim 2, characterized in that: Calculating the update order of each to-be-updated base station contained in the regular polygon area by using a dynamic programming algorithm includes: Converting the update status of each to-be-updated base station contained in the regular polygonal area into a binary first state number to obtain a first state number corresponding to each update period, wherein the update period is a time period required to update a to-be-updated base station; Converting the first state number into a second state number in decimal system; The penalty value corresponding to the second state number in each update period is calculated using the dynamic programming algorithm to obtain a target second state number corresponding to the target penalty value, and the target second state number is used as the update sequence.

5. The method according to claim 4, characterized in that Calculating the penalty values ​​corresponding to the second state numbers in each update period using the dynamic programming algorithm includes: Acquire an update condition of the base station to be updated, and determine a preset penalty value corresponding to the update condition; The penalty value corresponding to the second state number in each update period is calculated using the preset penalty value corresponding to the update condition and the dynamic programming algorithm.

6. The method according to claim 1, characterized in that The regular polygon includes a regular hexagon.

7. The method according to claim 4, characterized in that The update status includes at least updated and not updated; the update condition includes: When the base station to be updated is updated, there are other base stations to be updated whose update status is updated or not updated within the baseline length of the base station to be updated; Wherein, the preset side length is not greater than the baseline length.

8. A base station updating device, characterized in that: include: An information acquisition module, used to acquire the location information of the base station to be updated; A region division module, used for dividing the base station to be updated into regular polygons with preset side lengths according to the location information to obtain a plurality of regular polygon regions; A coloring module, used for coloring the plurality of regular polygonal regions, and coloring adjacent regular polygonal regions with different colors respectively, so as to obtain a set of regions with the same color; The updating module is used to update the regular polygonal areas contained in the same area set in parallel, and to update the base stations to be updated contained in the same regular polygonal area in series.

9. An electronic device, characterized in that: include: one or more processors; a storage device for storing one or more programs, When the one or more programs are executed by the one or more processors, the one or more processors are enabled to implement the base station updating method according to any one of claims 1 to 7.

10. A computer readable medium having a computer program stored thereon, characterized in that: When the program is executed by a processor, the base station updating method according to any one of claims 1 to 7 is implemented.

Images