A method for distributing a multi-layer service access satellite oriented to geographical partition

Abstract

The application provides a multi-layer service access satellite distribution method for geographical partitioning, comprising: acquiring a geographical partition set and a communication coverage range of each satellite; determining a satellite accessible to each geographical partition according to a positional relationship between each geographical partition and the communication coverage range; determining a target satellite number accessed by each geographical partition according to a user number of each geographical partition and a user number serviceable by the satellite accessible to each geographical partition, with a user communication satisfaction degree maximization as a target; determining a target satellite accessed by each geographical partition according to the target satellite number accessed by each geographical partition, the user communication satisfaction degree and a communication time length provided by the satellite for the geographical partition served thereby, with a satellite matching degree maximization as a target; and directly accessing, for a satellite not accessed, to a geographical partition corresponding to a longest communication time length. The application can reasonably distribute satellite resources for ground partitioning in a large-scale satellite network scenario.

Description

TECHNICAL FIELD

[0001] The present application relates to the field of communication technology, in particular to a multi-layer service access satellite distribution method for geographical zoning. BACKGROUND

[0002] Satellite communication has the advantages of global coverage, no distance limitation, rapid deployment, flexible networking, etc., and can make up for the shortcomings of other communication methods, playing an important role in both military communication field and civil communication field. In recent years, satellite network technology has developed rapidly, such as the promotion of the "Starlink" project and the deployment of the Chinese Beidou navigation system, so that the number of satellites in orbit has exceeded thousands, which can provide lower delay, wider coverage area and stronger anti-interference performance. These advantages significantly make up for the limitations of traditional ground cellular networks in coverage range and excessive dependence on ground infrastructure, promoting the application process in many fields such as industrial automation and smart city. And the large-scale low-orbit satellite network is a multi-layer satellite network composed of low-orbit satellites with different orbital heights, and the low-orbit satellite network can overcome the coverage limitations of existing ground networks and meet the seamless coverage and high-quality service requirements of future 6G networks.

[0003] Low-orbit satellites have a low orbit height, and the communication area of a single satellite on the earth's surface is small, so a large number of satellites need to be deployed to achieve global coverage. In the scenario of multi-layer low-orbit satellite network, each user can select multiple satellites to access, and each low-orbit satellite can select multiple regions to serve, so it is necessary to reasonably allocate satellite resources to meet user demand.

[0004] For satellite resource allocation, traditional inter-beam resource allocation algorithms such as proportional allocation according to the traffic volume of each beam and channel gain allocation are no longer suitable for current satellite communication systems, so some researches on inter-beam resource allocation algorithms have been made at home and abroad. However, the existing satellite selection access method is mostly suitable for the case of few satellite nodes, and the above-mentioned satellite resource allocation algorithm is mostly not applicable in the scenario of large-scale satellite network. In addition, in the multi-layer low-orbit satellite network, each user can select multiple satellites to access, and each low-orbit satellite can select multiple regions to serve, so the existing satellite selection access method is difficult to reasonably allocate satellite resources. SUMMARY

[0005] Therefore, the purpose of the present application is to provide a multi-layer service access satellite distribution method for geographical zoning, which can reasonably allocate satellite resources for ground zoning in the scenario of large-scale satellite network.

[0006] In the first aspect, the present application provides a multi-layer service access satellite distribution method for geographical zoning, comprising:

[0007] Obtain a set of geographic partitions and the corresponding communication coverage of each satellite in the satellite network. The geographic partitions contained in the geographic partition set are obtained by dividing the earth's surface according to the distribution pattern of the satellite network. All geographic partitions in the geographic partition set can completely cover the earth's surface.

[0008] Determine the satellites accessible to each geographical partition based on the positional relationship between each geographical partition and the communication coverage area corresponding to each satellite;

[0009] Based on the number of users in each geographical area and the number of users that can be served by satellites accessible to each geographical area, the target number of satellites accessible to each geographical area is determined with the goal of maximizing user communication satisfaction. User communication satisfaction is an indicator that measures whether the number of users that can be served by satellites can meet the number of users in the geographical area.

[0010] Based on the number of target satellites accessed by each geographical partition, user communication satisfaction, and the communication time provided by the satellite for the geographical partition it serves, the target satellite for each geographical partition is determined with the goal of maximizing satellite matching. For satellites in the satellite network that are not connected to a geographical partition, the satellite is connected to the geographical partition corresponding to the longest communication time. Satellite matching is an indicator that measures whether the communication time provided by the satellite accessed by a geographical partition can meet the communication needs of the geographical partition, and whether the number of users that the satellite can serve can meet the number of users in the geographical partition.

[0011] In one embodiment, determining the satellite accessible to each geographical partition based on the positional relationship between each geographical partition and the communication coverage area corresponding to each satellite includes:

[0012] For any satellite, the following operations are performed: determining a coverage radius of a communication coverage range corresponding to the satellite, and determining a distance between a sub-satellite point of the satellite and a designated point of any geographical partition; determining whether the designated point of the geographical partition is within the communication coverage range based on the coverage radius and the distance; and if so, determining the geographical partition as a geographical partition serviceable by the satellite;

[0013] Based on the geographical areas that each satellite can serve, the satellites and the number of satellites that can be accessed in each geographical area are determined.

[0014] In one embodiment, based on the number of users in each geographical zone and the number of users serviceable by satellites accessible to each geographical zone, with the goal of maximizing user communication satisfaction, determining a target number of satellites accessible to each geographical zone includes:

[0015] Initialize a set of satellite quantity solutions, where the satellite quantity solutions in the set are used to describe the number of candidate satellites accessed by each geographical partition;

[0016] Assign initial position and velocity to each satellite number;

[0017] Determine the user communication satisfaction corresponding to each satellite number solution based on the number of users in each geographical partition, the number of users serviceable by the satellites accessible to each geographical partition, and the number of candidate satellites accessible to each geographical partition described by each satellite number solution;

[0018] Update the position and velocity corresponding to each satellite number solution according to the update formula. Update the individual optimal position and the global optimal position based on the user communication satisfaction corresponding to each satellite number solution. At the same time, determine whether the updated satellite number solution meets the satellite number constraint.

[0019] When the first iteration stopping condition is met, the target number of satellites accessed by each geographical partition is determined.

[0020] In one embodiment, determining the user communication satisfaction corresponding to each satellite quantity solution based on the number of users in each geographical partition, the number of users serviceable by satellites accessible to each geographical partition, and the number of candidate satellites accessible to each geographical partition described by each satellite quantity solution includes:

[0021] For any number of satellites, perform the following operations:

[0022] For any geographical partition, the number of users serviceable by all satellites accessed by the geographical partition is determined based on the number of users serviceable by satellites accessible to the geographical partition and the number of candidate satellites accessed by the geographical partition as described by the satellite number solution; the user communication satisfaction corresponding to the geographical partition is determined based on the number of users serviceable by all satellites accessed by the geographical partition and the number of users in the geographical partition;

[0023] Based on the user communication satisfaction corresponding to each geographical partition, the user communication satisfaction corresponding to the satellite quantity solution is determined.

[0024] In one embodiment, the target satellites to be accessed by each geographical partition are determined based on the number of target satellites to be accessed by each geographical partition, the user communication satisfaction, and the communication duration provided by the satellite for the geographical partition it serves, with the goal of maximizing satellite matching, including:

[0025] Connect the polar-orbiting satellites at the bottom layer of the satellite network to the geographical partition where their sub-satellite points are located, and determine the remaining satellites that can be connected to each geographical partition and the number of remaining satellites that can be connected to each geographical partition to initialize a satellite allocation solution set. The satellite allocation solutions in the satellite allocation solution set are used to describe the candidate satellites to be connected to each geographical partition.

[0026] Assign an initial position and velocity to each satellite;

[0027] Determine the satellite matching degree corresponding to each satellite allocation solution based on the user communication satisfaction corresponding to the number of target satellites actually accessed by each geographical partition and the communication duration provided by the candidate satellites for the geographical partition served by it;

[0028] Update the position and velocity corresponding to each satellite allocation solution according to the update formula, update the individual optimal position and the global optimal position based on the satellite matching degree corresponding to each satellite allocation solution, and determine whether the updated satellite allocation solution meets the satellite service constraints;

[0029] When the second iteration stop condition is met, the target satellite to be accessed by each geographical partition is determined.

[0030] In one embodiment, determining the satellite matching degree corresponding to each satellite allocation solution based on the user communication satisfaction corresponding to the number of target satellites actually accessed by each geographical partition and the communication duration provided by the candidate satellites for the geographical partition served by the candidate satellites includes:

[0031] For any satellite allocation solution, the satellite matching degree corresponding to the satellite allocation solution is determined according to the following formula:

[0032] ;

[0033] ;

[0034] in, Assign the satellite matching degree corresponding to the solution to the satellite, is the user communication satisfaction corresponding to the number of target satellites actually accessed in all geographical partitions, is the number of geographical partitions, The normalized result of the communication time provided by all candidate satellites for the geographical area they serve, The target number of satellites to be accessed for each geographical region, For the The communication time provided by the candidate satellites for the geographical area they serve, For the Rank The identifier of the geographic partition of the column, The maximum communication time provided to the satellite, 、 is a constant.

[0035] In one embodiment, the satellite service constraint includes: the candidate satellite is a satellite accessible to the geographical zone it serves, and the candidate satellite does not access other geographical zones.

[0036] In a second aspect, the present invention further provides a geographically partitioned multi-layer service access satellite distribution device, comprising:

[0037] a data acquisition module configured to acquire a set of geographical partitions and a communication coverage range corresponding to each satellite in a satellite network, the geographical partitions in the set of geographical partitions being obtained by dividing a surface of the earth according to a distribution rule of the satellite network, and all the geographical partitions in the set of geographical partitions being capable of covering the surface of the earth completely;

[0038] a first satellite allocation module configured to determine a satellite accessible by each geographical partition according to a positional relationship between each geographical partition and the communication coverage range corresponding to each satellite;

[0039] a satellite number determination module configured to determine a target number of satellites accessed by each geographical partition according to a number of users in each geographical partition and a number of users served by the satellite accessible by each geographical partition, with a user communication satisfaction degree as a target, the user communication satisfaction degree being an index for measuring whether the number of users served by the satellite can meet the number of users in the geographical partition;

[0040] a second satellite allocation module configured to determine a target satellite accessed by each geographical partition according to the target number of satellites accessed by each geographical partition, the user communication satisfaction degree, and a communication duration provided by the satellite for the geographical partition served by the satellite, with a satellite matching degree as a target, the satellite matching degree being an index for measuring whether the communication duration provided by the satellite accessed by the geographical partition can meet a communication demand of the geographical partition and whether the number of users served by the satellite can meet the number of users in the geographical partition, and the target satellite being accessed by each geographical partition, and for a satellite in the satellite network that is not accessed by any geographical partition, the satellite being accessed by a geographical partition corresponding to the longest communication duration.

[0041] In a third aspect, the present application further provides an electronic device including a processor and a memory, the memory storing computer executable instructions capable of being executed by the processor, and the processor executes the computer executable instructions to implement the method of any one of the first aspect.

[0042] In a fourth aspect, the present application further provides a computer readable storage medium storing computer executable instructions, and the computer executable instructions, when invoked and executed by a processor, cause the processor to implement the method of any one of the first aspect.

[0043] The application provides a multi-layer service access satellite distribution method for geographical zoning, which comprises the following steps: firstly, acquiring a geographical zoning set and a communication coverage range corresponding to each satellite in a satellite network; the geographical zoning set is obtained by dividing the earth surface according to the distribution rule of the satellite network, and all the geographical zoning in the geographical zoning set can completely cover the earth surface; then, determining the satellite accessible to each geographical zoning according to the positional relationship between each geographical zoning and the communication coverage range corresponding to each satellite; next, determining the target satellite number accessed by each geographical zoning according to the user number of each geographical zoning and the user number serviced by each satellite accessible to the geographical zoning, and taking the maximization of user communication satisfaction as the target; the user communication satisfaction is an index for measuring whether the user number serviced by the satellite can meet the user number of the geographical zoning; finally, determining the target satellite accessed by each geographical zoning according to the target satellite number accessed by each geographical zoning, the user communication satisfaction and the communication time length provided by the satellite for the geographical zoning, and taking the maximization of satellite matching degree as the target; the satellite matching degree is an index for measuring whether the communication time length provided by the satellite accessed by the geographical zoning can meet the communication demand of the geographical zoning, and whether the user number serviced by the satellite can meet the user number of the geographical zoning; in addition, the satellite not accessed is directly accessed to the geographical zoning corresponding to the longest communication time length.

[0044] Additional features and advantages of the application will be set forth in the description that follows, and in part will be apparent from the description, or can be learned by practice of the application. The objectives and other advantages of the application will be realized and attained by the structure particularly pointed out in the description and claims.

[0045] In order to make the above objectives, features and advantages of the present application more apparent, the following will specifically describe a preferred embodiment, and combine with the accompanying drawings, and make a detailed description as follows. BRIEF DESCRIPTION OF DRAWINGS

[0046] In order to more clearly illustrate the specific embodiments of the present application or the technical solutions in the prior art, the following will briefly introduce the drawings needed to be used in the specific embodiments or the prior art description. Obviously, the drawings described below are some embodiments of the present application, and for those skilled in the art, other drawings can also be obtained without creative labor on the basis of these drawings.

[0047] Figure 1 A flowchart of a multi-layer service access satellite distribution method for geographical zoning provided by an embodiment of the present application;

[0048] Figure 2 The overall flowchart of a geographic zoning-oriented multi-layer service access satellite distribution method provided by the embodiment of the present application is shown in the figure;

[0049] Figure 3 The satellite arrangement under a typical polar orbit constellation provided by the embodiment of the present application is shown in the figure;

[0050] Figure 4 The satellite arrangement under a typical inclined orbit constellation provided by the embodiment of the present application is shown in the figure;

[0051] Figure 5 The 16x16 equi-latitude and longitude geographic zoning schematic diagram provided by the embodiment of the present application is shown in the figure;

[0052] Figure 6 The communication coverage area schematic diagram of a low-orbit satellite beam to the ground provided by the embodiment of the present application is shown in the figure;

[0053] Figure 7 The particle swarm optimization algorithm flowchart provided by the embodiment of the present application is shown in the figure;

[0054] Figure 8 The structure schematic diagram of a geographic zoning-oriented multi-layer service access satellite distribution device provided by the embodiment of the present application is shown in the figure;

[0055] Figure 9 The structure schematic diagram of an electronic device provided by the embodiment of the present application is shown in the figure. DETAILED DESCRIPTION

[0056] In order to make the purpose, technical scheme and advantages of the embodiments of the present application more clear, the technical scheme of the present application will be described clearly and completely in combination with embodiments. Obviously, the described embodiments are some of the embodiments of the present application, but not all the embodiments of the present application. Based on the embodiments in the present application, all the other embodiments obtained by those skilled in the art without creative labor fall within the scope of protection of the present application.

[0057] At present, the existing satellite selection access methods include: (1) Research on multi-beam satellite communication systems in the Ka band, and studying the power optimization allocation algorithm with the goal of minimizing total power resources. (2) Research on the multi-dimensional resource allocation problem of multi-beam satellite communication, establishing a multi-objective optimization model based on the maximum number of users and maximizing system throughput, and proposing a multi-objective deep enhancement algorithm. (3) In the scenario where there is inter-beam interference in the multi-beam satellite system, with the service delay and inter-beam interference power limit as constraints, maximizing the satisfaction of the service demand of each point beam is the optimization goal to improve the system transmission rate. (4) Research on the situation of strong inter-beam interference, with the goal of minimizing the system delay experienced by users during data download, scheduling users, allocating bandwidth and power resources to alleviate inter-beam interference. (5) Research on the power allocation algorithm of multi-beam satellite communication systems in the Ka band, considering the impact of fixed rain attenuation on resource allocation, and ensuring the fairness of power allocation between beams. Compared with traditional resource allocation algorithms, the above resource allocation algorithms can improve resource utilization to a certain extent. However, most of them do not take into account the impact of complex link environments on satellite resource allocation. Even if they take into account the impact of rainfall on resource allocation between satellite beams, they only use fixed attenuation values ​​rather than dynamic rainfall attenuation. (6) Research on resource allocation between satellite users based on cooperative games. Using economic thinking, focusing on the idea of ​​cooperative games in economics, a set of resource allocation strategies is designed, a resource allocation model between satellite users based on cooperative games is established, and the optimization objective function of resource allocation is given. Then, the swarm intelligence algorithm Fruit Fly Algorithm is used to solve the Nash bargaining solution of the game problem.

[0058] As can be seen, existing satellite selection and access methods have problems with large-scale satellite network scenarios, and the rationality of satellite resource allocation needs to be improved. Based on this, the present invention provides a multi-layer service access satellite allocation method for geographical partitioning, which can reasonably allocate satellite resources to ground partitions in large-scale satellite network scenarios.

[0059] To facilitate understanding of this embodiment, the principle of a geographically partitioned multi-layer service access satellite allocation method provided by an embodiment of the present invention is first explained.

[0060] Low Earth Orbit (LEO) satellites are closer to the ground and have lower signal transmission delay, which can provide high-speed data communication services. In terms of communication, LEO satellite systems can provide high-speed and stable Internet access services, which are particularly important for communication needs in remote areas and mobile environments, such as providing stable Internet connections for remote mountainous areas, islands, and ships at sea. In military applications, LEO satellite communication terminals play an important role in improving the efficiency and security of military communication. A large-scale LEO satellite network is a network system composed of satellites deployed in low Earth orbits. Satellites have inter-satellite links and usually have on-board processing capabilities. LEO satellite network systems can realize information exchange between space and ground.

[0061] A large-scale composite LEO satellite network includes polar orbit and inclined orbit satellite constellations of different altitudes, ground stations, user terminals, ground control centers, and other related facilities. It not only integrates the advantages of low signal transmission delay and wide coverage of satellite communication, but also has the characteristics of mobile communication flexibility, high efficiency, and others. The ground control center can obtain the orbital and real-time position data of the satellites, as well as the situation of the ground users, and is responsible for the selection of satellite access. The ground control center can establish communication connections with LEO satellites, ground users, and ground stations. At the same time, the ground control center records the number of geographic partitions and the latitude and longitude range of each partition. In addition, the ground control center selects satellites to access geographic partitions and records the number of access satellites as well as the satellite number and type of access.

[0062] LEO satellites have low orbital altitudes, and a single satellite has a small communication coverage range on the Earth's surface. Therefore, a large number of satellites need to be deployed to achieve global coverage. Unlike ground networks, backbone satellite nodes in LEO satellite networks are always in motion, and LEO satellites and the ground are not relatively stationary, which causes all ground users to constantly face switching between access satellites. The address aggregation relationship between users and access satellites will be difficult to maintain directly. For LEO satellite users with characteristics such as high relative mobility, frequent link switching, and uneven user distribution, geographic information-based mobility management, i.e., IP address allocation and maintenance based on geographic location, can reduce the consumption of IP address allocation and maintenance. Therefore, satellite resource allocation is also based on geographic partitioning.

[0063] In a multi-layer LEO satellite network, there are multiple accessible satellites on each geographic partition, and each LEO satellite has multiple accessible regions. Different regions require different numbers of satellites, and the selection of satellite access based on ground user distribution and the length of time that satellites provide communication services for geographic partitions can meet the needs of ground users while minimizing satellite switching frequency to reasonably allocate satellite resources.

[0064] On this basis, a multi-layer service access satellite distribution method based on geographical zoning is disclosed in the embodiment of the application, and the method is described in detail with reference to Figure 1 The method mainly includes the following steps S102 to S108, as shown in a flowchart of a multi-layer service access satellite distribution method based on geographical zoning.

[0065] In step S102, a geographical zoning set and a communication coverage range corresponding to each satellite in a satellite network are obtained.

[0066] The geographical zoning in the geographical zoning set is obtained by dividing the earth surface according to the distribution rule of the satellite network, that is, the distribution rule of the divided geographical zoning is consistent with the distribution rule of the satellite network, and all the geographical zoning in the geographical zoning set can completely cover the earth surface; the communication coverage range is the range in which the satellite can provide communication services.

[0067] In step S104, the satellite accessible to each geographical zoning is determined according to the positional relationship between each geographical zoning and the communication coverage range corresponding to each satellite.

[0068] The relative positional relationship can be whether a specified point (such as a center point) of the geographical zoning is located in the communication coverage range. In an example, for any satellite, all the geographical zoning in which the specified point is located in the communication coverage range of the satellite can be regarded as the geographical zoning serviced by the satellite, so as to determine the satellite accessible to each geographical zoning.

[0069] In step S106, the target satellite quantity accessed by each geographical zoning is determined according to the user quantity of each geographical zoning and the user quantity serviced by the satellite accessible to each geographical zoning, with the maximum user communication satisfaction as the target.

[0070] The user communication satisfaction is an index for measuring whether the user quantity serviced by the satellite can satisfy the user quantity of the geographical zoning. In an example, the satellite quantity solution set can be initialized, the satellite quantity solution in the satellite quantity solution set is used to describe the alternative satellite quantity accessed by each geographical zoning, and the initial position and speed are assigned to the satellite quantity solution, then the user communication satisfaction is taken as the fitness value, the position and speed corresponding to the satellite quantity solution are updated according to the update formula, the individual optimal position and the global optimal position are updated, and the process is repeated until the first iteration stopping condition is met, and the target satellite quantity accessed by each geographical zoning is obtained.

[0071] Step S108, according to the number of target satellites accessed by each geographical partition, the user communication satisfaction degree and the communication time length provided by the satellite for the geographical partition it serves, the target satellite accessed by each geographical partition is determined, and for the satellite in the satellite network which has not accessed the geographical partition, the satellite is accessed to the geographical partition corresponding to the longest communication time length.

[0072] Wherein, the satellite matching degree is an index for measuring whether the communication time length provided by the satellite accessed by the geographical partition can meet the communication demand of the geographical partition, and whether the number of users that can be served by the satellite can meet the number of users of the geographical partition. In an example, for the polar orbit satellite at the bottom layer, it directly accesses the geographical partition where the subsatellite point is located, on this basis, the satellite assignment solution set is initialized, the satellite assignment solution in the satellite assignment solution set is used to describe the candidate satellite accessed by each geographical partition, and the initial position and speed are assigned to the satellite assignment solution, then the satellite matching degree is taken as the fitness value, the position and speed corresponding to the satellite assignment solution are updated according to the update formula, each satellite assignment solution is evaluated, the individual optimal position and the global optimal position are updated, and the process is repeated until the second iteration stopping condition is met, and the target satellite accessed by each geographical partition is obtained.

[0073] Further, for the satellite in the satellite network which has not accessed the geographical partition, the satellite is accessed to the geographical partition corresponding to the longest communication time length. In actual application, the communication time length provided by the same satellite for different geographical partitions is different, if there is still a satellite which has not accessed a certain geographical partition after the above iteration distribution, the geographical partition corresponding to the longest communication time length provided by the satellite is taken as the geographical partition accessed by the satellite.

[0074] The multi-layer service access satellite distribution method for geographical partition provided by the embodiment of the application can be applied to the scene of large-scale satellite network, considers the user distribution in the ground partition and the satellite accessed by the satellite for the geographical partition to provide the communication time length, can meet the demand of ground users, and makes the satellite switching frequency smaller, and realizes more reasonable distribution of satellite resources.

[0075] For the convenience of understanding, the embodiment of the application provides a specific implementation mode of the multi-layer service access satellite distribution method for geographical partition, which is described with reference to Figure 2The overall process diagram of a multi-layer service access satellite allocation method for geographical partitioning is shown in FIG. The main ideas are as follows: (1) Based on the distribution law of the lowest-level polar orbit satellite network, the earth's surface is divided into a corresponding number of ground partitions; (2) According to the communication coverage area including the center point of the geographical partition, the satellite is determined to be able to serve the geographical partition, thereby determining all the satellites that can be accessed in the geographical partition; (3) Based on the particle swarm optimization algorithm, according to the number of users in the geographical partition, with the goal of maximizing user communication satisfaction, the number of target satellites accessing the geographical partition is calculated; (4) Based on the particle swarm optimization algorithm, according to the number of target satellites accessing the geographical partition, user communication satisfaction and the communication time that the satellite can provide in the geographical partition, the target satellites accessed by the geographical partition are determined with the goal of maximizing satellite matching; for the remaining satellites that have not been accessed to the geographical partition, the geographical partition with the longest access communication time is selected; among them, the lowest-level polar orbit satellite directly accesses the geographical partition where the sub-satellite point is located to ensure that at least one satellite serves one area; (5) After determining the target satellites accessed by each geographical partition, the satellite matching is recalculated and analyzed to judge the rationality of the scheme.

[0076] The specific steps of the embodiment of the present invention are as follows:

[0077] (1) Based on the distribution pattern of the lowest-level polar orbit satellite network, the Earth's surface is divided into a corresponding number of ground partitions.

[0078] The distribution pattern of the polar orbit satellite network at the bottom layer is as follows: the polar orbit satellite network includes multiple orbits with the same radius. In each polar orbit plane, the latitude difference between two adjacent satellite nodes is the same, the angle between the planes of adjacent polar orbits is the same, and the satellites in two adjacent orbit planes are staggered. Each satellite is located on the perpendicular bisector between the two adjacent satellites in the adjacent orbit. Figure 3 The satellite arrangement in a typical polar orbit constellation is shown. satellites, forming a mesh topology, in which represents a polar orbiting constellation, is the number of orbital planes, The number of satellites in each orbital plane is Figure 3 in For example, it represents a polar orbit constellation middle =1, = 4, i.e. the fourth satellite in the first orbital plane; and see Figure 4 The satellite arrangement in a typical inclined orbit constellation is shown. satellites, among which, represents an inclined orbit constellation, is the number of orbital planes, is the number of satellites in each orbit, Figure 4 in For example, it represents an inclined orbit constellation middle =1, =3, that is, the third satellite in the first orbital plane.

[0079] In one application example, a two-tier low-orbit satellite network is deployed, totaling 1,024 satellites. The single-tier satellite network consists of a dual-orbit composite low-orbit constellation. Specifically, the first-tier satellite network comprises a 16x16 polar orbit constellation and a 16x16 inclined orbit constellation, totaling approximately 500 satellites. The single-tier polar orbit satellites consist of a Walker Star polar orbit constellation with an 86-degree inclination, spanning 16 orbital planes, each with 16 satellites. The first-tier polar orbit satellites have an altitude of 1,000 km. The single-tier inclined orbit satellites consist of a Walker Delta inclined orbit constellation with an 60-degree inclination, spanning 16 orbital planes, each with 16 satellites. The first-tier inclined orbit satellites have an altitude of 1,050 km, totaling 512 satellites. The second-tier satellite network consists of a 16×16 polar orbit constellation and a 16×16 inclined orbit constellation. The inclination angle of the polar orbit constellation satellites is 90 degrees, and the inclination angle of the inclined orbit constellation satellites is 60 degrees. The altitude of the second-tier polar orbit satellites is 1,100 km, and the altitude of the inclined orbit satellites is 1,150 km.

[0080] The bottom polar orbit has a total of 16×16 satellite nodes, wherein the number of operating orbital planes of the bottom polar orbit satellite is 16, and the number of satellite nodes in each of the operating orbital planes is 16.

[0081] See also Figure 5 This is a 16×16 schematic diagram of equal longitude and latitude geographical divisions. The Earth's surface is divided into 16×16 geographical divisions based on equal longitude and latitude according to the distribution pattern of the polar orbit satellite network at the bottom layer. Figure 5 In this example, only 16×8 equal longitude and latitude geographical divisions within the range of -180° to 0° are taken as an example. Representative OK, Representative The distribution pattern of geographical partitions should conform to the distribution pattern of satellite network. Two adjacent geographical partitions are staggered, and each geographical partition is located between the perpendicular bisectors of two adjacent geographical partitions in the adjacent orbit. For example, lie in and According to the longitude and latitude geographic coordinate system, the ground location area is based on longitude. ,latitude The starting point of the ground location area division is latitude ,longitude The location of the partition is then numbered from south to north and from west to east. The longitude span of each geographical partition is , the latitude span is .

[0082] (2) Based on the satellite communication coverage including the center point of the geographical partition, determine the geographical partition that the satellite can serve, and thus determine all the accessible satellites in the geographical partition.

[0083] In one embodiment, the method includes the following (2.1) to (2.2):

[0084] (2.1) For any satellite, perform the following operations: determine the coverage radius of the communication coverage area corresponding to the satellite, and determine the distance between the sub-satellite point of the satellite and a designated point of any geographical partition; determine whether the designated point of the geographical partition is within the communication coverage area based on the coverage radius and distance; if the determination result is yes, determine the geographical partition as a geographical partition that can be served by the satellite.

[0085] Determine whether the satellite's communication coverage includes the center point of the geographical partition. If so, determine that the satellite can serve the geographical partition. Figure 6 The diagram shows a low-orbit satellite beam communication coverage area on the ground. The low-orbit satellite beam communication coverage area on the ground can be approximated as a spherical circle. Assume that the radius of the low-orbit satellite communication coverage range is , satellite subsatellite point and geographical partition center The distance is .if , it is determined that the satellite can access the geographical partition. The calculation formula for the distance between the satellite sub-satellite point and the center point of the geographical partition is as follows:

[0086] ;

[0087] Where R represents the radius of the earth, the subsatellite point The latitude is , longitude is , geographical division center point The latitude is , longitude is . 、 、 、 It must be expressed in radians. The communication coverage area of ​​the low-orbit satellite beam on the ground can be approximated as a spherical circle. From the figure we can see that the satellite coverage radius for: .in, represents the satellite elevation angle, and h represents the orbit height of the satellite. Thus, the distance from the subsatellite point of all satellites to the center point of the geographical partition is calculated by traversal, and then all accessible satellites of each geographical partition are determined.

[0088] The ground communication coverage radius of all satellites and the distance from the subsatellite point to the center point of the geographical partition are calculated by traversal, and then all accessible satellites of each geographical partition are determined.

[0089] During the satellite operation, since the communication coverage range of the satellite exceeds the area of the geographical partition, even if the subsatellite point of the satellite is not located in the geographical partition, the satellite can still serve as the access management satellite of the geographical partition. Meanwhile, there are multiple accessible satellites on each geographical partition, and each low-orbit satellite can select multiple accessible geographical partitions, so the number of all satellites that can be accessed by each geographical partition in theory is obtained. .

[0090] (2.2) Based on the geographical partition that can be served by each satellite, the satellite that can be accessed by each geographical partition and the number of the satellite are determined. In the specific implementation, the geographical partition that can be served by each satellite is known, and thus the satellite that can be accessed by each geographical partition and the number of the satellite are reversely determined.

