Multicast communication method and system based on three-dimensional geographic position, and electronic equipment

Abstract

The invention relates to the technical field of communication, and discloses a multicast communication method and system based on a three-dimensional geographic position and electronic equipment, and the method comprises the steps: obtaining the three-dimensional geographic position of a target area; generating a space identifier of the target area based on the three-dimensional geographic position; performing service query based on the space identifier to obtain a mapping relation corresponding to the target area; performing routing addressing on the target area based on the mapping relation to generate a flow table; generating a multicast communication message based on the space identifier, and sending the multicast communication message to all receiving terminals in the target area according to a flow table; and screening effective terminals from all the receiving terminals based on the multicast communication message, so that each effective terminal receives and processes the multicast communication message. According to the method, the space identifier is generated through the three-dimensional geographic position, the precision limitation of a traditional mapping relation and the limitation of two-dimensional plane communication are broken through, finer communication granularity is achieved, three-dimensional space representation is supported, and multicast errors, omission and range generalization are avoided.

Description

Technical Field

[0001] This invention relates to the field of communication technology, and specifically to a multicast communication method, system, and electronic device based on three-dimensional geographic location. Background Technology

[0002] Geographic multicast is a flexible and efficient one-to-many network communication paradigm. Its core advantage lies in its ability to transmit data packets to all receiving terminals within the target area. It is especially suitable for scenarios with a large number of receiving terminals within the target area, which can significantly improve communication efficiency and reduce network overhead.

[0003] Most current mainstream geographic multicast solutions rely on IP (Internet Protocol) geolocation technology. For example, users can access the eDNS geolocation database to obtain the geographic locations mapped to the IP addresses of all receiving terminals within a specified area, and then send data packets to these terminals one by one according to their geographic locations, thereby achieving multicast communication.

[0004] However, the mapping relationship between IP addresses and geographic locations in the above scheme relies on manual collection. To achieve geographic multicast, this mapping relationship must be dynamically updated, but the mapping is prone to failure when terminals move or their IP addresses change, resulting in high maintenance costs. Furthermore, the database update cycle is long and cannot keep up with the rapid movement of terminals (such as drones and mobile phones), leading to multicast communication errors or omissions. In addition, the positioning accuracy of the mapping relationship can only reach the city or street level, failing to achieve precise positioning, resulting in a generalized multicast range and inaccurate communication. Summary of the Invention

[0005] This invention provides a multicast communication method, system, and electronic device based on three-dimensional geographic location to solve the problems of high cost of maintaining mapping relationships, errors, omissions, and generalizations in existing multicast communication based on IP addresses.

[0006] In a first aspect, the present invention provides a multicast communication method based on three-dimensional geographic location, the method comprising:

[0007] Obtain the three-dimensional geographic location of the target area; Generate spatial identifiers for the target area based on three-dimensional geographic location; Service queries are performed based on spatial identifiers to obtain the mapping relationship corresponding to the target area; Based on the mapping relationship, routing and addressing are performed on the target area, and a flow table is generated; Multicast communication messages are generated based on spatial identifiers and sent to all receiving terminals in the target area according to the flow table. Based on multicast communication messages, valid terminals are selected from all receiving terminals so that each valid terminal can receive and process multicast communication messages.

[0008] This invention acquires the three-dimensional geographic location of a target area, generates a spatial identifier based on this, and then performs service queries based on this spatial identifier to obtain a mapping relationship. This mapping relationship enables routing and addressing, generating a flow table. Multicast communication messages are generated based on the spatial identifier and sent to valid terminals in the target area according to the flow table. Compared to traditional IP address-based multicast communication, directly acquiring the three-dimensional geographic information of the target area eliminates the need for additional mapping relationship maintenance, fundamentally avoiding the high maintenance costs associated with mapping updates. Furthermore, the spatial identifier generated from the three-dimensional geographic location overcomes the precision limitations of traditional mapping relationships and the limitations of two-dimensional planar communication, achieving finer communication granularity and supporting three-dimensional spatial representation. This helps improve the spatial accuracy of multicast communication, avoiding errors, omissions, and range generalization in multicast, making it particularly suitable for applications sensitive to spatial granularity.

[0009] Secondly, the present invention provides a multicast communication system based on three-dimensional geographic location, the system comprising: The sending terminal is used to obtain the three-dimensional geographic location of the target area, generate a spatial identifier of the target area based on the three-dimensional geographic location, and generate a multicast communication message based on the spatial identifier. An open network operating system is used to perform service queries based on spatial identifiers, obtain the mapping relationship corresponding to the target area, perform routing and addressing of the target area based on the mapping relationship, and generate flow tables; Programmable switching equipment is used to send multicast communication messages to all receiving terminals in the target area according to the flow table; The receiving terminal is used to filter valid terminals from all receiving terminals based on multicast communication messages, so that each valid terminal can receive and process multicast communication messages.

[0010] Thirdly, the present invention provides an electronic device, comprising: a memory and a processor, wherein the memory and the processor are communicatively connected to each other, the memory stores computer instructions, and the processor executes the computer instructions to perform the multicast communication method based on three-dimensional geographic location described in the first aspect or any corresponding embodiment thereof.

[0011] Fourthly, the present invention provides a computer-readable storage medium storing computer instructions for causing a computer to execute the three-dimensional geographic location-based multicast communication method of the first aspect or any corresponding embodiment thereof. Attached Figure Description

[0012] To more clearly illustrate the specific embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the specific embodiments or the prior art will be briefly introduced below. Obviously, the drawings described below are some embodiments of the present invention. For those skilled in the art, other drawings can be obtained from these drawings without creative effort.

[0013] Figure 1 This is a schematic diagram of a multicast communication system based on three-dimensional geographic location according to an embodiment of the present invention; Figure 2 This is a flowchart of a multicast communication method based on three-dimensional geographic location according to an embodiment of the present invention; Figure 3 This is a network topology diagram according to an embodiment of the present invention; Figure 4 This is a schematic diagram of rectangular correction according to an embodiment of the present invention; Figure 5 This is a schematic diagram of grid division of an extended model based on geographic region mapping according to an embodiment of the present invention; Figure 6 This is a schematic diagram of latitude and longitude according to an embodiment of the present invention; Figure 7 This is a schematic diagram of planar encoding according to an embodiment of the present invention; Figure 8 This is a schematic diagram of the entire target area according to an embodiment of the present invention; Figure 9 This is a schematic diagram of the target area spanning the top and bottom left according to an embodiment of the present invention; Figure 10 This is a schematic diagram of the target area spanning the left and right sides and slightly upwards according to an embodiment of the present invention; Figure 11 This is a schematic diagram of airspace categories according to an embodiment of the present invention; Figure 12 This is a schematic diagram illustrating the generation of spatial identifiers according to an embodiment of the present invention; Figure 13 This is a schematic diagram of spatial identification according to an embodiment of the present invention; Figure 14 This is a schematic diagram of service query and routing addressing according to an embodiment of the present invention; Figure 15 This is a schematic diagram of matching subdivided grid coding according to an embodiment of the present invention; Figure 16 This is a schematic diagram of the hardware structure of an electronic device according to an embodiment of the present invention. Detailed Implementation

[0014] To make the objectives, technical solutions, and advantages of the embodiments of the present invention clearer, the technical solutions of the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of the present invention, not all embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of the present invention.

[0015] It is understood that before using the technical solutions disclosed in the various embodiments of the present invention, users should be informed of the types, scope of use, and usage scenarios of the personal information involved in the present invention and their authorization should be obtained in accordance with relevant laws and regulations through appropriate means.

