# An integrated diversity and fusion framework for binary consensus over fading channels

- Mehrzad Malmirchegini
^{1}Email author and - Yasamin Mostofi
^{1}

**2013**:144

https://doi.org/10.1186/1687-6180-2013-144

© Malmirchegini and Mostofi; licensee Springer. 2013

**Received: **22 April 2012

**Accepted: **19 June 2013

**Published: **4 September 2013

## Abstract

In this paper, we consider a cooperative network that is trying to reach consensus on the occurrence of an event by communicating over not fully connected and time-invariant network topologies with fading channels. We first discuss the fusion and diversity decision-making strategies over time-invariant network topologies and shed light on the underlying trade-offs. We then propose an integrated diversity and fusion framework. Our approach properly takes advantage of both fusion to enable information flow and diversity to increase robustness to link errors. We mathematically analyze the proposed framework and show how the network achieves accurate consensus asymptotically. To show an example, we then utilize the proposed framework over regular ring lattice networks. Our theoretical and simulation results indicate that the proposed technique improves the consensus performance considerably.

## Keywords

## 1 Introduction

Cooperative decision-making over sensor networks has gotten considerable interest in recent years. These networks have a variety of applications such as environmental monitoring, target tracking, and surveillance. Consider the scenario where a network of nodes, distributed in a harsh environment, aims to cooperatively accomplish a task. Each node has limited local capabilities and can therefore only accomplish the task in a cooperative manner. In this paper, we are interested in group agreement problem, where a group of agents need to reach consensus on the value of a parameter of interest. The consensus problems can be categorized into two main groups: *estimation consensus* and *detection consensus*. Estimation consensus refers to problems in which each agent has an estimate of the parameter of interest, where the parameter of interest can take values over an infinite set or an unknown finite set. For instance, it may be of interest that all the mobile agents that started in different directions reach an agreement on their asymptotic headings in a cooperative multi-agent network [1]. Recently, there has been considerable interest in estimation consensus problems from the signal processing and communication community, with more emphasis on link uncertainties [2–4].

Detection consensus, on the other hand, refers to problems in which the parameter of interest takes values from a finite known set. Then the update protocol, which each agent will utilize, becomes nonlinear. By *binary consensus*[5], we refer to a subset of detection consensus problems where the network is trying to reach consensus over a binary parameter. For instance, in a cooperative fire detection scenario, each node has an initial opinion as to if there is a fire or not. However, as a network, they may act based only on the majority vote. Therefore, the goal of the network is for each node to reach consensus over the majority of initial votes. Another application of binary consensus is in cooperative spectrum sensing in cognitive radio networks. In this scenario, the secondary users communicate with each other in order to reach consensus on busy or idle status of the primary user, which is a binary value [6].

### 1.1 Related work and our contribution

While there exists a rich literature on estimation consensus, detection consensus problems only recently started to receive attention. In [7], the authors consider convergence in a detection consensus setup over perfect channels with repeated sensing and known probabilistic sensing models. In [8], the authors consider a distributed hypothesis testing problem over perfect communication channels to which they refer to as belief consensus. They consider the case where each node transmits its belief (conditional probability) to other nodes. As a result, their problem immediately takes the form of the traditional average estimation consensus for which a rich literature exists.

In [5, 9], the binary consensus scenario is considered. In this scenario, each node in the network has an opinion regarding the occurrence of an event. The nodes will then communicate over the network topology. The goal for every node is to reach the majority of the initial votes without any prior knowledge on the sensing qualities. Authors in [9] characterized phase transition of such a binary consensus problem in the presence of a uniformly distributed communication noise. In most applications, however, the agents will communicate their values wirelessly and will experience Gaussian receiver noise as opposed to a uniformly distributed noise. In [5], we considered reaching binary consensus over regular network topologies (all nodes have the same number of neighbors) with additive white Gaussian noise channels. We characterized the transient behavior of the network probabilistically. We showed that in the presence of noise, the network state is asymptotically *memoryless*, i.e., independent of the initial state. This is undesirable since the group agreement is not related to the initial state of the system and is merely a function of channel errors.

In [10], we studied the binary consensus over a fully connected network topology with fading channels. We proposed a novel consensus-seeking protocol that utilizes information of link qualities. We showed that by incorporating the information of link qualities, the network will be in consensus with a higher probability but still holds the undesirable asymptotic behavior. In [11], we considered binary consensus over rapidly changing network topologies with fading channels. We mathematically characterized the impact of fading, noise, network connectivity and time-varying topology on consensus performance.

In this paper, we consider the binary consensus problem over the general time-invariant network topologies (not necessarily fully connected) with fading channels. We study two decision-making strategies that differ in terms of using the available transmissions: fusion and diversity. In the first strategy, the given resources are used to increase the flow of information in the network, whereas the second strategy aims to increase robustness to link error by channel coding [11]. We characterize the underlying trade-offs between these two strategies for binary consensus over a *not fully connected* and *time-invariant* network topology. In particular, we show that fusion-based scheme results in an asymptotic memoryless behavior, which is not desirable. Furthermore, diversity-based scheme only outperforms fusion-based scheme, when the main bottleneck is link quality and the network has a good connectivity. The *main contribution* of this paper is to propose a framework that keeps the benefits of both fusion and diversity strategies, in terms of the network information flow and link error robustness, for binary consensus over time-invariant network topologies with fading channels. We mathematically analyze the proposed framework and show that it achieves accurate consensus asymptotically. The proposed framework solves the undesirable memoryless behavior of the network consensus and results in a drastic performance improvement.

## 2 Binary consensus problem over time-invariant topologies with ideal communication links

In this section, we introduce the binary consensus problem over not fully connected and time-invariant network topologies. Furthermore, we assume ideal communication links. Studying this case allows us to focus solely on the impact of information flow in the network and characterize a benchmark for the performance of binary consensus algorithms over non-ideal communication links.

