Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Traffic routing tree construction method based on geographic location

A construction method and technology based on geographic location, applied in the field of traffic routing tree construction based on geographic location, can solve the problems of complex routing and poor routing performance, and achieve the effect of reducing transmission time, prolonging life and improving system throughput.

Inactive Publication Date: 2018-04-13
TIANJIN UNIV
View PDF5 Cites 4 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0004] When the root node is not selected properly, it is easy to generate a large number of conflicting packets, and a large number of conflicting packets will lead to more complicated routing
At the same time, if there is high traffic in the link containing the routing tree, there is likely to be a bottleneck in the tree, and the performance of routing performed on this routing tree will be poor

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Traffic routing tree construction method based on geographic location
  • Traffic routing tree construction method based on geographic location
  • Traffic routing tree construction method based on geographic location

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0033] A method for constructing traffic routing tree based on geographic location, see figure 1 , the traffic routing tree construction method includes the following steps:

[0034] 101: Initialization steps:

[0035] Each cluster head uses a disjoint set data structure, and a priority queue data structure, which is used in the cluster to track the membership of each node; the priority queue data structure is used to store information to all adjacent The virtual bandwidth and distance of the cluster;

[0036] The center of the cluster is the average of the positions of all nodes in the cluster; the distance between two adjacent clusters is the distance between the cluster centers; the virtual bandwidth of two adjacent clusters is the sum of all available bandwidths between the two cluster nodes; calculated according to the gravitational function the gravitational force of each pair of adjacent clusters;

[0037] 102: Merge step:

[0038] A pair of adjacent clusters with t...

Embodiment 2

[0050] The following is combined with specific calculation formulas, examples, figure 1 and figure 2 The technical scheme in embodiment 1 is further introduced, see the following description for details:

[0051] The embodiment of the present invention proposes a bottom-up distributed design method, the object of which is to construct an efficient routing tree adapting to the structure of the network and improve the performance of geographic location routing. The technical solution mainly involves three aspects: 1) cluster definition; 2) gravitational function definition; 3) data structure definition, see the following description for details:

[0052] 201: cluster definition;

[0053] see figure 2 , a cluster is a collection of nodes. Each cluster has a cluster head, and each node belongs to a cluster. The center of the cluster is the average of the positions of all nodes in the cluster. two clusters C 1 and C 2 The distance is dist(C 1 ,C 2 ), for C 1 Center and C...

Embodiment 3

[0075] The scheme in embodiment 1 and 2 is further introduced below in conjunction with specific example, see the following description for details:

[0076] This example uses the operation of a cluster head based on a wireless network as an example to give a specific implementation method. The specific steps are as follows:

[0077] 1) Initialization stage;

[0078] T max is the longest timer a node is allowed to set in the number of beacon periods. At the beginning, each node is regarded as a cluster with only one node, and the calculation of the cluster where the cluster head is located to each of its adjacent clusters C i gravitational force G i , and choose the maximum value G T , set the target cluster to C T and timer T for T max / G T , and set the state to compare state.

[0079] (2) monitoring and merging stage;

[0080] At this stage, these cluster heads will go through a process similar to the two-phase commit protocol. Cluster heads that send merge reques...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The invention provides a traffic sensing routing tree construction method based on geographic location routing. The method comprises the steps that a disjoint set data structure is used to track the membership of each node in a cluster; a priority queue data structure is used to store virtual bandwidths and distances to all adjacent clusters; the virtual bandwidth of two adjacent clusters is the sum of all available bandwidths between two cluster nodes, and a pair of adjacent clusters with the maximum attraction are merged first; the cluster head of a cluster with many nodes appears as a new cluster head; the cluster center is the average of the locations of all nodes in the cluster; the virtual bandwidth of the new cluster to the adjacent cluster is calculated from the bandwidth of the original cluster to the adjacent cluster; the highest available bandwidth link from the new cluster to the adjacent cluster is the highest bandwidth link from the original cluster to the adjacent cluster; and until only one cluster left or the rest of the clusters have no attraction, the method ends, and a large cluster with all nodes of a routing tree is acquired, wherein the cluster head of the large cluster is the node of the routing tree root. According to the invention, location and traffic information are considered at the same time; the number of collision packets and the average path hops are reduced; and the average path throughput is increased.

Description

technical field [0001] The invention relates to the fields of ad hoc networks and sensor networks, in particular to a method for constructing a flow routing tree based on geographic location. Background technique [0002] In recent years, the concept of geographic location routing has been proposed in the field of ad hoc networks and sensor networks. It is able to generate routing circuits using local geographic location information, thus avoiding the massive communication and storage overhead caused by proactive and reactive routing protocols. Tree routing is one of the many detours that geo-location routing uses to help packets find a suitable path out of a local minimum. [0003] The effectiveness of tree routing depends on the quality of pre-constructed routing trees, while existing tree construction methods adopt a top-down and centralized approach and do not consider the traffic load in the network. [0004] When the root node is not selected properly, a large number...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
Patent Type & Authority Applications(China)
IPC IPC(8): H04L12/721H04L12/753
CPCH04L45/38H04L45/48
Inventor 张蕾王聪刘琨
Owner TIANJIN UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com