[0016] The terms "first" and "second" are used for descriptive purposes only and should not be construed as indicating or implying relative importance or implicitly specifying the number of technical features indicated. Thus, a feature defined as "first" or "second" may explicitly or implicitly include one or more of that feature. In the description of this invention, "a plurality of" means two or more, unless otherwise explicitly specified.

[0017] Current mainstream geographic multicast solutions mostly rely on IP geolocation technology. However, the mapping relationship between IP addresses and geographic locations depends on manual collection and must be dynamically updated. This mapping is prone to failure when terminals move or their IP addresses change, resulting in high maintenance costs. Furthermore, the database update cycle is long and cannot keep up with the rapid movement of terminals (such as drones and mobile phones), leading to multicast communication errors or omissions. Additionally, the positioning accuracy of the mapping relationship only reaches the city or street level, failing to achieve precise positioning, resulting in a generalized multicast range and inaccurate communication.

[0018] This invention directly acquires the three-dimensional geographic information of the target area without the need for additional mapping relationships, thus fundamentally avoiding the high maintenance costs associated with mapping updates. Furthermore, the spatial identifiers generated through three-dimensional geographic locations overcome the limitations of traditional mapping relationships and two-dimensional planar communication, achieving finer communication granularity and supporting three-dimensional spatial representation. This helps improve the spatial accuracy of multicast communication and avoids errors, omissions, and range generalization in multicast, making it particularly suitable for application scenarios sensitive to spatial granularity.

[0019] According to an embodiment of the present invention, a multicast communication method based on three-dimensional geographic location is provided. It should be noted that the steps shown in the flowchart in the accompanying drawings can be executed in a computer system such as a set of computer-executable instructions. Furthermore, although a logical order is shown in the flowchart, in some cases, the steps shown or described may be executed in a different order than that shown here.

[0020] This embodiment provides a multicast communication method based on three-dimensional geographic location, which can be used in multicast communication systems based on three-dimensional geographic location. Figure 1 This is a schematic diagram of a multicast communication system based on a three-dimensional geographic location according to an embodiment of the present invention. The system includes: a transmitting terminal, configured to acquire the three-dimensional geographic location of a target area, generate a spatial identifier of the target area based on the three-dimensional geographic location, and generate multicast communication messages based on the spatial identifier; an open network operating system, configured to perform service queries based on the spatial identifier to obtain a mapping relationship corresponding to the target area, perform routing addressing on the target area based on the mapping relationship, and generate a flow table; a programmable switching device, configured to send the multicast communication messages to all receiving terminals in the target area according to the flow table; and a receiving terminal, configured to filter valid terminals from all receiving terminals based on the multicast communication messages, so that each valid terminal receives and processes the multicast communication messages.

[0021] Specifically, the sending terminal, as the initiator of multicast communication, first obtains the three-dimensional geographic location of the target area. Based on this location, it generates a spatial identifier (SpaceID) containing three-dimensional geographic semantics, and then constructs a multicast communication message using this spatial identifier as the core. The Open Network Operating System (ONOS), as the network control core, performs service queries based on this spatial identifier to obtain the network resource mapping relationship corresponding to the target area, thereby generating a flow table. Programmable switching devices, including core network routers, access network routers, and access points (APs), can broadcast the multicast communication message to all receiving terminals in the target area according to the flow table issued by ONOS after receiving it. Upon receiving the message, the receiving terminals automatically select valid terminals to receive and process the message, completing precise multicast communication.

[0022] This embodiment provides a multicast communication method based on three-dimensional geographic location, which can be used in the aforementioned multicast communication system based on three-dimensional geographic location. Figure 2 This is a flowchart of a multicast communication method based on three-dimensional geographic location according to an embodiment of the present invention, such as... Figure 2 As shown, the process includes the following steps: Step S201: Obtain the three-dimensional geographic location of the target area.

[0023] Specifically, the three-dimensional geographic location includes the latitude and longitude coordinates of four points in the target area and the altitude range of the target area. Unlike traditional IP address-based multicast communication, which requires manual dynamic maintenance of the mapping relationship between IP addresses and geographic locations, this embodiment of the invention directly obtains the three-dimensional geographic information of the target area without the need for additional maintenance of the mapping relationship, thus fundamentally avoiding the high maintenance costs caused by mapping updates.

[0024] Step S202: Generate spatial identifiers for the target area based on the three-dimensional geographic location.

[0025] Specifically, the transmitting terminal converts the three-dimensional geographic location of the target area into a standardized spatial identifier that can be recognized by the network layer. Compared to traditional IP address-based multicast communication, this spatial identifier, by integrating precise latitude, longitude, and altitude, overcomes the limitations of traditional mapping relationships and two-dimensional planar communication. It not only enables refined, three-dimensional positioning of the target area but also accurately distinguishes terminals at different heights within the same planar area, helping to improve the spatial accuracy of multicast communication, especially suitable for application scenarios sensitive to spatial granularity. Furthermore, the integrated air-space-ground network achieves seamless collaboration and integration between air, space, and ground, constructing a comprehensive information network system with full coverage, real-time connectivity, and intelligent efficiency. Within this network, this spatial identifier can help determine the target area for user communication and locate the specific three-dimensional geographic location of the receiving terminal, thereby providing flexible and customizable communication services to users based on specific needs.

[0026] Step S203: Perform a service query based on the spatial identifier to obtain the mapping relationship corresponding to the target area.

[0027] Specifically, based on this spatial identifier, ONOS initiates a service query to the mapping server under the integrated air-space-ground network architecture to obtain the mapping relationship corresponding to the target area. This mapping relationship refers to the network resource configuration information that is precisely associated with the three-dimensional geographical location of the target area, including access devices (such as APs), core network routing links, device port information, service support status, and network topology adaptation parameters within the coverage area of ​​the target area, providing accurate resource basis for subsequent routing and addressing.

[0028] Step S204: Based on the mapping relationship, perform routing addressing on the target area and generate a flow table.

[0029] Specifically, considering the characteristics of high terminal mobility and dynamic topology changes in integrated air-space-ground networks, ONOS optimizes for low latency and high bandwidth. It uses a dynamic routing algorithm based on mapping relationships to plan the optimal multicast forwarding path from the access network where the sending terminal is located to the access network where the target area is located, intelligently avoiding faulty nodes, high-load links, and signal blind spots. Based on this, ONOS converts the planned path logic into a standardized flow table. The flow table contains core fields: matching rules (using the spatial identifier in the packet header as the core to ensure accurate matching of forwarding requirements corresponding to three-dimensional geographical locations), forwarding actions (clarifying the forwarding instructions of the target port / device to ensure targeted packet transmission), priority (setting a higher priority than ordinary data packets to improve multicast communication response speed), and timeout (adapting to dynamic changes in network topology and avoiding communication failures caused by old paths). This flow table directly associates network resources corresponding to three-dimensional geographical semantics based on mapping relationships. Compared with traditional solutions, it avoids the problems of high maintenance costs and poor adaptability caused by static planning. Furthermore, it innovatively integrates deeply into the routing decision-making process, enabling communication paths in dynamic scenarios such as UAV swarms and low-altitude traffic to automatically optimize with changes in vertical location. Finally, ONOS sends the flow table to the programmable switching device and simultaneously sends a successful service query reply message to access network 1 where the sending terminal is located, thus terminating the service query process.

[0030] Step S205: Generate multicast communication messages based on spatial identifiers, and send the multicast communication messages to all receiving terminals in the target area according to the flow table.