Consider a cooperative network of *M* nodes^{a} that are trying to reach consensus over the occurrence of an event. Each node has its own initial decision, based on its one-time sensing. The goal of the network is for each node to reach a decision that is equal to the majority of the initial votes. For instance, in a cooperative fire detection scenario, each node has an initial opinion as to if there is a fire or not. However, as a network, they may act based only on the majority vote. Therefore, it is desirable that every node reaches the majority of the initial votes without a group leader. As it may happen in realistic scenarios, the nodes may not have any information on their own or the others’ sensing quality. Therefore, the main goal is that each node reaches the majority of the initial votes. Considering sensing quality of the nodes is among possible extensions of this work.

In order to achieve this, each node will transmit its current decision to other nodes.^{b} We model the underlying network as an undirected graph $G(\mathcal{V},\mathcal{E})$, where $\mathcal{V}=\{1,\dots ,M\}$ represents the vertex set and
is the link set (the set of available communication links among the nodes). Each node will then revise its current vote based on the received information. This process will go on for a while. We say that *accurate consensus* is achieved if each agent reaches the majority of the initial votes [5]. For instance, if 70% of the nodes start voting one and they all end up voting one, we have accurate consensus. Let ${\stackrel{~}{b}}_{i}^{0}\in \{0,1\}$ represent the initial vote of the *i* th node, where ${\stackrel{~}{b}}_{i}^{0}=1$ indicates that the *i* th agent initially decides that the event occurred, whereas ${\stackrel{~}{b}}_{i}^{0}=0$ denotes otherwise. Consider the binary consensus problem over ideal communication links. In this scenario, each node receives the votes of its neighbors over the ideal communication links. It then fuses all the received information and updates its vote based on the majority of its neighbors’ votes.

*i*th node’s vote after

*u*fusion steps over ideal communication links. We have,

*i*th node, and the decision-making function for the binary consensus over ideal communication links,

*ϒ*

_{ideal}(.,.), is defined as follows:

*M*= 17 nodes trying to reach consensus over a 6-regular ring lattice.

^{c}In this topology, each node receives information from its neighbors over ideal communication links. As can be seen, all the nodes reach the majority of initial votes at the second level of fusion. Let ${D}^{u}=\{{\stackrel{~}{b}}_{1}^{u},{\stackrel{~}{b}}_{2}^{u},\dots ,{\stackrel{~}{b}}_{M}^{u}\}$ denote the network state after

*u*fusion steps. Define

For instance, for the example of Figure 1, we have *D*
^{0} = {1,0,0,1,0,1,0,1,1,1,0,0,0,1,1,0,1} and *u*
_{
G
}(*D*
^{0}) = 2. We then define ${\mathcal{D}}_{G}\triangleq \left\{{D}^{0}\right|\phantom{\rule{2.77626pt}{0ex}}{u}_{G}\left({D}^{0}\right)<\infty \}$ and ${u}_{G}=\underset{{D}^{0}\in {\mathcal{D}}_{G}}{max}{u}_{G}\left({D}^{0}\right)$. *u*
_{
G
} is only a function of graph connectivity and represents the maximum number of required fusion levels in order to achieve accurate consensus if ${D}^{0}\in {\mathcal{D}}_{G}$. For instance, for the fully connected graph, i.e., each node is connected to all the nodes in the network, we have *u*
_{
G
} = 1. In the next section, we consider the binary consensus problem over non-ideal communication links. We discuss different strategies in terms of information flow and robustness to link error and characterize the underlying trade-offs.

## 3 The underlying trade-offs between information flow and link error robustness

In a realistic scenario, each node transmits its decision to other nodes over non-ideal communication links. The transmissions occur over fading channels and are furthermore corrupted by the receiver noise. Let *r*
_{
j,i
}(*k*) represent the fading coefficient of the link from node *j* to node *i* at time *k*. Similarly, *n*
_{
j,i
}(*k*) denotes the receiver noise at the *k* th time step in the transmission from the *j* th node to the *i* th one. *n*
_{
j,i
}(*k*) is zero-mean Gaussian with the variance of ${\sigma}_{j,i}^{2}$. We take the receiver noise of the receptions of different nodes to be uncorrelated. Let *b*
_{
j,i
}(*k*) represent the reception of the *i* th node from the transmission of the *j* th one at the *k* th time step. We have the following if there exists a link from the *j* th node to the *i* th one:^{d}
*b*
_{
j,i
}(*k*) = *r*
_{
j,i
}(*k*)*b*
_{
j
}(*k*) + *n*
_{
j,i
}(*k*), where *b*
_{
j
}(*k*) denotes the *j* th node’s vote at time *k*. We assume that each receiver can learn the fading coefficient of each of its receptions and utilize it in the decision-making process. Furthermore, we consider the case where the fading coefficients are uncorrelated among different nodes and in different time steps. Each agent will then update its assessment based on the received information. We next discuss fusion and diversity decision-making strategies for binary consensus problem over not fully connected and time-invariant network topologies and characterize the underlying trade-offs.

### 3.1 Fusion case

*i*th node’s neighbors. Then the

*i*th node estimates

*ψ*

_{ i }(

*k*) using the best affine unbiased function of the received information: $\widehat{{\psi}_{i}}\left(k\right)=\sum _{j\in {\mathcal{N}}_{i}}{\alpha}_{j,i}\left(k\right){b}_{j,i}\left(k\right)+{\beta}_{j,i}\left(k\right)$ where

*q*

_{ j }(

*k*) =

**E**[

*b*

_{ j }(

*k*)] (readers are referred to [10] for more information). The

*i*th node will then update its decision as follows:

*i*≤

*M*. The decision-making function for the binary consensus over fading communication links,

*ϒ*

_{fading,M }(.,.), is defined as follows:

