CN104320383B - Domain name generation method based on geographical position coding - Google Patents

Abstract

The invention discloses a method for generating a domain name based on geographic location codes, which includes the following steps: acquiring geographic location information; generating corresponding location codes according to longitude information and latitude information; generating according to corresponding location codes and a preset location mask corresponding domain name. In the method of the embodiment of the present invention, the corresponding domain name is generated according to the corresponding location code and mask, and the geographic location is coded into a location code that can be clustered, so that the location code can not only locate a certain location, but also cover an area, and Generate a specific domain name according to the location code, and publish and receive information based on the domain name, so that Internet devices in the same location or a specified location area can know each other, and obtain information related to these locations through a specific domain name, so that the information of the specified location Publishing and communication just got easier.

Description

Domain Name Generation Method Based on Geographical Coding

technical field

The invention relates to the technical field of computer networks, in particular to a method for generating a domain name based on geographic location coding.

Background technique

At present, geographical location is usually presented in the form of longitude and latitude. Due to the existence of binary or even more metadata such as height, the data is usually not easy to store and present. Especially when using the Internet, due to the complex data structure, resulting in Data is not readily available. In related technologies, it is usually packaged and presented with complex data structures on top of HTTP (HTTP-Hypertext transfer protocol), for example, the API (Application Programming Interface, application programming interface) used by Google or Baidu They all use more complex data packaging forms. However, each application system uses its own defined API, and the geographical location information is separated in each application, making it difficult to establish a unified location service interface on the Internet. In addition, another problem with the expression of geographical location is that describing the scope of geographical location is a relatively complicated problem. Using the expression of latitude and longitude, it is difficult to generate a clustering relationship between locations, which also makes it difficult to design and implement the range search.

Contents of the invention

The present invention aims at solving one of the technical problems in the related art mentioned above at least to a certain extent.

For this reason, the object of the present invention is to propose a method for generating a domain name based on geographic location codes that facilitates information release and communication at a specified location.

In order to achieve the above purpose, the embodiment of the present invention proposes a method for generating a domain name based on geographic location coding, including the following steps: acquiring geographic location information, wherein the geographic location information includes longitude information and latitude information; according to the longitude information generating a location code corresponding to the latitude information; and generating a corresponding domain name according to the corresponding location code and a preset location mask.

According to the domain name generation method based on geographic location coding proposed in the embodiment of the present invention, by generating the corresponding location code according to the longitude information and latitude information, the corresponding domain name is generated according to the corresponding location code and the preset mask, and the geographic location code is generated. For location codes that can be clustered, the location code can not only locate a certain location, but also cover an area, and generate a specific DNS (Domain Name System, DomainName, domain name) based on the location code, and publish information based on the domain name. It can make Internet devices in the same location or a designated location area know each other, and Internet devices can obtain information related to these locations through a specific DNS domain name, making it easier to publish and communicate information at designated locations.

In addition, the method for generating a domain name based on geographic location coding according to the above-mentioned embodiments of the present invention may also have the following additional technical features:

In one embodiment of the present invention, after the acquiring the geographic location information, it further includes: encoding the longitude into n-bit binary, wherein the n-bit binary includes a symbol segment and a data segment, and the data The segment includes a first data segment and a second data segment, the symbol of the longitude is encoded into the symbol segment, and the absolute value of the longitude is encoded into the data segment, wherein the first data segment represents the The integer part of the absolute value of the longitude, the second data segment represents the fractional part of the absolute value of the longitude, n is a positive integer greater than 9; the latitude is encoded as the n-bit binary, and the latitude of A symbol is encoded into the symbol segment, and the absolute value of the latitude is encoded into the data segment.

Further, in an embodiment of the present invention, said generating corresponding position codes according to said longitude information and latitude information specifically includes: binary encoding of n bits of said longitude encoding and n bits of said latitude encoding Binary cross-merging is performed to obtain the position code; the geographic location range is described by the position code and the preset position mask represented by k, wherein the position mask is k indicating that the first 2k bits of all codes and An area composed of all positions with the same first 2k bits of the position code, where k is a positive integer greater than 2 and less than or equal to n.

Further, in an embodiment of the present invention, the generating the corresponding domain name according to the corresponding position code and position mask specifically includes: starting from the leftmost according to the corresponding position code and position mask, Every 2m bits are converted into a domain to obtain a list of converted domains, wherein m is a positive integer; the list of domains is reversed and connected to a preset suffix domain name to generate the corresponding domain name.

Preferably, in one embodiment of the present invention, m=2.

Further, in an embodiment of the present invention, every 2m bits is converted into a domain with only one character, so that the domain name of the entity whose length exceeds one character is used to represent the domain name of the entity within the range limited by the location code and the location mask.

Further, in an embodiment of the present invention, the encoding the longitude into n-bit binary and the encoding the latitude into n-bit binary specifically include: by using 1 bit to represent a sign and 8 bits to represent data to the left of the decimal point, and the remaining n-9 bits to represent data to the right of the decimal point to encode the longitude as n-bit binary; side data, and the remaining n-8 bits represent the data on the right side of the decimal point to encode the latitude into n-bit binary.

Further, in an embodiment of the present invention, the cross-merging of the n-bit binary of the longitude code and the n-bit binary of the latitude code to obtain the position code specifically includes: The longitude-coded n-bit binary and the latitude-coded n-bit binary are cross-merged, the odd bits are placed in the longitude-coded n-bit binary, and the even-numbered bits are placed in the latitude-coded n-bit binary , or, put the n-bit binary of the latitude code in odd bits, and put the n-bit binary of the longitude code in even bits, so as to obtain the position code.

Further, in an embodiment of the present invention, the above method further includes: accessing the domain name to obtain the information corresponding to the specified location range

Additional aspects and advantages of the invention will be set forth in part in the description which follows, and in part will be obvious from the description, or may be learned by practice of the invention.

Description of drawings

The above and/or additional aspects and advantages of the present invention will become apparent and comprehensible from the description of the embodiments in conjunction with the following drawings, wherein:

Fig. 1 is the flow chart of the domain name generation method based on geographic location code according to one embodiment of the present invention;

Fig. 2 is the flow chart of converting the part on the right side of the decimal point of a decimal real number into a binary encoding method according to an embodiment of the present invention;

FIG. 3 is a flow chart of a method for generating a position code according to an embodiment of the present invention;

FIG. 4 is a flowchart of a method for using a location mask according to an embodiment of the present invention;

Fig. 5 is a schematic diagram of geographic range longitudes corresponding to location codes of different lengths according to an embodiment of the present invention;

Fig. 6 is a flowchart of a method for obtaining a series of location codes and location masks through a range of longitude and latitude according to an embodiment of the present invention;

FIG. 7 is a schematic structural diagram of DNS according to an embodiment of the present invention;

FIG. 8 is a schematic diagram of a DNS resolution process according to an embodiment of the present invention;

FIG. 9 is a flowchart of a method for generating a domain name based on geographic location coding according to a specific embodiment of the present invention; and

Fig. 10 is a schematic diagram of a conversion table of encoding a location code and a location mask into a DNS domain name according to an embodiment of the present invention.

Detailed ways

Embodiments of the present invention are described in detail below, examples of which are shown in the drawings, wherein the same or similar reference numerals designate the same or similar elements or elements having the same or similar functions throughout. The embodiments described below by referring to the figures are exemplary and are intended to explain the present invention and should not be construed as limiting the present invention.

In addition, the terms "first" and "second" are used for descriptive purposes only, and cannot be interpreted as indicating or implying relative importance or implicitly specifying the quantity of indicated technical features. Thus, a feature defined as "first" and "second" may explicitly or implicitly include one or more of these features. In the description of the present invention, "plurality" means two or more, unless otherwise specifically defined.

In the present invention, unless otherwise clearly specified and limited, terms such as "installation", "connection", "connection" and "fixation" should be understood in a broad sense, for example, it can be a fixed connection or a detachable connection , or integrally connected; it may be mechanically connected or electrically connected; it may be directly connected or indirectly connected through an intermediary, and it may be the internal communication of two components. Those of ordinary skill in the art can understand the specific meanings of the above terms in the present invention according to specific situations.

In the present invention, unless otherwise clearly specified and limited, a first feature being "on" or "under" a second feature may include direct contact between the first and second features, and may also include the first and second features Not in direct contact but through another characteristic contact between them. Moreover, "above", "above" and "above" the first feature on the second feature include that the first feature is directly above and obliquely above the second feature, or simply means that the first feature is horizontally higher than the second feature. "Below", "below" and "under" the first feature to the second feature include that the first feature is directly above and obliquely above the second feature, or simply means that the first feature is less horizontal than the second feature.

The method for generating a domain name based on geographic location coding according to an embodiment of the present invention will be described below with reference to the accompanying drawings. Shown in Fig. 1 with reference to, this method comprises the following steps:

S101. Acquire geographic location information, where the geographic location information includes longitude information and latitude information.

Geographic locations are usually described in terms of longitude and latitude. Longitude is the number of degrees east or west of a point on Earth from a north-south line called the prime meridian. Among them, the longitude of the prime meridian is 0°, and the longitude of other places on the earth is 180° to the east or 180° to the west. Unlike latitude, which has the equator as a natural starting point, longitude has no natural starting point. British cartography People use the meridian passing through the Greenwich Observatory in London as the starting point, and other countries or people have used other meridians as the starting point in the past, such as Rome, Copenhagen, Jerusalem, St. Petersburg, Pisa, Paris, and Philadelphia. The Greenwich meridian was officially established as the origin of longitude at the International Prime Meridian Congress in 1884. 180° east longitude is 180° west longitude, which is approximately equivalent to the international date line, and the dates on both sides of the international date line differ by one day. Specifically, longitude refers to the dihedral angle formed by the meridian plane passing through a certain place and the prime meridian plane. Longitudes east of the prime meridian are called east longitudes, and those west of the prime meridian are called west longitudes. East longitude is represented by "E" and west longitude is represented by "W". Each degree of longitude is divided into 60 arc minutes, and each minute is divided into 60 seconds. A longitude thus generally looks like this: 23°27'30"E or 23°27'30"W. Seconds are expressed as fractional minutes in more precise longitude positions, eg: 23°27.500'E.

Together, a longitude and a latitude determine the precise location of a place on Earth. Latitude refers to the line-plane angle formed by a line connecting a point with the center of the earth and the equatorial plane of the earth, and its value is between 0 and 90 degrees. The latitude of the point north of the equator is called north latitude, denoted as N; the latitude of the point south of the equator is called south latitude, denoted as S, and each degree of latitude is equivalent to about 111km.

There are many ways to express latitude and longitude, such as ddd.ddddd degree is the decimal real number representation of longitude or latitude, for example: 31.12035°; and ddd.mm.mmm is degree.minute, which is divided into decimal real numbers such as 31°10.335′; or ddd.mm.ss, degrees. minutes. seconds, such as 31°12′42".

In one embodiment of the present invention, what the embodiment of the present invention uses is the real number expression mode of longitude or latitude, and the method for converting latitude and longitude into decimal real numbers is very simple, according to the following formula Decimal Degrees=Degrees+minutes/60+ seconds/3600, such as: 57°55′56.6"=57+55/60+56.6/3600=57.9323888888888. The longitude is between -180° and 180°, the east longitude is positive, the west longitude is negative, and the latitude is - Between 90° and 90°, the north latitude is a positive number and the south latitude is a negative number.

Wherein, in one embodiment of the present invention, after obtaining the geographic location information, it also includes: encoding the longitude into n-bit binary, wherein the n-bit binary includes a symbol segment and a data segment, and the data segment includes the first data segment and the second data segment, the symbol of longitude is encoded into the symbol segment, and the absolute value of longitude is encoded into the data segment, wherein the first data segment represents the integer part of the absolute value of longitude, and the second data segment represents the decimal of the absolute value of longitude part, n is a positive integer greater than 9; encode the latitude into n-bit binary, encode the sign of the latitude into the symbol segment, and encode the absolute value of the latitude into the data segment.

In one embodiment of the present invention, the embodiment of the present invention encodes the longitude or latitude into a binary representation. For real numbers converted from decimal to binary, the scheme in the IEEE 754 standard proposes that floating-point numbers in the digital system are approximations to real numbers (decimals) in mathematics, and the standard stipulates that the sequence of 0 and 1 expressing floating-point numbers is divided into three parts (Three domains): Taking 32-bit single-precision floating-point numbers as an example, the specific conversion rules are: firstly, binary decimals are expressed in binary scientific notation, and the sign bit sign indicates the positive or negative of the number (0 is positive, 1 is negative ), so fill in 0 here. The embodiment of the present invention does not adopt this standard, the main reason is that both longitude and latitude have fixed ranges, and it is unnecessary to reserve additional exponent bits.

In one embodiment of the present invention, encoding the longitude into n-bit binary and encoding the latitude into n-bit binary specifically includes: by using 1 bit to represent the sign and 8 bits to represent the data on the left side of the decimal point, and The remaining n-9 bits represent the data to the right of the decimal point to encode the longitude into n-bit binary; by assigning 1 bit to represent the sign and 7 bits to represent the data to the left of the decimal point, and the remaining n-8 bits to represent Data to the right of the decimal point to encode the latitude as n-bit binary.

Specifically, for longitude, the part to the left of the decimal point is represented by 9 bits, wherein the first bit, the sign segment, is a sign bit; for latitude, the part to the left of the decimal point is represented by 8 bits, wherein the first The bit or sign segment is the sign bit. The sign bit can use any convention to indicate positive or negative, for example, the first bit is 1 to indicate negative. For the part less than 1 degree, convert to binary decimals by multiplying by 2 and rounding up, and ordering. Referring to Figure 2, the specific method is: use 2 to multiply the decimal number to get the product, take out the integer part of the product, then multiply the remaining decimal part by 2 to get another product, and then take out the integer part of the product, like this Carry out until the fractional part in the product is zero or reaches the required precision, and then arrange the extracted integer parts in order, the integer taken first is used as the high-order significant bit of the binary decimal, and the integer taken later is used as the low-order significant bit.

S102. Generate a corresponding location code according to the longitude information and the latitude information.

Further, in one embodiment of the present invention, generating corresponding position codes according to longitude information and latitude information specifically includes: cross-merging the n-bit binary coded by longitude and the n-bit binary coded by latitude to obtain the position Coding; describe the geographical location range through the position code and the preset position mask represented by k, where the position mask is k, which means that the first 2k bits of all codes are the same as the first 2k bits of the position code. Wherein, k is a positive integer greater than 2 and less than or equal to n.

Further, in one embodiment of the present invention, the n-bit binary of the longitude code and the n-bit binary of the latitude code are cross-merged to obtain the position code, which specifically includes: Binary and latitude-coded n-bit binary are cross-merged, odd bits are longitude-coded n-bit binary, even-numbered latitude-coded n-bit binary, or odd bits are latitude-coded n-bit binary, even bits Put the longitude-encoded n-bit binary to get the location code.

The geographical location coding method of the embodiment of the present invention cross-codes the longitude and latitude into a location code, so that the generated location code is displayed in a form similar to the Internet address hierarchy, and at the same time it is convenient for the analysis and storage of location data and mapping. In addition, by introducing location masks, the size of different geographic regions can be easily specified. A geographic region with a shorter location mask can contain multiple regions described by location codes with the same prefix but longer masks. This makes this encoding have similar characteristics to Internet IP addresses, making it easy to integrate with the Internet.

Further, the encoding length set in the embodiment of the present invention is 2n, that is to say, the number of bits used for both the longitude and the latitude is n, and n>9. The latitude and longitude converted by the above method is truncated according to this number of bits. Note that in order to maintain the unity of accuracy, the decimal part of latitude is 1 bit more than the longitude. In order to facilitate the clustering of the converted location identifiers, the embodiment of the present invention uses the cross representation of latitude and longitude, as shown in Figure 3, for example, the binary code is the longitude and binary code of a ₁ a ₂ ... a _n-1 a _n The latitude interleaved encoding of b ₁ b ₂ ...b _n-1 b _n is a ₁ b ₁ a ₂ b ₂ ...a _n-1 b _n-1 a _n b _n , wherein the first data segment of the data segment is The part before the decimal point is marked in , and the second data segment of the data segment is the part after the decimal point marked in the figure. In actual use, either an odd-numbered longitude and an even-numbered latitude can be used, or an even-numbered longitude and an odd-numbered latitude can be used.

Specifically, the method of converting longitude to n-bit binary is to use 1 bit to represent the symbol, use 8 bits to represent the data on the left side of the decimal point, and the remaining n-9 bits are used to represent the data on the right side of the decimal point; for latitude The conversion method is to use 1 bit to represent the symbol, use 7 bits to represent the data on the left side of the decimal point, and use the remaining n-8 bits to represent the data on the right side of the decimal point. The binary representations of longitude and latitude of equal length are cross-merged to form the final position code.

In a specific embodiment of the present invention, for longitude, the first bit is a sign bit, and the left side of the decimal point is directly converted into an 8-bit binary code, and the right side of the decimal point is generated according to the following steps: multiply the decimal number by 2 to obtain Product, the integer part of the product is taken out, and then the remaining fractional part is multiplied by 2 to obtain another product, and then the integer part of the product is taken out, and so on until n-9 bits are reached. Then arrange the integer parts taken out in order, the integer taken first is used as the high-order significant bit of the binary fraction, and the integer taken later is used as the low-order significant bit. The sign bit, the binary representation of the integer bit and the binary representation of the decimal bit are connected to form the longitude code. For latitude, the first bit is the sign bit, and the left side of the decimal point is directly converted into a 7-bit binary code, and the right side of the decimal point is generated according to the following steps: multiply the decimal number by 2 to get the product, take out the integer part of the product, and then Multiply the remaining fractional part by 2 to get another product, and then take out the integer part of the product, and proceed in this way until n-8 bits are reached. Then arrange the integer parts taken out in order, the integer taken first is used as the high-order significant bit of the binary fraction, and the integer taken later is used as the low-order significant bit. The binary representation of the sign bit, the integer bit and the binary representation of the decimal place are connected to form a latitude code, and the binary representation of the longitude and latitude of the same length is cross-merged, the odd-numbered bit is used for the longitude code, and the even-numbered bit is used for the latitude code, or the even-numbered bit The encoding of the longitude and the encoding of the odd-numbered latitude can form the last 2n bit position encoding.

Further, in the embodiment of the present invention, the embodiment of the present invention uses the location mask k to identify the range of the location, where 2<k<=n. Specifically, the above-mentioned 2n-bit location code L can be used together with a location mask represented by an integer k smaller than n to describe a location range. An address mask of k represents the region consisting of all locations where the first 2k bits of all codes are the same as the first 2k bits of L. Since an Internet-connected device such as a mobile terminal such as a mobile phone is not only interested in information in a small area but also in a larger range of specified information when performing information release or communication in a designated geographic location, the embodiment of the present invention makes The generated geolocation code is displayed in a form similar to Internet address classification, so as to facilitate the release of multi-scale geographic location information.

Specifically, after the position coding is performed, the embodiment of the present invention uses the position mask k to identify the range of this position, where 2<k<=n, the above-mentioned 2n-bit position coding L can be combined with a The location mask represented by the integer k is used together to describe a location range. The address mask is k, which means that the first 2k bits after encoding are the same as the first 2k bits of the position code L, and all positions are the same, as shown in Figure 4. Figure 4 shows the method flow for judging whether a position code is within this range picture. The location mask is similar to the concept of the network mask in the network, and can be used to represent a range. For example, set n=24, that is to say, the length of the position code is 48 bits, then the longitude and latitude are (116.3156326940, 39.9953253066) and the conversion of the position into 24 bits is (001110100010100001100110, 001001111111111011001101), and the hexadecimal description is then (3a2866, 27fecd), the corresponding position code is 000011101001110101011101110101000111100001111001 (0e9d5dd47879 in hexadecimal notation). If the location mask is 22, it means that this area covers all locations where the first 44 bits of the location code are 00001110100111010101110111010100011110000111 (0e9d5dd4787 in hexadecimal notation). All positions from 39.995300293 to 39.9953613281.

The coding method of the embodiment of the present invention cross-codes longitude and latitude into a location code, which not only enables the generated location code to be displayed in a form similar to Internet address hierarchy, but also facilitates the analysis, storage and mapping of location data. In addition, by introducing location masks, the size of different geographic regions can be easily specified. A geographic region with a shorter location mask can contain multiple regions described by location codes with the same prefix but longer masks, enabling encoding It has similar characteristics to Internet IP addresses, making it easy to integrate with the Internet.

Further, in another embodiment of the present invention, the step of transforming the position code into longitude and latitude is as follows: use the encoded odd bits as the conversion value of longitude, and use the encoded even bits as the conversion value of latitude. For longitude , the first bit is the sign bit, the 8 bits of the 2nd to 9th bits are the integer part of the absolute value of longitude, and then the fractional part of the absolute value of longitude; for latitude, the first bit is the sign bit, the 2nd to 8th The bits are the integer part of the latitude, followed by the fractional part of the latitude. The approximate relationship between the code length and the covered location accuracy is shown in Figure 5. Since the length of each degree of longitude varies with latitude, the listed range is the maximum possible range. For the location mask, the location range and location accuracy covered by different location mask lengths are the same.

Among them, the code does not need to cover all the latitude and longitude, that is to say, in most cases, other information (such as domain name suffix, etc.) may have provided some geographical location-related information, so the range of representation can be further narrowed, so that the longitude and the part to the left of the decimal point of latitude can be coded with fewer bits, thus reducing the total code length with the same precision. For example, for a location release limited to the Beijing area, since the latitude of Beijing is from 39°26′ to 41°03′ north latitude and 115°25′ to 117°30′ east longitude, the part to the left of the decimal point can only be Just use 1 bit (because the latitude span does not exceed 2), and only use 2 bits for longitude (because the longitude span is less than 4), so that 7 bits can be reduced for both longitude and latitude, and the total code length can be reduced by 14 bit.

Further, for the designated location information issuer, the covered location code can be determined according to the location to be released and the required coverage range. There are multiple strategies for calculating the range of multicast addresses to be advertised based on the blocks in the latitude and longitude range. A single range that can cover this range can be selected, or multiple ranges can be superimposed.

From the above, in another embodiment of the present invention, the embodiment of the present invention can obtain the location code and location mask covering the geographic location range according to the geographic location range, that is to say, the embodiment of the present invention can enable a given After the longitude range and latitude range, a series of location codes and masks covering this plot can be obtained. Referring to Figure 6, according to the given longitude range and latitude range to obtain a block range formed, the steps are:

1) Calculate the code a generated by the smaller longitude and the smaller latitude and the code b generated by the larger longitude and the larger latitude;

2) Set x=a, k=1;

3) Let x and ^4k -1 find the bitwise AND, whether the obtained result is 0, if it is 0, go to step 4, otherwise go to step 5;

4) judge whether x+4 ^k is greater than b, if greater then step 5, otherwise let k=k+1 and then repeat step 3, otherwise step 5;

5) output x, k-1;

6) Set x=x+4 ^k-1 , judge whether x is greater than b, if it is greater than b, exit, otherwise set k=1 and repeat step 3.

S103. Generate a corresponding domain name according to the corresponding location code and location mask.

Further, in an embodiment of the present invention, generating the corresponding domain name according to the corresponding position code and position mask specifically includes: starting from the leftmost according to the corresponding position code and position mask, converting every 2m bits into A domain, to obtain a list of converted domains, where m is a positive integer; process the list of domains in reverse order, and connect the preset suffix domain name to generate a corresponding domain name.

Preferably, in one embodiment of the present invention, m=2.

Further, in an embodiment of the present invention, every 2m bits is converted into a field with only one character, so that a field longer than one character is used to represent an entity domain name limited by the location code and the location mask.

The embodiment of the present invention maps location codes to corresponding DNS domain names. Among them, the domain name system is a core service of the Internet. As a distributed database that can map domain names and IP addresses to each other, it can make it easier for people to access the Internet without having to remember IPs that can be directly read by machines. number string. DNS implements a hierarchical namespace by allowing a name server to "delegate" a portion of its name service (known as a zone) to subservers. The so-called hierarchical naming mechanism is to add structure to the name, and this structure is hierarchical. The namespace is no longer managed in a centralized manner, but is divided into several parts, and each part is authorized to be managed by a certain organization. The authorized management organization can further divide the namespace under its jurisdiction and further authorize several sub-organizations for management. In this way, the name space management organization forms a hierarchical tree structure, in which each node (including each level of management organization and the final host node) has a corresponding identifier, and the name of the host is the path from the leaf to the root of the tree. An ordered sequence of node identifiers on . Obviously, as long as the identifiers of each layer of nodes under the same subtree do not conflict, the host names will never conflict. Referring to Figure 7, Figure 7 is a schematic diagram of the hierarchical structure of DNS, in which each component is a domain, and from an intuitive point of view, a DNS domain name is a series of characters connected by ".". For example: www.tsinghua.edu.cn, where the top-level domain is the cn domain, the second-level domain is the domain "edu.cn" of China Education and Research Computer Network, and the third-level domain is the domain "tsinghua.edu. cn".