[0031] Specifically, the sending terminal generates multicast communication messages with spatial identifiers as the core, ensuring that the messages have geographic addressing semantics that can be directly recognized by ONOS. Figure 3 This is a network topology diagram according to an embodiment of the present invention, such as... Figure 3 As shown, ASR1 and ASR2 are both Access Service Routers, used for packet connection between the access network and the ONOS core network; CR1 and CR2 are both Core Routers, used for packet transmission within the core network. Access Network 1, where the sending terminal is located, sends the packet to ASR1 on the access side. ASR1 encapsulates the packet according to the flow table and transmission specifications, and forwards the encapsulated packet to ASR2 on the target area side via CR1 and CR2 according to the optimal path planned in the flow table. After ASR2 decapsulates the packet, it broadcasts it to all receiving terminals within the coverage area of ​​the two access networks via AP1 and AP2 in Access Network 2 and Access Network 3.

[0032] Step S206: Select valid terminals from all receiving terminals based on multicast communication messages, so that each valid terminal can receive and process multicast communication messages.

[0033] Specifically, the receiving terminal automatically selects valid terminals based on the multicast communication message, enabling these valid terminals to receive and process the multicast communication message, while other receiving terminals discard the message, thus avoiding errors, omissions, and scope generalization in multicast and achieving accurate multicast communication in three-dimensional space.

[0034] This invention acquires the three-dimensional geographic location of a target area, generates a spatial identifier based on this, and then performs service queries based on this spatial identifier to obtain a mapping relationship. This mapping relationship enables routing and addressing, generating a flow table. Multicast communication messages are generated based on the spatial identifier and sent to valid terminals in the target area according to the flow table. Compared to traditional IP address-based multicast communication, directly acquiring the three-dimensional geographic information of the target area eliminates the need for additional mapping relationship maintenance, fundamentally avoiding the high maintenance costs associated with mapping updates. Furthermore, the spatial identifier generated from the three-dimensional geographic location overcomes the precision limitations of traditional mapping relationships and the limitations of two-dimensional planar communication, achieving finer communication granularity and supporting three-dimensional spatial representation. This helps improve the spatial accuracy of multicast communication, avoiding errors, omissions, and range generalization in multicast, making it particularly suitable for applications sensitive to spatial granularity.

[0035] This embodiment provides a multicast communication method based on three-dimensional geographic location, which can be used in the aforementioned multicast communication system based on three-dimensional geographic location. The method specifically includes the following steps: Step S301: Obtain the three-dimensional geographic location of the target area. For details, please refer to [link to relevant documentation]. Figure 2 Step S201 of the illustrated embodiment will not be described again here.

[0036] Step S302: Generate a spatial identifier for the target area based on the three-dimensional geographic location, which includes multiple latitude and longitude coordinates and an altitude range.

[0037] Specifically, step S302 includes: Step S3021: Verify whether the area formed by multiple latitude and longitude coordinates is a rectangle.

[0038] Specifically, since the core requirement of EMD (Extended Model on Mapping Division) is to perform encoding calculations based on regular rectangular grids to ensure the accuracy and uniqueness of subsequent encoding generation, it is necessary to verify the shape of the region formed by the latitude and longitude coordinates of the four points in the target area to determine whether it conforms to the geometric characteristics of a rectangle.

[0039] Step S3022: When the coordinates are not a rectangle, correct multiple latitude and longitude coordinates to obtain the corresponding corrected coordinates.

[0040] Specifically, if the verification determines that the area formed by the four latitude and longitude coordinates is a non-rectangular shape such as a trapezoid or an irregular quadrilateral, it will be automatically corrected. Using the maximum and minimum longitude, maximum and minimum latitude values ​​of the four latitude and longitude coordinates as boundaries, the four vertices of a standard rectangle are determined through a minimum expansion strategy. The non-rectangular area is corrected into the smallest bounding rectangle that can completely cover the original target area, and the corrected four latitude and longitude coordinates are finally output.

[0041] In some alternative implementations, Figure 4 This is a schematic diagram of rectangular correction according to an embodiment of the present invention, as shown below. Figure 4 As shown, the green dashed line represents the area formed by the four latitude and longitude coordinates of the target area before correction. Since this area is trapezoidal, it needs to be corrected into a rectangle using a minimum expansion strategy. The corrected area is shown as the blue solid line.

[0042] Step S3023: Generate a subdivision grid code based on multiple corrected coordinates.

[0043] Specifically, step S3023 includes: Step S30231: Using an extended model based on geographic region mapping, each corrected coordinate is encoded to obtain the code of the corrected coordinate in each grid layer, and then integrated into the grid code of the corrected coordinate according to the grid hierarchy.

[0044] Specifically, through the hierarchical subdivision and encoding logic of the EMD model, the corrected latitude and longitude coordinates are transformed into standardized grid codes. Figure 5 This is a schematic diagram of grid partitioning based on an extended model of geographic region mapping according to an embodiment of the present invention, such as... Figure 5 As shown, EMD divides the global geospatial space into 27 grid layers, from macro to micro, according to preset rules. For each corrected coordinate, starting from the highest layer (layer 1), the sub-grid to which the corrected coordinate belongs is determined layer by layer using a binary search method, and a binary code for the corresponding layer is generated according to preset coding rules. The finer the layer, the higher the coding accuracy, and the more accurately the geographic attribution of the coordinate can be determined. After coding, the binary codes of each layer are integrated sequentially according to the grid hierarchy from high to low, forming a 63-bit grid code for the corrected coordinate. This coding not only retains the globally unified and multi-level compatible characteristics of the EMD model, but also ensures the uniqueness and geographic semantic relevance of the code through binary sequence combination, laying the foundation for subsequent accurate 3D spatial matching.

[0045] Optionally, the encoding algorithm flow for the EMD model is based on existing technology, as shown below: initialization SMC = null ; when hour: ; ; ; when hour: ; ; ; when hour: ; ; ; ; when hour: ;

[0046] in, SMC Represents grid encoding; Indicates longitude; Indicates latitude; Indicates the first The grid number of the layer; Indicates the first The number of grid cells in the east-west direction of the layer; Indicates the first The longitude span of each grid in the layer, that is, the standard longitude; Indicates the first The latitudinal span of each grid in the layer, that is, the standard latitude; Indicates the first Relative longitude of the layers; Indicates the first Layer relative latitude.

[0047] In some alternative implementations, Figure 6 This is a schematic diagram of latitude and longitude according to an embodiment of the present invention, such as... Figure 6 As shown, standard longitude and standard latitude are the longitude and latitude spans of each grid in each layer; relative longitude (as shown by the blue dashed line) and relative latitude (as shown by the red dashed line) are the longitude and latitude of a point (as shown by the yellow circle) relative to the grid in which it is located, thus forming the relative position of the point in the grid.

[0048] Step S30232: Perform layer-by-layer consistency verification on the grid encoding of multiple corrected coordinates to determine the target valid layer.

[0049] Specifically, the grid codes for the four corrected coordinates are checked layer by layer in order from the highest to the lowest level. First, the codes for the four corrected coordinates in the highest level (Level 1) are checked to ensure complete consistency. If they are consistent, the process continues to the next level. This process is repeated until a layer shows inconsistent codes for the four corrected coordinates, at which point the check process terminates. The level above the termination check level is determined as the target valid layer (i.e., the maximum number of valid layers). The code corresponding to this level can fully represent the planar extent of the target area.

[0050] Step S30233: Convert the target valid layer into binary hierarchical encoding.