It can be seen that Equation 3 assumes that the knowledge of *q*
_{
j
}(*k*) is available at the receiver. If the *i* th node does not have an estimate of *q*
_{
j
}(*k*), it will assume that *q*
_{
j
}(*k*) = 0.5. We refer to this case as basic BAE.

In section III-B of [11], we mathematically analyzed the asymptotic behavior of the basic BAE for binary consensus over fully connected network topology. We showed that the network loses its memory of the initial state asymptotically due to the impact of link errors, which is undesirable. The same analysis can also be extended to the case of not fully connected network topologies. Therefore, the fusion approach for binary consensus over not fully connected and time-invariant network topology and in the presence of noise and fading suffers from asymptotic memoryless behavior. Next, we discuss the diversity-based scheme, which is more robust to the link error.

### 3.2 Diversity case

*K*+ 1 transmissions to reach an agreement. Each node can use all of its transmissions to repeat its initial vote and only fuses the received information afterward. This strategy can, in particular, be useful in reducing the impact of link errors. Let

*Z*

_{ j,i }(

*K*) = [

*b*

_{ j,i }(0),…,

*b*

_{ j,i }(

*K*)]

^{ T }denote the receptions of

*i*th node from the

*j*th node in

*K*+ 1 transmissions. Define

*R*

_{ j,i }(

*K*) = [

*r*

_{ j,i }(0),…,

*r*

_{ j,i }(

*K*)]

^{ T }and

*N*

_{ j,i }(

*K*) = [

*n*

_{ j,i }(0),…,

*n*

_{ j,i }(

*K*)]

^{ T }. For the diversity case, all nodes use their transmissions to repeat their initial votes, i.e., ${b}_{j}\left(k\right)={\stackrel{~}{b}}_{j}^{0}$ for 0 ≤

*k*≤

*K*. Then we have the following, considering all the receptions of the

*i*th node from the

*j*th node: ${Z}_{j,i}\left(K\right)={\stackrel{~}{b}}_{j}^{0}{R}_{j,i}\left(K\right)+{N}_{j,i}\left(K\right)$. The

*i*th node can then estimate ${\stackrel{~}{b}}_{j}^{0}$ by using the best affine unbiased function of the received information: ${\widehat{b}}_{j}^{0}\left(K\right)={\rho}_{j,i}^{T}\left(K\right){Z}_{j,i}\left(K\right)+{\eta}_{j,i}\left(K\right)$. To ensure an unbiased estimator, we should have, $\mathbf{E}\left[{\widehat{b}}_{j}^{0}\left(K\right)\right]=\mathbf{E}\left[{\stackrel{~}{b}}_{j}^{0}\right]\Rightarrow {\eta}_{j,i}\left(K\right)={\stackrel{~}{q}}_{j}^{0}\left(1-{\rho}_{j,i}^{T}\left(K\right){R}_{j,i}\left(K\right)\right)$, where ${\stackrel{~}{q}}_{j}^{0}=\mathbf{E}\left[{\stackrel{~}{b}}_{i}^{0}\right.$. Let ${\zeta}_{j,i}\left(K\right)=\mathbf{E}\left[{\left({\widehat{b}}_{j}^{0}\left(K\right)-{\stackrel{~}{b}}_{j}^{0}\right)}^{2}\right]$ denote the corresponding estimation error variance. We then have the following optimization problem:

*ρ*

_{ j,i }(

*K*), we have

*K*+ 1 transmissions: ${\zeta}_{j,i}\left(K\right)=\frac{{\sigma}_{j,i}^{2}}{\frac{{\sigma}_{j,i}^{2}}{{\stackrel{~}{q}}_{j}^{0}(1-{\stackrel{~}{q}}_{j}^{0})}+\parallel {R}_{j,i}{\left(K\right)\parallel}^{2}}=\frac{1}{\frac{1}{{\stackrel{~}{q}}_{j}^{0}(1-{\stackrel{~}{q}}_{j}^{0})}+\sum _{k=0}^{K}{\text{CNR}}_{j,i}\left(k\right)}$, where ${\text{CNR}}_{j,i}\left(k\right)=\frac{{r}_{j,i}^{2}\left(k\right)}{{\sigma}_{j,i}^{2}}$ denotes the channel-to-noise ratio for the link from node

*j*to node

*i*at time

*k*. We then have the following decision-making function:

where ${b}_{i}\left(k\right)={\stackrel{~}{b}}_{i}^{0}\text{for}0\le k\le K$.

#### Lemma 1

Consider binary consensus over a not fully connected network topology. Under the assumption of i.i.d. Rayleigh fading channels, CNR_{
j,i
}(*k*) are independent and identically distributed (i.i.d.) exponential random variables with $\overline{\text{CNR}}=\mathbf{E}\left\{\right.{\text{CNR}}_{j,i}\left(k\right)\left\}\right.$. Then the dynamical system, based on the decision-making function of 8, will asymptotically reach ${D}^{1}=\{{\stackrel{~}{b}}_{1}^{1},{\stackrel{~}{b}}_{2}^{1},\dots ,{\stackrel{~}{b}}_{M}^{1}\}$, where *D*
^{1} represents the network state after one level of fusion over ideal communication links.

#### Proof

_{ j,i }(

*k*)s are i.i.d. exponential random variables with the mean of $\overline{\text{CNR}}$,

*γ*

_{ j,i }(

*K*) has Gamma distribution with the following parameters: ${\gamma}_{j,i}\left(K\right)\sim \text{Gamma}(K+1,\overline{\text{CNR}})$. As a result, ${\gamma}_{j,i}^{-1}\left(K\right)$ is an inverse Gamma random variable. We then have, $\underset{K\to \infty}{lim}\mathbf{E}\left\{{\gamma}_{j,i}^{-1}\left(K\right)\right\}=\underset{K\to \infty}{lim}\frac{1}{(K+1)\times \overline{\text{CNR}}}=0$. Since ${\gamma}_{j,i}^{-1}\left(K\right)$ is a non-negative random variable, we have

Therefore, lim_{
K→∞
}
*ζ*
_{
j,i
}(*K*) = 0, which results in ${\text{lim}}_{K\to \infty}\text{prob}\left({b}_{i}(K+1)={\stackrel{~}{b}}_{i}^{1}\right)=1$ for 1 ≤ *i* ≤ *M*. □

*M*= 17 nodes that is trying to reach consensus by communicating over a regular ring lattice topology. Figure 2 (left) shows the comparison for a 16-regular ring topology, i.e., fully connected graph, where the transmissions occur over Rayleigh channels with $\overline{\text{CNR}}=-6$ dB. Since the main bottleneck is the link qualities, the diversity approach outperforms the fusion approach and reaches accurate consensus asymptotically. The fusion strategy, on the other hand, has a better transient behavior. This is due to the fact that by fusing the received information, it helps in propagating the information over the network. However, it lacks asymptotic accurate consensus and suffers from asymptotic memoryless behavior. As the network connectivity decreases, the fusion strategy outperforms the diversity. For instance, Figure 2 (right) compares the performance of both approaches for 6-regular ring topology and $\overline{\text{CNR}}=6$ dB. Since the main bottleneck is the network connectivity, the fusion approach outperforms the diversity one drastically. In summary, the fusion strategy is more suitable when the graph connectivity is low, while the diversity technique is a better candidate if poor link quality is the main bottleneck. The analysis and simulation of this part show the underlying trade-offs between fusion and diversity strategies. In the next section, we propose a novel framework that keeps the benefits of both fusion and diversity approaches.

## 4 An integrated diversity-fusion framework for binary consensus over fading channels

In this section, we propose our diversity-fusion framework for binary consensus over fading channels. In this strategy, each agent sends a vector to its neighbors. This vector consists of the estimations of the votes corresponding to the different fusion levels. Throughout the repeated communications (diversity), each node tries to refine its assessments of different fusion levels in order to reach consensus.

*i*will send to all its neighbors over fading channels at time

*k*,

^{e}where ${b}_{i}^{u}\left(k\right)$ represents the

*i*th node’s estimate of ${\stackrel{~}{b}}_{i}^{u}$ at time

*k*and

*l*

_{ G }(

*k*) = min{

*k*,

*u*

_{ G }−1}. Note that ${\stackrel{~}{b}}_{i}^{u}$ is defined in Section 2 as the value of node

*i*after

*u*fusion levels for the case where there is no noise. Table 1 shows the time progression of the transmitted vector by node

*i*to all its neighbors. As can be seen, at time

*t*= 0, node

*i*only transmits its initial vote to its neighbors. It also receives its neighbors’ initial votes over fading channels. Next, in time step

*t*= 1, node

*i*fuses all its receptions in order to come up with an estimate of ${\stackrel{~}{b}}_{i}^{1}$. It then transmits its initial vote together with the estimate of ${\stackrel{~}{b}}_{i}^{1}$ to all its neighbors. This process will go on for a while, and each agent sends its estimate of different fusion levels to it neighbors. As can be seen, the

*i*th node’s estimate of ${\stackrel{~}{b}}_{i}^{u}$ will not be available till

*k*=

*u*. Therefore, for

*k*<

*u*

_{ G }−1, ${B}_{i}\left(k\right)={\left[{b}_{i}^{0}\right(k),{b}_{i}^{1}(k),\dots ,{b}_{i}^{k}(k\left)\right]}^{T}$ and

*l*

_{ G }(

*k*) =

*k*. However, for

*t*≥

*u*

_{ G }−1, the length of the transmitted vector becomes fixed and equal to

*u*

_{ G }.

^{f}It is worth noting that except for the first row, the columns of other rows have different values. This is due to the fact that similar transmissions can undergo different noise and fading values.

**Time progression of transmitted vector by node**
i

t = 0 | t = 1 | ⋯ |
t = u
| ⋯ | t = k |
---|---|---|---|---|---|

${b}_{i}^{0}\left(0\right)$ | ${b}_{i}^{0}\left(1\right)$ | ⋯ | ${b}_{i}^{0}({u}_{G}-1)$ | ⋯ | ${b}_{i}^{0}\left(k\right)$ |

${b}_{i}^{1}\left(1\right)$ | ⋯ | ${b}_{i}^{1}({u}_{G}-1)$ | ⋯ | ${b}_{i}^{1}\left(k\right)$ | |

⋯ | ⋮ | ⋯ | ⋮ | ||

⋯ | ${b}_{i}^{{u}_{G}-1}({u}_{G}-1)$ | ⋯ | ${b}_{i}^{{u}_{G}-1}\left(k\right)$ |

*j*to node

*i*, respectively. ${n}_{j,i}^{u}\left(k\right)$ is the zero-mean Gaussian with the variance of ${\sigma}_{j,i,u}^{2}$. We take the fading coefficient and the receiver noise of all the receptions to be uncorrelated. Let ${b}_{j,i}^{u}\left(k\right)$ represent the reception of the

*i*th node from the transmission of ${b}_{j}^{u}\left(k\right)$ at time

*k*. We have the following, ${b}_{j,i}^{u}\left(k\right)={r}_{j,i}^{u}\left(k\right){b}_{j}^{u}\left(k\right)+{n}_{j,i}^{u}\left(k\right)\phantom{\rule{.3em}{0ex}}\text{for}\phantom{\rule{.3em}{0ex}}1\le i\le M\text{and}j\in {\mathcal{N}}_{i}$. Let ${Z}_{j,i}^{u}\left(k\right)={\left[{b}_{j,i}^{u}\right(u),\dots ,{b}_{j,i}^{u}(k\left)\right]}^{T}$ represent all the receptions of node

*i*from node

*j*corresponding to the

*u*th level of fusion till time

*k*. Node

*i*will then update its estimate of ${b}_{i}^{u+1}$ at time

*k*+ 1 based on ${b}_{i}^{u}\left(k\right)$ and all the

*u*th level votes of its neighbors until time

*k*.

*k*≥

*u*. The

*i*th node will then try to estimate ${\stackrel{~}{b}}_{j}^{u}$, based on all receptions from

*j*th node, i.e., ${Z}_{j,i}^{u}\left(k\right)$. In order to characterize the best affine estimation of ${\stackrel{~}{b}}_{j}^{u}$, the second-order statistic of ${\widehat{B}}_{j}^{u}\left(k\right)$ is required. However, finding a closed-form expression for the second-order statistics of this variable is challenging. The vector ${\widehat{B}}_{j}^{u}\left(k\right)$ contains different temporal assessments of the

*j*th node about ${\stackrel{~}{b}}_{j}^{u}$. To simplify the mathematical derivation, we consider the case, where the

*u*th level of fusion is in its steady state, i.e., ${\widehat{B}}_{j}^{u}\left(k\right)={\stackrel{~}{b}}_{j}^{u}{\overrightarrow{1}}_{k-u+1}\phantom{\rule{2.77626pt}{0ex}}\phantom{\rule{2.77626pt}{0ex}}\forall j$. Under this assumption, the BAE estimation can be derived similar to Equation 6 as follows: ${\widehat{b}}_{j}^{u}\left(k\right)={{\rho}_{j,i}^{u}}^{T}\left(k\right){Z}_{j,i}^{u}\left(k\right)+{\eta}_{j,i}^{u}\left(k\right)$, where ${\rho}_{j,i}^{u}\left(k\right)=\frac{1}{\frac{{\sigma}_{j,i,u}^{2}}{{\stackrel{~}{q}}_{j}^{u}(1-{\stackrel{~}{q}}_{j}^{u})}+\parallel {R}_{j,i}^{u}{\left(k\right)\parallel}^{2}}{R}_{j,i}^{u}\left(k\right)$, ${\eta}_{j,i}^{u}\left(k\right)={\stackrel{~}{q}}_{j}^{u}\left(1-{{\rho}_{j,i}^{u}}^{T}\left(k\right){R}_{j,i}^{u}\left(K\right)\right)$ and ${\stackrel{~}{q}}_{j}^{u}=\mathbf{E}\left[{\stackrel{~}{b}}_{j}^{u}\right]$. Since ${\widehat{B}}_{j}^{u}\left(k\right)\ne {\stackrel{~}{b}}_{j}^{u}{\overrightarrow{1}}_{k-u+1}$, the estimator is suboptimal. However, in Theorem 1, we will show that $\underset{k\to \infty}{lim}{b}_{j}^{u}\left(k\right)={\stackrel{~}{b}}_{j}^{u}$ for 1 ≤

*j*≤

*M*. Therefore, the proposed suboptimal estimator is asymptotically optimal. The

*i*th node will then update its (

*u*+ 1)th level decision as

for *k* ≥ *u*, 0 ≤ *u* ≤ *u*
_{
G
} − 1 and ${b}_{i}^{0}\left(k\right)={\stackrel{~}{b}}_{i}^{0}$ ∀*i*,*k*. Next we show that the decision-making function of Equation 12 achieves accurate consensus asymptotically and overcomes the asymptotic memoryless behavior of the traditional fusion approaches.

### Theorem 1

Consider binary consensus over a time-invariant network topology with i.i.d. Rayleigh fading channels. Then, the decision-making function of Equation 12 asymptotically converges (in probability) to accurate consensus if ${D}^{0}\in {\mathcal{D}}_{G}$.

### Proof

We prove the theorem by induction. Define ${\omega}_{i}^{u}\left(k\right)\triangleq \text{prob}\left({b}_{i}^{u}\left(k\right)\ne {\stackrel{~}{b}}_{i}^{u}\right)$. For *u* = 0, we have ${b}_{i}^{0}\left(k\right)={\stackrel{~}{b}}_{i}^{0}\phantom{\rule{2.77626pt}{0ex}}\phantom{\rule{2.77626pt}{0ex}}\forall k,i$. From Lemma 1, it can be easily confirmed that $\underset{k\to \infty}{lim}{\omega}_{i}^{1}\left(k\right)=0\phantom{\rule{2.77626pt}{0ex}}\phantom{\rule{2.77626pt}{0ex}}\forall i$. Assume $\underset{k\to \infty}{lim}{\omega}_{i}^{u}\left(k\right)=0$. We next prove that $\underset{k\to \infty}{lim}{\omega}_{i}^{u+1}(k+1)=0$.

*σ*

^{2}, then $\mathbf{E}\left\{\sqrt{\Xi}\right\}=\sqrt{\frac{2}{\pi}}\sigma $. Let

*ϵ*> 0. Since $\underset{k\to \infty}{lim}{\omega}_{j}^{u}\left(k\right)=0$, there exists a number ${T}_{j}^{u}\left(\mathit{\u03f5.}\right)$ such that ${\omega}_{j}^{u}\left(k\right)<\mathit{\u03f5.}$ for all $k\ge {T}_{j}^{u}\left(\mathit{\u03f5.}\right)$. Therefore,

Since $\frac{1}{\parallel {R}_{j,i}^{u}\left(k\right){\parallel}^{2}}\sum _{t=u}^{{T}_{j}^{u}\left(\mathit{\u03f5.}\right)}{{r}_{j,i}^{u}}^{2}\left(t\right)$ is a non-negative random variable, it goes to 0 as *k* → *∞*. Therefore, we have, $\underset{k\to \infty}{lim}\frac{1}{\parallel {R}_{j,i}^{u}\left(k\right){\parallel}^{2}}\sum _{t=u}^{k}{{r}_{j,i}^{u}}^{2}\left(t\right){\omega}_{j}^{u}\left(t\right)=0$. Furthermore, similar to Equation 10, we can show that $\underset{k\to \infty}{lim}\frac{1}{{\gamma}_{j,i}^{u}\left(k\right)}=0$. By substituting these values in Equation 13, it can be easily confirmed that $\underset{k\to \infty}{lim}{\omega}_{i}^{u+1}(k+1)=0$. Using induction, we have $\underset{k\to \infty}{lim}{\omega}_{i}^{{u}_{G}}\left(k\right)=0$ and as a result $\underset{k\to \infty}{lim}\text{prob}\left(\right.{b}_{i}^{{u}_{G}}\left(k\right)={\stackrel{~}{b}}_{i}^{{u}_{G}}\left)\right.=1$ for 1 ≤ *i* ≤ *M*. Therefore, if ${D}^{0}\in {\mathcal{D}}_{G}$, then $\underset{k\to \infty}{lim}\left[{b}_{1}^{{u}_{G}}\right(k),\cdots \phantom{\rule{0.3em}{0ex}},{b}_{M}^{{u}_{G}}(k\left)\right]$ is an accurate consensus state with the probability of one, which proves the theorem. □

### Remark 1

*σ*

_{ j,i,u }s. If such information is not available, then the

*i*th node can estimate ${\stackrel{~}{b}}_{j}^{u}$ using best linear unbiased estimation: ${\widehat{b}}_{j}^{u}\left(k\right)=\frac{1}{\parallel {R}_{j,i}^{u}\left(k\right){\parallel}^{2}}{{R}_{j,i}^{u}}^{T}\left(k\right){Z}_{j,i}^{u}\left(k\right)$, assuming that the

*u*th level of fusion is in its steady state. Each node will then update its (

*u*+ 1)th level decision as follows:

for *k* ≥ *u*, 0 ≤ *u* ≤ *u*
_{
G
}−1, and ${b}_{i}^{0}\left(k\right)={\stackrel{~}{b}}_{i}^{0}$ ∀*i*,*k*. This receiver can be considered as a special case of the decision-making function of Equation 12, where *σ*
_{
j,i,u
} = 0. We can similarly show that it achieves accurate asymptotic consensus. Furthermore, we have $\underset{k\to \infty}{lim}{\rho}_{j,i}^{u}\left(k\right)\approx \frac{1}{\parallel {R}_{j,i}^{u}\left(k\right){\parallel}^{2}}{R}_{j,i}^{u}\left(k\right)$ and $\underset{k\to \infty}{lim}{\eta}_{j,i}^{u}\left(k\right)\approx 0$.

In the subsequent sections, we utilize the integrated framework for a special class of undirected graphs and show the performance of the proposed framework.

## 5 Integrated framework over regular ring lattice topologies

In Section 4, we introduced our proposed framework, which asymptotically achieves accurate consensus. In this approach, node *i* will send a vector *B*
_{
i
}(*k*) to all its neighbors over fading channels. The length of this vector is *u*
_{
G
} for *t* ≥ *u*
_{
G
}−1, which is a function of graph connectivity. Intuitively, networks with higher connectivity require smaller values of *u*
_{
G
}. For instance, for fully connected networks, we have *u*
_{
G
} = 1. In general, *u*
_{
G
} is a function of network topology and independent of communication quality. This parameter needs to be determined before running the algorithm. In this section, we mainly focus on *L*-regular ring lattice topologies with ideal communication links in order to characterize *u*
_{
G
}. Let $\mathcal{V}=\{1,2,\dots ,M\}$ denote the vertex set. Without loss of generality, we assume that the vertices are ordered clockwise on the ring (see Figure 1). Furthermore, we assume that *M* is odd. Under the above assumptions, the adjacency matrix of an *L*-regular ring lattice, i.e., *A*
_{
L
}, can be represented by a circulant matrix with the first row of $[0,{\overrightarrow{1}}_{\frac{L}{2}}^{T},{\overrightarrow{0}}_{M-L-1}^{T},{\overrightarrow{1}}_{\frac{L}{2}}^{T}]$. For this class of graphs, *L* is a notion of connectivity. Therefore, we try to show how *u*
_{
G
} changes as a function of *L*. We then have the following lemma, which will be used in Theorem 2.

### Lemma 2

For an *L*-regular ring lattice, if *L* = *M* − 1, then $\left|{\cap}_{i=1}^{M}\left\{{\mathcal{N}}_{i}\cup \left\{i\right\}\right\}\right|=M$. Moreover, if *L* ≤ *M* − 3, then $\left|{\cap}_{n=1}^{p}\left\{{\mathcal{N}}_{{i}_{n}}\cup \left\{{i}_{n}\right\}\right\}\right|\le L+2-p$. The equality is achieved if and only if $\{{i}_{1},\dots ,{i}_{p}\}\subset \mathcal{V}$ denotes a set of consecutive nodes on the corresponding ring.

### Proof

The proof is straightforward and we skip it. □

Let ${m}^{u}=\text{min}\left(\sum _{j=1}^{M}{\stackrel{~}{b}}_{j}^{u},M-\sum _{j=1}^{M}{\stackrel{~}{b}}_{j}^{u}\right)$. We then have the following theorem.

### Theorem 2

*L*-regular ring lattice. We then have the following properties:

- 1.
Assume $\mathcal{V}=\bigcup _{i=1}^{c}{\mathcal{V}}_{i}$, such that ${\mathcal{V}}_{i}$ represents a set of consecutive nodes on the ring that vote the same and $\left|{\mathcal{V}}_{i}\right|\ge \frac{L}{2}+1$. Then the corresponding network state is an absorbing state.

- 2.
For ${m}^{0}\le \frac{L}{2}$, the accurate consensus is achievable after one level of fusion.

- 3.
For ${m}^{0}=\frac{L}{2}+1$ and ${D}^{0}\in {\mathcal{D}}_{G}$, accurate consensus is achievable at most after two fusion steps.

### Proof

Let ${\mathcal{V}}_{i}=\{{o}_{1}^{i},\dots ,{o}_{\left|{\mathcal{V}}_{i}\right|}^{i}\}$ denote the *i* th partition, where ${o}_{j}^{i}$ represents the index of *j* th node in the *i* th partition. Therefore, we have, $\left|\left\{{\mathcal{N}}_{{o}_{j}^{i}}\cup \left\{{o}_{j}^{i}\right\}\right\}\bigcap {\mathcal{V}}_{i}\right|\ge \frac{L}{2}+1$ for all $1\le j\le \left|{\mathcal{V}}_{i}\right|$. Since all the nodes in ${\mathcal{V}}_{i}$ vote the same, we have ${\stackrel{~}{b}}_{{o}_{j}^{i}}^{u+1}={\stackrel{~}{b}}_{{o}_{j}^{i}}^{u}$ for 1 ≤ *i* ≤ *c* and $1\le j\le \left|{\mathcal{V}}_{i}\right|$.

We next prove the second part. Consider the case where the majority of the initial votes is 1. If ${m}^{0}\le \frac{L}{2}$, we then have $\frac{{\stackrel{~}{b}}_{i}^{0}+\sum _{j\in {\mathcal{N}}_{i}}{\stackrel{~}{b}}_{j}^{0}}{L+1}\ge \frac{L+1-{m}^{0}}{L+1}>\frac{1}{2}\phantom{\rule{2.77626pt}{0ex}}\forall \phantom{\rule{2.77626pt}{0ex}}i$, which results in ${\stackrel{~}{b}}_{i}^{1}=1$. For the case where the majority of the initial votes is 0, we have $\frac{{\stackrel{~}{b}}_{i}^{0}+\sum _{j\in {\mathcal{N}}_{i}}{\stackrel{~}{b}}_{j}^{0}}{L+1}\le \frac{{m}^{0}}{L+1}<\frac{1}{2}\phantom{\rule{2.77626pt}{0ex}}\forall \phantom{\rule{2.77626pt}{0ex}}i$, which results in ${\stackrel{~}{b}}_{i}^{1}=0$. Therefore, for ${m}^{0}\le \frac{L}{2}$ accurate consensus is achievable in one iteration.

Next, we show the third statement. First we show that for ${m}^{0}=\frac{L}{2}+1$ and ${D}^{0}\in {\mathcal{D}}_{G}$, we have ${m}^{1}\le \frac{L}{2}$. Let $\left\{{i}_{1}^{0},{i}_{2}^{0},\dots ,{i}_{{m}^{0}}^{0}\right\}$ denote an ordered set of the nodes, which vote to the minority of the initial votes. Lemma 2 says that at most $L+2-{m}^{0}=\frac{L}{2}+1$ nodes can have $\{{i}_{1}^{0},\dots ,{i}_{{m}^{0}}^{0}\}$ in their neighbor set if and only if $\left\{\right.{i}_{1}^{0},{i}_{2}^{0},\dots ,{i}_{{m}^{0}}^{0}\left\}\right.$ is a set of consecutive vertices. Therefore, ${m}^{1}=\frac{L}{2}+1$ is achievable if and only if the initial state is an absorbing state (see Theorem 2-1). Therefore, if ${D}^{0}\in {\mathcal{D}}_{G}$, then ${m}^{1}\le \frac{L}{2}$, which reaches accurate consensus in *u* = 2 (see Theorem 2-2). □

*L*) and initial state (

*D*

^{0}). For instance, for a fixed connectivity, if ${m}^{0}\le \frac{L}{2}$, accurate consensus is achievable after one level of fusion. However, if

