Ad Hoc peer-to-peer network center-less distributed quick corecognition method

A peer-to-peer network and distributed technology, applied in the field of communication, can solve the problems affecting the performance and application scope of the decentralized distributed consensus method, the low efficiency of the network distributed consensus algorithm, and the slow convergence speed of the algorithm, so as to reduce the number of nodes and The amount of information interaction, the avoidance of network traffic, and the effect of good real-time performance

Inactive Publication Date: 2017-08-01
XIAN UNIV OF POSTS & TELECOMM
View PDF5 Cites 3 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

However, when the number of network nodes is large and the information diffusion path is long, due to the communication burden on the network caused by the above two aspects of 1) and 2), the speed of information diffusion is slow, resulting in a decentralized distributed consensus based on the Ad Hoc peer-to-peer network. The method cannot converge quickly, and the real-time performance is poor
[0007] To sum up, when the original algorithm has a large number of network nodes and a long information diffusion path in the information diffusion link and iter

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
  • Ad Hoc peer-to-peer network center-less distributed quick corecognition method
  • Ad Hoc peer-to-peer network center-less distributed quick corecognition method
  • Ad Hoc peer-to-peer network center-less distributed quick corecognition method

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0032] Based on the original algorithm in the Ad Hoc peer-to-peer network in the information diffusion link and iterative calculation link, when the number of network nodes is large and the information diffusion path is very long, it will cause slow information diffusion speed, slow algorithm convergence speed, information loop calculation, and node calculation. Problems such as large size and high energy consumption of nodes lead to the disadvantages of low efficiency, high energy consumption, and poor real-time performance in the distributed consensus process of the network.

[0033] The above defects have affected the performance and application range of the decentralized consensus method based on the Ad Hoc peer-to-peer network, and even make the algorithm invalid when the situation is bad. For this reason, the present invention proposes a kind of Ad Hoc peer-to-peer network non-center distributed fast consensus method through repeated exploration and innovation, see figur...

Embodiment 2

[0043] Ad Hoc peer-to-peer network non-central distributed fast consensus method is the same as embodiment 1, the calculation of the initial state value sum of the dominant set node and the independent affiliated neighbor node in step 3 is specifically: use the state variable x i Indicates the initial state value of network node i, for connected dominator set node k, k=1,..., |V′|, |V′| is the number of nodes in dominator set V’, independent subordinate neighbors of dominator set node k denoted as F k ,|F k |Indicates the number of independent subordinate neighbors of the dominating set node k; each dominating set node k performs the calculation:

[0044]

[0045] where x' k Indicates the sum of the initial state values ​​of the dominating set node k and its independent affiliated neighbor nodes, x k is the initial state value of the dominating set node k.

[0046] The present invention utilizes network subsets to connect and dominate centralized dominating nodes to rea...

Embodiment 3

[0048] The Ad Hoc peer-to-peer network non-central distributed fast consensus method is the same as that of Embodiment 1-2, and the information sharing convergence model in step 4 is specifically: the initial state values ​​of all dominating set nodes k and their independent affiliated neighbor nodes and their sums are combined with the network The ratio of all node numbers. In other words, the initial state values ​​of all nodes in the network are non-repeatedly summed through the dominating set.

[0049] According to the initial state value and the same calculation performed on each node of the connected dominator set, the information sharing convergence model calculation is performed in the connected dominator set to obtain the consensus convergence result:

[0050]

[0051] where x * Indicates the result of Ad Hoc peer-to-peer wireless network consensus convergence.

[0052] The present invention utilizes the dominant node to realize the full coverage and non-repetiti...

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 discloses an Ad Hoc peer-to-peer network center-less distributed quick corecognition method. The method comprises the steps of allocating non-dominated nodes, which are not repeated, of a whole network to each of dominated set nodes to take as independent neighboring nodes of the dominated set nodes, and then by virtue of a dominated set, performing distributed corecognition calculation of network node state values and sharing a final corecognition result to the whole network. By employing the method, the rapid convergence of a distributed corecognition calculation result can be implemented, the convergent result is accurate and stable and the network does not need to have a central node; through the method, an algorithm can achieve stable convergence via a round of the calculation, and the global original information of the network is not needed, such that the calculation complexity is small, and the problems that the iterative times in a previous center-less distributed iterative algorithm cannot be determined, the node interactive traffic is large, the convergent result is unstable and the like are avoided; and therefore, the energy consumption of the nodes can be saved, the traffic and the node calculation burden are reduced, the service life of the network is prolonged, the network delay is effectively reduced, and the real-time capability is good.

Description

technical field [0001] The invention belongs to the technical field of communication, relates to distributed data fusion and distributed detection, and specifically relates to a centerless distributed fast consensus method of an Ad Hoc peer-to-peer network, which is used for distributed consensus calculation under the Ad Hoc peer-to-peer network. Background technique [0002] The Ad Hoc network is a temporary network formed by a group of mobile nodes through wireless interfaces, and it does not require the help of other special infrastructure or centralized management, and its deployment has great flexibility. In the network, nodes generally do not need to maintain a fixed, globally known network position, and nodes can move. Generally, the main characteristics of mobile nodes are low bandwidth, mobility and low energy. Ad Hoc networks can be mainly used in distributed computing and wireless sensor networks, and their application ranges include civil, disaster relief and mi...

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
IPC IPC(8): H04W28/06H04W40/24H04W84/18H04L12/24H04L12/801
CPCH04L41/12H04L47/10H04L47/12H04W28/06H04W40/246H04W40/248H04W84/18Y02D30/50Y02D30/70
Inventor 黄庆东郭欢曹丽霞庞胜利包志强王军选
Owner XIAN UNIV OF POSTS & TELECOMM
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products