[0051] Specifically, the EMD model has 27 layers, and the 5-bit binary encoding can cover a numerical range of 0-31. The effective layers of the target are converted into 5-bit layer codes according to the binary encoding rules to identify the maximum number of layers occupied by the target area. This ensures that subsequent network devices can quickly resolve the planar coverage granularity of the target area, providing a layer basis for the accurate generation of 3D spatial identification.

[0052] Step S30234: For any corrected coordinate grid code, retain the code of the target effective layer and all layers before it, and set the code of all layers after the target effective layer to a preset value to obtain the planar code of the target area.

[0053] Specifically, the encoding of the four corrected coordinates is completely consistent across the target effective layer and all layers preceding it. Therefore, there is no need to repeatedly process the encoding of all corrected coordinates; only the 63-bit grid encoding of any one corrected coordinate needs to be selected. During processing, the encoding of the target effective layer and all layers preceding it is retained. Since the encoding of layers following the target effective layer no longer has consistent geographical significance, the encoding of all layers following the target effective layer is uniformly set to a preset value of 0. This avoids interference from redundant information and forms a 63-bit planar encoding representing the planar extent of the target area.

[0054] In some alternative implementations, Figure 7 This is a schematic diagram of planar encoding according to an embodiment of the present invention, such as... Figure 7 As shown, the grid codes for the four corrected coordinates are verified layer by layer starting from layer 1. If they match, the verification continues. If the four codes do not match at layer 7, the verification stops. The codes of the first 6 layers are retained, and the codes of layer 7 and subsequent layers are set to the preset value 0, thus obtaining the planar code of the target area.

[0055] Step S30235: Determine the region boundaries of multiple corrected coordinates in the grid corresponding to the target effective layer.

[0056] Specifically, in traditional grid coding schemes, if the target area does not fall entirely within a single grid (e.g., partly in grid A and partly in grid B), it is forced to backtrack to a larger grid at a higher level for data broadcasting. This causes the communication requirement, which originally only needed to cover two small grids, to expand to ten unrelated grids, resulting in a large amount of redundant message transmission and wasted network resources. Therefore, to achieve accurate multicast, this embodiment of the invention refines the grid containing the target area into four sub-grids at the next lower level. It determines whether the target area is located to the left or right or up and down of the four sub-grids. When the target area spans two or more grids, it does not need to backtrack to a higher level; instead, it re-divides the approximate range of the target area and continues subsequent coding, completing planar hierarchical expansion with finer granularity.

[0057] Therefore, the regional boundary of the target area needs to be determined first. Specifically, when each corrected coordinate is processed by the encoding algorithm of the EMD model, its corresponding relative latitude and relative longitude are obtained at each layer. For the target effective layer, the relative longitude and relative latitude corresponding to all corrected coordinates at that layer are extracted, and the maximum relative longitude, minimum relative longitude, maximum relative latitude, and minimum relative latitude are selected from them. Together, they constitute the complete regional boundary of the target area within the grid of the target effective layer.

[0058] Step S30236: Obtain the standard longitude and standard latitude of the grid of the next layer of the target effective layer.

[0059] Step S30237: Based on the regional boundary, standard longitude, and standard latitude, determine the grid type of the target region, and determine the extended code corresponding to the grid type. The regional boundary includes the maximum relative longitude, minimum relative longitude, maximum relative latitude, and minimum relative latitude.

[0060] Specifically, step S30237 above determines the grid type of the target area based on the region boundary, standard longitude, and standard latitude, including: Step a1: When the maximum relative latitude is greater than the standard latitude, the minimum relative latitude is less than the standard latitude, and the maximum relative longitude is greater than the standard longitude and the minimum relative longitude is less than the standard longitude, determine the span type as full span.

[0061] Specifically, a span type is determined to be a full span when the following four conditions are met simultaneously: the maximum relative latitude of the target area is greater than the standard latitude of the next layer, the minimum relative latitude is less than the standard latitude of the next layer, the maximum relative longitude is greater than the standard longitude of the next layer, and the minimum relative longitude is less than the standard longitude of the next layer. Figure 8 This is a schematic diagram of the entire span of the target area according to an embodiment of the present invention, as shown below. Figure 8As shown, the target region is located in grid 1 of the target effective layer, and the next layer is further divided into four sub-grids, numbered 0-3, according to the four-part principle. If all four conditions are met simultaneously, it means that the boundary of the target region is located in each of the four sub-grids. In this case, it is impossible to lock the core range of the target region through a unidirectional expansion strategy of dividing left and right or up and down. Forcibly subdividing the region would result in fragmentation, so it is determined to be a full span.

[0062] Step a2: When the maximum relative latitude is greater than the standard latitude, the minimum relative latitude is less than the standard latitude, and the maximum relative longitude is less than the standard longitude, determine the span type as spanning the top and bottom left.

[0063] Specifically, the grid type is determined to be a grid spanning top-bottom-left when the following three conditions are met simultaneously: the maximum relative latitude is greater than the standard latitude of the next layer, the minimum relative latitude is less than the standard latitude of the next layer, and the maximum relative longitude is less than the standard longitude of the next layer. Figure 9 This is a schematic diagram of the target area spanning vertically and slightly to the left according to an embodiment of the present invention, as shown below. Figure 9 As shown, if the above three conditions are met simultaneously, it means that the relative latitude range of the target area covers two sub-grids, while the relative longitude range does not reach the center point of the longitude direction of the four sub-grids. That is, the overall area is biased towards the left sub-grid area. This determines the target area by spanning the upper, lower and left sides, achieving finer-grained regional positioning and avoiding the generalization of the communication range.

[0064] Assuming the target's effective layer is layer 18, with the standard longitude of the layer below it being 0.0002° and the standard latitude being 0.00015°, if the minimum and maximum relative longitudes of the target area are 0.00005° and 0.00018°, and the minimum and maximum relative latitudes are 0.00005° and 0.00025°, satisfying all three conditions, it is determined to be a region spanning vertically and slightly to the left, and its spatial distribution is similar to... Figure 9 Consistent.

[0065] Step a3: When the maximum relative latitude is greater than the standard latitude, the minimum relative latitude is less than the standard latitude, and the minimum relative longitude is greater than the standard longitude, determine the span type as spanning the top and bottom right.

[0066] Specifically, the grid crossing type is determined to be "spanning vertically and slightly to the right" when all three of the following conditions are met: the maximum relative latitude is greater than the next level standard latitude, the minimum relative latitude is less than the next level standard latitude, and the minimum relative longitude is greater than the next level standard longitude. The simultaneous fulfillment of these three conditions means that the relative latitude range of the target area covers two sub-grids, and the minimum relative longitude is greater than the center point of the longitude direction of four sub-grids, i.e., the overall area is biased towards the right sub-grid region. This determines the target area as spanning vertically and slightly to the right, achieving finer-grained regional positioning and avoiding communication range generalization.

[0067] Step a4: When the maximum relative longitude is greater than the standard longitude, the minimum relative longitude is less than the standard longitude, and the minimum relative latitude is greater than the standard latitude, determine the span type as spanning left and right with an upward bias.

[0068] Specifically, when the following three conditions are met simultaneously, the span type is determined to be a span that is slightly above the left or right: the maximum relative longitude is greater than the standard longitude of the next layer, the minimum relative longitude is less than the standard longitude of the next layer, and the minimum relative latitude is greater than the standard latitude of the next layer. Figure 10 This is a schematic diagram of the target area spanning the left and right sides and slightly upwards according to an embodiment of the present invention, as shown below. Figure 10 As shown, if the above three conditions are met simultaneously, it means that the relative longitude range of the target area covers two sub-grids, while the relative latitude range does not reach the center point of the latitude direction of four sub-grids. That is, the overall area is biased towards the upper sub-grid area. This determines that the target area spans the left and right sides and is slightly upward, achieving more granular regional positioning and avoiding the generalization of the communication range.