*m*

^{0}increases to $\frac{L}{2}+1$, then the network may require two fusion steps to reach consensus. In order to understand the impact of the connectivity on the required fusion steps, Figure 3 characterizes

*u*

_{ G }as a function of

*L*over a regular ring lattice topology for different number of nodes. As can be seen, as

*L*increases,

*u*

_{ G }decreases. For instance, for

*L*=16, i.e., a fully connected graph, the network requires only one level of fusion to reach accurate consensus. It can also be seen that

*u*

_{ G }is only a function of the graph topology. Figure 3 also compares

*u*

_{ G }for different number of nodes. As can be seen,

*u*

_{ G }is a non-decreasing function of

*M*for a fixed

*L*. However, the mathematical derivations are challenging. Intuitively, as

*M*increases, the network requires more number of fusion levels, i.e., ‘a higher’

*u*

_{ G }, in order to achieve consensus. For instance, consider an

*L*-regular ring lattice network of

*M*

_{1}nodes, where

*L*=

*M*

_{1}−1 and

*M*

_{1}is an odd number. Since we always have ${m}^{0}\le \frac{L}{2}=\frac{{M}_{1}-1}{2}$, therefore the network achieves accurate consensus only in one iteration. Next, consider an

*L*-regular ring lattice network of

*M*