[0091] (3) Based on the particle swarm optimization algorithm, the target number of satellites accessed by the geographical partition is calculated according to the number of users in the geographical partition, with the maximum user communication satisfaction as the target.

[0092] In the specific implementation, the following (3.1) to (3.5) are included:

[0093] (3.1) Initialize the satellite number solution set. The satellite number solution in the satellite number solution set is used to describe the number of candidate satellites accessed by each geographical partition.

[0094] (3.2) Assign an initial position and speed to each satellite number solution.

[0095] (3.3) According to the number of users in each geographical partition, the number of users that can be served by each satellite accessible to the geographical partition, and the number of candidate satellites accessed by each geographical partition described by each satellite number solution, the user communication satisfaction corresponding to each satellite number solution is determined.

[0096] In one embodiment, the following operations are performed for any satellite number solution:

[0097] For any geographical partition, the number of users served by all satellites accessible to the geographical partition is determined according to the number of satellites accessible to the geographical partition and the number of alternative satellites accessible to the geographical partition described by the number of satellites solution; the user communication satisfaction degree corresponding to the geographical partition is determined according to the number of users in the geographical partition and the number of users served by all satellites accessible to the geographical partition.

[0098] Based on the user communication satisfaction degree corresponding to each geographical partition, the user communication satisfaction degree corresponding to the number of satellites solution is determined.

[0099] Specifically, the user communication satisfaction degree A target function is established with the goal of maximizing the communication satisfaction degree. Wherein, is the number of orbital planes, is the number of satellites for each orbital plane, and the communication satisfaction degree of the geographical partition The calculation formula is as follows:

[0100] ;

[0101] Wherein, represents the number of users served by all satellites accessible to the geographical partition, , the number of users in the geographical partition is , the number of users served by a single satellite is , represents the number of alternative satellites accessible to the geographical partition.

[0102] (3.4) Update the position and velocity corresponding to each satellite number solution according to the update formula, update the individual optimal position and global optimal position based on the user communication satisfaction degree corresponding to each satellite number solution, and at the same time, determine whether the updated satellite number solution satisfies the satellite number constraint.

[0103] Wherein, the satellite number constraint is that the sum of the number of satellites accessible to all geographical partitions is equal to the total number of satellites; and the number of satellites accessible to any geographical partition is less than or equal to the number of all satellites that can be theoretically accessed by the geographical partition. Its expression is as follows:

[0104] ;

[0105] ;

[0106] Wherein, represents the number of alternative satellites accessible to the geographical partition, the number of all satellites that can be theoretically accessed by the geographical partition.

[0107] (3.5) Repeat the above (3.3) to (3.4), and when the first iteration stopping condition is met, determine the target number of satellites to be accessed by each geographical partition. The first iteration stopping condition may include reaching a predetermined number of iterations and the user communication satisfaction convergence.

[0108] (4) Based on the particle swarm optimization algorithm, the target satellites to be connected to the geographical partition are determined by maximizing the satellite matching degree according to the number of target satellites connected to the geographical partition, the user communication satisfaction and the communication time that the satellite can provide in the geographical partition. Among them, the polar orbit satellites at the bottom layer are directly connected to the geographical partition where the sub-satellite point is located to ensure that there is at least one satellite service in each partition.

[0109] In the specific implementation, it includes the following (4.1) to (4.5):

[0110] (4.1) Connect the polar-orbiting satellites at the bottom layer of the satellite network to the geographical partition where their sub-satellite points are located, and determine the remaining satellites that can be connected to each geographical partition and the number of remaining satellites that can be connected to each geographical partition to initialize the satellite allocation solution set.

[0111] In one example, the polar-orbiting satellite at the lowest level directly accesses the geographical partition where the sub-satellite point is located and does not participate in the following satellite selection method based on the particle swarm optimization algorithm. That is, the polar-orbiting satellite at the lowest level is deleted from the satellites accessible to the geographical partition it serves, and the remaining satellites accessible to the geographical partition and the remaining number of satellites accessible to each geographical partition are updated. The remaining satellites accessible to each geographical partition and the remaining number of satellites accessible to each geographical partition are used to initialize the satellite allocation solution set. The satellite allocation solutions in the satellite allocation solution set are used to describe the candidate satellites accessible to each geographical partition.

[0112] The initialization process requires setting algorithm-related parameters, such as population size, particle dimension, maximum number of iterations, and inertia weight. Random initialization generates the initial population, randomly generates the initial positions and velocities of a group of particles (i.e., the satellite allocation solution), and initializes the optimal individual position and optimal group position.

[0113] (4.2) Assign the initial position and velocity to each satellite.

[0114] (4.3) Determine the satellite matching degree corresponding to each satellite allocation solution based on the user communication satisfaction corresponding to the number of target satellites actually connected to each geographical partition and the communication duration provided by the candidate satellites to the geographical partition served.

[0115] In one embodiment, for any satellite allocation solution, the satellite matching degree corresponding to the satellite allocation solution is determined according to the following formula:

[0116] ;

[0117] ;

[0118] wherein, is the satellite matching degree corresponding to the satellite assignment solution, is the user communication satisfaction degree corresponding to the number of target satellites accessed by all geographical partitions, is the number of geographical partitions, is the normalized result of the communication duration provided by all candidate satellites for the geographical partitions served thereby, is the number of target satellites accessed by each geographical partition, is the communication duration provided by the th candidate satellite for the geographical partitions served thereby, is the identification of the geographical partition in the th row and the th column, is the longest communication duration provided by the satellite, , is a constant.

[0119] (4.4) Update the position and velocity corresponding to each satellite assignment solution according to the update formula, update the individual optimal position and the global optimal position based on the satellite matching degree corresponding to each satellite assignment solution, and simultaneously determine whether the updated satellite assignment solution satisfies the satellite service constraint.

[0120] The process of updating the satellite assignment solutions contained in the satellite assignment solution set is as follows: the velocity of the updating particle is calculated according to the formula:

[0121]

[0122] The position of the updating particle is calculated according to the formula:

[0123] ;

[0124] wherein, , represents the particle number; represents the velocity and direction of the th particle in the latitude of the search space; represents the inertia weight; and are uniform random numbers in the range of (0, 1); and represent the acceleration factor, represents the individual acceleration coefficient, represents the group acceleration coefficient; represents the velocity and direction of the th particle in the latitude the position coordinates of the gth particle in the th iteration, that is, the position coordinates of the gth particle in the th iteration In the th iteration, the position coordinates of the gth particle in the th iteration, that is, the position coordinates of the gth particle in the th iteration In the th iteration, the position coordinates of the gth particle in the th iteration, that is, the position coordinates of the gth particle in the th iteration In the th iteration, the position coordinates of the gth particle in the th iteration, that is, the position coordinates of the gth particle in the th iteration In the th iteration, the position coordinates of the gth particle in the th iteration, that is, the position coordinates of the gth particle in the th iteration In the th iteration, the position coordinates of the gth particle in the th iteration, that is, the position coordinates of the gth particle in the th iteration In the th iteration, the position coordinates of the gth particle in the th iteration, that is, the position coordinates of the gth particle in the th iteration In the th iteration, the position coordinates of the gth particle in the th iteration, that is, the position coordinates of the gth particle in the th iteration In the th iteration, the position coordinates of the gth particle in the th iteration, that is, the position coordinates of the gth particle in the th iteration

[0125] Further, the satellite service constraint includes: the alternative satellite belongs to the satellite accessible to the geographical partition it serves, and the alternative satellite does not access other geographical partitions. The embodiment of the application judges whether the communication range covers the geographical partition, and judges whether the satellite has accessed other geographical partitions. Only when the satellite communication range covers the area and the satellite does not access other partitions, the next step is performed. The expression of the satellite service constraint is as follows:

[0126] For each satellite, it is necessary to judge whether the satellite communication range can serve the geographical partition :

[0127] ;

[0128] wherein, represents whether the gth satellite communication range can cover the geographical partition ;

[0129] For each satellite selected to access the geographical partition, it is necessary to judge whether the satellite has accessed other geographical partitions. If the satellite has established a connection with other geographical partitions, it will not access the geographical partition:

[0130] ;

[0131] wherein, represents whether the satellite has accessed other geographical partitions.

[0132] (4.5) Repeat the foregoing (4.3) to (4.4), and when the second iteration stop condition is met, determine the target satellite accessed by each geographical partition. The second iteration stop condition can include reaching a predetermined number of iterations and a convergence coefficient being lower than a preset value.

[0133] In one example, the satellite matching degree corresponding to each satellite distribution solution is updated, and the individual optimal position and the global optimal position are updated. For each satellite distribution solution, the current fitness is compared with the individual optimal fitness, the individual optimal position is updated, the individual optimal fitness is compared with the global optimal fitness, the global optimal position is updated, and the global optimal solution is obtained. Whether the termination condition is satisfied is judged. If the termination condition is satisfied, the iteration is stopped, that is, the maximum iteration number is reached and the fitness is stable in a certain range. The optimization is ended and the global optimal solution is returned, that is, the target satellite accessed by the geographic partition, and the satellite that has accessed the region is marked and cannot access other geographic partitions. Otherwise, the iteration is continued.

[0134] In summary, the embodiment of the present application provides a satellite distribution method for multi-layer service access to geographic partition as shown in Figure 7 The flow chart of the particle swarm optimization algorithm includes: 1) setting the parameters of the particle swarm optimization algorithm and randomly initializing the particle swarm; 2) calculating the fitness value of each particle according to the target function (that is, the satellite matching degree function), and evaluating the global optimal solution (that is, the optimal satellite distribution solution); 3) calculating the speed of the updated particle according to the speed update formula, and calculating the position of the updated particle according to the position update formula; 4) judging whether the updated particle, that is, the satellite, satisfies the access region condition; 5) updating the fitness value of the particle, and updating the individual optimal position and the global optimal position; 6) judging whether the termination condition is satisfied. If the termination condition is satisfied, the iteration is stopped and the global optimal solution is output. If the termination condition is not satisfied, the step 3) is returned.

[0135] Further, for the satellite in the satellite network that has not accessed the geographic partition, the satellite is accessed to the geographic partition corresponding to the longest communication duration. In actual application, the communication duration provided by the same satellite for different geographic partitions is different. If there is still a satellite that has not accessed a certain geographic partition after the iteration distribution, the geographic partition corresponding to the longest communication duration provided by the satellite is taken as the geographic partition accessed by the satellite.

[0136] (5) After determining the target satellite accessed by each geographic partition, the satellite matching degree is recalculated and analyzed to judge the rationality of the scheme. In one example, after determining the target satellite accessed by each geographic partition, the satellite matching degree corresponding to each satellite distribution solution is determined by using the calculation formula of the satellite matching degree, according to the user communication satisfaction degree corresponding to the actual number of target satellites accessed by each geographic partition and the communication duration provided by the geographic partition served by the target satellite, so as to evaluate the rationality of the scheme.

[0137] In summary, the satellite distribution method for multi-layer service access to geographic partition provided by the embodiment of the present application has at least the following characteristics:

[0138] (1) Compared with a traditional satellite resource allocation method, the method provided in the embodiment of the application is applicable to a large-scale satellite network scenario, and the number of satellite nodes reaches more than 1000.

[0139] (2) The method provided in the embodiment of the application realizes reasonable satellite-ground resource allocation, ensures that the ground communication demand is met, and makes the satellite provide as long a communication service duration as possible for the region to be connected, thereby reducing the switching frequency. Meanwhile, the low-orbit satellite network has the characteristics of relatively large mobility, frequent link switching, and uneven user distribution, and the related management of mobility is performed based on geographic information, that is, the IP address is allocated and maintained according to the geographic location, which can reduce the consumption of IP address allocation and maintenance. Therefore, the embodiment of the application proposes satellite resource allocation based on geographic partitioning, so as to realize reasonable resource allocation.

[0140] On the basis of the foregoing embodiment, the embodiment of the application provides a geographic partitioning-oriented multi-layer service access satellite allocation device, which refers to a structure schematic diagram of a geographic partitioning-oriented multi-layer service access satellite allocation device as shown in Figure 8 The device mainly includes the following parts:

[0141] The data acquisition module 802 is configured to acquire a geographic partitioning set and a communication coverage range corresponding to each satellite in the satellite network. The geographic partitioning set is obtained by dividing the earth's surface according to the distribution rule of the satellite network, and all the geographic partitionings in the geographic partitioning set can completely cover the earth's surface.

[0142] The first satellite allocation module 804 is configured to determine the satellite accessible to each geographic partitioning according to the positional relationship between each geographic partitioning and the communication coverage range corresponding to each satellite.

[0143] The satellite number determination module 806 is configured to determine the target satellite number accessed by each geographic partitioning according to the number of users in each geographic partitioning and the number of users served by the satellite accessible to each geographic partitioning, with the maximum user communication satisfaction degree as the target, the user communication satisfaction degree being an index for measuring whether the number of users served by the satellite can meet the number of users in the geographic partitioning.

[0144] The second satellite allocation module 808 is configured to determine the target satellite accessed by each geographic partitioning according to the target satellite number accessed by each geographic partitioning, the user communication satisfaction degree, and the communication duration provided by the satellite for the geographic partitioning served thereby, with the maximum satellite matching degree as the target. For the satellite in the satellite network that does not access the geographic partitioning, the satellite is accessed to the geographic partitioning corresponding to the longest communication duration, and the satellite matching degree is an index for measuring whether the communication duration provided by the satellite accessed by the geographic partitioning can meet the communication demand of the geographic partitioning and whether the number of users served by the satellite can meet the number of users in the geographic partitioning.

[0145] The multi-layer service access satellite allocation device for geographical partitioning provided by an embodiment of the present invention can be applied to the scenario of large-scale satellite networks. It takes into account the user distribution within the ground partition and the satellite providing communication time allocation access for the geographical partition. It can meet the needs of ground users while reducing the satellite switching frequency and realizing more reasonable allocation of satellite resources.

[0146] In one embodiment, the first satellite allocation module 804 is specifically configured to:

[0147] For any satellite, the following operations are performed: determining a coverage radius of a communication coverage range corresponding to the satellite, and determining a distance between a sub-satellite point of the satellite and a designated point of any geographical partition; determining whether the designated point of the geographical partition is within the communication coverage range based on the coverage radius and the distance; and if so, determining the geographical partition as a geographical partition serviceable by the satellite;

[0148] Based on the geographical areas that each satellite can serve, the satellites and the number of satellites that can be accessed in each geographical area are determined.

[0149] In one embodiment, the satellite quantity determination module 806 is specifically configured to:

[0150] Initialize a set of satellite quantity solutions, where the satellite quantity solutions in the set are used to describe the number of candidate satellites accessed by each geographical partition;

[0151] Assign initial position and velocity to each satellite number;

[0152] Determine the user communication satisfaction corresponding to each satellite number solution based on the number of users in each geographical partition, the number of users serviceable by the satellites accessible to each geographical partition, and the number of candidate satellites accessible to each geographical partition described by each satellite number solution;

[0153] Update the position and velocity corresponding to each satellite number solution according to the update formula. Update the individual optimal position and the global optimal position based on the user communication satisfaction corresponding to each satellite number solution. At the same time, determine whether the updated satellite number solution meets the satellite number constraint.

[0154] When the first iteration stopping condition is met, the target number of satellites accessed by each geographical partition is determined.

[0155] In one embodiment, the satellite quantity determination module 806 is specifically configured to:

[0156] For any number of satellites, perform the following operations:

[0157] For any geographical partition, the number of users served by all satellites accessible to the geographical partition is determined according to the number of users served by satellites accessible to the geographical partition and the number of alternative satellites accessible to the geographical partition described by the satellite number solution; the user communication satisfaction degree corresponding to the geographical partition is determined according to the number of users served by all satellites accessible to the geographical partition and the number of users in the geographical partition.

[0158] Based on the user communication satisfaction degree corresponding to each geographical partition, the user communication satisfaction degree corresponding to the satellite number solution is determined.

[0159] In an implementation, the second satellite distribution module 808 is specifically configured to:

[0160] The polar orbit satellite at the bottom layer of the satellite network is accessed to the geographical partition where the subsatellite point of the polar orbit satellite is located, and the remaining satellites accessible to each geographical partition and the number of the remaining satellites accessible to each geographical partition are determined, so as to initialize the satellite distribution solution set, and the satellite distribution solution in the satellite distribution solution set is used to describe the alternative satellite accessible to each geographical partition.

[0161] An initial position and velocity are assigned to each satellite distribution solution;

[0162] The satellite matching degree corresponding to each satellite distribution solution is determined according to the user communication satisfaction degree corresponding to the number of target satellites actually accessible to each geographical partition and the communication duration provided by the alternative satellite for the geographical partition;

[0163] The position and velocity corresponding to each satellite distribution solution are updated according to the update formula, the individual optimal position and the global optimal position are updated based on the satellite matching degree corresponding to each satellite distribution solution, and it is determined whether the updated satellite distribution solution satisfies the satellite service constraint;

[0164] When the second iteration stop condition is satisfied, the target satellite accessible to each geographical partition is determined.

[0165] In an implementation, the second satellite distribution module 808 is specifically configured to:

[0166] For any satellite distribution solution, the satellite matching degree corresponding to the satellite distribution solution is determined according to the following formula:

[0167] ;

[0168] ;

[0169] wherein, the satellite matching degree corresponding to the satellite distribution solution is, the user communication satisfaction degree corresponding to the number of target satellites accessible to all geographical partitions, the number of geographical partitions, a normalization of the communication duration provided for the geographical partition served by the alternative satellite, a number of target satellites accessed for each geographical partition, a communication duration provided for the geographical partition served by the alternative satellite, a communication duration provided for the geographical partition served by the alternative satellite, a communication duration provided for the geographical partition served by the alternative satellite, a communication duration provided for the geographical partition served by the alternative satellite, an identification of the geographical partition of the line of the column, a longest communication duration provided for the satellite, , a constant.

[0170] In an embodiment, the satellite service constraint comprises that the geographical partition served by the alternative satellite is accessible by the satellite to which the alternative satellite belongs and that the alternative satellite does not access other geographical partitions.

[0171] The apparatus provided by the embodiments of the present application has the same implementation principle and technical effects as the foregoing method embodiments, and for brief description, the part not mentioned in the apparatus embodiment can be referred to the corresponding content in the foregoing method embodiments.

[0172] The electronic device provided by the embodiments of the present application comprises a processor and a memory. The memory stores a computer program. When the computer program is executed by the processor, the method according to any one of the embodiments described above is executed.

[0173] Figure 9 The electronic device provided by the embodiments of the present application comprises a processor and a memory. The memory stores a computer program. When the computer program is executed by the processor, the method according to any one of the embodiments described above is executed.

[0174] The memory 91 can include a high-speed random access memory (RAM) and can also include a non-volatile memory, such as at least one disk memory. The communication connection between the system network element and at least one other network element is realized through at least one communication interface 93 (which can be wired or wireless), and the Internet, a wide area network, a local area network, a metropolitan area network, etc. can be used.

[0175] The bus 92 can be an ISA bus, a PCI bus, an EISA bus, etc. The bus can be divided into an address bus, a data bus, a control bus, etc. For the sake of brevity, Figure 9 only one bidirectional arrow is used to represent the bus, but it does not mean that there is only one bus or only one type of bus.

[0176] The memory 91 is configured to store a program, and the processor 90 executes the program after receiving an execution instruction. The method performed by the device for defining a flow process according to any of the foregoing embodiments of the present application can be applied to the processor 90 or implemented by the processor 90.

[0177] The processor 90 can be an integrated circuit chip having a processing capability of signals. In the implementation process, each step of the foregoing method can be completed by an integrated logic circuit of hardware in the processor 90 or an instruction in the form of software. The foregoing processor 90 can be a general-purpose processor, including a central processing unit (CPU), a network processor (NP), and the like; or can be a digital signal processor (DSP), an application specific integrated circuit (ASIC), a field-programmable gate array (FPGA) or other programmable logic device, a discrete gate or transistor logic device, a discrete hardware component. Each method, step and logic block diagram disclosed in the embodiments of the present application can be implemented or executed. The general-purpose processor can be a microprocessor or the processor can also be any conventional processor. The steps of the method disclosed in combination with the embodiments of the present application can be directly embodied as a hardware code processor for execution, or a combination of hardware and software modules in the code processor for execution. The software module can be located in a random access memory, a flash memory, a read-only memory, a programmable read-only memory or an electrically erasable programmable memory, a register, or other mature storage media in the art. The storage medium is located in the memory 91, and the processor 90 reads the information in the memory 91 and combines the hardware to complete the steps of the foregoing method.

[0178] The computer program product of the readable storage medium provided by the embodiments of the present application includes a computer readable storage medium storing a program code, and the program code includes instructions for executing the method described in the foregoing method embodiments. For specific implementation, reference can be made to the foregoing method embodiments, which will not be described here.

[0179] If the functions are realized in the form of software function units and sold or used as independent products, they can be stored in a computer readable storage medium. Based on this understanding, the technical solutions of the present application or the parts of the present application that essentially contribute to the prior art or the parts of the technical solutions can be embodied in the form of a software product. The computer software product is stored in a storage medium and includes instructions for making a computer device (which can be a personal computer, a server, or a network device, etc.) execute all or part of the steps of the method described in the embodiments of the present application. The aforementioned storage medium includes: a U disk, a mobile hard disk, a read-only memory (ROM, Read-Only Memory), a random access memory (RAM, Random Access Memory), a magnetic disk or an optical disk, and various media that can store program codes.

[0180] Finally, it should be noted that: the above-described embodiments are only specific embodiments of the present application, which are used to illustrate the technical solutions of the present application, but not to limit them. The protection scope of the present application is not limited to this. Although the present application has been described in detail with reference to the foregoing embodiments, those skilled in the art should understand that any person skilled in the art can modify or easily think of changes to the technical solutions recorded in the foregoing embodiments within the technical range disclosed by the present application, or make equivalent replacements to some technical features. The modifications, changes or replacements do not make the corresponding technical solutions deviate from the spirit and scope of the technical solutions of the embodiments of the present application, and should be covered within the protection scope of the present application. Therefore, the protection scope of the present application should be subject to the protection scope of the claims.

Claims

1. A method for allocating multi-layer service access satellites for geographical partitioning, characterized in that: include: Obtaining a set of geographic partitions and a communication coverage range corresponding to each satellite in a satellite network, wherein the geographic partitions included in the set of geographic partitions are obtained by dividing the earth's surface according to a distribution pattern of the satellite network, and all the geographic partitions in the set of geographic partitions can completely cover the earth's surface; Determining the satellite accessible to each geographical partition according to a positional relationship between each geographical partition and the communication coverage area corresponding to each satellite; Determining a target number of satellites accessible to each geographical partition based on the number of users in each geographical partition and the number of users serviceable by the satellite accessible to each geographical partition, with the goal of maximizing user communication satisfaction, wherein the user communication satisfaction is an indicator measuring whether the number of users serviceable by the satellite can meet the number of users in the geographical partition; Based on the number of target satellites accessed by each geographical partition, the user communication satisfaction, and the communication duration provided by the satellite for the geographical partition it serves, with the goal of maximizing satellite matching, the target satellite accessed by each geographical partition is determined. For the satellites in the satellite network that are not accessed by the geographical partition, the satellites are connected to the geographical partition corresponding to the longest communication duration. The satellite matching degree is an indicator that measures whether the communication duration provided by the satellites accessed by the geographical partition can meet the communication needs of the geographical partition, and whether the number of users that can be served by the satellite can meet the number of users in the geographical partition.

2. The method for allocating multi-layer service access satellites for geographical partitioning according to claim 1, characterized in that: Determining the satellite accessible to each geographical partition according to a positional relationship between each geographical partition and the communication coverage area corresponding to each satellite includes: For any of the satellites, the following operations are performed: determining a coverage radius of the communication coverage range corresponding to the satellite, and determining a distance between a sub-satellite point of the satellite and a designated point of any of the geographical partitions; determining whether the designated point of the geographical partition is within the communication coverage range based on the coverage radius and the distance; and if so, determining the geographical partition as a geographical partition serviceable by the satellite; Based on the geographical zones serviceable by each satellite, the satellites accessible to each geographical zone and the number of satellites accessible to each geographical zone are determined.

3. The method for allocating multi-layer service access satellites for geographical partitioning according to claim 1, characterized in that: According to the number of users in each of the geographical partitions and the number of users serviceable by the satellites accessible to each of the geographical partitions, with the goal of maximizing user communication satisfaction, determining a target number of satellites accessible to each of the geographical partitions, including: Initializing a set of satellite quantity solutions, where the satellite quantity solutions in the set of satellite quantity solutions are used to describe the number of candidate satellites accessed by each of the geographical partitions; allocating an initial position and velocity to each of the number of satellites; Determining a user communication satisfaction degree corresponding to each satellite quantity solution according to the number of users in each geographic partition, the number of users serviceable by the satellite accessible to each geographic partition, and the number of candidate satellites accessible to each geographic partition described by each satellite quantity solution; updating the position and velocity corresponding to each of the satellite number solutions according to an update formula, updating the individual optimal position and the global optimal position based on the user communication satisfaction corresponding to each of the satellite number solutions, and determining whether the updated satellite number solution satisfies the satellite number constraint; When the first iteration stopping condition is met, the target number of satellites accessed by each of the geographical partitions is determined.

4. The method for allocating multi-layer service access satellites for geographical partitioning according to claim 3, characterized in that: Determining, according to the number of users in each geographical partition, the number of users serviceable by the satellite accessible to each geographical partition, and the number of candidate satellites accessible to each geographical partition described by each satellite number solution, a user communication satisfaction corresponding to each satellite number solution, including: For any of the satellite number solutions, perform the following operations: For any of the geographical partitions, determining the number of users serviceable by all the satellites accessed by the geographical partition based on the number of users serviceable by the satellites accessible to the geographical partition and the number of candidate satellites accessed by the geographical partition as described by the number of satellites; determining the user communication satisfaction corresponding to the geographical partition based on the number of users serviceable by all the satellites accessed by the geographical partition and the number of users in the geographical partition; Based on the user communication satisfaction corresponding to each of the geographical partitions, the user communication satisfaction corresponding to the satellite quantity solution is determined.

5. The method for allocating multi-layer service access satellites for geographical partitioning according to claim 1, characterized in that: Determining the target satellite for access by each geographical partition according to the number of target satellites accessed by each geographical partition, the user communication satisfaction, and the communication duration provided by the satellite for the geographical partition served by the satellite, with the goal of maximizing satellite matching, includes: Accessing the polar-orbiting satellite in the lowest layer of the satellite network to the geographical partition where its sub-satellite point is located, and determining the remaining satellites accessible to each of the geographical partitions and the number of remaining satellites accessed to each of the geographical partitions, so as to initialize a set of satellite allocation solutions, wherein the satellite allocation solutions in the set of satellite allocation solutions are used to describe candidate satellites accessed by each of the geographical partitions; allocating an initial position and velocity to each of the satellites; Determining a satellite matching degree corresponding to each satellite allocation solution according to the user communication satisfaction corresponding to the number of target satellites actually accessed by each geographical partition and the communication duration provided by the candidate satellite for the geographical partition served by the candidate satellite; updating the position and velocity corresponding to each satellite allocation solution according to an update formula, updating the individual optimal position and the global optimal position based on the satellite matching degree corresponding to each satellite allocation solution, and determining whether the updated satellite allocation solution satisfies the satellite service constraint; When the second iteration stopping condition is met, a target satellite to be accessed by each of the geographical partitions is determined.

6. The method for allocating multi-layer service access satellites for geographical partitioning according to claim 5, characterized in that: Determining a satellite matching degree corresponding to each satellite allocation solution according to the user communication satisfaction corresponding to the number of target satellites actually accessed by each geographical partition and the communication duration provided by the candidate satellite for the geographical partition served by the candidate satellite includes: For any of the satellite allocation solutions, the satellite matching degree corresponding to the satellite allocation solution is determined according to the following formula: ； ； in, Assign the satellite matching degree corresponding to the solution to the satellite, The user communication satisfaction corresponding to the number of the target satellites accessed by all the geographical partitions, is the number of geographical divisions, A normalized result of the communication duration provided by all the candidate satellites for the geographical area served, The number of target satellites accessed for each of the geographical partitions, For the The communication time provided by the candidate satellites for the geographical area served by the candidate satellites, For the Rank The identifier of the geographic partition of the column, The maximum communication time provided to the satellite, 、 is a constant.

7. The method for allocating multi-layer service access satellites for geographical partitioning according to claim 5, characterized in that: The satellite service constraint includes: the candidate satellite is a satellite accessible to the geographical partition it serves, and the candidate satellite does not access other geographical partitions.

8. A multi-layer service access satellite distribution device for geographical partitioning, characterized in that: include: a data acquisition module, configured to acquire a set of geographical partitions and a communication coverage area corresponding to each satellite in a satellite network, wherein the geographical partitions included in the set of geographical partitions are obtained by dividing the earth's surface according to a distribution pattern of the satellite network, and all the geographical partitions in the set of geographical partitions can completely cover the earth's surface; A first satellite allocation module is configured to determine the satellite accessible to each geographical partition according to a positional relationship between each geographical partition and the communication coverage area corresponding to each satellite; a satellite number determination module, configured to determine a target number of satellites for access by each geographical partition based on the number of users in each geographical partition and the number of users serviceable by the satellites accessible to each geographical partition, with the goal of maximizing user communication satisfaction, wherein the user communication satisfaction is an indicator measuring whether the number of users serviceable by the satellites can meet the number of users in the geographical partition; The second satellite allocation module is configured to determine the target satellite to be accessed by each geographical partition based on the number of target satellites accessed by each geographical partition, the user communication satisfaction, and the communication duration provided by the satellite for the geographical partition served by the satellite, with the goal of maximizing satellite matching. For the satellites in the satellite network that are not accessed by the geographical partition, the satellites are connected to the geographical partition corresponding to the longest communication duration. The satellite matching degree is an indicator that measures whether the communication duration provided by the satellites accessed by the geographical partition can meet the communication needs of the geographical partition, and whether the number of users that can be served by the satellite can meet the number of users in the geographical partition.

9. An electronic device, characterized in that: The method comprises a processor and a memory, wherein the memory stores computer-executable instructions that can be executed by the processor, and the processor executes the computer-executable instructions to implement the method according to any one of claims 1 to 7.

10. A computer-readable storage medium, characterized in that The computer-readable storage medium stores computer-executable instructions. When the computer-executable instructions are called and executed by a processor, the computer-executable instructions prompt the processor to implement the method according to any one of claims 1 to 7.

Images