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

Ad Hoc One-way Link Network Decentralized Distributed Fast Consensus Method

A one-way link and distributed technology, applied in the field of communication, can solve problems such as uncertainty of convergence accuracy, high energy consumption of nodes, and large amount of calculation of nodes, so as to reduce the number of nodes and the amount of information interaction, and avoid information redundancy. In addition, the effect of saving frequency band resources

Inactive Publication Date: 2020-01-21
XIAN UNIV OF POSTS & TELECOMM
View PDF3 Cites 0 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 very 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 the non-central distribution of the network based on Ad Hoc unidirectional links. The traditional consensus method cannot converge quickly, and the real-time performance is poor
[0008] 4) In terms of accuracy, this non-central distributed consensus method based on the Ad Hoc one-way link network, because the node communication link is one-way, it causes the communication state between the network nodes to be asymmetrical, making the state transition probability matrix of information transmission It is not a double random matrix, so the consistent result that will cause convergence is not the average consensus result of the entire network. There is often a certain error between them, and this error cannot be accurately estimated, so there is uncertainty in the accuracy of convergence
[0009] In the calculation based on the Ad Hoc unidirectional link network without a center distributed consensus, the original algorithm will cause slow information diffusion and slow information diffusion when the number of network nodes is large and the information diffusion path is long in the information diffusion link and iterative calculation link. Problems such as slow algorithm convergence speed, large node computation, and high node energy consumption lead to low efficiency, high energy consumption, and poor real-time performance of the network distributed consensus algorithm
In addition, more importantly, there are uncertainties in the convergence link that cannot be predicted, which reduces the credibility, directly affects the performance and application range of the Ad Hoc unidirectional link network, and even makes the algorithm failure, causing the network to malfunction

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 One-way Link Network Decentralized Distributed Fast Consensus Method
  • Ad Hoc One-way Link Network Decentralized Distributed Fast Consensus Method
  • Ad Hoc One-way Link Network Decentralized Distributed Fast Consensus Method

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0035] Ad Hoc network is a special wireless mobile network whose main characteristics are limited bandwidth, unconstrained mobility and low energy. In many cases, Ad Hoc network nodes are limited by available resources such as energy and limited bandwidth. The network often has no control center, and the distributed algorithm to be executed is simple and time-efficient.

[0036] However, in the information diffusion link and iterative calculation link of the existing algorithm, when the number of network nodes is large and the information diffusion path is very long, the information diffusion speed is slow, the algorithm convergence speed is slow, the node calculation amount is large, and the node energy consumption is high, resulting in a distributed network. The consensus algorithm has low efficiency, high energy consumption, and poor real-time performance. More importantly, there is uncertainty in the accuracy of the convergence link. The reduced reliability directly affects...

Embodiment 2

[0047] The centerless distributed fast consensus method for Ad Hoc unidirectional link network is the same as that of Embodiment 1. The independent subordinate dominant neighbor and the independent subordinate absorbing neighbor described in step 2 are respectively: if a non-gateway node has only one gateway dominant neighbor, then the non-gateway node has only one gateway dominant neighbor. A gateway node is divided into independent subordinate absorbing neighbors of the gateway node. If a non-gateway node has only one gateway absorbing neighbor, the non-gateway node is divided into independent subordinate dominating neighbors of the gateway node; if a non-gateway node has multiple gateway dominating neighbor nodes , then select one of the gateway nodes according to the criteria of proximity or link status, and divide the non-gateway node to the selected gateway node as its independent subordinate absorbing neighbor. If the non-gateway node has multiple gateway absorbing neighb...

Embodiment 3

[0049] Ad Hoc unidirectional link network centerless distributed fast consensus method is the same as embodiment 1-2. In step 3, the independent initial state collection value x' of gateway node k is obtained k , specifically using the state variable x i Represents the initial state value of network node i. For gateway node k=1,...,|V'|, |V'| is the number of nodes in the connected dominating absorbing set V', and the independent subordinate dominating neighbors of gateway node k represent for F k , |F k |represents the number of independent subordinate dominant neighbors of gateway node k; each gateway node k performs the calculation:

[0050]

[0051] where x' k Represents the independent initial state collection value of gateway node k, which is the initial state and value of all independent affiliated neighbors of gateway node k. and gateway node k initial state value x k The added sum value.

[0052] The invention utilizes network subsets to connect, dominate an...

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 acentric distributed rapid consensus method for an Ad Hoc unidirectional link network. Non-gateway nodes in the whole network are distributed in a nonredundant manner to each gateway node in a communicated predomination and absorption set to serve as independent neighbor nodes of the gateway nodes, distributed consensus computation of a network node state value is performed with the aid of the communicated predomination and absorption set, and a final consensus result is shared to the whole network; and rapid convergence of the distributed consensus result is achieved. According to the method provided by the invention, the convergence result is accurate and stable, and the network does not need the central node. The purpose of stable convergence and small computing complexity can be achieved via a turn of computation, and the problems that in a traditional acentric distributed rapid iterative algorithm, the number of iterations cannot be determined, the node interaction communication traffic is large, and the convergence result is instable or cannot be converged to an accurate value are solved, so that the method provided by the invention is capable of saving node energy consumption, reduced in communication traffic and node computation burden, prolonged in service life of the network, effectively reduced in network delay and good in instantaneity.

Description

technical field [0001] The invention belongs to the field of communication technology, relates to distributed non-central data fusion and distributed detection and control, in particular to an Ad Hoc unidirectional link network non-central distributed fast consensus method, which is used for Ad Hoc unidirectional link network without Central distributed fast consensus computing, one-way link network distributed data fusion and distributed detection. Background technique [0002] Ad Hoc network is a special kind of wireless mobile network, which is a temporary network formed through wireless interfaces, without the help or management of any infrastructure, such as base stations or mobile switching centers, and can be flexibly deployed. In the network, nodes generally do not need to maintain a fixed, globally known network position, and nodes can move. Usually, the main characteristics of mobile nodes are limited bandwidth, unconstrained mobility and low energy. Ad Hoc netwo...

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 Patents(China)
IPC IPC(8): H04W40/04H04W40/32H04W84/18
CPCH04W40/04H04W40/32H04W84/18Y02D30/70
Inventor 黄庆东周赟姚雪茜曹丽霞郭欢庞胜利包志强王军选
Owner XIAN UNIV OF POSTS & TELECOMM
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