_{2}nodes, where

*L*=

*M*

_{1}−1,

*M*

_{2}>

*M*

_{1}and

*M*

_{2}is an odd number. It is easy to confirm that

*u*

_{ G }≥ 2 in this case.

## 6 Simulation and comparison

*M*= 17 nodes. In order to show the impact of network connectivity on the performance of the proposed algorithm, we consider a regular graph topology with different values of

*L*. For each

*L*, the number of required fusion levels, i.e.,

*u*

_{ G }, can be found from Figure 3. Each node will then send a binary vector of length

*u*

_{ G }to all its neighbors over communication channels. Moreover, we assume all channels experience the same noise variance (

*σ*

_{ j,i,u }= 1.5) and the average power of fading coefficients is equal to one ($E\left[\right.{{r}_{j,i}^{u}}^{2}\left(k\right)\left]\right.=1$). In order to make a fair comparison (the proposed integrated approaches send more bits per iteration), we compare all the approaches under the same number of transmitted bits. Therefore, in Figure 4, we show the probability of accurate consensus as a function of number of transmitted bits per node.

Figure 4 shows the performance of the proposed framework for *L* = 8,10, and 14. For these simulations, we assume that node *i* does not have the knowledge of ${q}_{j}^{u}$ for $j\in {\mathcal{N}}_{i}$. So it simply assumes ${q}_{j}^{u}=0.5$ in the decision-making function of Equation 12. As can be seen, the the integrated approach, independent of network connectivity, achieves accurate consensus asymptotically. Therefore, the proposed approach overcomes the memoryless asymptotic behavior of traditional binary consensus approaches. Furthermore, networks with higher connectivity, i.e., larger values of *L*, reach their steady state in fewer transmissions. For the case of *L* = 8, the performance of both fusion and diversity approaches of Section 3 are also shown for comparison. As can be seen, the proposed approach keeps the benefits of both fusion and diversity in terms of the transient and asymptotic behaviors respectively. Furthermore, the performance of the integrated approach for the case where *L* = 8 and knowledge of *σ*
_{
j,i,u
} is not available (Remark 1) is also shown in Figure 4. As can be seen, the integrated approach with known link quality slightly outperforms the case of unknown link quality. However, both cases provide a similar performance asymptotically as mentioned earlier in Remark 1.

