CN115801658A - Network routing communication method based on geographic grids - Google Patents
Network routing communication method based on geographic grids Download PDFInfo
- Publication number
- CN115801658A CN115801658A CN202211215728.7A CN202211215728A CN115801658A CN 115801658 A CN115801658 A CN 115801658A CN 202211215728 A CN202211215728 A CN 202211215728A CN 115801658 A CN115801658 A CN 115801658A
- Authority
- CN
- China
- Prior art keywords
- network
- node
- cost
- geographic
- grid
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 43
- 230000006854 communication Effects 0.000 title claims abstract description 37
- 238000004891 communication Methods 0.000 title claims abstract description 36
- 230000000875 corresponding effect Effects 0.000 claims description 10
- 230000006835 compression Effects 0.000 claims description 4
- 238000007906 compression Methods 0.000 claims description 4
- 230000002596 correlated effect Effects 0.000 claims description 4
- 230000009286 beneficial effect Effects 0.000 abstract description 2
- 238000005516 engineering process Methods 0.000 description 8
- 230000008569 process Effects 0.000 description 8
- 238000004364 calculation method Methods 0.000 description 5
- 230000007547 defect Effects 0.000 description 3
- 238000010586 diagram Methods 0.000 description 3
- 238000013507 mapping Methods 0.000 description 3
- 238000000926 separation method Methods 0.000 description 3
- 238000011161 development Methods 0.000 description 2
- 230000000694 effects Effects 0.000 description 2
- 238000011156 evaluation Methods 0.000 description 2
- 230000033001 locomotion Effects 0.000 description 2
- 230000002776 aggregation Effects 0.000 description 1
- 238000004220 aggregation Methods 0.000 description 1
- 230000005540 biological transmission Effects 0.000 description 1
- 238000006243 chemical reaction Methods 0.000 description 1
- 238000010276 construction Methods 0.000 description 1
- 230000002079 cooperative effect Effects 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 238000000265 homogenisation Methods 0.000 description 1
- 230000010354 integration Effects 0.000 description 1
- 238000012423 maintenance Methods 0.000 description 1
- 238000007726 management method Methods 0.000 description 1
- 230000007246 mechanism Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000008520 organization Effects 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
- 238000004904 shortening Methods 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
- 230000007704 transition Effects 0.000 description 1
Images
Classifications
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Abstract
The invention discloses a network routing communication method based on geographic grids, which comprises the following steps: generating a geographical location identifier of the network based on the geographical grid code; taking the geographic position identification of the grid corresponding to the longitude and latitude of an access terminal in the network as the UID of the terminal; the sending terminal generates a data packet containing a sending terminal UID and a target terminal UID; determining a network routing path according to the geographical position identification of the node; the data packet is transmitted to a router of which the subnet range contains a target terminal UID according to a network routing path; and the router containing the UID of the target terminal sends the data packet to the target terminal. The invention is beneficial to reducing network consumption and realizing high-efficiency communication of the network.
Description
Technical Field
The invention belongs to the technical field of network communication, and particularly relates to a network routing communication method based on a geographic grid.
Background
In the traditional network, the IP is a bridge between various transmission media and various network applications, and the homogenization pattern of the "one-block bridge for IP" can not meet the application requirements of diversification, diversification and specialization, so that the network world develops slowly due to the loss of the inherent vitality of diversification. With the proposal of multidimensional identification, the transition of a network from single construction to multidimensional development is an advanced stage of the development, and a multimodal addressing routing method should be developed for personalized network identification to improve the quality of network service.
Diversified addressing and routing modes are required for diversified network applications, and the multi-modal addressing and routing mechanism of the novel network comprises the following typical modes:
(1) IPv4/IPv6 based addressing and routing. The method adopts technologies such as a hierarchical address mode, automatic address configuration, source authentication and the like, has stronger flexibility and rapid processing capability, and can continuously play an important role in a novel network.
(2) Content identification based addressing and routing. The mode changes the network communication mode from attention to 'where' to 'what' and considers all data contents in the network as transmittable information, thereby realizing the direct content interconnection mode instead of the host interconnection.
(3) Identity based addressing and routing. The method comprehensively and effectively solves the problems of safety, mobility, expandability, user experience and the like through identity and position separation, resource and position separation and access and core separation.
(4) Addressing and routing centered on a spatial coordinate location identification. The method carries out network position coding based on the coordinate position information, can realize direct mapping of the network space and the real space position, and provides support for improving the network application efficiency.
The existing routing addressing based on the space coordinate position identification has the following defects:
(1) Location updates and lookups are slow. The routing protocol based on the position information performs routing forwarding through the position information, and needs to additionally manage the geographical position information. The position information of the current routing protocol based on the position is recorded in the form of latitude and longitude, and is more complex in the aspects of position updating and searching.
(2) The route forwarding time delay is long. In the process of routing addressing, the distance between nodes is calculated through longitude and latitude coordinates to select a data forwarding path, and the calculation is complex.
(3) The network flexibility is not strong. In the existing routing protocol, when a node in the network fails or moves far away, the current connectivity state is affected, and in order to maintain connectivity, a route needs to be re-planned, thereby generating a large routing overhead.
Disclosure of Invention
The invention aims to overcome the defects and provide a network routing communication method based on a geographic grid, which solves the technical problems that the current routing protocol based on position information is slow in position updating and searching, long in routing forwarding delay, low in network flexibility and the like. The invention can effectively improve the communication efficiency.
In order to achieve the above purpose, the invention provides the following technical scheme:
a method of geographic grid based network routed communications, comprising:
generating a geographical location identifier of the network based on the geographical grid code;
taking the geographic position identification of the grid corresponding to the longitude and latitude of an access terminal in the network as the UID of the terminal;
the sending terminal generates a data packet containing a sending terminal UID and a target terminal UID;
determining a network routing path according to the geographical position identification of the node;
the data packet is transmitted to a router of which the subnet range contains a target terminal UID according to a network routing path;
and the router containing the UID of the target terminal sends the data packet to the target terminal.
Further, based on the geographic grid code, the method for generating the geographic location identifier of the network comprises:
selecting a global subdivision grid;
acquiring longitude and latitude coordinates of each grid in the global subdivision grid based on outdoor and indoor positioning methods;
converting the longitude and latitude coordinates of each grid into geographic grid codes;
and carrying out multi-scale compression on the geographic grid codes to generate the geographic position identification of the network.
Further, the method for determining the network routing path according to the geographical location identifier of the node comprises the following steps:
analyzing the geographic grid codes of the nodes according to the geographic position identifiers of the nodes, and calculating the distance and the topological direction between the nodes through a code algebra;
constructing distance cost, topological azimuth cost and space constraint cost according to the distance between the nodes, the topological azimuth and the geographical position identification of the nodes;
and determining the network routing path according to the distance cost, the topological orientation cost or the space constraint cost.
Further, the method for obtaining the distance between the nodes according to the geographical position identification of the nodes comprises the following steps:
and carrying out bit operation on the geographic grid codes in the geographic position identifications corresponding to different nodes to obtain the distance between the nodes.
Further, the method for acquiring the topological orientation between the nodes according to the geographical position identification of the nodes comprises the following steps:
and calculating a cosine value of an included angle ASB according to the geographic grid codes in the geographic position identifications corresponding to the source node A, the target node B and the topological adjacent node S of the source node, and obtaining an angle value of the included angle ASB according to the cosine value, namely the topological orientation of the topological adjacent node S of the source node.
Further, the method for constructing the distance cost, the topology orientation cost and the space constraint cost according to the distance between the nodes and the topology orientation comprises the following steps:
judging whether the node is located in the space constraint area according to the geographical position identification of the node, and enabling the space constraint cost to be 0 when the node is located in the space constraint area, otherwise enabling the space constraint cost to be larger than 0;
the value of the distance cost is positively correlated with the distance between the node and the source node;
the value of the topological orientation cost is positively correlated with the topological orientation of the node.
Furthermore, the boundary of the space constraint region is obtained after the boundary of the convex hull constraint region between the source node and the target node is extended by a preset threshold.
Further, when a network routing path is determined according to the distance cost, the topology orientation cost or the space constraint cost, the sum of the distance cost, the topology orientation cost or the space constraint cost is the minimum value through the selection of the nodes in the path.
Further, when the communication range of the sending terminal and the target terminal is a local network, re-identifying the common prefix of the sending terminal UID and the target terminal UID by using the short code, when determining the network routing path according to the geographical position identifier of the node, removing the short code in the geographical position identifier of the node, and then determining the network routing path by using other parts of the geographical position identifier; the number of bits of the short code is less than the number of bits of the common prefix.
Further, the global subdivision grid is a multi-scale grid determined according to the network structure and the communication capability of the terminal.
Compared with the prior art, the invention has the following beneficial effects:
(1) The invention takes the geographical grid code as the network geographical position identification, realizes a novel routing addressing method under the condition of not changing the network routing addressing infrastructure, and can effectively improve the communication efficiency;
(2) When the invention is used for addressing, only the geographic characteristics need to be extracted from the position identification, and the geographic characteristics are combined and added into the novel routing table, so that a large amount of expenses of the traditional network addressing protocol in the aspects of routing table maintenance and the like are avoided;
(3) Aiming at the network communication of local areas, the invention re-identifies the common prefix by using the short code and applies multi-scale identification coding, thereby further reducing the number of coding bits, reducing the network consumption and realizing the high-efficiency communication of the network.
Drawings
FIG. 1 is a schematic diagram of a network geolocation tag for a local network of the present invention;
FIG. 2 is a schematic diagram of a data packet according to the present invention;
FIG. 3 is a schematic diagram of a network routing path based on geographical location identification according to the present invention;
FIG. 4 is a flowchart illustrating a network geolocation identifier generation process of the present invention;
fig. 5 is a flowchart of a method for routing communications through a network based on a geographic grid according to a preferred embodiment of the present invention.
Detailed Description
The features and advantages of the present invention will become more apparent and appreciated from the following detailed description of the invention.
The word "exemplary" is used exclusively herein to mean "serving as an example, embodiment, or illustration. Any embodiment described herein as "exemplary" is not necessarily to be construed as preferred or advantageous over other embodiments. While the various aspects of the embodiments are presented in drawings, the drawings are not necessarily drawn to scale unless specifically indicated.
Aiming at the defects of slow position updating and searching, long route forwarding delay, low network flexibility and the like of the current routing protocol based on position information, the invention provides a network routing communication method based on geographic position identification.
As shown in fig. 5, in a preferred embodiment of the present invention, a routing communication method based on network geolocation code includes the following steps:
1. unique identification of network geographic location based on geographic grid coding
The network geographical position identification code is based on the network identification, and is modified on the basis of the network identification so as to have the characteristic of a spatial address. The selected geographic grid framework has a global coverage, multi-level nesting and step-by-step coding longitude and latitude grid system, and is convenient to convert and calculate with the existing system.
As shown in fig. 4, after a suitable global subdivision grid framework is selected, indoor and outdoor integrated network position information acquisition can be achieved based on the Beidou satellite positioning and indoor high-precision positioning technologies respectively.
And the outdoor high-precision space data positioning can adopt Beidou coordinates and Beidou output by a Beidou satellite. The Beidou system adopts a Beidou coordinate system (BDCS), the coordinate system definition conforms to the international earth rotation service organization (IERS) specification, and reference ellipsoid parameters of a 2000 China geodetic coordinate system (CGCS 2000) are adopted and aligned to the latest international earth reference frame (ITRF) and are updated once a year. The accurate position can be calculated by three satellites and the positioning clock difference.
The indoor high-precision space positioning can be assisted by the positioning technologies such as the existing wireless local area network positioning technology, the radio frequency tag positioning technology, the zigbee positioning technology, the bluetooth positioning technology, the ultra-wideband positioning technology and the like.
After the position information is obtained, the longitude and latitude coordinates are converted into space grid codes, multi-scale compression is carried out according to application requirements, and finally a network position geographic identification is generated. The multi-scale compression is to determine a proper grid level according to the size of a node, and the higher the level is, the larger the corresponding grid is, and the shorter the code is.
2. Generating network geographical location identification data packet
Based on the network geolocation identification code, in combination with a globally consistent geography trellis coding system, the network geolocation identification network system shown in fig. 2 may be formed, where FCS in fig. 2 is a fixed field at the end of a data packet for checking data integrity.
Each access terminal in the network is assigned with a User Identification (UID) which represents the spatio-temporal position information of the User and provides a basis for data delivery. The UID communication terminal can determine the current space-time position through navigation positioning time service information of a Beidou satellite group, longitude and latitude of the terminal are obtained through code conversion, the longitude and the latitude are respectively converted into two-bit system numbers, binary one-dimensional grid codes of the position are obtained through bit-by-bit cross combination, the coding bit numbers are different, and the expression precision and the grid size are also different. The code can also be converted into a 10-system-equivalent form, and corresponds to a unique code UID in a discrete space-time grid framework.
The core network is responsible for a routing forwarding function, and the Router is allocated with an RID (Router identity Identification) which describes an outsource aggregation area of all terminals in the subnet, namely UID ∈ RID, and is generally determined by a communication range of the Router.
When a user sends a data packet, only the UID marking the space-time position information of both communication sides needs to be appointed, when the data packet arrives at the exchange router, the router inquires the identification management server, searches the RID router containing the target UID, forwards the corresponding data packet to the target RID router, and the RID router searches the target UID to complete a communication process.
3. Network routing path computation incorporating geographical features
The location identification brings the network with the geographical location, and three characteristics of distance, direction and space constraint can be obtained from the geographical location, and the distance characteristic provides the physical distance between any two trellis-coded nodes.
The geographic feature integration scheme requires the advantages of integrating individual geographic features. Referring to fig. 3, the following is a detailed description of the features of each geographic feature:
(1) Distance between two adjacent plates
The distance can be used as an important index for network cost evaluation. Each node has a unique grid code, the grid code of each node contains geographic information, the spatial distance between the nodes can be obtained by directly carrying out bit operation on the grid codes of different nodes or calculating a mapping function of the grid codes and the actual geographic position, and the spatial distance is used as an important evaluation index in a routing table.
When the routing range is a local area with a small range and high density, the distance difference between the topological node and the target node may be very small or even overlapped, and at this time, the distance characteristic is limited, the function cannot be exerted, and the cooperative action with other characteristics is required.
(2) Topological orientation
The role of the topological orientation is a 'guiding' function in the routing process, which helps the router to decide the next optimal node, i.e. to forward to the next router closest to the target node. The calculation process is as follows: the geocode of the identifiers A and B, the topological adjacent IP identifier S and the geocode thereof can be obtained by calculation according to the coding information in the IP identifier of the source node A and the IP identifier of the target node B, the included angle formed by the identifiers S and A, B is calculated by utilizing the cosine theorem, cosine values among different included angles are compared, and the node with the smallest included angle is used as the next hop address of the router. In practical application, the grid codes are analyzed from the identifiers and then calculated, and the topological adjacent grid codes are calculated through the grid codes.
In the actual routing addressing, when the routing distance is far, the difference obtained by calculating the topological azimuth is small, the role of the azimuth in guiding is limited, and when the routing is always to a close distance, the difference of the calculated result of the topological azimuth is large, and the topological azimuth can really play a role.
(3) Space constraint
The space constraint characteristic provides constraint conditions for the routing addressing process, and the routing process is prevented from exceeding the area range. The region of the spatial constraint is a convex hull constraint region between the source node and the target node plus a certain threshold limit. The nodes forwarded in the routing process are in the convex hull range, so that the space constraint condition is met, the nodes exceeding the threshold limit outside the convex hull range give higher routing penalty cost, and the nodes outside the space constraint area are avoided as much as possible in the routing process.
Combining the advantages and disadvantages of the geographic features, the optimal geographic feature combination scheme is as follows: when the source node is far away from the target node, the cost of distance characteristics is taken as the main cost, and the topological azimuth characteristics are reduced or even not used; when the source node is closer to the target node, the addressing direction of the route is guided by the distance characteristic and the topological azimuth characteristic; the spatial constraint feature serves as a constraint condition for the entire route.
And generating network address codes with different scales according to the network structures and the communication capacities of various terminals in the network, and ensuring that the network address code level corresponds to the terminal network level. And adapting the communication range of the network node by combining the multi-scale division of the geographic grid. On the basis, the network coding mapping relation is stored in a network coding addressing large table, geographic space navigation calculation is combined, network space adjacent routing addressing based on geographic space identification is achieved, and a network path between a source address and a destination address is calculated.
As shown in fig. 1, for local area network communication, the network communication is limited in the area, and if the global network geographic identification code is continuously used, redundancy of the network location identification address space is caused. Therefore, it is necessary to combine with the actual application scenario, rely on the multi-scale characteristics of the location identifier, re-identify the common prefix by using the short code, and apply the multi-scale identifier coding, thereby further reducing the number of coding bits, reducing the network consumption, and realizing the high-efficiency communication of the network.
According to the principle, the position identification short code design can compress the identification by shortening the identification expression range, expressing the identification code in multiple scales and the like.
For a local geographical location network, firstly, a communication range of the local geographical location network is determined, the local geographical location network is registered in a network system, and a location identification access network router stores a location identification prefix corresponding to the communication range. When the network communication activity occurs in the communication range, the route calculation is carried out only by the identifier after the prefix is removed. When the network communication activity involves contact outside the area, the data packet needs to be repackaged on the access network router, and forwarded after the prefix of the corresponding area is added. Short codes here mean shorter than a common prefix.
Meanwhile, the motion capability and the temporal-spatial information precision of the terminal in the location network need to be considered. The terminals have different movement capabilities and different positioning accuracies, and geographic position marks of different levels are used.
The invention has been described in detail with reference to specific embodiments and illustrative examples, but the description is not intended to be construed in a limiting sense. Those skilled in the art will appreciate that various equivalent substitutions, modifications or improvements may be made to the technical solution of the present invention and its embodiments without departing from the spirit and scope of the present invention, which fall within the scope of the present invention. The scope of the invention is defined by the appended claims.
Those skilled in the art will appreciate that those matters not described in detail in the present specification are well known in the art.
Claims (10)
1. A method for routing a communication based on a geographic grid network, comprising:
generating a geographical location identifier of the network based on the geographical grid code;
taking the geographic position identification of the grid corresponding to the longitude and latitude of an access terminal in the network as the UID of the terminal;
the sending terminal generates a data packet containing a sending terminal UID and a target terminal UID;
determining a network routing path according to the geographical position identification of the node;
the data packet is transmitted to a router of which the subnet range contains a target terminal UID according to a network routing path;
and the router containing the target terminal UID sends the data packet to the target terminal.
2. The method of claim 1, wherein the method for generating the geographical location identifier of the network based on the geography grid coding comprises:
selecting a global subdivision grid;
acquiring longitude and latitude coordinates of each grid in the global subdivision grid based on outdoor and indoor positioning methods;
converting the longitude and latitude coordinates of each grid into geographic grid codes;
and carrying out multi-scale compression on the geographic grid codes to generate the geographic position identification of the network.
3. The method of claim 1, wherein the method for determining the network routing path according to the geographical location identifier of the node comprises:
acquiring the distance and the topological direction between the nodes according to the geographical position identification of the nodes;
constructing distance cost, topological azimuth cost and space constraint cost according to the distance between the nodes, the topological azimuth and the geographical position identification of the nodes;
and determining a network routing path according to the distance cost, the topological azimuth cost or the space constraint cost.
4. The method of claim 3, wherein the step of obtaining the distance between nodes according to the geographical location identifier of the node comprises:
and carrying out bit operation on the geographic grid codes in the geographic position identifications corresponding to different nodes to obtain the distance between the nodes.
5. The method for network routing communication based on geographic grids of claim 3, wherein the method for obtaining the topological orientation between the nodes according to the geographic position identification of the nodes comprises the following steps:
and calculating a cosine value of an included angle ASB according to the geographic grid codes in the geographic position identifications corresponding to the source node A, the target node B and the topological adjacent node S of the source node, and obtaining an angle value of the included angle ASB according to the cosine value, namely the topological orientation of the topological adjacent node S of the source node.
6. The method for network routing communication based on geographic grids of claim 5, wherein the method for constructing the distance cost, the topological orientation cost and the space constraint cost according to the distance between the nodes and the topological orientation comprises the following steps:
judging whether the node is located in the space constraint area according to the geographical position identification of the node, and enabling the space constraint cost to be 0 when the node is located in the space constraint area, otherwise enabling the space constraint cost to be larger than 0;
the value of the distance cost is positively correlated with the distance between the node and the source node;
the value of the topological orientation cost is positively correlated with the topological orientation of the node.
7. The method of claim 6, wherein the boundaries of the spatial constraint region are obtained by extending the boundaries of the convex hull constraint region between the source node and the destination node by a predetermined threshold.
8. The method of claim 3, wherein when determining the network routing path according to the distance cost, the topology orientation cost, or the spatial constraint cost, the selection of the nodes in the path minimizes the sum of the distance cost, the topology orientation cost, or the spatial constraint cost.
9. The method according to claim 1, wherein when the communication range between the sending terminal and the target terminal is a local network, the common prefix between the sending terminal UID and the target terminal UID is re-identified by using a short code, and when the network routing path is determined according to the geographical location identifier of the node, the short code in the geographical location identifier of the node is removed, and then the network routing path is determined by using the other part of the geographical location identifier; the number of bits of the short code is less than the number of bits of the common prefix.
10. The method of claim 2, wherein the globally split mesh is a multi-scale mesh determined according to the network structure and communication capability of the terminal.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211215728.7A CN115801658A (en) | 2022-09-30 | 2022-09-30 | Network routing communication method based on geographic grids |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211215728.7A CN115801658A (en) | 2022-09-30 | 2022-09-30 | Network routing communication method based on geographic grids |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN115801658A true CN115801658A (en) | 2023-03-14 |
Family
ID=85432543
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202211215728.7A Pending CN115801658A (en) | 2022-09-30 | 2022-09-30 | Network routing communication method based on geographic grids |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115801658A (en) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20160091319A1 (en) * | 2014-09-25 | 2016-03-31 | United States Postal Service | Methods and systems for creating and using a location identification grid |
| CN105509743A (en) * | 2015-11-24 | 2016-04-20 | 上海汽车集团股份有限公司 | A positioning processing method, a business platform and a network system |
| CN105764084A (en) * | 2016-02-05 | 2016-07-13 | 南京邮电大学 | Wireless sensor network multipath routing protocol realization method |
| CN107153711A (en) * | 2017-05-19 | 2017-09-12 | 北京旋极伏羲大数据技术有限公司 | Geographic information data processing method and processing device |
| US20190174208A1 (en) * | 2017-12-05 | 2019-06-06 | The Government of the United States of America, as represented by the Secretary of Homeland Security | Systems and Methods for Integrating First Responder Technologies |
-
2022
- 2022-09-30 CN CN202211215728.7A patent/CN115801658A/en active Pending
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20160091319A1 (en) * | 2014-09-25 | 2016-03-31 | United States Postal Service | Methods and systems for creating and using a location identification grid |
| CN105509743A (en) * | 2015-11-24 | 2016-04-20 | 上海汽车集团股份有限公司 | A positioning processing method, a business platform and a network system |
| CN105764084A (en) * | 2016-02-05 | 2016-07-13 | 南京邮电大学 | Wireless sensor network multipath routing protocol realization method |
| CN107153711A (en) * | 2017-05-19 | 2017-09-12 | 北京旋极伏羲大数据技术有限公司 | Geographic information data processing method and processing device |
| US20190174208A1 (en) * | 2017-12-05 | 2019-06-06 | The Government of the United States of America, as represented by the Secretary of Homeland Security | Systems and Methods for Integrating First Responder Technologies |
Non-Patent Citations (3)
| Title |
|---|
| WEI XIAOFENG ETC: ""Chain Code Methods for Hexagonal Grids"", 《WEB OF SCIENCE》, 5 November 2019 (2019-11-05) * |
| 张玮等: ""一种卫星资源一体化网格组织模型"", 《武汉大学学报（信息科学版）》, 11 December 2019 (2019-12-11) * |
| 陆楠等: ""基于GeoSOT地理网格的环境信息标识与检索方法"", 《河北农业大学学报》, 15 November 2015 (2015-11-15) * |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102823309B (en) | The method and apparatus of serviceability historical data in localization method selection | |
| CN102118456B (en) | Mixed addressing method for heaven and earth networks based on geographical position information | |
| CN109327542B (en) | Game service access response method, request forwarding method, connection method and device | |
| US9426044B2 (en) | Radio access network geographic information system with multiple format | |
| CN1689286A (en) | Signal propagation delay routing | |
| CN101095317A (en) | Obtaining routing information | |
| CN103339988A (en) | Network system | |
| US20070249329A1 (en) | Method of providing route update messages and paging access terminals | |
| Hussaini et al. | Efficient producer mobility management model in Information-Centric Networking | |
| CN104580350A (en) | Server-based positioning system architecture | |
| Ciavarrini et al. | Smartphone-based geolocation of Internet hosts | |
| CN109389848A (en) | A kind of car networking real-time analyzer based on HASH | |
| Brahmi et al. | An improved map-based location service for vehicular ad hoc networks | |
| Aissaoui et al. | Hcbls: A hierarchical cluster-based location service in urban environment | |
| Ashok et al. | Efficient map based location service for VANETs | |
| Zamanifar et al. | EECASC: an energy efficient communication approach in smart cities | |
| CN103973832A (en) | IPv6 addressing and networking method based on physical space position mapping | |
| CN114353795A (en) | Indoor three-dimensional positioning system and method based on UWB equipment | |
| CN114158106A (en) | Distributed routing method, device and storage medium for satellite network | |
| CN115801658A (en) | Network routing communication method based on geographic grids | |
| CN104159265B (en) | A kind of data transmission method towards low-speed wireless MANET | |
| Wala et al. | Identification of optimal location points for efficient data gathering in IoT environment | |
| Xiaonan et al. | A scheme for connecting vehicular networks to the Internet | |
| CN103686807A (en) | CCN subnet mobile data transmission method | |
| WO2023065855A1 (en) | Control routing method, apparatus, and system in satellite network |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |