CN109743253A - A kind of distributed hashtable method for routing merging geographical location - Google Patents
A kind of distributed hashtable method for routing merging geographical location Download PDFInfo
- Publication number
- CN109743253A CN109743253A CN201811639889.2A CN201811639889A CN109743253A CN 109743253 A CN109743253 A CN 109743253A CN 201811639889 A CN201811639889 A CN 201811639889A CN 109743253 A CN109743253 A CN 109743253A
- Authority
- CN
- China
- Prior art keywords
- network node
- geographical location
- integer
- latitude
- distributed hashtable
- 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
Abstract
The present invention discloses a kind of distributed hashtable method for routing for merging geographical location, and P2P network node therein generates node ID using the ID create-rule based on geographical location, according to distance between ID calculate node.The distributed hashtable method for routing in present invention fusion geographical location, in conjunction with distributed hashtable and the advantage for knowing geographical location information, distributed hashtable can be with decentralization, bottom-layer network for block chain transmits, know geographical location information, it can faster find the closer node in geographical location, faster, communication efficiency caused by solving the problems, such as distributed hashtable euclidean distance between node pair too far is low for inter-node communication speed.
Description
Technical field
The present invention relates to geography, distributed hashtable, block chain technical field more particularly to a kind of fusion geographical locations
Distributed hashtable method for routing.
Background technique
With the arrival of the internet of things era, large number of equipment enters huge numbers of families, block chain, distributed file system, edge
The technologies such as calculating are in rapid advances.Many block chain bottom-layer networks use distributed hashtable technology, promote distributed hashtable
The efficiency of data exchange has very big help to the speed for promoting block chain data exchange, finding node.
But traditional distributed hashtable method for routing cannot be guaranteed the data exchange efficiency of connecting node.Work as user
When using distributed hashtable, the distance for calculating P2P network node be the value that is obtained according to the ID xor operation of two nodes come
It is closer to be worth smaller then distance for judgement, and geographical location that the ID of P2P network node is randomly generated and P2P network node does not have
There is relationship, the node for the offer service first found is capable of providing identical clothes closer local in the another side of the earth
The node of business, but the closer node of physical distance may logical reach it is farther, apart from farther node, logical reach is closer instead,
Cause data transmission efficiency low.
Summary of the invention
The purpose of the present invention is being directed to the deficiency of distributed hashtable technology, a kind of distribution for merging geographical location is provided
Formula Hash table method for routing, this method combine the advantage for knowing geographical location and distributed hashtable, have accomplished data exchange effect
The promotion of rate.
The purpose of the present invention is what is be achieved by the following scheme: a kind of distributed hashtable routing side for merging geographical location
Method includes the following steps:
(1) the P2P network node described in obtains the ID of oneself and another P2P network node；
(2) P2P network node described in taken out respectively from oneself ID with another P2P network node longitude integer,
Latitude integer and random bytes array；
(3) the P2P network node described in calculates and the difference of the longitude integer of another P2P network node；
(4) the P2P network node described in calculates and the difference of the latitude integer of another P2P network node；
(5) the P2P network node described in be calculated longitude integer difference square with latitude integer difference square
With and it is smaller then distance it is closer, and more it is big then distance it is remoter；
(6) the P2P network node described in does xor operation to random bytes array, and the result of xor operation is smaller closer,
As a result more big then remoter.
Further, the process that the P2P network node obtains oneself ID includes the following steps:
(1.1) the P2P network node described in obtains the latitude and longitude information of oneself；
(1.2) the P2P network node described in generates the longitude integer of an expression longitude information according to longitude information；
(1.3) the P2P network node described in generates the latitude integer of an expression latitude information according to latitude information；
(1.4) the P2P network node described in generates the constant random bytes array of length at random；
(1.5) P2P network node combination longitude integer, latitude integer and random bytes array described in are combined into described
P2P network node ID.
Further, the P2P network node, for using the ID create-rule based on geographical location to generate node
ID, according to distance between ID calculate node；
Further, the euclidean distance between node pair is not the physical distance between node, rather than the logical reach between node.
Further, the ID of the P2P network node, totally 200 bit, longitude information account for 21 bits, latitude letter to length
Breath accounts for 21 bits, and random information accounts for 158 bits.
Beneficial effects of the present invention are as follows:
The distributed hashtable method for routing in fusion geographical location of the invention, sufficiently combines geographical location and distribution
The advantage of Hash table improves the efficiency of the data transmission of the P2P network node of distributed hashtable.According to geography in the present invention
Location information generates the ID of P2P network node, finds other P2P network nodes on distributed hashtable in P2P network node
When, the closer resource of geographic distance can be preferentially found, the efficiency for finding node, data transmission is greatly improved.
Detailed description of the invention
Fig. 1 is the flow chart of distance between the calculate node for merging the distributed hashtable method for routing in geographical location.
Specific embodiment
Below according to attached drawing and preferred embodiment the present invention is described in detail, the objects and effects of the present invention will become brighter
White, below in conjunction with drawings and examples, the present invention will be described in further detail.It should be appreciated that described herein specific
Embodiment is only used to explain the present invention, is not intended to limit the present invention.
As shown in Figure 1, distance between the calculate node of the distributed hashtable method for routing in fusion geographical location of the invention
Flow chart, it is a kind of merge geographical location distributed hashtable method for routing, include the following steps:
(1) the P2P network node described in obtains the ID of oneself and another P2P network node；
(2) P2P network node described in taken out respectively from oneself ID with another P2P network node longitude integer,
Latitude integer and random bytes array；
(3) the P2P network node described in calculates and the difference of the longitude integer of another P2P network node；
(4) the P2P network node described in calculates and the difference of the latitude integer of another P2P network node；
(5) the P2P network node described in be calculated longitude integer difference square with latitude integer difference square
With and it is smaller then distance it is closer, and more it is big then distance it is remoter；
(6) the P2P network node described in does xor operation to random bytes array, and the result of xor operation is smaller closer,
As a result more big then remoter.
Further, the process that the P2P network node obtains oneself ID includes the following steps:
(1.1) the P2P network node described in obtains the latitude and longitude information of oneself；
(1.2) the P2P network node described in generates the longitude integer of an expression longitude information according to longitude information；
(1.3) the P2P network node described in generates the latitude integer of an expression latitude information according to latitude information；
(1.4) the P2P network node described in generates the constant random bytes array of length at random；
(1.5) P2P network node combination longitude integer, latitude integer and random bytes array described in are combined into described
P2P network node ID.
Further, the P2P network node, for using the ID create-rule based on geographical location to generate node
ID, according to distance between ID calculate node；
Further, the euclidean distance between node pair is not the physical distance between node, rather than the logical reach between node.
Further, the ID of the P2P network node, totally 200 bit, longitude information account for 21 bits, latitude letter to length
Breath accounts for 21 bits, and random information accounts for 158 bits.
It will appreciated by the skilled person that being not used to limit the foregoing is merely the preferred embodiment of invention
System invention, although invention is described in detail referring to previous examples, for those skilled in the art, still
It can modify to the technical solution of aforementioned each case history or equivalent replacement of some of the technical features.It is all
Within the spirit and principle of invention, modification, equivalent replacement for being made etc. be should be included within the protection scope of invention.
Claims (5)
1. a kind of distributed hashtable method for routing for merging geographical location, which comprises the steps of:
(1) the P2P network node described in obtains the ID of oneself and another P2P network node.
(2) P2P network node described in takes out longitude integer, latitude from oneself ID with another P2P network node respectively
Integer and random bytes array.
(3) the P2P network node described in calculates and the difference of the longitude integer of another P2P network node.
(4) the P2P network node described in calculates and the difference of the latitude integer of another P2P network node.
(5) the P2P network node described in be calculated longitude integer difference square with latitude integer difference square and, and
Smaller then distance is closer, and more big then distance is remoter.
(6) the P2P network node described in does xor operation to random bytes array, and the result of xor operation is smaller closer, as a result
It is more big then remoter.
2. a kind of distributed hashtable method for routing for merging geographical location according to claim 1, which is characterized in that institute
It states P2P network node and obtains the process of oneself ID and include the following steps:
(1.1) the P2P network node described in obtains the latitude and longitude information of oneself.
(1.2) the P2P network node described in generates the longitude integer of an expression longitude information according to longitude information.
(1.3) the P2P network node described in generates the latitude integer of an expression latitude information according to latitude information.
(1.4) the P2P network node described in generates the constant random bytes array of length at random.
(1.5) P2P network node combination longitude integer, latitude integer and random bytes array described in are combined into the P2P
The ID of network node.
3. a kind of distributed hashtable method for routing for merging geographical location according to claim 1, which is characterized in that institute
The P2P network node stated, for using the ID create-rule based on geographical location to generate node ID, according to ID calculate node spacing
From.
4. a kind of distributed hashtable method for routing for merging geographical location according to claim 3, which is characterized in that institute
The euclidean distance between node pair stated is not the physical distance between node, rather than the logical reach between node.
5. a kind of distributed hashtable method for routing in fusion geographical location described in -4 according to claim 1, which is characterized in that
The ID of the P2P network node, totally 200 bit, longitude information account for 21 bits to length, and latitude information accounts for 21 bits, random to believe
Breath accounts for 158 bits.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811639889.2A CN109743253A (en) | 2018-12-29 | 2018-12-29 | A kind of distributed hashtable method for routing merging geographical location |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811639889.2A CN109743253A (en) | 2018-12-29 | 2018-12-29 | A kind of distributed hashtable method for routing merging geographical location |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN109743253A true CN109743253A (en) | 2019-05-10 |
Family
ID=66362524
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811639889.2A Pending CN109743253A (en) | 2018-12-29 | 2018-12-29 | A kind of distributed hashtable method for routing merging geographical location |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109743253A (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110691446A (en) * | 2019-09-12 | 2020-01-14 | 深圳市云慧联科技有限公司 | Secondary generation method and device of ID information |
| CN111641734A (en) * | 2020-06-08 | 2020-09-08 | 杭州复杂美科技有限公司 | Node identifier generation method, device and storage medium |
| CN115550251A (en) * | 2022-12-01 | 2022-12-30 | 杭州蚂蚁酷爱科技有限公司 | Block chain network, node set maintenance method and device |
Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101018172A (en) * | 2007-02-09 | 2007-08-15 | 浪潮电子信息产业股份有限公司 | A method for optimizing the P2P transfer in the MAN |
| CN101374087A (en) * | 2007-08-20 | 2009-02-25 | 华为技术有限公司 | Mobile self-grouping network, node and region partitioning method thereof |
| CN101505263A (en) * | 2008-02-05 | 2009-08-12 | 华为技术有限公司 | Method and device for maintaining routing information |
| CN101626392A (en) * | 2008-07-08 | 2010-01-13 | 中国移动通信集团公司 | Methods and systems for storing and searching data |
| CN101656733A (en) * | 2009-08-27 | 2010-02-24 | 中国电信股份有限公司 | Method and device for calculating communication distance |
| CN102088418A (en) * | 2008-02-05 | 2011-06-08 | 华为技术有限公司 | Method and device for establishing route |
| US8654684B1 (en) * | 2007-11-23 | 2014-02-18 | Media Melon, Inc. | Multi-platform video delivery configuration |
| CN103701846A (en) * | 2013-09-18 | 2014-04-02 | 南京邮电大学 | Peer-to-peer network resource search optimization method based on node proximity estimation |
| CN105488172A (en) * | 2015-11-30 | 2016-04-13 | 北京奇艺世纪科技有限公司 | Location-based data query method and device |
-
2018
- 2018-12-29 CN CN201811639889.2A patent/CN109743253A/en active Pending
Patent Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101018172A (en) * | 2007-02-09 | 2007-08-15 | 浪潮电子信息产业股份有限公司 | A method for optimizing the P2P transfer in the MAN |
| CN101374087A (en) * | 2007-08-20 | 2009-02-25 | 华为技术有限公司 | Mobile self-grouping network, node and region partitioning method thereof |
| US8654684B1 (en) * | 2007-11-23 | 2014-02-18 | Media Melon, Inc. | Multi-platform video delivery configuration |
| CN101505263A (en) * | 2008-02-05 | 2009-08-12 | 华为技术有限公司 | Method and device for maintaining routing information |
| CN102088418A (en) * | 2008-02-05 | 2011-06-08 | 华为技术有限公司 | Method and device for establishing route |
| CN101626392A (en) * | 2008-07-08 | 2010-01-13 | 中国移动通信集团公司 | Methods and systems for storing and searching data |
| CN101656733A (en) * | 2009-08-27 | 2010-02-24 | 中国电信股份有限公司 | Method and device for calculating communication distance |
| CN103701846A (en) * | 2013-09-18 | 2014-04-02 | 南京邮电大学 | Peer-to-peer network resource search optimization method based on node proximity estimation |
| CN105488172A (en) * | 2015-11-30 | 2016-04-13 | 北京奇艺世纪科技有限公司 | Location-based data query method and device |
Non-Patent Citations (1)
| Title |
|---|
| 陈兴蜀，林大云，王文贤: "P2P 节点智能选择机制的研究与实现", 《计算机应用》 * |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110691446A (en) * | 2019-09-12 | 2020-01-14 | 深圳市云慧联科技有限公司 | Secondary generation method and device of ID information |
| CN110691446B (en) * | 2019-09-12 | 2021-11-19 | 深圳市云慧联科技有限公司 | Secondary generation method and device of ID information |
| CN111641734A (en) * | 2020-06-08 | 2020-09-08 | 杭州复杂美科技有限公司 | Node identifier generation method, device and storage medium |
| CN115550251A (en) * | 2022-12-01 | 2022-12-30 | 杭州蚂蚁酷爱科技有限公司 | Block chain network, node set maintenance method and device |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Roos et al. | Settling payments fast and private: Efficient decentralized routing for path-based transactions | |
| CN109743253A (en) | A kind of distributed hashtable method for routing merging geographical location | |
| CN106559340A (en) | The network centered on information with little multipath or single footpath forwarding state | |
| TWI640177B (en) | Data delivery method and system in software defined network | |
| Zhang et al. | Assessing multi-hop performance of reactive routing protocols in wireless sensor networks | |
| Lahiri et al. | A trustworthy blockchain based framework for impregnable IoV in edge computing | |
| US7948917B2 (en) | Routing internet communications using network coordinates | |
| JP2024010228A (en) | System and method for random differential relay and network coding | |
| Fu et al. | Evolution-cast: Temporal evolution in wireless social networks and its impact on capacity | |
| CN104378426B (en) | A kind of load-balancing method for real time information dissemination system | |
| Choksatid et al. | An efficient spreading epidemic routing for delay-tolerant network | |
| CN103973832A (en) | IPv6 addressing and networking method based on physical space position mapping | |
| Kumar et al. | Impact of wormhole attack on data aggregation in hieracrchical WSN | |
| Abid et al. | Merging of DHT‐based logical networks in MANETs | |
| Gupta et al. | Performance Evaluation of Routing Protocols for Mobile Adhoc Networks | |
| Byrenheid et al. | Secure embedding of rooted spanning trees for scalable routing in topology-restricted networks | |
| Roos et al. | Dealing with dead ends: Efficient routing in darknets | |
| Munir et al. | Smart agent based dynamic data aggregation for delay sensitive smart city services | |
| Orlinski et al. | Distributed expectation-based spatio-temporal cluster detection for pocket switched networks | |
| Suhail et al. | Detection of malicious node in rpl-based internet of things through provenance | |
| Jia et al. | A multidimensional heuristic for social routing in peer-to-peer networks | |
| Singh et al. | Energy efficient source based tree routing with time stamp in WSN | |
| Xu et al. | Discovering the influences of complex network effects on recovering large scale multiagent systems | |
| Deng et al. | Sociality-based buffer management for multicast in DTNs | |
| CN105991429B (en) | A kind of route reselection determination method and device |
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 | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20190510 |
|
| RJ01 | Rejection of invention patent application after publication |