## 7 Conclusions

In this paper we considered a cooperative network that is trying to reach binary consensus over not fully connected and time-invariant network topologies with fading channels. We first characterized the underlying trade-offs between fusion and diversity strategies. We then proposed a framework that keeps the benefits of both strategies. We mathematically analyzed the proposed algorithm and showed how it achieves accurate consensus asymptotically. Our results indicated that the proposed technique improves the consensus performance considerably and solves the undesirable memoryless asymptotic behavior of the original problem.

## Endnotes

^{a} We also use the term ‘agent’ to refer to each node.

^{b} Note that in a binary consensus scenario, each node only exchanges 1 bit of information with its neighbors in each time step.

^{c} An *L*-regular ring lattice is an *L*-regular graph with *M* vertices in a ring in which each vertex is connected to its *L* neighbors ($\frac{L}{2}$ on each side for an even value of *L*).

^{d} Note that without loss of generality, we assumed that the modulation is on-off keying.

^{e} We assume an FDMA- or TDMA-based MAC approach. For instance, in FDMA-base approach, to each node we assign different frequency subbands, corresponding to different fusion levels.

^{f} Note that we chose *u*
_{
G
} as the maximum length based on the fact that, in the case of no noise, this is the number of fusion levels needed for convergence. However, in this case that we have noise, this may not be the optimum length and choosing longer lengths can possibly result in a better performance.