TCP/IP name-address mapping is completed by domain name servers distributed at various levels, and these domain name servers are the core of the domain name resolution system. A domain name server is actually a server software that runs on a designated machine to complete name-address (namely domain name-IP address) mapping. Usually we call the machine running domain name service software a domain name server. A domain name resolution can use one or more domain name servers for name mapping. Corresponding to the domain name structure, the Internet domain name server also forms a certain hierarchical structure. It is basically consistent with the hierarchical structure of the domain name.

The server tree composed of domain name servers in the Internet is the basis for the realization of domain name resolution algorithms. In general, domain name resolution adopts a top-down algorithm, starting from the root server to the leaf server, and the required name-address mapping must be found on a node in between. Of course, due to the upper and lower jurisdictional relationship between parent and child nodes, the process of domain name resolution is just a top-down one-way path from a certain node (not necessarily the root node) to another node (a certain leaf node) in the tree. The entire server tree needs to be traversed.

Referring to FIG. 8 , there are two domain name resolution methods. Among them, the first is called recursive resolution, which requires the domain name server system to complete all name-address transformations; the second is called iterative resolution, which requests a server each time. The address of the server, and then the resolver requests the next server. The difference between the two is that the former puts the complexity and burden on the server software, while the latter puts the complexity and burden on the resolver software. Therefore, generally speaking, for a domain name server with a heavy load and many domains in charge, it will It is configured to only perform iterative queries, such as the root domain name server; while it is responsible for fewer domains and lighter loads, it can perform recursive resolution. The difference between the two can be shown in Figure 8. Regardless of the resolution method, the domain name resolution process requires that the resolver must know the address of an initial server, and each server must at least know the address of the root server.

Specifically, in an embodiment of the present invention, the location code and the location mask of the embodiment of the present invention can be converted into a form of a DNS domain name, so as to facilitate the release of information at a specific location. Referring to Figure 9, assuming a 2n-bit position code, the position mask is k (the area represented by the leftmost 2k bits), which can be converted into a DNS domain every 2m bits starting from the leftmost. The length is filled with zeros, the list of converted domains is reversed, and the preset suffix domain name is connected, so that the domain name mapped to this location range is obtained. The advantage of this is that the converted domain name has a containment relationship, that is, the location represented by a longer domain name under a certain subdomain must be within the range of the location represented by the subdomain. For example, assuming that the suffix domain name is lbs.com, if a conversion scheme of 4 bits (i.e. m=2) is adopted, that is to say, every 4 bits are converted once, with reference to the conversion code table shown in Figure 10, it will be converted to domain name, then the longitude and latitude are (116.3156326940, 39.9953253066), n=24, and the area with mask as 22 is represented by the DNS domain name as 7.8.7.4.d.d.5.d.9.e.0.lbs.com, and the longitude and latitude are ( 116.3156326940, 39.9953253066) corresponds to the domain name 9.7.8.7.4.d.d.5.d.9.e.0.lbs.com. Among them, other transcoding tables may be used in actual use, and encoding may also be performed through more complex encoding schemes such as Gray codes.

In the embodiment of the present invention, the embodiment of the present invention may obtain a corresponding DNS domain name method. According to the mapping table, the present invention maps every 4-bit value (0-15) to a letter allowed by a fixed DNS, and each letter constitutes a first-level domain name, according to a larger range of coding, the later in the domain name Arranged regularly, through such a mapping, the location information is convenient for DNS information query.

Furthermore, in an embodiment of the present invention, the embodiment of the present invention may additionally create a name for a part of the domain obtained by location encoding/masking, expressing information related to this geographic location, such as this geographic location institutions etc. These names require a length greater than 1 to distinguish them from domain names generated by geographic locations. For example, the longitude and latitude are (116.3156326940, 39.9953253066), n=24, and the area with mask 22 is represented by DNS domain name as 7.8.7.4.d.d.5.d.9.e.0.lbs.com, a laboratory of Tsinghua University In this position, it is possible to create a domain name with the full domain name thu-a-lab.7.8.7.4.d.d.5.d.9.e.0.lbs.com, because the name thu-a-lab The length exceeds 1, so the terminal can recognize that this is a final name and not a domain.

Since the code does not need to cover all latitude and longitude, the length of the domain name can also be reduced accordingly. That is to say, if other information (such as domain name suffix, etc.) may have provided part of the geographic location-related information. For example, for a location release limited to the Beijing area, since the latitude of Beijing is from 39°26′ to 41°03′ north latitude and 115°25′ to 117°30′ east longitude, the part to the left of the decimal point can only be Just use 1 bit (because the latitude span does not exceed 2), and only use 2 bits for longitude (because the longitude span is less than 4), so that 7 bits can be reduced for both longitude and latitude, and the total code length can be reduced by 14 bit. Assuming that the longitude minus 39 is represented by 2 bits, and the latitude minus 115 is represented by 3 bits, then the latitude and longitude is (116.3156326940, 39.9953253066), and n=18, then the binary longitude and latitude after encoding is (001010100001100110, 001111111011001101), using 16 The base description is (0a866, 0fecd), and the corresponding position code is 000011011101110101000111100001111001 (0ddd47879 in hexadecimal). The area with a mask of 16 is represented by the DNS domain name as 7.8.7.4.d.d.d.0.bj.lbs.com, and the complete domain name of a laboratory in Tsinghua University is thu-a-lab.7.8.7.4.d.d.d.0.bj.lbs .com domain names to make the domain name hierarchy shorter and easier to remember.

