WO2020168506A1 - Procédé et système de radiomessagerie de réseau d'identifiants multi-modes basés sur un mappage de coordonnées - Google Patents

Procédé et système de radiomessagerie de réseau d'identifiants multi-modes basés sur un mappage de coordonnées Download PDF

Info

Publication number
WO2020168506A1
WO2020168506A1 PCT/CN2019/075668 CN2019075668W WO2020168506A1 WO 2020168506 A1 WO2020168506 A1 WO 2020168506A1 CN 2019075668 W CN2019075668 W CN 2019075668W WO 2020168506 A1 WO2020168506 A1 WO 2020168506A1
Authority
WO
WIPO (PCT)
Prior art keywords
node
network
coordinate
degree
coordinates
Prior art date
Application number
PCT/CN2019/075668
Other languages
English (en)
Chinese (zh)
Inventor
李挥
胡嘉伟
邬江兴
伊鹏
朱伏生
李文军
安辉耀
李胜飞
陈世胜
唐宏
张云勇
魏进武
陈孟尝
朱强
Original Assignee
北京大学深圳研究生院
国家数字交换系统工程技术研究中心
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by 北京大学深圳研究生院, 国家数字交换系统工程技术研究中心 filed Critical 北京大学深圳研究生院
Priority to PCT/CN2019/075668 priority Critical patent/WO2020168506A1/fr
Priority to CN201980005059.0A priority patent/CN111418192B/zh
Publication of WO2020168506A1 publication Critical patent/WO2020168506A1/fr

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/12—Shortest path evaluation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L61/00—Network arrangements, protocols or services for addressing or naming
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L61/00—Network arrangements, protocols or services for addressing or naming
    • H04L61/50—Address allocation

Definitions

  • the invention belongs to the field of network technology improvement, and in particular relates to a method and system for multi-mode identification network addressing based on coordinate mapping.
  • Multi-mode identification network is a new open network architecture proposed for the inherent defects of the existing Internet control capabilities being too centralized and lack of international multilateral co-management and co-governance. Specifically, it refers to the joint deployment of multiple routing identification collaborative routing addressing in networks of different architectures Network environment. For example, if a content network is deployed in a traditional network, if data can shuttle between these two types of networks, a multi-mode network environment composed of two network systems and addressed by content identification and address identification is formed. By using the advantages of different networks to work together, the multi-mode identification network can improve the basic transmission capacity of the current Internet, enhance the utilization of network resources, and enrich the network layer functions. More importantly, the multi-mode identification network reduces the dependence and limitations of the existing Internet system on address identification, and provides the possibility for multilateral co-management and co-governance of the Internet.
  • the adaptability of its routing cost to a large-scale network must be considered, and the routing cost can be measured by the scale of the forwarding table (FIB) and the number of control packets required when the network topology changes. .
  • the information center network ICN directly forwards the name of the content, while the Internet of Things (IoT) has an extremely large number of nodes, which results in extremely large addressing space and must have a high degree of In order to meet the actual needs of the network, people have to rethink how to design a routing mechanism that matches the future network.
  • Greedy Geometric Routing maps the network to a metric space and assigns an address, or coordinates, to each node in it. Each network message transmitted in the network has its destination coordinates attached to it. When forwarding, the router will calculate the geometric distance between each of its neighboring nodes and the destination, and select the one with the smallest distance as the forwarding Next hop. Since each node only needs to know the coordinate information of its neighbors, GGR can minimize the size of FIB as much as possible, thus providing a basis for us to design routing protocols for large-scale networks.
  • Hyperbolic Routing is proposed based on the scale-free nature of the network, that is, the degree of nodes in the network obeys the power distribution.
  • HR Hyperbolic Routing
  • the network is mapped to a negative curvature, that is, a hyperbolic space.
  • each node is mapped to a disk with a radius R and assigned polar coordinates ( r, ⁇ ), where the angular coordinate ⁇ represents the relative position of the node in the network, and the radius coordinate r represents the center of the node.
  • the more centralized the node the smaller the radius coordinate, that is, the closer to the center of the disk.
  • the hyperbolic distance between them will decrease as their radial coordinates decrease. Therefore, greedy routing based on hyperbolic distance will tend to select a more centralized node as its forwarding Object.
  • hyperbolic routing also has its drawbacks: Compared with traditional routing protocols based on the shortest path algorithm, the forwarding path greedily selected by hyperbolic routing has a larger transmission delay. This is not only due to the inherent disadvantages of the greedy strategy, but also It is also because most of the existing hyperbolic mapping algorithms do not consider the network delay. Since reducing delay is also one of the core goals of routing protocol design, we must tackle this problem.
  • Kleinberg is equivalent to the paper "Geographic routing using hyperbolic space” in 2007 and proposed the earliest mapping algorithm for hyperbolic routing.
  • this paper by constructing the minimum spanning tree of the network, any network can be mapped into the hyperbolic space, and based on The mapped greedy routing has a 100% success rate.
  • the algorithm must know the global topological information. At the same time, when the minimum spanning tree of the network changes, the coordinates of all nodes must be recalculated, so the adaptability to dynamic networks is poor.
  • This algorithm only considers the adjacency status of the network, and all connections are regarded as equivalent regardless of their delays. As a result, routing based on this algorithm often selects suboptimal paths with larger delays.
  • Lehman is equivalent to the 2015 “An experimental investigation of hyperbolic routing with a smart forwarding plane in ndn", trying to use NDN's adaptive and intelligent forwarding plane to delay the suboptimal path selected by the hyperbolic routing Optimization.
  • the routing node will periodically detect and record the average delay between each port and the transmission destination, and dynamically select the one with the smallest delay as the next hop.
  • the hyperbolic distance determines the interface selected at the beginning of the transmission. , And the probability of delay detection for each interface.
  • this method has a significant reduction in delay, for short-term transmission, the number of detected delay samples is not enough to optimize the forwarding path. At the same time, this method cannot optimize the worst-case scenario (that is, those paths whose delay is much greater than the theoretical optimum).
  • the purpose of the present invention is to provide a multi-mode identification network addressing method based on coordinate mapping, which aims to solve the above technical problems.
  • the present invention is realized in this way, a multi-mode identification network addressing method based on coordinate mapping.
  • the multi-mode identification network addressing method based on coordinate mapping includes the following steps:
  • d 12 cosh -1 (cosh r 1 cosh r 2 -sinh r 1 sinh r 2 cos ⁇ 12 )
  • the smallest neighbor node forwards the message
  • r and ⁇ come from the coordinates of the node, and ⁇ 12 is the central angle between the two points and the origin:
  • the further technical solution of the present invention is: multiple routing identifiers coexist in the network, such as content identifiers, identity identifiers, geographic location identifiers, and IP address identifiers, etc., through multi-identity dynamic adaptation and conversion technology, to meet various network requirements
  • the step S3 is used for addressing and routing of a variety of new types of network identifiers led by content in a large-scale network.
  • mapping in the step S1 includes angular coordinate mapping and radial coordinate mapping
  • angular coordinate mapping includes the following steps:
  • S111 Take the longitude and latitude information of the geographic location of the corner coordinates of the central node with high connectivity
  • S112. Determine whether the degree is greater than or equal to the set value for the coordinates of the non-central node with low connectivity. If so, calculate the average delay from each central node based on the IP protocol, and select the set value with the smallest delay.
  • a central node can calculate its own angular coordinates. If not, most of them have only one path to the central node, and their angular coordinates will directly copy the neighbors with the highest degree.
  • the radial coordinate mapping includes the following steps:
  • a further technical solution of the present invention is: in the step S121, the most central node in each subgraph has a radius coordinate r 0 , and only minor corrections are made to non-central nodes with a smaller radius coordinate.
  • R is the radius of the sphere
  • connection probability of two nodes is:
  • x is the hyperbolic distance between two points.
  • R can be obtained by the following integral:
  • the parameter T is the temperature, which controls the degree of aggregation of the nodes; ⁇ is the curvature of the hyperbolic space, and x′ is Hyperbolic distance between and (r,0,0);
  • Another object of the present invention is to provide a multi-mode identification network addressing system based on coordinate mapping, which includes
  • the network mapping module is used to map a scale-free multi-mode identification network to a three-dimensional hyperbolic space, and assign three-dimensional spherical coordinates to each node in the network;
  • Forwarding module used to select hyperbolic distance based on the calculated distance between nodes
  • d 12 cosh -1 (cosh r 1 cosh r 2 -sinh r 1 sinh r 2 cos ⁇ 12 )
  • the smallest neighboring node is the object of forwarding
  • r and ⁇ come from the coordinates of the node, and ⁇ 12 is the central angle between the two points and the origin:
  • the further technical solution of the present invention is: multiple routing identifiers coexist in the network, such as content identifiers, identity identifiers, geographic location identifiers, and IP address identifiers, etc., through multi-identity dynamic adaptation and conversion technology, to meet various network requirements
  • the real-time requirements of the two-zone coordinates are used for addressing and routing of a variety of new network identifications led by content in large-scale networks.
  • mapping in the network mapping module includes angular coordinate mapping and radial coordinate mapping
  • angular coordinate mapping includes
  • the central node coordinate acquisition unit is used to obtain the longitude and latitude information of the geographical position of the corner coordinates of the central node with high connectivity;
  • the non-central node coordinate acquisition unit is used to judge whether the degree of the non-central node coordinates with low connectivity is greater than or equal to the set value, if it is, then based on the IP protocol, calculate the average delay between itself and each central node, and select one of them
  • the central node with the minimum time delay is set to calculate its own angular coordinates. If not, most of them have only one path to the central node, and their angular coordinates will directly copy the neighbor with the highest degree.
  • a further technical solution of the present invention is: the radial coordinate mapping includes
  • the network division module is used to divide the global network into several sub-graphs and perform independent polar coordinate operations on each sub-graph.
  • a further technical solution of the present invention is that the most central node in each subgraph in the network division module has a radius coordinate r 0 , and only minor corrections are made to non-central nodes with a smaller radius coordinate.
  • the maximum likelihood estimation of the radius coordinate includes
  • the maximum likelihood estimation of the radius coordinate includes:
  • a priori hypothesis unit According to the statistical law of the network, we assume that the degree of the node satisfies the power distribution ⁇ ( ⁇ ) ⁇ - ⁇ , the lowest degree is ⁇ 0 , and the average degree is The relationship between the degree of the node and the diameter coordinate is: Among them, R is the radius of the sphere; according to the statistical law of the network, we assume that the connection probability of two nodes is:
  • x is the hyperbolic distance between two points.
  • R can be obtained by the following integral:
  • the parameter T is the temperature, which controls the degree of aggregation of the nodes; ⁇ is the curvature of the hyperbolic space, and x′ is Hyperbolic distance between and (r,0,0);
  • Sub-picture division and calculation unit Take m nodes i 1 , i 2 ... i m with the highest degree of centrality in the network, and the remaining nodes measure the delay between themselves and each i * . If i k is the one with the smallest delay, then the node belongs to the subgraph G k . For a node with degree ⁇ i , the maximum likelihood of its radius coordinate is estimated as:
  • the beneficial effect of the present invention is that for the traditional hyperbolic routing algorithm, the present algorithm can reduce the transmission delay by about 30% at most, while maintaining the inherent high forwarding success rate.
  • the algorithm relies on less network information, simple calculations, and easy to complete locally, thereby improving the scalability of the scheme.
  • Fig. 1 is a schematic diagram from 3 nodes to a central point provided by an embodiment of the present invention.
  • Fig. 2 is a schematic diagram of a mapping algorithm provided by an embodiment of the present invention.
  • Fig. 3 is a schematic diagram of a forwarding process provided by an embodiment of the present invention.
  • Fig. 4 is a schematic diagram of a hyperbolic disk provided by an embodiment of the present invention.
  • FIG. 5 is a schematic diagram of DS comparison between the recalculated angular coordinates and the original angular coordinates provided by an embodiment of the present invention.
  • Fig. 6 is a schematic diagram of DS comparison between recalculated diameter coordinates and original diameter coordinates provided by an embodiment of the present invention.
  • the multi-mode identification network addressing method based on coordinate mapping provided by the present invention is detailed as follows
  • delay participates in the mapping process in two ways:
  • the non-central node measures the average time delay between itself and the surrounding central node, and uses the time delay as the spherical distance to complete its own angular coordinate calculation based on the angular coordinates of the central node.
  • the global network is divided into several sub-graphs, and each sub-graph will perform its radial coordinate calculation independently to improve the locality of routing and reduce delay.
  • mapping mechanisms are used to adapt to the scale-free nature of the network.
  • nodes in the network can be roughly divided into two categories: most common user nodes with low connections, and a very small number of central nodes with very large connections . For these two types of nodes, we use different coordinate mapping mechanisms.
  • the corner coordinates of the central node come from the geographical position, and the polar coordinates come from its surroundings.
  • the non-central node uses the central node as the benchmark to measure its own coordinates.
  • This algorithm maps a scale-free network to a three-dimensional hyperbolic space
  • each node in the network is assigned three-dimensional spherical coordinates
  • Two points with The hyperbolic distance of is derived from the law of cosines:
  • ⁇ 12 is the central angle between the two points and the origin:
  • each segment of the message is attached to its destination address, and each routing node knows the coordinates of its neighbors, and greedily selects the neighbor with the smallest hyperbolic distance to the destination for forwarding .
  • Each node is first given corner coordinates To be mapped to the sphere on.
  • Spherical It can be regarded as a simulation of the earth's surface, and the corner coordinates of the node reflect its actual position in the network.
  • node i For non-central nodes with a low number of connections, we do not use the same method for them, because their location in the network depends more on local topology information than geographic information.
  • node i For node i with a degree greater than or equal to 3, based on the IP protocol (its routing is usually based on the shortest path algorithm), it will measure its average delay from each central node, and select the three central nodes j 1 with the smallest delay, j 2 ,j 3 , used to calculate own angular coordinates:
  • Equation constraint (4) represents the proportional relationship between network delay and spherical distance, and the slack variable ⁇ is used to ensure that a feasible solution can be found. As shown in Figure 1.
  • the former term of the objective function ensures that the value of the slack variable is as small as possible, and the latter term ⁇ ( ⁇ i1 + ⁇ i2 + ⁇ i3 ) is used to select the smallest sum of spherical distances when there are multiple feasible solutions.
  • the radius coordinate r reflects the center degree of the node. In a scale-free network, r should satisfy the exponential distribution.
  • the super nodes in the network may lead to the generation of delayed sub-optimal paths.
  • Shanghai has an extremely large number of Internet users. Therefore, there are several super nodes with high centrality in Shanghai.
  • the hyperbolic routing forwarding path of the message may be attracted by Shanghai’s high centrality, namely: the northern end of South Korea-Shanghai-the southern end of South Korea. Additional delay.
  • the radius coordinates are first estimated by maximum likelihood, we have the following prior conditions:
  • the degree ⁇ of the node satisfies the power distribution ⁇ ( ⁇ ) ⁇ - ⁇ , the lowest degree is ⁇ 0 , and the average degree is The degree and diameter coordinates satisfy the following relationship:
  • R is the radius of the sphere.
  • connection probability is:
  • T is the temperature, which controls the degree of aggregation of the nodes;
  • ⁇ is the curvature of the hyperbolic space; at this time, R can be obtained by the following integral:
  • ⁇ is used to adjust the relative weight of the radius coordinate and the angular coordinate in the routing process.
  • DS Delay Stretch
  • the DS comparison chart of the recalculated angle coordinates vs and the original angle coordinates respectively lists the 75th percentile (representing a bad situation) and the 95th percentile (representing almost The worst situation). It can be seen that when an appropriate central node ratio is selected, the recalculation of coordinates can better reduce the worst-case time delay. Since the 75th percentile is already close to 1, its degree of optimization is relatively small.
  • FIG. 6 it is a DS comparison chart of the recalculated diameter coordinate vs. the original diameter coordinate, where the abscissa is the number of sub-graphs divided, relative to the angular coordinates, the division of the graph and the recalculation of the diameter coordinate
  • the network delay can be reduced better.
  • the algorithm can reduce the delay by up to 30% in the worst case.
  • the hyperbolic mapping algorithm maps the network to a hyperbolic space.
  • the network is mapped to a 2-dimensional disk. It can be seen that the greater the degree of the node (which can be used to represent the popularity of the node), the closer the node is to the center of the disk, that is, the radius coordinate The smaller; and the corner coordinates of the node represent its relative position in the network. as shown in picture 2.
  • the forwarding process of hyperbolic routing The message attaches the coordinates of the destination to it, and the routing node calculates the hyperbolic distance between each next hop and the destination, and selects the smallest distance to forward. As shown in Figure 3.
  • a triangular mosaic of hyperbolic discs (Poincaré discs), where each triangle has the same size. For two points with the same visual distance, the closer to the edge of the disc, the greater the actual distance between them.
  • the three-dimensional hyperbolic sphere has similar properties. As shown in Figure 4.
  • Another object of the present invention is to provide a multi-mode identification network addressing system based on coordinate mapping, which includes
  • the network mapping module is used to map a scale-free multi-mode identification network to a three-dimensional hyperbolic space, and assign three-dimensional spherical coordinates to each node in the network;
  • Forwarding module used to select hyperbolic distance based on the calculated distance between nodes
  • d 12 cosh -1 (cosh r 1 cosh r 2 -sinh r 1 sinh r 2 cos ⁇ 12 )
  • the smallest neighboring node is the object of forwarding
  • r and ⁇ come from the coordinates of the node, and ⁇ 1 2 is the central angle between the two points and the origin:
  • routing identifications coexist in the network, such as content identification, identity identification, geospatial location identification and IP address identification, etc., through multi-identification dynamic adaptation and conversion technology, to meet the real-time needs of the network for multiple needs, including hyperbolic coordinates It is used for addressing and routing of a variety of new types of network identities led by content in large-scale networks.
  • the mapping in the network mapping module includes angular coordinate mapping and radial coordinate mapping, and the angular coordinate mapping includes
  • the central node coordinate acquisition unit is used to obtain the longitude and latitude information of the geographical position of the corner coordinates of the central node with high connectivity;
  • the non-central node coordinate acquisition unit is used to judge whether the degree of the non-central node coordinates with low connectivity is greater than or equal to the set value, if it is, then based on the IP protocol, calculate the average delay between itself and each central node, and select one of them
  • the central node with the minimum time delay is set to calculate its own angular coordinates. If not, most of them have only one path to the central node, and their angular coordinates will directly copy the neighbor with the highest degree.
  • the polar coordinate mapping includes
  • the network division module is used to divide the global network into several sub-graphs and perform independent polar coordinate operations on each sub-graph.
  • the most central node in each sub-graph in the network dividing module has a radius coordinate r 0 , and only minor corrections are made to non-central nodes with a smaller radius coordinate.
  • the maximum likelihood estimation of the radius coordinate includes
  • a priori hypothesis unit According to the statistical law of the network, we assume that the degree of the node satisfies the power distribution ⁇ ( ⁇ ) ⁇ - ⁇ , the lowest degree is ⁇ 0 , and the average degree is The relationship between the degree of the node and the diameter coordinate is: Among them, R is the radius of the sphere; according to the statistical law of the network, we assume that the connection probability of two nodes is:
  • x is the hyperbolic distance between two points.
  • R can be obtained by the following integral:
  • the parameter T is the temperature, which controls the degree of aggregation of the nodes; ⁇ is the curvature of the hyperbolic space, and x′ is Hyperbolic distance between and (r,0,0);
  • Sub-picture division and calculation unit Take m nodes i 1 , i 2 ... i m with the highest degree of centrality in the network, and the remaining nodes measure the delay between themselves and each i * . If i k is the one with the smallest delay, then the node belongs to the subgraph G k . For a node with degree ⁇ i , the maximum likelihood of its radius coordinate is estimated as:
  • this algorithm can reduce the transmission delay by up to about 30% while maintaining an inherently high forwarding success rate.
  • the algorithm relies on less network information, and the calculation is simple, easy to complete locally, thereby improving the scalability of the scheme.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

La présente invention convient au domaine de l'avancement de la technologie de réseau et concerne un procédé de radiomessagerie de réseau d'identifiants multi-mode basé sur un mappage de coordonnées, comprenant les étapes consistant à : S1, mapper, au moyen de l'attribution d'une coordonnée mondiale tridimensionnelle à chaque nœud dans un réseau, un réseau d'identifiants multi-mode ayant des propriétés sans mise à l'échelle à un espace hyperbolique tridimensionnel ; S2, l'expéditeur d'un message fixant des coordonnées de nœud de sa destination à chaque segment du message ; et S3, calculer, lors du transfert du message, un nœud de routage calculant la distance hyperbolique entre la destination et chaque nœud adjacent et sélectionnant le plus petit pour servir d'objet de transfert. L'algorithme décrit repose sur très peu d'informations globales et le calcul est simple et bien adapté pour être complété localement, ce qui permet d'améliorer l'adaptabilité d'un réseau à grande échelle.
PCT/CN2019/075668 2019-02-21 2019-02-21 Procédé et système de radiomessagerie de réseau d'identifiants multi-modes basés sur un mappage de coordonnées WO2020168506A1 (fr)

Priority Applications (2)

Application Number Priority Date Filing Date Title
PCT/CN2019/075668 WO2020168506A1 (fr) 2019-02-21 2019-02-21 Procédé et système de radiomessagerie de réseau d'identifiants multi-modes basés sur un mappage de coordonnées
CN201980005059.0A CN111418192B (zh) 2019-02-21 2019-02-21 一种基于坐标映射的多模标识网络寻址方法及系统

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/CN2019/075668 WO2020168506A1 (fr) 2019-02-21 2019-02-21 Procédé et système de radiomessagerie de réseau d'identifiants multi-modes basés sur un mappage de coordonnées