## Declarations

## Authors’ Affiliations

## References

- Jadbabaie A, Lin J, Morse AS: Coordination of groups of mobile autonomous agents using nearest neighbor rules.
*IEEE Trans. Automatic Control*2003, 48: 988-1001. 10.1109/TAC.2003.812781MathSciNetView ArticleGoogle Scholar - Aysal TC, Yildiz ME, Sarwate AD, Scaglione A: Broadcast gossip algorithms for consensus.
*IEEE Trans. Signal Process*2009, 57: 2748-2761.MathSciNetView ArticleGoogle Scholar - Kar S, Moura J: Distributed consensus algorithms in sensor networks with imperfect communication: Link failures and channel noise.
*IEEE Trans. Signal Process*2009, 57: 355-369.MathSciNetView ArticleGoogle Scholar - Scutari G, Barbarossa S: Distributed consensus over wireless sensor networks affected by multipath fading.
*IEEE Trans. Signal Process*2008, 56: 4100-4106.MathSciNetView ArticleGoogle Scholar - Mostofi Y: Binary consensus with Gaussian communication noise: a probabilistic approach. Proceedings of the 46th IEEE Conference on Decision and Control (CDC) Hilton New Orleans Riverside, New Orleans, 12–14, Dec 2007Google Scholar
- Ashrafi S, Malmirchegini M, Mostofi Y:
*Binary consensus for cooperative spectrum sensing in cognitive radio networks. IEEE GLOBECOM, Houston, 5–9 Dec 2011.*Piscataway: IEEE; 2011.Google Scholar - Hong Y, Scaglione A, Varshney P:
*A communication architecture for reaching the consensus in decision for a large network. IEEE Statistical Signal Processing Workshop, SSP2005, Bordeaux, 17–20 July 2005.*Piscataway: IEEE; 2005:17-22.Google Scholar - Olfati-Saber R, Franco E, Frazzoli E, Shamma JS: Belief consensus and distributed hypothesis testing in sensor networks.
*Network Embedded Sensing Control*2006, 331: 169-182. 10.1007/11533382_11MathSciNetView ArticleGoogle Scholar - Liu J, Yadav V, Sehgal H, Olson J, Liu H, Elia N:
*Phase transitions on fixed connected graphs and random graphs in the presence of noise. Proceedings of the 44th IEEE Conference on Decision and Control, Orlando, 12–15 Dec 2005.*Piscataway: IEEE; 2005:2996-3000.Google Scholar - Malmirchegini M, Ruan Y, Mostofi Y:
*Binary consensus over fading channels: a best affine estimation approach. IEEE Global Telecommunications Conference, New Orleans, 30 Nov–4 Dec 2008.*Piscataway: IEEE; 2008.Google Scholar - Mostofi Y, Malmirchegini M: Binary consensus over fading channels.
*IEEE Trans. Signal Process*2010, 58: 6340-6354.MathSciNetView ArticleGoogle Scholar

## Copyright

This article is published under license to BioMed Central Ltd. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.