In one embodiment of the present invention, the embodiment of the present invention obtains the designated information of the specific geographic location through the designated DNS domain name. Among them, in the embodiment of the present invention, the Internet-connected devices first obtain their own location information, obtain the domain related to this location through this information, and access the information publishing website established in this domain, and the Internet-connected devices can know each other and receive information at that location.

Further, in one embodiment of the present invention, the embodiment of the present invention finds the method of the information release website closest to the present location, after obtaining one's own geographic location, and then decreases one by one from the largest location mask until finding available domain name, then the domain name of the information distribution server closest to the current location can be found.

In the embodiment of the present invention, for example, after the Internet access device obtains its own geographic location, it obtains the WWW server domain name of the DNS domain mapped to it through the above algorithm and the address mask it pays attention to, such as www.7.8.7.4 .d.d.5.d.9.e.0.lbs.com, access the domain name through other channels such as WWW, you can get the specified information relative to the location. Further, after the Internet access device obtains its own geographical location, it may start to decrease one by one from the largest location mask (that is, the smallest possible range) until an available domain name is found. For example, the user can first try to resolve the A or AAAA record of www.9.7.8.7.4.d.d.5.d.9.e.0.lbs.com, and if the result can be returned, the user can access the WWW service of the server to get the same Information about this location is published. If not found, the user can continue to search for the www.7.8.7.4.d.d.5.d.9.e.0.lbs.com server, and if the result is still not obtained, the user can continue to search for www.8.7.4.d.d.5. d.9.e.0.lbs.com, and so on until a result is returned. In this way, even if there is no corresponding location announcement for a certain location, it can search upwards until it finds the corresponding location server.

In an embodiment of the present invention, the above method further includes: accessing the domain name to acquire the information of the corresponding designated location range.

Among them, in the embodiment of the present invention, the Internet access device, that is, the Internet access device, can obtain the geographic location of the device through its own positioning module, and then obtain the corresponding domain name according to the geographic location, and then by accessing the domain name, the Internet access devices can communicate with each other. Know and receive information on the location. With the switching of the geographical location, the Internet device automatically generates a new domain name, and automatically accesses the information on the designated location corresponding to the new domain name. Moreover, if the user modifies the geographic range (including wishing to enter a larger geographic range, or enter a more detailed geographic range), the Internet access device can generate domain names represented by different ranges. The Internet access device can also access multiple domain names targeted at different ranges at the same time, so as to receive information from multiple location ranges at the same time.

To sum up, the embodiment of the present invention is characterized in that by encoding the geographic location as a position code that can be clustered, the position code can not only locate a certain position, but also cover an area, and according to this position code, can Generate a specific DNS domain name, publish information based on this domain name, so that Internet devices in the same location or a specified location area can know each other, and these devices can obtain information related to these locations through a specific DNS domain name. The invention makes it easier to issue and communicate information at designated locations, and can be implemented on mobile Internet devices such as mobile phones.

According to the domain name generation method based on geographic location coding proposed in the embodiment of the present invention, by generating the corresponding location code according to the longitude information and latitude information, the corresponding domain name is generated according to the corresponding location code and the preset mask, and the geographic location code is generated. As a location code that can be clustered, the location code can not only locate a certain location, but also cover an area, and generate a specific DNS based on the location code, and publish and receive information based on the domain name. The Internet devices in the location area know each other, and the Internet devices can obtain information related to these locations through a specific DNS domain name, making it easier to publish and communicate information at a specified location.

Any process or method descriptions in flowcharts or otherwise described herein may be understood to represent modules, segments or portions of code comprising one or more executable instructions for implementing specific logical functions or steps of the process , and the scope of preferred embodiments of the invention includes alternative implementations in which functions may be performed out of the order shown or discussed, including substantially concurrently or in reverse order depending on the functions involved, which shall It is understood by those skilled in the art to which the embodiments of the present invention pertain.

The logic and/or steps represented in the flowcharts or otherwise described herein, for example, can be considered as a sequenced listing of executable instructions for implementing logical functions, can be embodied in any computer-readable medium, For use with instruction execution systems, devices, or devices (such as computer-based systems, systems including processors, or other systems that can fetch instructions from instruction execution systems, devices, or devices and execute instructions), or in conjunction with these instruction execution systems, devices or equipment used. For the purposes of this specification, a "computer-readable medium" may be any device that can contain, store, communicate, propagate or transmit a program for use in or in conjunction with an instruction execution system, device or device. More specific examples (non-exhaustive list) of computer-readable media include the following: electrical connection with one or more wires (electronic device), portable computer disk case (magnetic device), random access memory (RAM), Read Only Memory (ROM), Erasable and Editable Read Only Memory (EPROM or Flash Memory), Fiber Optic Devices, and Portable Compact Disc Read Only Memory (CDROM). In addition, the computer-readable medium may even be paper or other suitable medium on which the program can be printed, since the program can be read, for example, by optically scanning the paper or other medium, followed by editing, interpretation or other suitable processing if necessary. The program is processed electronically and stored in computer memory.