Publications (1)

Publication Number Publication Date
WO2020168506A1 true WO2020168506A1 (fr) 2020-08-27

Family

ID=71495134

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2019/075668 WO2020168506A1 (fr) 2019-02-21 2019-02-21 Procédé et système de radiomessagerie de réseau d'identifiants multi-modes basés sur un mappage de coordonnées

Country Status (2)

Country Link
CN (1) CN111418192B (fr)
WO (1) WO2020168506A1 (fr)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114070773A (zh) * 2021-10-13 2022-02-18 杭州电子科技大学 一种基于最短路径长度的空间网络路由策略

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112104556B (zh) * 2020-11-20 2021-03-02 广东省新一代通信与网络创新研究院 一种网络融合方法及系统
CN112565094B (zh) * 2020-12-09 2023-04-07 之江实验室 一种多模态网络拓扑结构
CN114143084B (zh) * 2021-11-30 2024-02-23 安天科技集团股份有限公司 恶意域名判定方法、装置、电子设备及存储介质

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102143545A (zh) * 2011-03-03 2011-08-03 上海左岸芯慧电子科技有限公司 路由器及其分组转发方法
CN103200096A (zh) * 2013-03-13 2013-07-10 南京理工大学 一种复杂网络中避免关键节点的启发式路由方法
WO2018098750A1 (fr) * 2016-11-30 2018-06-07 深圳天珑无线科技有限公司 Procédé de transmission de message dans un réseau distribué et nœud
CN108712336A (zh) * 2018-05-21 2018-10-26 华东师范大学 一种提高无标度网络传输容量的局部信息动态路由算法