[0069] Step a5: When the maximum relative longitude is greater than the standard longitude, the minimum relative longitude is less than the standard longitude, and the maximum relative latitude is less than the standard latitude, determine the span type as spanning left and right with a downward bias.

[0070] Specifically, the grid crossing type is determined to be a left-right-downward crossing when all three of the following conditions are met: the maximum relative longitude is greater than the standard longitude of the next layer, the minimum relative longitude is less than the standard longitude of the next layer, and the maximum relative latitude is less than the standard latitude of the next layer. The simultaneous fulfillment of these three conditions means that the relative latitude range of the target area covers two sub-grids, while the maximum relative longitude does not exceed the center point of the latitude direction of four sub-grids. This indicates an overall downward-sloping sub-grid area, thus determining the target area as a left-right-downward crossing, achieving finer-grained regional positioning and avoiding communication range generalization.

[0071] In some optional implementations, a corresponding 3-bit extended code is determined based on the span type of the target region: if the span type is a full span, the extended code is 000; if the span type is a top-bottom left span, the extended code is 100; if the span type is a top-bottom right span, the extended code is 101; if the span type is a left-right top span, the extended code is 111; if the span type is a left-right bottom span, the extended code is 110.

[0072] Step S30238: The hierarchical coding, planar coding, and extended coding are sequentially integrated into a subdivided grid coding.

[0073] Specifically, a 5-bit hierarchical code, a 63-bit planar code, and a 3-bit extended code are concatenated in the order of hierarchical code → planar code → extended code to form a 71-bit Sbdivision Mesh Code (SMC). The hierarchical code defines the effective precision range of the code, the planar code accurately maps the two-dimensional geographic coordinates of the target area, and the extended code supplements the fine-grained directional information in cross-grid scenarios. The three work together to enable the Sbdivision Mesh Code to support custom-granularity region division. Through this integration, a large geographic area can be further broken down into precise grid units, completely breaking through the limitations of traditional fixed hierarchical codes. This improves the accuracy and flexibility of region positioning and lays the foundation for subsequent spatial label generation.

[0074] Step S3024: Generate altitude codes based on the altitude range.

[0075] Specifically, step S3024 above includes: Step S30241: Determine the airspace category corresponding to the altitude range, and determine the first code corresponding to the airspace category.

[0076] Specifically, Figure 11 This is a schematic diagram of airspace categories according to an embodiment of the present invention, such as... Figure 11 As shown, considering factors such as flight rules, airspace environment, aircraft performance, and air traffic services, airspace is divided into controlled airspace (Classes A, B, C, D, and E) and uncontrolled airspace (Classes G and W). Based on the altitude range of the target area, its corresponding airspace category is determined, and a 3-bit first code corresponding to that airspace category is obtained. Specifically, the first code for Class W (0-120 meters) is 001; for Class G (120-300 meters) it is 010; for Class E (300-6000 meters) it is 011; for Class A (6000-20000 meters) it is 100; for Class D (20000+ meters) it is 101; for Class B (0-10000 meters) it is 110; and for Class C (0-4000 meters) it is 111.

[0077] Step S30242: When the airspace category is uncontrolled, the altitude range corresponding to the airspace category is coarse-grained and refined to obtain multiple coarse-grained altitude ranges.

[0078] Specifically, in this embodiment of the invention, controlled airspace is not considered; only uncontrolled airspace is further refined in altitude. When the target area belongs to category W or category G, its corresponding altitude range is coarsely refined according to preset rules to obtain multiple coarse-grained altitude ranges. For example, category W (0-120 meters) can be refined into two coarse-grained altitude ranges: 0-60 meters and 60-120 meters; category G (120-300 meters) can be refined into two coarse-grained altitude ranges: 120-200 meters and 200-300 meters.

[0079] Step S30243: When there is a coarse-grained height range that includes the altitude range, determine the second code corresponding to the coarse-grained height range; when there is no coarse-grained height range that includes the altitude range, determine the second code as a preset value and stop refining.

[0080] Specifically, it is determined whether there exists a coarse-grained height range that completely encompasses the altitude range of the target area. If it exists, the 1-bit second code corresponding to the coarse-grained height range is determined; if it does not exist, the second code is determined to be a preset value of 0, and further height refinement is stopped.

[0081] Step S30244: The coarse-grained height range is refined into medium-grained height ranges to obtain multiple medium-grained height ranges.

[0082] Specifically, if a certain coarse-grained height range completely encompasses the altitude range of the target area, this coarse-grained height range is refined into medium-grained height ranges according to preset rules to further improve the coding accuracy of the height dimension, resulting in multiple medium-grained height ranges. For example, the coarse-grained height range of 0-60 meters for class W is refined into four medium-grained height ranges: 0-15 meters, 15-30 meters, 30-45 meters, and 45-60 meters; or the coarse-grained height range of 120-200 meters for class G is refined into four medium-grained height ranges: 120-140 meters, 140-160 meters, 160-180 meters, and 180-200 meters.

[0083] Step S30245: When there is a medium-grained height range that includes the altitude range, determine the third code corresponding to the medium-grained height range; when there is no medium-grained height range that includes the altitude range, determine the third code as a preset value and stop refining.

[0084] Specifically, it is determined whether there exists a certain granular height range that completely encompasses the altitude range of the target area. If it exists, the 2-bit third code corresponding to the granular height range is determined; if it does not exist, the third code is determined to be a preset value of 0, and further height refinement is stopped.

[0085] Step S30246: The medium-grained height range is refined into fine-grained ranges to obtain multiple fine-grained height ranges.

[0086] Specifically, if a certain medium-grained height range completely encompasses the altitude range of the target area, this medium-grained height range is further refined according to preset rules to improve the coding accuracy of the height dimension, resulting in multiple fine-grained height ranges. For example, the medium-grained height range of 0-15 meters for class W can be refined into three fine-grained height ranges: 0-5 meters, 5-10 meters, and 10-15 meters; or the 15-30 meters range can be refined into three fine-grained height ranges: 15-20 meters, 20-25 meters, and 25-30 meters.

[0087] Step S30247: When there is a fine-grained height range that includes the altitude range, determine the fourth code corresponding to the fine-grained height range; when there is no fine-grained height range that includes the altitude range, determine the fourth code as a preset value and stop refining.

[0088] Specifically, it is determined whether there exists a fine-grained height range that completely encompasses the altitude range of the target area. If it exists, the 2-bit fourth code corresponding to the fine-grained height range is determined; if it does not exist, the fourth code is determined to be a preset value of 0, and further height refinement is stopped.

[0089] Step S30248: Determine the hierarchical identifier based on the granularity corresponding to the stop refinement, and sequentially integrate the hierarchical identifier, the first code, the second code, the third code, and the fourth code into a height code.

[0090] Specifically, a 2-bit level identifier is determined based on the highly refined termination state to specify the maximum effective number of levels in the high-level encoding: if refined to coarse granularity (encoding to the second encoding), the level identifier is 01; if refined to medium granularity (encoding to the third encoding), the level identifier is 10; if refined to fine granularity (encoding to the fourth encoding), the level identifier is 11; if not refined to coarse granularity (the target area belongs to controlled airspace), the level identifier is 00.