It should be understood that various parts of the present invention can be realized by hardware, software, firmware or their combination. In the embodiments described above, various steps or methods may be implemented by software or firmware stored in memory and executed by a suitable instruction execution system. For example, if implemented in hardware, as in another embodiment, it can be implemented by any one or combination of the following techniques known in the art: Discrete logic circuits, ASICs with suitable combinational logic gates, programmable gate arrays (PGAs), field programmable gate arrays (FPGAs), etc.

Those of ordinary skill in the art can understand that all or part of the steps carried by the methods of the above embodiments can be completed by instructing related hardware through a program, and the program can be stored in a computer-readable storage medium. During execution, one or a combination of the steps of the method embodiments is included.

In addition, each functional unit in each embodiment of the present invention may be integrated into one processing module, each unit may exist separately physically, or two or more units may be integrated into one module. The above-mentioned integrated modules can be implemented in the form of hardware or in the form of software function modules. If the integrated modules are realized in the form of software function modules and sold or used as independent products, they can also be stored in a computer-readable storage medium.

The storage medium mentioned above may be a read-only memory, a magnetic disk or an optical disk, and the like.

In the description of this specification, descriptions referring to the terms "one embodiment", "some embodiments", "example", "specific examples", or "some examples" mean that specific features described in connection with the embodiment or example , structure, material or characteristic is included in at least one embodiment or example of the present invention. In this specification, schematic representations of the above terms do not necessarily refer to the same embodiment or example. Furthermore, the specific features, structures, materials or characteristics described may be combined in any suitable manner in any one or more embodiments or examples.

Although the embodiments of the present invention have been shown and described above, it can be understood that the above embodiments are exemplary and cannot be construed as limitations to the present invention. Variations, modifications, substitutions, and modifications to the above-described embodiments are possible within the scope of the present invention.

Claims (7)

1. a kind of domain name generation method based on geographical position coding, it is characterised in that comprise the following steps：

Geographical location information is obtained, wherein, the geographical location information includes longitude information and latitude information；

The longitude is encoded to the binary system of n-bit, wherein, the binary system of the n-bit includes sign field and data segment, institute Stating data segment includes the first data segment and the second data segment, by the symbolic coding of the longitude to sign field, by the longitude In absolute encoder to the data segment, wherein, first data segment represents the integer part of the longitude absolute value, described Second data segment represents the fractional part of the longitude absolute value, and n is the positive integer more than 9；

The latitude is encoded to the binary system of n-bit, the symbolic coding of the latitude to the latitude is encoded to n-bit In sign field in binary system, the data that the latitude absolute encoder are encoded to the latitude in the binary system of n-bit In section；

It is position encoded according to corresponding to the longitude information and latitude information generation；

According to domain name corresponding to position mask generation that is described corresponding position encoded and pre-setting；

Domain name is accessed to obtain the information of corresponding specified location scope.

2. domain name generation method according to claim 1, it is characterised in that described to be believed according to the longitude information and latitude Breath generation is position encoded, specifically includes：

The binary system of the n-bit of the binary system for the n-bit that the longitude is encoded and latitude coding carries out cross-combining, with Obtain described position encoded；

Geographical position range is described by the position mask represented by k that is described position encoded and pre-setting, wherein, institute's rheme Put the area that mask represents the preceding 2k bits of all codings position compositions all with the position encoded preceding 2k bits identical for k Domain, wherein, k is the positive integer for being less than or equal to n more than 2.

3. domain name generation method according to claim 2, it is characterised in that it is described according to it is described it is corresponding it is position encoded and Domain name corresponding to position mask generation, is specifically included：

According to the corresponding position encoded and position mask since the leftmost side, every 2m bits switch be a domain, to obtain The list in the domain after conversion is taken, wherein, m is positive integer；

The list in the domain is subjected to backward processing, and connects and presets suffix domain name to generate the corresponding domain name.

4. domain name generation method according to claim 3, it is characterised in that m=2.

5. domain name generation method according to claim 4, it is characterised in that there was only one in the domain being converted into per 2m bits Character, with by length more than described in the domain representation of a character position encoded and position mask limit in the range of entity domains Name.

6. domain name generation method according to claim 1, it is characterised in that described that the longitude is encoded to n-bit Binary system and the binary system that the latitude is encoded to n-bit, are specifically included：

By 1 bit being represented into symbol and 8 bits represent data on the left of decimal points, and by remaining n-9 bits table Show the data on the right side of decimal point, the longitude is encoded to the binary system of n-bit；

By 1 bit being represented into symbol and 7 bits represent data on the left of decimal points, and by remaining n-8 bits table Show the data on the right side of decimal point, the latitude is encoded to the binary system of n-bit.

7. domain name generation method according to claim 1, it is characterised in that the n-bit for encoding the longitude The binary system of the n-bit of binary system and latitude coding carries out cross-combining, described position encoded to obtain, and specifically includes：

The binary system of the n-bit of the binary system for the n-bit that the isometric longitude is encoded and latitude coding is intersected Merging, odd bits put the binary system of the n-bit of the longitude coding, and even bit puts the binary system of the n-bit of the latitude coding, Or odd bits put the binary system of the n-bit of the latitude coding, even bit puts the binary system of the n-bit of the longitude coding, It is described position encoded to obtain.