Family Cites Families (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102291312A (zh) * 2011-09-05 2011-12-21 电子科技大学 一种基于层次化ip网络坐标系统的路由选择方法
CN103152265B (zh) * 2013-03-22 2017-02-15 杭州华三通信技术有限公司 一种spb网络中的报文转发方法和设备
US10812365B2 (en) * 2017-02-28 2020-10-20 Northeastern University Geohyperbolic routing and addressing schemes for networks
CN107292440B (zh) * 2017-06-26 2020-12-01 河海大学 一种基于ba无标度网络理论的集装箱班轮航线优化方法

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102143545A (zh) * 2011-03-03 2011-08-03 上海左岸芯慧电子科技有限公司 路由器及其分组转发方法
CN103200096A (zh) * 2013-03-13 2013-07-10 南京理工大学 一种复杂网络中避免关键节点的启发式路由方法
WO2018098750A1 (fr) * 2016-11-30 2018-06-07 深圳天珑无线科技有限公司 Procédé de transmission de message dans un réseau distribué et nœud
CN108712336A (zh) * 2018-05-21 2018-10-26 华东师范大学 一种提高无标度网络传输容量的局部信息动态路由算法

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114070773A (zh) * 2021-10-13 2022-02-18 杭州电子科技大学 一种基于最短路径长度的空间网络路由策略

Also Published As

Publication number Publication date
CN111418192A (zh) 2020-07-14
CN111418192B (zh) 2022-03-29

Similar Documents

Publication Publication Date Title
WO2020168506A1 (fr) Procédé et système de radiomessagerie de réseau d'identifiants multi-modes basés sur un mappage de coordonnées
Bruck et al. MAP: Medial axis based geometric routing in sensor networks
Liebeherr et al. Application-layer multicasting with delaunay triangulation overlays
US20170005877A1 (en) Data object and networking node locators
WO2005055519A1 (fr) Regroupement de noeuds sur la base d'interets utilisateur, d'exigences d'application et de caracteristiques de reseau
Tsai et al. A path-connected-cluster wireless sensor network and its formation, addressing, and routing protocols
CN101437045A (zh) P2p系统中中转节点的选择方法及p2p节点
WO2018098750A1 (fr) Procédé de transmission de message dans un réseau distribué et nœud
Zhang et al. Node correlation clustering algorithm for wireless multimedia sensor networks based on overlapped FoVs
Tan et al. Convex partition of sensor networks and its use in virtual coordinate geographic routing
Hou et al. Cluster routing-based data packet backhaul prediction method in vehicular named data networking
Yang et al. A network-embedding-based approach for scalable network navigability in content-centric social IoT
WO2018098748A1 (fr) Procédé de communication dans un réseau distribué, nœud et système
Wedaj et al. TBDD: Territory-Bound Data Delivery for Large-Scale Mobile Sink Wireless Sensor Networks
Wirtz et al. Mesh-DHT: A locality-based distributed look-up structure for Wireless Mesh Networks
Tan et al. Convex partitioning of large-scale sensor networks in complex fields: Algorithms and applications
WO2018098752A1 (fr) Procédé de diffusion de message pour réseau distribué, et nœud
WO2018098749A1 (fr) Procédé de diffusion de message dans un réseau distribué et nœud
Bian et al. Using hierarchical location names for scalable routing and rendezvous in wireless sensor networks
Rais et al. Optimal Routing and Clustering Technique for Wireless Sensor Networks.
CN113207138B (zh) 基于多质量属性的sr方法、系统、设备和介质
CN102035870B (zh) 无线移动网络中基于极坐标划分管理的服务发现方法
Zhang et al. On the utility of concave nodes in geometric processing of large-scale sensor networks
Wang Distributed Energy Balance Clustering Algorithm in Wireless Sensor Networks
Chen et al. A weight factors localization algorithm in fog-supported wireless sensor networks

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 19915667

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 19915667

Country of ref document: EP

Kind code of ref document: A1