[0091] In special cases, if there are no requirements regarding the altitude range of the target area, the altitude code is set to a preset value of 0, which means that communication can be made with receiving terminals at all altitudes in the target area.

[0092] The hierarchical identifier, first code, second code, third code, and fourth code are integrated in the order to form a 10-bit height code (HC). The first code is used to distinguish the spatial domain category, and the second to fourth codes correspond to the coarse, medium, and fine-grained height range mappings, respectively. Hierarchical codes that have not been refined are filled with a preset value of 0.

[0093] If food is delivered to a user on the 9th floor, approximately 24-26m above the ground, the height code is 10-001-0-01-00 (the actual height code does not have a hyphen, but it is added here for explanation purposes). This indicates that the height cannot be further subdivided at the medium granularity level, so it can only be coded up to the third level, with the corresponding level identifier being 10.

[0094] By generating height codes, a more refined granular division is achieved, shifting from a two-dimensional plane to a three-dimensional solid, providing accurate three-dimensional geographic semantic support for spatial identification and adapting to the three-dimensional communication needs in integrated air-space-ground scenarios.

[0095] Step S3025: The preset prefix identifier, preset type identifier, subdivision grid code, height code, and preset extension bit are sequentially concatenated into a spatial identifier. The preset prefix identifier represents the network type, and the preset type identifier represents the service type.

[0096] Specifically, the default prefix identifier is a fixed 24-bit segment, helping network devices quickly identify network packets within an integrated air-space-ground network architecture and distinguish them from identifiers of other network types. The fixed value is 2004:00, originating from unallocated address space in IPv6. This not only ensures the uniqueness and resolvability of the identifier but also makes it compatible with the existing IPv6 address system, ensuring that the identifier will not conflict with other network identifiers. It also provides reserved space for future expansion, ensuring scalability in future services.

[0097] The default type identifier is an 8-bit service type identifier segment, a crucial part of the application service identifier in the integrated air-space-ground network architecture. Its value ranges from 00 to ff, representing up to 256 different service types. The identifier for geographic area service types is specified as 08, specifically used to support geographic area multicast service mechanisms. By designing this identifier, different service types can be distinguished within the integrated air-space-ground network architecture, further refining the definition of network services. If new identifier types need to be introduced (e.g., services targeting specific content or identities), the value of this identifier can be adjusted for expansion without affecting the existing identifier system. This gives the integrated air-space-ground network architecture high flexibility and scalability.

[0098] The default extension bit is a 15-bit set to 0, which does not carry any actual semantic information. It is left blank or reserved in the design to leave room for future expansion or optimization.

[0099] The spatial identifier is concatenated into a 128-bit identifier according to the preset prefix identifier, preset type identifier, subdivision grid code, height code, and preset extension bits. This identifier optimizes the coding spatial structure and dynamic partitioning capability of the two-dimensional geolocation service identifier, and has the characteristics of including semantics, fixed identifier length, and compatibility with existing networks. It ensures that the geolocation service identifier can efficiently and flexibly support the geographic area multicast service mechanism, while maintaining good compatibility with existing network protocols, laying the foundation for realizing multicast communication in three-dimensional space, and greatly improving the flexibility and scalability of network services.

[0100] In some alternative implementations, Figure 12 This is a schematic diagram of generating spatial identifiers according to an embodiment of the present invention, such as... Figure 12 As shown, the transmitting terminal includes a rectangle verification module, an encoding calculation module, an altitude range module, and an identifier generation module. Four latitude and longitude coordinates are input to the rectangle verification module. If the area formed by these four coordinates is not a rectangle, it is corrected to obtain four corrected coordinates, which are then input to the encoding calculation module. The encoding calculation module calculates the grid code for each corrected coordinate, and simultaneously calculates the hierarchical code and extended code, integrating them to obtain a subdivided grid code. Then, the altitude range is input to the altitude range module to generate an altitude code. The subdivided grid code and altitude code are input to the identifier generation module, which outputs a spatial identifier for the target area.

[0101] In some alternative implementations, Figure 13 This is a schematic diagram of a spatial identifier according to an embodiment of the present invention, such as... Figure 13 As shown, the spatial identifier consists of a preset prefix identifier, a preset type identifier, and a semantic identifier. The preset prefix identifier is a fixed 24-bit value of 2004:00; the preset type identifier is 8 bits, with a value of 08 in the geographic multicast communication service; and the semantic identifier is 96 bits, including 71 bits of subdivision grid coding, 10 bits of height coding, and 15 bits of preset extension bits. More specifically, the subdivision grid coding consists of 5 bits of hierarchical coding, 63 bits of planar coding, and 3 bits of extended coding. The planar coding is obtained by integrating 27 layers of grid coding corresponding to four latitude and longitude coordinates. The height coding consists of 2 bits of hierarchical identifier, 3 bits of first coding, 1 bit of second coding, 2 bits of third coding, and 3 bits of fourth coding.

[0102] Optionally, embodiments of the present invention employ subdivided grid coding as a planar geocoding standard, in conjunction with altitude coding, to construct a three-dimensional spatial identifier. In practical applications, other geocoding methods (such as H3 Uber grid, Geohash, etc.) can also be used to replace planar subdivided grid coding, and altitude coding can be replaced with altitude layer coding based on standard atmospheric pressure or other vertical reference systems.

[0103] Step S303: Perform a service query based on the spatial identifier to obtain the mapping relationship corresponding to the target area.

[0104] Specifically, step S303 includes: Step S3031: Generate a query request based on the service query message. The service query message is generated based on the spatial identifier.

[0105] Specifically, after generating the spatial identifier of the target area, the sending terminal is unsure whether the currently deployed integrated air-space-ground network supports geographic multicast services for that target area. Therefore, the sending terminal constructs a service query message using the spatial identifier of the target area as the core parameter, according to a preset message format, and sends it to ONOS. Upon receiving the service query message, ONOS extracts the spatial identifier of the target area by parsing the message and generates a standardized query request based on network communication protocol specifications.

[0106] Step S3032: Extract the mapping relationship corresponding to the target region from the mapping relationship database based on the query request.

[0107] Specifically, after generating a query request, ONOS sends it to the mapping server in the integrated air-space-ground network architecture via a preset communication interface. Upon receiving the query request, the mapping server parses the spatial identifier of the target area carried within it, uses this spatial identifier as the retrieval key, performs a precise match in the pre-maintained mapping relationship database, extracts the mapping relationship corresponding to the target area, and returns it to ONOS, laying the data foundation for subsequent route calculation, flow table generation, and data forwarding processes.

[0108] In some alternative implementations, Figure 14 This is a schematic diagram of service query and routing addressing according to an embodiment of the present invention, such as... Figure 14 As shown, the sending terminal generates a service query message based on the spatial identifier and forwards it to ONOS through the access network router. ONOS parses the message, generates a query request based on the parsed spatial identifier, and sends it to the mapping server. The mapping server returns the mapping relationship obtained based on the query request to ONOS. ONOS performs routing based on this mapping relationship, generates a flow table, and distributes the flow table through the access network router.

[0109] Step S304: Based on the mapping relationship, perform routing addressing for the target area and generate a flow table. For details, please refer to [link to relevant documentation]. Figure 2 Step S204 of the illustrated embodiment will not be described again here.

[0110] Step S305: Generate multicast communication messages based on spatial identifiers, and send the multicast communication messages to all receiving terminals in the target area according to the flow table. For details, please refer to [link to relevant documentation]. Figure 2 Step S205 of the illustrated embodiment will not be described again here.

[0111] Step S306: Select valid terminals from all receiving terminals based on multicast communication messages, so that each valid terminal can receive and process multicast communication messages.

[0112] Specifically, step S306 above, which filters valid terminals from all receiving terminals based on multicast communication messages, includes: Step S3061: Parse the subdivision grid code and height code from the multicast communication message.

[0113] Specifically, the receiving terminal includes a positioning module, an encoding calculation module, an encoding matching module, and a message parsing module. The message parsing module receives multicast communication messages broadcast by the AP, parses them to obtain subdivided grid encoding and height encoding, and then forwards them to the encoding matching module.

[0114] Step S3062: Obtain the subdivision grid code and height code generated by each receiving terminal.

[0115] Specifically, the positioning module of the receiving terminal will perceive its own latitude, longitude, and altitude range in real time under the integrated air-space-ground architecture, and transfer this three-dimensional geographical location to the encoding calculation module. Referring to steps S3023 and S3024, the encoding calculation module generates its own subdivided grid code and altitude code, and transfers them to the encoding matching module.

[0116] Step S3063: Match the subdivision grid code and height code of the multicast communication message with the subdivision grid code and height code generated by the receiving terminal. If the match is successful, the receiving terminal is determined as a valid terminal.

[0117] Specifically, the encoding matching module receives the subdivided grid code and height code generated by the terminal itself, as well as the subdivided grid code and height code forwarded by the message parsing module. For the subdivided grid code in the message and the generated subdivided grid code, it compares whether the codes at each layer are the same. If every bit at each layer is the same, it proceeds to height code matching. First, it obtains the layer identifier of the height code in the message and compares it with the layer identifier in the generated height code. If they match, it continues to compare each subsequent bit. If all bits match, the receiving terminal is a valid terminal.

[0118] In some alternative implementations, Figure 15 This is a schematic diagram of the matching of the subdivided grid encoding according to an embodiment of the present invention, such as... Figure 15As shown, the positioning module senses its own latitude and longitude coordinates and sends them to the encoding calculation module. The encoding calculation module calculates its own subdivided grid code based on the latitude and longitude coordinates and sends it to the encoding matching module. The message parsing module parses the multicast communication message, extracts the subdivided grid code, and sends it to the encoding matching module. The encoding matching module matches the two received subdivided grid codes.

[0119] This invention acquires the three-dimensional geographic location of a target area, generates a spatial identifier based on this, and then performs service queries based on this spatial identifier to obtain a mapping relationship. This mapping relationship enables routing and addressing, generating a flow table. Multicast communication messages are generated based on the spatial identifier and sent to valid terminals in the target area according to the flow table. Compared to traditional IP address-based multicast communication, directly acquiring the three-dimensional geographic information of the target area eliminates the need for additional mapping relationship maintenance, fundamentally avoiding the high maintenance costs associated with mapping updates. Furthermore, the spatial identifier generated from the three-dimensional geographic location overcomes the precision limitations of traditional mapping relationships and the limitations of two-dimensional planar communication, achieving finer communication granularity and supporting three-dimensional spatial representation. This helps improve the spatial accuracy of multicast communication, avoiding errors, omissions, and range generalization in multicast, making it particularly suitable for applications sensitive to spatial granularity.

[0120] The embodiments of the present invention have the following beneficial effects: First, the spatial identification adopts a dynamic and scalable architecture, which completely breaks through the traditional hierarchical limitations and can flexibly adjust the granularity of spatial division according to different application scenarios (such as urban microgrid management, wide-area resource monitoring, etc.). Second, in terms of coding efficiency optimization, by extending the planar hierarchy and introducing the deep integration of height coding and latitude and longitude information, the spatial description accuracy is improved to a three-dimensional dimension while maintaining an effective total coding length of 128 bits compatible with the IPv6 communication format. Compared with the traditional geolocation coding method based on GeoIP (Geographical Internet Protocol), the planar hierarchy extension can achieve finer-grained range communication and realize efficient representation of three-dimensional space. Third, the embodiments of the present invention provide a more efficient, flexible and environmentally friendly underlying geospatial identification foundation for future intelligent network services such as high-precision positioning and navigation, large-scale IoT device management, and smart city spatial computing, and provide a more powerful and intelligent three-dimensional location service capability for integrated air-space-ground networks.

[0121] Figure 16 This is a schematic diagram of the structure of an electronic device provided in an embodiment of the present invention.

[0122] The following is a detailed reference. Figure 16The diagram illustrates a structural schematic suitable for implementing an electronic device according to embodiments of the present invention. The electronic device may include a processor (e.g., a central processing unit, graphics processor, etc.) 1601, which can perform various appropriate actions and processes according to a program stored in read-only memory (ROM) 1602 or a program loaded from memory 1608 into random access memory (RAM) 1603. The RAM 1603 also stores various programs and data required for the operation of the electronic device. The processor 1601, ROM 1602, and RAM 1603 are interconnected via a bus 1604. An input / output (I / O) interface 1605 is also connected to the bus 1604.

[0123] Typically, the following devices can be connected to the I / O interface 1605: input devices 1606 including, for example, a touchscreen, touchpad, keyboard, mouse, camera, microphone, accelerometer, gyroscope, etc.; output devices 1607 including, for example, a liquid crystal display (LCD), speaker, vibrator, etc.; memory devices 1608 including, for example, magnetic tape, hard disk, etc.; and communication devices 1609. Communication device 1609 allows electronic devices to communicate wirelessly or wiredly with other devices to exchange data. Although Figure 16 Electronic devices with various devices are shown, but it should be understood that it is not required to implement or have all of the devices shown, and more or fewer devices may be implemented or have instead.

[0124] In particular, according to embodiments of the present invention, the processes described above with reference to the flowcharts can be implemented as computer software programs. For example, embodiments of the present invention include a computer program product comprising a computer program carried on a non-transitory computer-readable medium, the computer program containing program code for performing the methods shown in the flowcharts. In such embodiments, the computer program can be downloaded and installed from a network via communication device 1609, or installed from memory 1608, or installed from ROM 1602. When the computer program is executed by processor 1601, it performs the functions defined in the multicast communication method based on three-dimensional geographic location of the present invention.

[0125] Figure 16 The electronic device shown is merely an example and should not be construed as limiting the functionality and scope of use of the embodiments of the present invention.

[0126] This invention also provides a computer-readable storage medium. The methods described above according to embodiments of the invention can be implemented in hardware or firmware, or implemented as computer code that can be recorded on a storage medium, or implemented as computer code downloaded over a network and originally stored on a remote storage medium or a non-transitory machine-readable storage medium and then stored on a local storage medium. Thus, the methods described herein can be processed by software stored on a storage medium using a general-purpose computer, a dedicated processor, or programmable or dedicated hardware. The storage medium can be a magnetic disk, optical disk, read-only memory, random access memory, flash memory, hard disk, or solid-state drive, etc.; further, the storage medium can also include combinations of the above types of memory. It is understood that computers, processors, microprocessor controllers, or programmable hardware include storage components capable of storing or receiving software or computer code. When the software or computer code is accessed and executed by the computer, processor, or hardware, the multicast communication method based on three-dimensional geographic location shown in the above embodiments is implemented.

[0127] A portion of this invention can be applied as a computer program product, such as computer program instructions, which, when executed by a computer, can invoke or provide the methods and / or technical solutions according to the invention through the operation of the computer. Those skilled in the art will understand that the forms in which computer program instructions exist in a computer-readable medium include, but are not limited to, source files, executable files, installation package files, etc. Correspondingly, the ways in which computer program instructions are executed by a computer include, but are not limited to: the computer directly executing the instructions, or the computer compiling the instructions and then executing the corresponding compiled program, or the computer reading and executing the instructions, or the computer reading and installing the instructions and then executing the corresponding installed program. Here, the computer-readable medium can be any available computer-readable storage medium or communication medium accessible to a computer.

[0128] Although embodiments of the invention have been described in conjunction with the accompanying drawings, those skilled in the art can make various modifications and variations without departing from the spirit and scope of the invention, and such modifications and variations all fall within the scope defined by the appended claims.

Claims

1. A multicast communication method based on three-dimensional geographic location, characterized in that, The method includes: Obtain the three-dimensional geographic location of the target area; Generate a spatial identifier for the target area based on the three-dimensional geographic location; Based on the spatial identifier, a service query is performed to obtain the mapping relationship corresponding to the target area; Based on the mapping relationship, routing and addressing are performed on the target area to generate a flow table; Multicast communication messages are generated based on the spatial identifier, and the multicast communication messages are sent to all receiving terminals in the target area according to the flow table; Based on the multicast communication message, valid terminals are selected from all receiving terminals so that each valid terminal can receive and process the multicast communication message.

2. The method according to claim 1, characterized in that, The three-dimensional geographic location includes multiple latitude and longitude coordinates and an altitude range; The process of generating a spatial identifier for the target area based on the three-dimensional geographic location includes: Verify whether the area formed by the multiple latitude and longitude coordinates is rectangular; When the coordinates are not rectangular, the multiple latitude and longitude coordinates are corrected to obtain the corresponding multiple corrected coordinates; Based on the multiple corrected coordinates, a subdivided grid code is generated; Based on the aforementioned altitude range, an altitude code is generated; The preset prefix identifier, preset type identifier, subdivision grid code, height code, and preset extension bit are sequentially concatenated to form the spatial identifier. The preset prefix identifier represents the network type, and the preset type identifier represents the service type.

3. The method according to claim 2, characterized in that, The step of generating a subdivided grid code based on the multiple corrected coordinates includes: An extended model based on geographic region mapping is adopted to encode each corrected coordinate, thereby obtaining the code of the corrected coordinate in each grid layer, and integrating them according to the grid hierarchy order to form the grid code of the corrected coordinate; Perform layer-by-layer consistency verification on the grid encoding of the multiple corrected coordinates to determine the target valid layer; Convert the target effective layer into a binary hierarchical encoding; For any modified coordinate grid encoding, retain the encoding of the target effective layer and all layers before it, and set the encoding of all layers after the target effective layer to a preset value to obtain the planar encoding of the target region; Determine the region boundaries of the plurality of corrected coordinates in the grid corresponding to the effective layer of the target; Obtain the standard longitude and standard latitude of the grid in the next layer of the target effective layer; Based on the region boundary, the standard longitude, and the standard latitude, determine the grid type of the target region, and determine the extended code corresponding to the grid type; The hierarchical encoding, the planar encoding, and the extended encoding are sequentially integrated into the subdivided grid encoding.

4. The method according to claim 3, characterized in that, The region boundary includes the maximum relative longitude, minimum relative longitude, maximum relative latitude, and minimum relative latitude; Determining the grid type of the target region based on the region boundary, the standard longitude, and the standard latitude includes: When the maximum relative latitude is greater than the standard latitude, the minimum relative latitude is less than the standard latitude, the maximum relative longitude is greater than the standard longitude, and the minimum relative longitude is less than the standard longitude, the span type is determined to be a full span. When the maximum relative latitude is greater than the standard latitude, the minimum relative latitude is less than the standard latitude, and the maximum relative longitude is less than the standard longitude, the span type is determined to be spanning the top and bottom left. When the maximum relative latitude is greater than the standard latitude, the minimum relative latitude is less than the standard latitude, and the minimum relative longitude is greater than the standard longitude, the grid type is determined to be a grid span that is vertically or horizontally biased to the right. If the maximum relative longitude is greater than the standard longitude, the minimum relative longitude is less than the standard longitude, and the minimum relative latitude is greater than the standard latitude, then the span type is determined to be a span of left-right-upper. If the maximum relative longitude is greater than the standard longitude, the minimum relative longitude is less than the standard longitude, and the maximum relative latitude is less than the standard latitude, then the span type is determined to be a left-right-low span.

5. The method according to claim 2, characterized in that, The process of generating altitude codes based on the altitude range includes: Determine the airspace category corresponding to the altitude range, and determine the first code corresponding to the airspace category; When the airspace category is uncontrolled, the altitude range corresponding to the airspace category is refined into multiple coarse-grained altitude ranges. When a coarse-grained height range containing the altitude range exists, a second code corresponding to the coarse-grained height range is determined; when no coarse-grained height range containing the altitude range exists, the second code is determined to be a preset value, and refinement is stopped. The coarse-grained height range is further refined into medium-grained height ranges to obtain multiple medium-grained height ranges; When a medium-grained height range containing the altitude range exists, a third code corresponding to the medium-grained height range is determined; when no medium-grained height range containing the altitude range exists, the third code is determined to be the preset value, and refinement is stopped. The medium-grained height range is further refined into multiple fine-grained height ranges; When a fine-grained height range containing the altitude range exists, the fourth code corresponding to the fine-grained height range is determined; when no fine-grained height range containing the altitude range exists, the fourth code is determined to be the preset value, and the refinement is stopped. Based on the granularity corresponding to the stop refinement, the hierarchical identifier is determined, and the hierarchical identifier, the first code, the second code, the third code, and the fourth code are sequentially integrated into the height code.

6. The method according to claim 2, characterized in that, The step of filtering valid terminals from all receiving terminals based on the multicast communication message includes: The subdivided grid code and height code are obtained by parsing the multicast communication message; Obtain the subdivision grid code and height code generated by each receiving terminal; The subdivision grid code and height code of the multicast communication message are matched with the subdivision grid code and height code generated by the receiving terminal. If the match is successful, the receiving terminal is determined to be a valid terminal.

7. The method according to claim 1, characterized in that, The step of performing a service query based on the spatial identifier to obtain the mapping relationship corresponding to the target region includes: A query request is generated based on the service query message, wherein the service query message is generated based on the spatial identifier; Based on the query request, the mapping relationship corresponding to the target region is extracted from the mapping relationship database.

8. A multicast communication system based on three-dimensional geographic location, characterized in that, The system includes: A sending terminal is used to obtain the three-dimensional geographic location of a target area, generate a spatial identifier of the target area based on the three-dimensional geographic location, and generate a multicast communication message based on the spatial identifier; An open network operating system is used to perform service queries based on the spatial identifier, obtain the mapping relationship corresponding to the target area, perform routing and addressing of the target area based on the mapping relationship, and generate a flow table; A programmable switching device is used to send the multicast communication messages to all receiving terminals in the target area according to the flow table; A receiving terminal is configured to filter valid terminals from all receiving terminals based on the multicast communication message, so that each valid terminal receives and processes the multicast communication message.

9. An electronic device, characterized in that, include: A memory and a processor are communicatively connected, the memory storing computer instructions, and the processor executing the computer instructions to perform the multicast communication method based on three-dimensional geographic location as described in any one of claims 1 to 7.

10. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores computer instructions for causing the computer to perform the multicast communication method based on three-dimensional geographic location as described in any one of claims 1 to 7.

Images