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

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...

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 iterative calculation link, it will cause slow information diffusion speed, slow algorithm convergence speed, large node calculation load, and node energy consumption. Higher disadvantages, which in turn lead to disadvantages such as low efficiency, high energy consumption, and poor real-time performance of the network distributed consensus algorithm

[0008] The above defects affect 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.

Images