CN107071846B - Ad Hoc unidirectional link network centerless distributed rapid consensus method - Google Patents

Ad Hoc unidirectional link network centerless distributed rapid consensus method Download PDF

Info

Publication number
CN107071846B
CN107071846B CN201710211692.8A CN201710211692A CN107071846B CN 107071846 B CN107071846 B CN 107071846B CN 201710211692 A CN201710211692 A CN 201710211692A CN 107071846 B CN107071846 B CN 107071846B
Authority
CN
China
Prior art keywords
network
nodes
node
hoc
consensus
Prior art date
Legal status (The legal status 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 status listed.)
Expired - Fee Related
Application number
CN201710211692.8A
Other languages
Chinese (zh)
Other versions
CN107071846A (en
Inventor
黄庆东
周赟
姚雪茜
曹丽霞
郭欢
庞胜利
包志强
王军选
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Xian University of Posts and Telecommunications
Original Assignee
Xian University of Posts and Telecommunications
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 Xian University of Posts and Telecommunications filed Critical Xian University of Posts and Telecommunications
Priority to CN201710211692.8A priority Critical patent/CN107071846B/en
Publication of CN107071846A publication Critical patent/CN107071846A/en
Application granted granted Critical
Publication of CN107071846B publication Critical patent/CN107071846B/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
    • H04W40/04—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
    • H04W40/32—Connectivity information management, e.g. connectivity discovery or connectivity update for defining a routing cluster membership
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W84/00—Network topologies
    • H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D30/00—Reducing energy consumption in communication networks
    • Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)
  • Small-Scale Networks (AREA)

Abstract

The invention discloses a non-central distributed rapid consensus method for an Ad Hoc one-way link network, which is characterized in that non-gateway nodes of the whole network are repeatedly distributed to all gateway nodes in communicated domination and absorption sets to serve as independent neighbor nodes of the gateway nodes, distributed consensus calculation of network node state values is carried out by means of the communicated domination and absorption sets, and final consensus results are shared to the whole network; and the quick convergence of the distributed consensus computing result is realized. The invention has accurate and stable convergence result and does not need the network to have a central node. The method can achieve stable convergence through one round of calculation, has small calculation complexity, and avoids the problems that the iteration times cannot be determined, the node interactive communication traffic is large, the convergence result is unstable or cannot be converged to an accurate value and the like in the conventional centerless distributed iteration algorithm.

Description

Ad Hoc unidirectional link network centerless distributed rapid consensus method
Technical Field
The invention belongs to the technical field of communication, and relates to distributed centerless data fusion and distributed detection and control, in particular to a centerless distributed rapid consensus method for an Ad Hoc unidirectional link network, which is used for centerless distributed rapid consensus calculation, distributed data fusion and distributed detection of the Ad Hoc unidirectional link network.
Background
An Ad Hoc network is a special wireless mobile network, which can be flexibly deployed through a temporary network formed by wireless interfaces without the aid of any infrastructure, such as a base station or a mobile switching center. In a network, nodes generally need not maintain a fixed, globally aware network location, and nodes may move. In general, the main features of mobile nodes are limited bandwidth, unrestricted mobility and low energy. The Ad Hoc network is mainly used for distributed computing and wireless sensor networks, and the application range relates to the fields of civil use, disaster relief, military application and the like. In many cases, the Ad Hoc network nodes are limited by available resources such as energy, limited bandwidth, and the like, so that energy consumption saving and band resource occupation reduction are main factors to be considered for the network nodes, and in addition, due to the mobility of the network nodes, the network is often without a control center, so that a distributed algorithm to be executed is simple and has good timeliness.
The Ad Hoc network adopting the distributed processing mechanism has the advantages that the network has no control center, and information among network nodes is transmitted in a node single-hop mode, so that the network has flexibility, scalability and survivability. The distributed consensus method is widely applied and can be used for the purposes of distributed cooperative spectrum sensing, distributed detection or estimation, cluster control and the like. In ad hoc wireless networks, some links often have unidirectional communication links due to inconsistent transmission distances or hidden terminal reasons. Under the condition of a hidden terminal, data packets sent from different nodes to the same destination node collide to cause data packet loss, the connection between the nodes should also be unidirectional, a bidirectional peer-to-peer network is often transformed into a substantially unidirectional network due to various factors in actual operation, and the bidirectional peer-to-peer network can be regarded as a special state of the unidirectional network. The problem of solving the unidirectional link network is more generally significant.
At present, a centerless distributed consensus method based on an Ad Hoc unidirectional link network does not need a data fusion control center, only local adjacent node information interaction is needed to complete cooperative consensus, and a better distributed consensus result can be realized. It still has the following links that can be optimized and improved:
1) because the distributed consensus calculation is iteratively executed on each node of the whole network based on the Ad Hoc unidirectional link network centerless distributed consensus method, the node state information in the network gradually diffuses to the whole network through local adjacent node information interaction and network node iterative calculation. This information diffusion speed is limited by the network size and network topology. Especially, when the number of network nodes is large and the information diffusion path is long, the network communication load is heavy, which easily causes network communication blockage, thereby delaying the algorithm convergence rate and increasing the node energy consumption.
2) In the Ad Hoc unidirectional link network based centerless distributed consensus method, each node performs iterative computation of distributed state information fusion and information interaction with adjacent nodes. When the number of network nodes is large and the information diffusion path is long, due to unsmooth information transmission and a large number of nodes participating in distributed computation, the convergence efficiency of each iterative computation is low, the overall convergence speed of the network is low, and the nodes are large in operation number, poor in quality and high in energy consumption.
3) In the aspect of real-time performance, the method can be carried out in a self-adaptive mode based on the centerless distributed consensus method of the Ad Hoc unidirectional link network. However, when the number of network nodes is large and the information diffusion path is long, the information diffusion speed is slow due to the communication burden on the network in the two aspects of 1) and 2), so that the Ad Hoc unidirectional link network based centerless distributed consensus method cannot be rapidly converged and has poor real-time performance.
4) In the aspect of accuracy, in the Ad Hoc unidirectional link network based centerless distributed consensus method, because node communication links are unidirectional, communication states among network nodes are asymmetric, a state transition probability matrix of information transmission is not a double random matrix, a convergence consistent result is not an average consensus result of the whole network, a certain error often exists among the network nodes, and the error cannot be accurately estimated, so that uncertainty exists in the aspect of convergence accuracy.
In the calculation based on the Ad Hoc unidirectional link network centerless distributed consensus, when the number of network nodes is large and the information diffusion path is long in an information diffusion link and an iterative calculation link, the original algorithm has the problems of low information diffusion speed, low algorithm convergence speed, large node calculation amount, high node energy consumption and the like, and further causes the problems of low efficiency, high energy consumption and poor real-time performance of the network distributed consensus algorithm. In addition, more importantly, uncertainty that the accuracy cannot be estimated exists in a convergence link, so that the reliability is reduced, the performance and the application range of the Ad Hoc unidirectional link network are directly influenced, and even the algorithm fails in severe conditions, so that the network fails.
Disclosure of Invention
The invention aims to overcome the defects of the prior art and provide a centerless distributed rapid consensus method based on an Ad Hoc unidirectional link network.
The invention relates to a centerless distributed rapid consensus method for an Ad Hoc unidirectional link network, which is characterized by comprising the following steps:
step 1, determining a dominance absorption set of Ad Hoc one-way link network communication: the method is characterized in that a centerless Ad Hoc one-way link wireless communication network is arranged, the connection of nodes in the network is directional, a node v in the one-way link can directly reach a node u in a single hop but the node u cannot necessarily directly reach the node v in the single hop, and the one-way link is represented as a one-way link (v, u), the node v is called a dominant neighbor of the node u, the node u is called an absorption neighbor of the node v, and the dominant neighbor and the absorption neighbor are collectively called as neighbors; determining a domination absorption set V 'communicated by the Ad Hoc network, wherein nodes in the set V' of the domination absorption set are gateway nodes, nodes except the domination absorption set are non-gateway nodes, and the assumption is that the network topology structure is not changed in the calculation process;
step 2, dividing independent attached neighbors of the gateway nodes: dividing non-gateway nodes in the Ad Hoc one-way link wireless network into each gateway node in a communicated domination absorption set in a non-repeated way as an independent attached neighbor node; dividing non-gateway nodes into independent attached dominating neighbors and independent attached absorbing neighbors of the gateway nodes, wherein the independent attached dominating neighbors and the independent attached absorbing neighbors are not repeated by the non-gateway nodes;
step 3. dominating neighbors with all independent affiliations of gateway node kAdding the initial state sum value and the initial state value of the gateway node k to obtain an independent initial state collection value x 'of the gateway node k'k；
Step 4, constructing a consensus convergence model of the Ad Hoc unidirectional link wireless network, and calculating a consensus convergence result by using the model;
step 5, sharing the network consensus result to all nodes of the network through a communicated domination absorption set to serve as a consistent result of the distributed consensus convergence of the whole network;
and 6, judging: judging the topological structure of the Ad Hoc one-way link wireless network, if the topological structure of the Ad Hoc one-way link wireless network is not changed in the calculation process, finishing the centerless distributed quick consensus of the Ad Hoc one-way link wireless network at this time, and using the consensus convergence consistent result in the application occasions of centerless distributed sensing, detection, judgment, control and the like of the one-way link wireless network to obtain the network global state consensus as the condition and basis of subsequent processing; and if the topological structure of the Ad Hoc one-way link wireless network changes in the calculation process, returning to execute the steps 1-5, and re-performing the centerless distributed rapid consensus calculation of the Ad Hoc one-way link wireless network.
The invention also relates to the application of the Ad Hoc unidirectional link network centerless distributed rapid consensus method, which is characterized in that: a method for realizing decentralized distributed rapid consensus of an Ad Hoc unidirectional link network is used for application occasions of decentralized distributed sensing, detection, judgment, control and the like of the unidirectional link network to obtain the global state consensus of the network, and the global state consensus is used as a condition and basis for subsequent processing.
The method can avoid the problem of uncertain consensus convergence precision caused by network asymmetry, and can quickly and accurately converge to the theoretical average value of the network through one iteration in a distributed centerless mode. The method can be used for application occasions of the unidirectional link network centerless distributed sensing, detection, judgment, control and the like to obtain the network global state consensus as the condition and basis of subsequent processing.
Compared with the prior art, the invention has the following advantages:
(1) the distributed consensus method of the nodes of the whole network is optimized to the connected domination absorption set for calculation, so that the number of the nodes participating in calculation and information interaction and the information interaction amount are reduced, the network energy consumption is reduced, and the frequency band resource is saved.
(2) When the method utilizes the communicated domination absorption set to collect information, the neighbor nodes are divided into the gateway nodes without overlapping, and the independent attached domination neighbors and the independent attached absorption neighbors of the gateway nodes are formed, so that the information redundancy is avoided under the condition of ensuring the network communication, and the algorithm can be ensured to calculate to obtain a stable consensus result through one iteration. On one hand, the problems of information redundancy, low convergence speed, high node energy consumption, multiple iteration times, network frequency band resource shortage and the like when the whole network node of the original algorithm participates in operation and information transmission are avoided.
(3) According to the invention, the state information of the whole network node is collected in a non-overlapping way through the adjacent gateway nodes, and then the gateway nodes share the collected non-overlapping state information in the communicated domination absorption set, so that the sum value of the state information of the whole network node and the number of the nodes are spliced in each gateway node, and then a stable consensus result can be obtained through calculation. Compared with the problems of low convergence speed, unstable convergence result, incapability of accurately estimating iteration steps required by convergence and the like of the original method, the method can accurately obtain a stable convergence result through one iteration, simultaneously reduce the node quantity of an execution algorithm, and avoid unnecessary network traffic of the conventional full network information interaction, so that the node energy consumption is saved, the network computing efficiency is improved, the network delay is effectively reduced, and the real-time performance is good.
(4) The method can quickly realize the calculation of the accurate average consensus result. In the original distributed computing method, because of the asymmetric influence of the communication state among network nodes caused by the unidirectional link network, the state transition probability matrix of information transmission is not a double random matrix, so that the convergence consistent result is not the average consensus result of the whole network, a certain error often exists between the two, and the error cannot be estimated. The method avoids the condition that the extreme distribution of the transition probability matrix is not the average distribution caused by multiple iterations when the network link is asymmetric through one round of information non-repeated collection and consensus calculation. Therefore, the method can quickly and accurately converge to a theoretical average result.
Description of the drawings:
FIG. 1 is a schematic flow chart of the algorithm of the present invention;
FIG. 2 is a schematic diagram of the topology and gateway node distribution of a 10-node network in the present invention;
FIG. 3 is a schematic diagram of the distribution of each gateway node and its independent attached neighbor nodes in FIG. 2;
FIG. 4 is a comparison of the scheme of FIG. 3 of the present invention with the cooperative consensus convergence of the prior art;
FIG. 5 is a schematic diagram of the topology and gateway node distribution of a 20-node network in the present invention;
FIG. 6 is a schematic diagram of the distribution of each gateway node and its independent attached neighbor nodes in FIG. 5;
FIG. 7 is a comparison of the scheme of FIG. 6 of the present invention with the convergence of cooperative consensus of the prior art;
fig. 8 is a schematic diagram of a network node data collection process.
The specific implementation mode is as follows:
in order to make the objects, technical solutions and advantages of the present invention more apparent, the present invention is described in detail below with reference to the accompanying drawings.
Example 1.
An Ad Hoc network is a special wireless mobile network, mainly characterized by limited bandwidth, unrestricted mobility and low energy. In many cases, the Ad Hoc network nodes are limited by available resources such as energy and limited bandwidth, and the network is usually without a control center, so that the distributed algorithm to be executed is simple and has good timeliness.
In the existing algorithm, when the number of network nodes is large and the information diffusion path is long in an information diffusion link and an iterative calculation link, the information diffusion speed is low, the algorithm convergence speed is low, the node calculation amount is large, and the node energy consumption is high, so that the network distributed consensus algorithm has low efficiency, high energy consumption and poor real-time performance, more importantly, the uncertainty that the accuracy cannot be estimated exists in the convergence link, the reliability of the uncertainty is reduced, the performance and the application of the Ad Hoc unidirectional link network are directly influenced, even the algorithm fails, and the network fails.
Aiming at the current situation, the invention develops research and innovation, and provides a centerless distributed rapid consensus method for an Ad Hoc unidirectional link network, and referring to fig. 1, the consensus process of the invention comprises the following steps:
step 1, determining a dominance absorption set of Ad Hoc one-way link network communication: the method is characterized in that a centerless Ad Hoc one-way link wireless communication network is arranged, the connection of nodes in the network is directional, a node v in the one-way link can directly reach a node u in a single hop but the node u cannot necessarily directly reach the node v in the single hop, and the one-way link is represented as a one-way link (v, u), the node v is called a dominant neighbor of the node u, the node u is called an absorption neighbor of the node v, and the dominant neighbor and the absorption neighbor are collectively called as neighbors; determining a domination absorption set V 'communicated by the Ad Hoc network, wherein nodes in the set V' of the domination absorption set are gateway nodes, nodes except the domination absorption set are non-gateway nodes, and the assumption is that the network topology structure is not changed in the calculation process.
There are many methods for forming dominant absorption set V', and the present invention adopts the method described in Jie Wu, extended-set-based routing in ad hoc wireless networks with unidirectional associations [ J ]. IEEE Transactions on Parallel and Distributed Systems,2002,13(9): 866) 881.
Step 2, dividing independent attached neighbors of the gateway nodes: dividing non-gateway nodes in the Ad Hoc one-way link wireless network into each gateway node in a communicated domination absorption set in a non-repeated way as an independent attached neighbor node; nodes included in the connected dominating absorption set V' are gateway nodes, and nodes other than the connected dominating absorption set are non-gateway nodes. Dividing non-gateway nodes into independent attached dominating neighbors and independent attached absorbing neighbors of the gateway nodes, wherein the independent attached dominating neighbors and the independent attached absorbing neighbors are not repeated by the non-gateway nodes; in the invention, the independent attached domination neighbor and the independent attached absorption neighbor are collectively called as an independent attached neighbor; in the Ad Hoc unidirectional link wireless network, a non-gateway node, namely a network node outside a domination absorption set V' communicated by the Ad Hoc network.
Step 3, adding all independent auxiliary domination neighbor initial state sum values of the gateway node k and the gateway node k initial state value to obtain an independent initial state collection value x 'of the gateway node k'kThat is, the sum of the initial state values of all the independent subordinate dominating neighbor nodes of the gateway node and the initial state value of the gateway node k.
And 4, constructing a consensus convergence model of the Ad Hoc unidirectional link wireless network, and calculating a consensus convergence result by using the model.
And 5, sharing the network consensus result to all nodes of the network through the communicated domination absorption set to serve as a consistent result of the distributed consensus convergence of the whole network.
And 6, judging: judging the topological structure of the Ad Hoc one-way link wireless network, if the topological structure of the Ad Hoc one-way link wireless network is not changed in the calculation process, finishing the centerless distributed quick consensus of the Ad Hoc one-way link wireless network at this time, and using the consensus convergence consistent result in the application occasions of centerless distributed sensing, detection, judgment, control and the like of the one-way link wireless network to obtain the network global state consensus as the condition and basis of subsequent processing; and if the topological structure of the Ad Hoc one-way link wireless network changes in the calculation process, returning to execute the steps 1-5, and re-performing the centerless distributed rapid consensus calculation of the Ad Hoc one-way link wireless network.
The invention realizes distributed rapid calculation of the Ad Hoc unidirectional link network, and can save network energy consumption, reduce network traffic and prolong the service life of nodes on the premise of obtaining accurate and stable consensus values.
Example 2.
The Ad Hoc unidirectional link network centerless distributed rapid consensus method is the same as embodiment 1, and the independent attached domination neighbor and the independent attached absorption neighbor in step 2 are respectively as follows: if the non-gateway node only has one gateway to control the neighbor, the non-gateway node is divided into an independent attached absorption neighbor of the gateway node, and if the non-gateway node only has one gateway to absorb the neighbor, the non-gateway node is divided into an independent attached control neighbor of the gateway node; if the non-gateway node has a plurality of gateways to govern the neighbor nodes, one gateway node is selected according to the criteria of the proximity or the link state, and the non-gateway node is divided to the selected gateway node to be used as the independent attached absorption neighbor of the selected gateway node.
Example 3.
Similar to embodiment 1-2, in the Ad Hoc unidirectional link network centerless distributed rapid consensus method in step 3, the independent initial state collected value x 'of the gateway node k is obtained'kUsing, in particular, the state variable xiThe initial state value of the network node i is represented, and for a gateway node k being 1, the node numbers of a connected dominance absorption set V |, | V' |, and an independent dependent dominance neighbor of the gateway node k is represented as Fk，|FkI represents the number of independent dependent domination neighbors of the gateway node k; each gateway node k performs the calculation:
x 'in the formula'kThe independent initial state collection value representing the gateway node k is the initial state and value of all independent dependent domination neighbors of the gateway node k
Figure GDA0002234537200000072
And the initial state value x of the gateway node kkThe summed sum value.
The invention realizes the collection and the summarization of the initial state values of the network nodes by communicating the gateway nodes in the domination absorption set by the network subset, avoids the complicated network communication association and the redundant information interaction among the nodes during the calculation of the whole network, and divides the non-gateway nodes outside the domination absorption set into the independent attached neighbor nodes of the gateway nodes without repetition by using the domination absorption set as the backbone channel of the information interaction, thereby realizing the full coverage and non-repeated collection of the information of the whole network node.
Example 4.
The Ad Hoc unidirectional link network centerless distributed rapid consensus method is the same as embodiments 1-3, and the step 4 of constructing the consensus convergence model of the Ad Hoc unidirectional link network specifically performs calculation in the connected dominance absorption set:
Figure GDA0002234537200000081
in the formula x*Representing the result of the convergence of the Ad Hoc unidirectional link wireless network consensus.
The invention realizes the full-coverage and non-repeated collection of the node information of the whole unidirectional link network by using the gateway node. The network nodes that govern the coverage of independent initial state collection values collected by different gateway nodes within an absorption set are non-overlapping. All gateway nodes collect and sum initial state values of non-overlapping and completely-covered independent partition area nodes of the network nodes, then the gateway nodes share information in the domination absorption set, and all gateway nodes in the domination absorption set realize full-coverage summation values of the initial state values of all network nodes
Figure GDA0002234537200000082
Then sum up the network nodes
Figure GDA0002234537200000083
In contrast, the method realizes the average of the initial state values of the whole network range, namely the result x of the convergence of the wireless network consensus of the unidirectional link*. By utilizing independent attached neighbor division of the gateway nodes, the result of the consensus convergence of the whole network can be accurately obtained through one round of information collection and information sharing interactive calculation among the gateway nodes. The method avoids the participation of the nodes of the whole network in the collection calculation, which complicates the whole calculation and information interaction and wastes node resources and wireless channel resources, and avoids the influence of information repetition and redundancy on the consensus convergence speed and precision when the nodes of the whole network participate in the collection calculation. The method is executed in a completely distributed and centerless unidirectional link wireless network environment, the algorithm is flexibly implemented, and the network is divided into sectionsWhen the point fails, the continuous operation of the calculation process is not influenced, and the survivability is strong. In addition, the algorithm has small calculated amount and information interaction amount, good timeliness, high convergence speed and high calculation precision.
Example 5.
The invention also relates to the application of the Ad Hoc unidirectional link network centerless distributed rapid consensus method, which is the same as the embodiment 1-4, and is used for the application occasions of the centerless distributed sensing, detection, judgment and control of the unidirectional link network according to the centerless distributed rapid consensus method of the Ad Hoc unidirectional link network to obtain the network global state consensus as the condition and basis of the subsequent processing.
In the application of the centreless distributed sensing, detection, judgment and control of the unidirectional link network, the information collection and consensus calculation are quickly realized by utilizing the connected domination absorption set backbone sub-network, and the distributed sensing, detection, judgment and control of the system are carried out.
Example 6.
The Ad Hoc unidirectional link network centerless distributed rapid consensus method and the application are the same as the embodiments 1-5, and in the unidirectional link network centerless distributed spectrum sensing application, each node takes the received signal energy detection value as an initial state value, and judges whether the authorized user exists in the current wireless environment by comparing the result of the convergence of the total network consensus with a preset threshold value.
In the application of the one-way link network centerless distributed control, the result of the consensus convergence of the whole network is used as the condition and basis of the distributed control, and whether an authorized user exists in the current wireless environment is judged according to the result of the consensus convergence. And the control network node occupies the idle wireless environment for communication, and does not interfere the normal wireless environment communication use of the authorized master user if the existence of the authorized master user is detected.
Example 7.
The Ad Hoc unidirectional link network centerless distributed fast consensus method and the use are the same as embodiments 1-6, in unidirectional link network centerless distributed detection, decision, control application, the result of convergence of the network consensus is used to realize the detection, decision, control of the variables or parameters of the distributed monitoring, detection or control system, wherein the value to be measured of the monitoring, detection or control system is used as the initial value, the decision value of the monitoring, detection or control system is used as the preset threshold, and the distributed monitoring, detection or control is performed.
In the application of the centreless distributed control of the unidirectional link network, the result of the consensus convergence of the whole network is used as the condition and basis of the distributed control, such as the average intensity of a certain signal, the average temperature and humidity of soil in a certain area, the comprehensive quality condition of air in a certain range, the comprehensive pollution data of water quality in a certain section and the like.
A full and enabling example is set forth below to further illustrate the present invention
Example 8.
The Ad Hoc unidirectional link network centerless distributed rapid consensus method of the present invention is the same as embodiments 1 to 7, and the present invention is an Ad Hoc unidirectional link network centerless distributed consensus method, referring to fig. 1, including the following steps:
step 1 is provided with a centerless Ad Hoc one-way link wireless network, a connected domination absorption set V 'of the Ad Hoc network is determined, nodes in the set V' are gateway nodes, and it is assumed that a network topology structure is not changed in the calculation process.
Generally, an Ad Hoc unidirectional link wireless network uses a directed graphA description is given, where V is a finite set of nodes,
Figure GDA0002234537200000092
is a set of directed edges. If a unidirectional link exists
Figure GDA0002234537200000093
(or
Figure GDA0002234537200000094
Then node V in V is referred to as the dominant neighbor (or absorbing neighbor) of another node u. If a connected node subset, each node in the network that is not in the subset has at least one dominating neighbor and one absorbing neighbor in the subset, then the subset is a connected dominating absorbing set V ', and the nodes in the subset V' are called gateway nodes. The network model of the method is a strong communication centerless Ad Hoc one-way link wireless network, wherein the strong communication means that a path (single hop or multi-hop) exists between any two nodes in the network to realize communication, in addition, the network model of the method is not completely communicated, the complete communication means that any two network nodes can directly communicate, and the domination absorption set V' of the completely communicated network is an empty set. The node set V' is a connected subset of the strong connected centerless Ad Hoc one-way link wireless network. This set of nodes V' contains the shortest paths between all the nodes of the network. The communicated domination absorption set V' can construct an information highway of a wireless network, the transmission speed of information is improved, meanwhile, unnecessary network redundant information transmission is reduced, and the network information transmission efficiency is improved.
And 2, dividing non-gateway nodes in the Ad Hoc unidirectional link wireless network into all gateway nodes in a communicated domination absorption set in a non-repeated way, and taking the gateway nodes as independent attached neighbor nodes.
Nodes included in the connected dominating absorption set V' are gateway nodes, and nodes other than the connected dominating absorption set are non-gateway nodes. The non-gateway nodes are divided into the independent attached dominating neighbors and the independent attached absorbing neighbors of the gateway nodes without repetition, so that data collection and information transmission can be facilitated under the condition that network communication is guaranteed, unnecessary information redundancy is avoided, and the follow-up calculation is guaranteed to be concise and effective.
Step 3 using the state variable xiThe initial state value of the network node i is represented, and for a gateway node k being 1, the node numbers of a connected dominance absorption set V |, | V' |, and an independent dependent dominance neighbor of the gateway node k is represented as Fk，|FkI represents the number of independent dependent domination neighbors of the gateway node k; each gateway node k performs the calculation:
x 'in the formula'kRepresenting the sum of the initial state values of the gateway node k and its independent affiliations governing the neighbor nodes.
The gateway node collects the state information of the independent and attached dominating neighbor nodes and the state information of the gateway node, and does not collect the information of other gateway neighbor nodes in the dominating absorption set, so that information redundancy can be avoided, and conditions are created for quick consensus of the algorithm.
Step 4 performs the calculation within the connected dominant absorption set:
in the formula x*Representing the result of the convergence of the Ad Hoc unidirectional link wireless network consensus.
Each gateway node collects the state information and the value x 'respectively'kInformation sharing is carried out only in the connected domination absorption set, information transmission efficiency is greatly improved, information redundancy is avoided, meanwhile, comprehensive and complete network information is guaranteed, and reliability and high efficiency of an algorithm are guaranteed. Information sharing in the connected domination absorption sets can be carried out firstly, then distributed consensus calculation is carried out, and accuracy and consistency of results can be guaranteed as long as data are not repeatedly calculated.
And 5, sharing the network consensus result to all nodes of the network through the communicated domination absorption set to serve as a consistent result of the distributed consensus convergence of the whole network.
The consistent result obtained by the rapid calculation of the dominating absorption set is a result of consistent consensus of the whole network information, and can be finally shared with other nodes of the network, so that the energy consumption of other nodes of the network and the frequency band resource waste caused by information interaction are avoided.
Step 6 is the same as above and is not described in detail.
The technical idea of the invention is as follows: firstly, determining a connected domination absorption set according to a topological structure of a strongly-connected centerless Ad Hoc one-way link wireless network. A connected dominating absorbing set is a connected subset of the network, each node in the network that is not in the subset having at least one dominating neighbor and one absorbing neighbor in the subset. The state information of the network nodes is collected in a non-overlapping mode through the gateway nodes, and then information sharing is carried out inside the communicated domination absorption sets, so that all node information of the network can be indirectly obtained by each gateway node, on one hand, all nodes of the network are prevented from participating in operation, on the other hand, the network information amount is reduced, and frequency spectrum resources are saved. After the gateway node obtains the complete state information, a stable consistent consensus result can be obtained through one round of calculation, and the problems that the convergence speed of the conventional algorithm is low, the convergence result is unstable and inaccurate, the number of iteration steps required by convergence cannot be accurately estimated and the like are solved. The invention can save energy consumption, prolong the life cycle of the node, improve the network computing efficiency and reduce the network delay.
In order to make the objects, technical solutions and advantages of the present invention clearer, the present invention is described in detail below with reference to the accompanying drawings.
Example 9.
The Ad Hoc unidirectional link network centerless distributed rapid consensus method and the use are the same as those of embodiments 1 to 8, and the Ad Hoc unidirectional link network is applied to the field of cognitive radio, and the cognitive radio distributed centerless consensus method is divided into two stages at this time. In the first stage, each node of the Ad Hoc unidirectional link network carries out data acquisition on authorization signals in the environment when detection starts, and the acquired data of a network node i is represented as YiIs a reaction of YiAssigning a state variable x as an initial state value of a network node ii＝Yi. And in the second stage, the network nodes perform a distributed consensus algorithm to obtain a network consistent consensus value x. And then sharing the consensus value x to the nodes of the whole network, and comparing the consensus value x with a preset judgment threshold by each node of the network to perform effective cognitive judgment on the authorization signal. For the Ad Hoc unidirectional link network, as long as the distributed algorithm design is supported, the Ad Hoc unidirectional link network capable of obtaining the connected domination absorption set is applicable.
Referring to fig. 1, the invention is a centerless distributed consensus method based on an Ad Hoc unidirectional link network, which comprises the following implementation steps:
step 1 is provided with a centerless Ad Hoc one-way link wireless network, a connected domination absorption set V 'of the Ad Hoc network is determined, nodes in the set V' are gateway nodes, and it is assumed that a network topology structure is not changed in the calculation process.
The network model of the invention is a strong communication centerless Ad Hoc one-way link wireless network, wherein the strong communication means that a path (single hop or multi-hop) exists between any two nodes in the network for communication, in addition, the network model of the method is not completely communicated, the complete communication means that any two network nodes can directly communicate, and the domination absorption set V' of the completely communicated network is an empty set. The invention establishes an information highway of a wireless network for collecting, transmitting and calculating data information by utilizing the connected domination absorption set sub-networks, can improve the transmission speed of the information, simultaneously reduces unnecessary network redundant information transmission and improves the network information transmission efficiency.
And 2, dividing non-gateway nodes in the Ad Hoc unidirectional link wireless network into all gateway nodes in a communicated domination absorption set in a non-repeated way, and taking the gateway nodes as independent attached neighbor nodes.
By dividing the non-gateway nodes into the independent attached dominating neighbors and the independent attached absorbing neighbors of the gateway nodes without repetition, unnecessary information redundancy can be avoided under the condition of network communication, and meanwhile, a foundation is laid for calculation of subsequent steps. Therefore, the network can quickly and accurately achieve a stable convergence result through one round of calculation.
Step 3 using the state variable xiThe initial state value of the network node i is represented, and for a gateway node k being 1, the node numbers of a connected dominance absorption set V |, | V' |, and an independent dependent dominance neighbor of the gateway node k is represented as Fk，|FkI represents the number of independent dependent domination neighbors of the gateway node k; each gateway node k performs the calculation:
x 'in the formula'kRepresenting the sum of the initial state values of the gateway node k and its independent affiliations governing the neighbor nodes.
The gateway node collects the state information of the independent and attached domination neighbors and the state information of the gateway node, and the information of the gateway neighbor nodes in the domination set is not collected, so that the current condition can be reasonably utilized, information redundancy is avoided, and later calculation is ready for information collection.
Step 4 performs the calculation within the connected dominant absorption set:
Figure GDA0002234537200000132
and x in the formula represents the result of the consensus convergence of the Ad Hoc unidirectional link wireless network.
The information is transmitted and collected by using the communicated domination absorption sets, so that the information transmission efficiency is improved, the information redundancy is avoided, the information integrity is ensured, and the algorithm is reliable and efficient. According to the method, only one round of calculation is carried out, and the final consistent consensus result x can be obtained by using the complete information of the whole network for dominating the nodes in the absorption set.
And 5, sharing the network consensus result to all nodes of the network through the communicated domination absorption set to serve as a consistent result of the distributed consensus convergence of the whole network.
And the consistent result x obtained by fast calculation of the domination absorption set is a consistent and commonly-identified result of the full network information, and is finally shared to other nodes x of the network, so that the energy consumption of other nodes of the network and the frequency band resource waste caused by information interaction are avoided. The consensus value x can be compared with a preset decision threshold at the dominating absorption set network node, the cognitive decision of the authorization signal is realized, the final cognitive decision result is shared by other nodes of the network, and the calculation amount of the network node is further saved.
Step 6 is not described in detail above.
The core of the invention is based on the Ad Hoc unidirectional link network centerless distributed consensus method, and the centerless distributed consensus calculation is realized by utilizing the communicated domination absorption set. On the premise of obtaining accurate and stable consistent consensus results through rapid calculation, network energy consumption can be saved, network traffic can be reduced, and the service life of nodes can be prolonged.
The following is a detailed description with reference to engineering implementation.
Example 10.
The Ad Hoc unidirectional link network centerless distributed rapid consensus method and the use are the same as embodiments 1-9, and the implementation steps include:
step 1 is provided with a centerless Ad Hoc one-way link wireless network, a connected domination absorption set V 'of the Ad Hoc network is determined, nodes in the set V' are gateway nodes, and it is assumed that a network topology structure is not changed in the calculation process.
Undirected graph for wireless network with Ad Hoc unidirectional linkA representation, where V represents a set of nodes,representing a set of directed edges. If a unidirectional link exists
Figure GDA0002234537200000143
(or
Figure GDA0002234537200000144
Then node V in V is referred to as the dominant neighbor (or absorbing neighbor) of another node u. For nodes u, Nd(u)(Na(u)) represents a dominant (absorbing) neighbor set. Neighbor set N (u) is the combination of the respective dominating neighbor and absorbing neighbor sets, i.e. N (u) ═ Na(u)∪Nd(u), where the set of neighbor nodes N (u) for node u is an open set (excluding the node itself). If u is a dominant, absorbing, or dominant absorbing neighbor of node v, then node u is said to be a neighbor of node v. There are various methods for determining connected dominating absorption sets, such as distance vector-based methods, link state-based methodsAnd the like, and the connected dominant absorption set is obtained finally without any particular requirement. And determining a connected dominance absorption set V', and referring to the nodes in the connected dominance absorption set as gateway nodes.
And 2, dividing non-gateway nodes in the Ad Hoc unidirectional link wireless network into all gateway nodes in a communicated domination absorption set in a non-repeated way, and taking the gateway nodes as independent attached neighbor nodes.
Step 3 using the state variable xiThe initial state value of the network node i is represented, and for a gateway node k being 1, the node numbers of a connected dominance absorption set V |, | V' |, and an independent dependent dominance neighbor of the gateway node k is represented as Fk，|FkI represents the number of independent dependent domination neighbors of the gateway node k; each gateway node k performs the calculation:
x 'in the formula'kRepresenting the sum of the initial state values of the gateway node k and its independent affiliations governing the neighbor nodes.
For node i, if it is not a gateway node, i.e. if it is a gateway node
Figure GDA0002234537200000146
If the domination (absorption) neighbor node of the node i is concentrated with only one gateway node, the node i is divided into the gateway nodes to be independent attached absorption (domination) neighbors of the gateway nodes; if the dominating (absorbing) neighbor node of the node i is concentrated with a plurality of gateway nodes, one gateway node is selected according to the criteria of distance, proximity or link state and the like, and the node i is divided into the gateway node to be used as the independent attached absorbing (dominating) neighbor of the gateway node. After the network is divided by the independent attached neighbor nodes, the independent attached neighbor node of any gateway node is a non-gateway node, and the independent attached dominating (absorbing) neighbor of any non-gateway node only contains one node and is a gateway node.
Step 4 performs the calculation within the connected dominant absorption set:
in the formula x*Representing the result of the convergence of the Ad Hoc unidirectional link wireless network consensus.
After the Ad Hoc network is divided by independent attached neighbors, each gateway node and the independent attached neighbor node are spliced together to form a whole network node set without repetition; similarly, each gateway node and the independent attached absorption neighbor node thereof are pieced together and just form the whole network node set without repetition, wherein each gateway node can manage the information of the non-gateway node in the network through the independent attached absorption neighbor node; and sharing the consensus convergence result to the non-gateway node in the network through the independent attached absorption neighbor node. Thus, the final result is obtained through one round of calculation
Figure GDA0002234537200000152
Wherein | V | represents the number of nodes in the Ad Hoc wireless network, x*In fact, it is the average of the initial state values of the entire network node. Each gateway node calculates x 'in step 3'kAt the same time, the number | F of the independent auxiliary control neighbor nodes is recordedkL and passed to other gateway nodes in the dominating absorption set, x 'being readily known'kTo this end | FkAnd | +1 node initial state information. x is the number of*By summing the sum of all gateway nodes
Figure GDA0002234537200000153
Then divided by the number of all nodes in the network
Figure GDA0002234537200000154
And (6) calculating. The method is a fully-distributed scalable execution method, the range of the participating computing nodes can also be preset, a public data processing center is not required for processing, a strong fault-tolerant mechanism is provided, and the calculation efficiency is improved by fully utilizing the connected domination absorption set containing the network topology structure information.
Step 5 and step 6 are the same as above and are not described in detail.
The technical effects of the present invention will be explained by the results of simulation experiments.
Example 11.
The Ad Hoc unidirectional link network centerless distributed rapid consensus method and the use are the same as those of embodiments 1 to 10, and the detailed contents and technical effects are as follows:
simulation conditions are as follows:
the conditions of the simulation experiment were as follows: in a rectangular plane area with the normalized width of 1, 10 network nodes are randomly distributed, the maximum normalized communication distance r of the nodes is 0.6, communication links among the nodes are unidirectional links under the influence of factors such as information collision, and the whole network formed by the 10 nodes is assumed to be strongly connected. The node adopts an energy detection method to carry out data acquisition on the environmental signal, setting TW as the time-bandwidth product of observation time and the frequency band bandwidth of the perception authorization signal, and using H0And H1Two assumptions are made to represent the absence and presence of an authorization signal, respectively. For network node i, the signal passes through a band-pass filter with bandwidth W, the pass band is located in the detected frequency range region, the filter is followed by an integrator with time length T, and the output of the integrator is represented as YiAt this time, the node i state variable xi＝YiEach node of the network performs this data measurement process. Y when the SNR is gamma under the non-fading channel conditioniWhen authorized users and unauthorized users exist, respectively obeying central card side distribution and non-central card side distribution:
Figure GDA0002234537200000161
in the formulaIs a central chi-square distribution with a degree of freedom of 2TW,
Figure GDA0002234537200000163
is a non-centric chi-square distribution with a degree of freedom of 2TW and an eccentricity parameter of 2 γ. Under Rayleigh fading channel conditions, if the average signal-to-noise ratio is
Figure GDA0002234537200000164
When, YiThe following distributions are obeyed for authorized users and unauthorized users, respectively:
Figure GDA0002234537200000165
in the formula
Figure GDA0002234537200000166
Is a central chi-square distribution with a degree of freedom of 2TW-2, YeCompliance parameter ofIs used as the index distribution of (1). If the preset judgment threshold is lambda, the network node performs cooperative sensing on the authorized user, and judges whether the authorized user exists or not according to the comparison between the cooperative sensing result x and the preset threshold lambda.
Simulation content and simulation result:
simulation 1, namely simulating the network topology structure of the invention to obtain a network topology graph as shown in figure 2, wherein the gateway node in the graph is marked as '■', other non-gateway nodes are marked as '○', the network has 10 nodes, the node marks are marked at corresponding nodes in the graph by numerical serial numbers 1-10, the maximum normalized communication distance r of the nodes is 0.6, the communication links between the nodes are influenced by factors such as information collision, and the like, in the figure 2, the solid line-link indicates that the two nodes are mutually communicated, the long dotted line-link indicates that the large-label node is unidirectionally communicated towards the small-label node, and the short dotted line indicates that the large-label node is unidirectionally communicated towards the small-label node
Figure GDA0002234537200000171
The link indicates that the small-label node is communicated in one direction towards the large-label node. The number of gateway nodes in the graph is 3, the node labels of the gateway nodes are 7, 8 and 10 respectively, and only the gateway nodes carry out distributed cooperative consensus computation and state information collection, so that the method can greatly simplify the node communication connection relation, reduce the network communication burden and the node computation amount, greatly improve the network life cycle and reduce the network life cycleNetwork delay. The result is that the comparison is carried out under the ideal condition, namely, the factors such as network delay and information loss are not considered in practice, and the performance of the invention is superior under the non-ideal condition.
Example 12.
The Ad Hoc unidirectional link network centerless distributed rapid consensus method and the application are the same as the embodiments 1-10, the simulation conditions are the same as the embodiment 11, and the detailed content and the technical effect are as follows:
simulation 2, fig. 3 is the distribution of independent attached neighbor nodes of gateway nodes in the network shown in fig. 2, in fig. 3, the connection relationship between a gateway node and its independent attached neighbor nodes is represented by thin lines, and the connection relationship between connected dominating absorbing centralized gateway nodes is represented by thick lines; the dotted line and the solid line represent the same meaning as in fig. 2. As can be seen from the figure, the independent dependent domination neighbor node of the gateway node 7 is {5, 6} these 2 non-gateway nodes; the independent attached absorption neighbor nodes of the gateway node 7 are 3 non-gateway nodes of {1, 5, 6 }. The gateway node 8 has independent attached control neighbor nodes which are 2 non-gateway nodes of {1, 2 }; the gateway node 8 is a non-gateway absorbing neighbor node, i.e., there is no independent attached absorbing neighbor node. The independent attached domination neighbor nodes of the gateway node 10 are 3 non-gateway nodes of {3, 4, 9 }; the independent attached absorption neighbor nodes of the gateway node 7 are 4 non-gateway nodes of {2, 3, 4, 9 }. Each gateway node k will collect the independent dependent domination neighbor state information and its own sum value x'kAnd number of nodes | FkAnd l +1 is shared by other gateway nodes, after each gateway node shares information in the domination absorption set, the average consensus result x can be calculated respectively, and the result is shared by the independent attached neighbor nodes, so that the mutual information transmission among all network nodes and the calculation of all network nodes in the original method are avoided, the redundancy of information is avoided, and the network calculation efficiency is greatly improved.
Example 13.
The Ad Hoc unidirectional link network centerless distributed rapid consensus method and the use are the same as embodiments 1-12, and the detailed content and technical effect are as follows:
simulation 3, in the case of the network topologies of fig. 2 and 3, assuming the channel is rayleighBy using fading channel, each network node has the same average signal-to-noise ratio
Figure GDA0002234537200000181
The time-bandwidth product TW is 6. The average consensus of the present invention compared to the prior art is shown in figure 4. Fig. 4 shows that the consensus values of all nodes in the network can be converged to the theoretical average value through one iteration of the method, while the prior algorithm requires at least more than 30 iterations, the consensus results of 10 nodes gradually tend to be consistent, and the convergence result is inconsistent with the theoretical average value, so the convergence result is inaccurate. The communication volume and the node calculation amount used by the method in the case of FIG. 4 are less than 1% of the corresponding quantity value of the original method, and the accuracy is far higher than that of the original method. In addition, the original method cannot predetermine how many times the loop iteration can reach convergence. The method has the advantages of saving communication traffic and calculation amount more obviously under the condition that the network topology is more complex and the number of network nodes is more.
Example 14.
The Ad Hoc unidirectional link network centerless distributed rapid consensus method and the use are the same as embodiments 1-13, and the detailed content and technical effect are as follows:
simulation conditions are as follows:
the conditions of the simulation experiment were as follows: in a rectangular plane area with the normalized width of 1, 20 isomorphic network nodes are randomly distributed, the maximum normalized communication distance r of the nodes is 0.4, communication links among the nodes are unidirectional links under the influence of factors such as information collision, and the whole network formed by the 20 nodes is assumed to be connected. Assuming that the channel is a Rayleigh fading channel, each network node has the same average signal-to-noise ratio
Figure GDA0002234537200000182
The time-bandwidth product TW is 6. Each network node i performs data acquisition on the environmental signal and represents as YiAnd setting an initial state variable x of the node ii＝Yi. The network needs each node to cooperatively calculate the average consensus result of the variables of the whole network node, and the consensus result is expressed as x*CalculatingThe process is carried out in a centerless distributed manner.
Simulation content and simulation result:
simulation 1, namely simulating the network topology structure of the invention to obtain a network topology graph as shown in figure 5, wherein the gateway node in the graph is marked as '■', other non-gateway nodes are marked as '○', the network has 20 nodes, the node marks are marked at corresponding nodes in the graph by numerical serial numbers 1-20, the maximum normalized communication distance r of the nodes is 0.4, the communication links between the nodes are influenced by factors such as information collision and the like, the network is a unidirectional link, in figure 5, a solid line-a link indicates that the two nodes are mutually communicated, a long dotted line-a link indicates that a large-label node is unidirectionally communicated towards a small-label node, and a short dotted line indicates that a short-dotted line is unidirectionally communicated towards a small-label node
Figure GDA0002234537200000192
The link indicates that the small-label node is communicated in one direction towards the large-label node. And in the method, 11 gateway nodes perform cooperative consensus calculation and state information collection, so that the node communication connection relation can be simplified, the network communication burden and the node calculation amount are reduced, the network life cycle is prolonged, and the network delay is reduced. The result is that the comparison is carried out under the ideal condition, namely, the factors such as network delay and information loss are not considered in practice, and the performance of the invention is superior under the non-ideal condition.
Simulation 2, fig. 6 is an independent attached neighbor node assignment for a gateway node in the network shown in fig. 5. In fig. 6, the connection relationship between a gateway node and its independent attached neighbor nodes is represented by thin lines, and the connection relationship between connected dominance absorption concentration gateway nodes is represented by thick lines; the dotted line and the solid line represent the same meaning as in fig. 5. Each gateway node k will collect the independent dependent domination neighbor state information and its own sum value x'kAnd number of nodes | FkThe | +1 is shared by other gateway nodes, after information sharing in the domination absorption set, each gateway node can respectively calculate an average consensus result x and share the result to an independent attached neighbor node, information mutual transmission among all network nodes and calculation of all network nodes in the original method are avoided, information redundancy is avoided, and the network is greatly improvedThe efficiency of the calculation.
Simulation 3, in the case of the network topologies of fig. 5 and 6, assuming rayleigh fading channel, average signal-to-noise ratio
Figure GDA0002234537200000191
The time-bandwidth product TW is 6. Comparison of the present invention with the average consensus of the prior art yields figure 7. Fig. 7 shows that the consensus values of all nodes in the network can be converged to the theoretical average value through one iteration of the method, while the original algorithm still cannot be converged to the stable value after 50 iterations, and the convergence value is inconsistent with the theoretical average value, so that an error exists. The method of the invention has the advantages of extremely high convergence speed, higher precision than the original method, strong network survivability, and recalculation as long as the connected domination absorption set is determined again if the network topology is changed. The method has the advantages of saving communication traffic and calculation amount more obviously under the condition that the network topology is more complex and the number of network nodes is more.
Example 15.
The Ad Hoc unidirectional link network centerless distributed rapid consensus method and the use are the same as embodiments 1-14, and the use method of the invention in specific engineering application is further explained by the embodiments.
When the distributed cooperative sensing is applied, the distributed spectrum sensing problem in the cognitive radio technology is solved by adopting the method, and the problems related to the specific implementation process in engineering application are explained in the aspects of a network node data acquisition and processing model and network node processing.
A network node data acquisition and processing model:
in the initial stage, after time synchronization, each node in the Ad Hoc network has a center frequency f0And in the frequency band region with the bandwidth W, performing energy detection with the time-bandwidth product TW on the received radio signal x (T), wherein the energy detection output value is Y, as shown in fig. 8, the energy detection process includes band-pass filtering with the bandwidth W, then performing a squaring operation, and finally performing an integration operation with the time length T. For networkNode i with energy detection output denoted as Yi. After each network node obtains an energy detection value, the energy detection value is used as an initial state variable x of each network nodei＝YiThen, distributed consensus processing was performed in the same manner as in examples 1 to 14 to obtain a consensus result x*. It is assumed that in the case of a continuous time signal t, an authorized user transmits a signal s (t), where s (t) is a real signal or a complex signal. After channel transmission, at time t, the signal h · s (t) and additive noise n (t) received by each node k of the network are obtained, where h is the channel gain, and the following received signals are obtained:
H1x (t) h · s (t) n (t), when an authorized user is present
H0A.. when the authorized user is not present, x (t) · n
H is a constant value under non-fading channel conditions, and h is a random number under rayleigh fading channel conditions.
And (3) network node processing:
comparing with embodiments 1-14, it can be known that the network nodes perform cooperative sensing to finally obtain the consensus result x of the whole network*. Each network node utilizes the consensus result x*Instead of the quantity Y in FIG. 8, a decision is made, i.e. x is*The value of (A) is compared with a preset threshold value lambda to judge whether the authorized user exists or not.
By the embodiment 15 and the embodiments 1 to 14, how to implement the Ad Hoc unidirectional link network centerless distributed rapid consensus method in specific cognitive radio applications can be grasped; the node data acquisition and processing model is constructed in the embodiment 15, and the distributed rapid consensus method is carried out in real time by using the methods in the embodiments 1 to 14, so that the rapid centerless average consensus of the whole network is realized, and the spectrum sensing judgment of the authorized user is further realized.
The distributed consensus computation and the information collection and sharing are executed by utilizing the connected domination absorption set sub-networks, the rapid distributed consensus computation is realized by utilizing the collected data collected by the whole network, and the stable and accurate convergence result can be rapidly achieved on the basis of one iteration. The invention can greatly improve the convergence speed and the convergence precision of the original algorithm, and avoid unnecessary network communication traffic and node calculation amount caused by the prior full-network node communication and calculation, thereby saving the node energy consumption, reducing the communication traffic and the node calculation amount, prolonging the service life of the network, effectively reducing the network delay and having good real-time performance; the invention is a distributed algorithm implemented on the basis of a centerless Ad Hoc one-way link network, thus having strong survivability; the method is a scalable distributed method, and can be implemented within a certain range of a preset network as long as conditions are met.

Claims (4)

1. A method for realizing decentralized distributed rapid consensus of an Ad Hoc unidirectional link network is characterized in that: the method comprises the following steps:
step 1, determining a dominance absorption set of Ad Hoc one-way link network communication: a centerless Ad Hoc one-way link wireless communication network is arranged, the connection of nodes in the network is directional, a domination absorption set V 'communicated by the Ad Hoc network is determined, nodes in a set V' of the domination absorption set are gateway nodes, nodes outside the domination absorption set are non-gateway nodes, and the assumption is made that the network topology structure is not changed in the calculation process;
step 2, dividing independent attached neighbors of the gateway nodes: dividing non-gateway nodes in the Ad Hoc one-way link wireless network into each gateway node in a communicated domination absorption set in a non-repeated way as an independent attached neighbor node; dividing non-gateway nodes into independent attached dominating neighbors and independent attached absorbing neighbors of the gateway nodes, wherein the independent attached dominating neighbors and the independent attached absorbing neighbors are not repeated by the non-gateway nodes;
step 3, adding all independent auxiliary domination neighbor initial state sum values of the gateway node k and the gateway node k initial state value to obtain an independent initial state collection value x 'of the gateway node k'k(ii) a In particular with the state variable xiThe initial state value of the network node i is represented, and for a gateway node k being 1, the node numbers of a connected dominance absorption set V |, | V' |, and an independent dependent dominance neighbor of the gateway node k is represented as Fk，|FkI represents the number of independent dependent domination neighbors of the gateway node k; each gateway node k performs the calculation:
Figure FDA0002234537190000011
x 'in the formula'kRepresenting an independent initial state collection value, x, for the gateway node kkIs the initial state value of the gateway node k;
step 4, constructing a consensus convergence model of the Ad Hoc unidirectional link wireless network, and calculating a consensus convergence result by using the model; specifically, the construction of the consensus convergence model of the Ad Hoc unidirectional link wireless network is to perform calculation in a connected dominance absorption set:
Figure FDA0002234537190000012
in the formula x*Representing the result of the convergence of the Ad Hoc unidirectional link wireless network consensus;
step 5, sharing the network consensus result to all nodes of the network through a communicated domination absorption set to serve as a consistent result of the distributed consensus convergence of the whole network;
and 6, judging: judging the topological structure of the Ad Hoc one-way link wireless network, if the topological structure of the Ad Hoc one-way link wireless network is not changed in the calculation process, finishing the centerless distributed quick consensus of the Ad Hoc one-way link wireless network at this time, and using the consensus convergence consistent result for the centerless distributed sensing, detecting, judging and controlling application occasions of the Ad Hoc one-way link wireless network to obtain the global state consensus of the network as the condition and basis of the subsequent processing; and if the topological structure of the Ad Hoc one-way link wireless network changes in the calculation process, returning to execute the steps 1-5, and re-performing the centerless distributed rapid consensus calculation of the Ad Hoc one-way link wireless network.
2. The Ad Hoc unidirectional link network centerless distributed fast consensus method of claim 1, characterized in that: the independent attached dominating neighbor and the independent attached absorbing neighbor in the step 2 are respectively: if the non-gateway node only has one gateway to control the neighbor, the non-gateway node is divided into an independent attached absorption neighbor of the gateway node, and if the non-gateway node only has one gateway to absorb the neighbor, the non-gateway node is divided into an independent attached control neighbor of the gateway node; if the non-gateway node has a plurality of gateways to govern the neighbor nodes, one gateway node is selected according to the criteria of the proximity or the link state, and the non-gateway node is divided to the selected gateway node to be used as the independent attached absorption neighbor of the selected gateway node.
3. The Ad Hoc unidirectional link network centerless distributed fast consensus method of claim 1, characterized in that: in the application of the centerless distributed spectrum sensing of the unidirectional link network, each node takes a received signal energy detection value as an initial state value, and judges whether an authorized user exists in the current wireless environment by comparing a result of the consensus convergence consistency of the whole network with a preset threshold value.
4. The Ad Hoc unidirectional link network centerless distributed fast consensus method of claim 1, characterized in that: in the application of the centreless distributed detection, judgment and control of the unidirectional link network, the variable or parameter of the distributed monitoring, detection or control system is detected, judged and controlled by using the result of the consensus convergence of the whole network, wherein the value to be measured of the monitoring, detection or control system is used as an initial value, and the judgment value of the monitoring, detection or control system is used as a preset threshold to carry out the distributed monitoring, detection or control.
CN201710211692.8A 2017-04-01 2017-04-01 Ad Hoc unidirectional link network centerless distributed rapid consensus method Expired - Fee Related CN107071846B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201710211692.8A CN107071846B (en) 2017-04-01 2017-04-01 Ad Hoc unidirectional link network centerless distributed rapid consensus method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201710211692.8A CN107071846B (en) 2017-04-01 2017-04-01 Ad Hoc unidirectional link network centerless distributed rapid consensus method

Publications (2)

Publication Number Publication Date
CN107071846A CN107071846A (en) 2017-08-18
CN107071846B true CN107071846B (en) 2020-01-21

Family

ID=59601483

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201710211692.8A Expired - Fee Related CN107071846B (en) 2017-04-01 2017-04-01 Ad Hoc unidirectional link network centerless distributed rapid consensus method

Country Status (1)

Country Link
CN (1) CN107071846B (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111325254B (en) * 2020-02-12 2022-06-28 支付宝(杭州)信息技术有限公司 Method and device for constructing conditional relational network and processing conditional service

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102546059A (en) * 2012-01-04 2012-07-04 中国人民解放军理工大学 Non-supervision clustering-based distributed cooperative spectrum sensing method for cognitive self-organizing network
CN104301971A (en) * 2014-10-13 2015-01-21 东南大学 Energy-saving node election method applicable to mobile ad hoc network

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9325510B2 (en) * 2009-07-13 2016-04-26 Lg Electronics Inc. Method and device for controlling Ad-Hoc network in CPNS enabler

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102546059A (en) * 2012-01-04 2012-07-04 中国人民解放军理工大学 Non-supervision clustering-based distributed cooperative spectrum sensing method for cognitive self-organizing network
CN104301971A (en) * 2014-10-13 2015-01-21 东南大学 Energy-saving node election method applicable to mobile ad hoc network

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
无线传感器网络覆盖控制及路由协议研究;陈存香;《中国优秀博士论文数据库》;20150415;全文 *

Also Published As

Publication number Publication date
CN107071846A (en) 2017-08-18

Similar Documents

Publication Publication Date Title
Torkestani et al. A link stability-based multicast routing protocol for wireless mobile ad hoc networks
Song et al. Link stability estimation based on link connectivity changes in mobile ad-hoc networks
Teng et al. Adaptive transmission power control for reliable data forwarding in sensor based networks
CN105871717A (en) Unmanned aerial vehicle ad hoc network routing method based on link stability
CN109699033B (en) LoRa power Internet of things base station deployment method and device for cost and load balancing
Turcanu et al. Pick the right guy: CQI-based LTE forwarder selection in VANETs
Sengul et al. A survey of adaptive services to cope with dynamics in wireless self-organizing networks
Mu et al. Performance analysis of the ZigBee networks in 5G environment and the nearest access routing for improvement
Paillassa et al. Network awareness and dynamic routing: The ad hoc network case
CN106998571B (en) Ad Hoc peer-to-peer network centerless distributed rapid consensus method
CN107071846B (en) Ad Hoc unidirectional link network centerless distributed rapid consensus method
Feng et al. Cost effective routing in large-scale multi-hop LoRa networks
Santos et al. CGR: Centrality-based green routing for Low-power and Lossy Networks
Mann et al. Energy-aware routing protocol for ad hoc wireless sensor networks
Tamg et al. A radio-link stability-based routing protocol for mobile ad hoc networks
Tao et al. DUPE: Duplicated unicast packet encapsulation in position-based routing VANET
Ma et al. Localized low-power topology control algorithms in IEEE 802.15. 4-based sensor networks
Abedi et al. Distributed routing for vehicular ad hoc networks: Throughput-delay tradeoff
Zhao et al. Available bandwidth estimation and prediction in ad hoc networks
Hsieh Data aggregation model using energy-efficient delay scheduling in multi-hop hierarchical wireless sensor networks
He et al. Density adaptive urban data collection in vehicular sensor networks
Kalaivani et al. Link survivability rate-based clustering for QoS maximisation in VANET
Anand et al. Comparison of routing protocols in wireless sensor networks: a detailed survey
CN114531701B (en) Cooperative optimization method for heterogeneous network in extra-high voltage direct current control protection system
Bohari et al. Energy efficient power aware routing algorithm (EEPARA) for mobile ad hoc network (MANET)

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
CB03 Change of inventor or designer information

Inventor after: Huang Qingdong

Inventor after: Zhou Bin

Inventor after: Yao Xueqian

Inventor after: Cao Lixia

Inventor after: Guo Huan

Inventor after: Pang Shengli

Inventor after: Bao Zhiqiang

Inventor after: Wang Junxuan

Inventor before: Huang Qingdong

Inventor before: Cao Lixia

Inventor before: Guo Huan

Inventor before: Pang Shengli

Inventor before: Bao Zhiqiang

Inventor before: Wang Junxuan

CB03 Change of inventor or designer information
GR01 Patent grant
GR01 Patent grant
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20200121

CF01 Termination of patent right due to non-payment of annual fee