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

Mehrzad Malmirchegini,Yasamin Mostofi

doi:10.1186/1687-6180-2013-144

Mehrzad Malmirchegini, Yasamin Mostofi

Open Access

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

Copy DOI

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.

Highlights

Cooperative decision-making over sensor networks has gotten considerable interest in recent years
In [5], we considered reaching binary consensus over regular network topologies with additive white Gaussian noise channels
In [11], we considered binary consensus over rapidly changing network topologies with fading channels

Summary

Introduction

Cooperative decision-making over sensor networks has gotten considerable interest in recent years. 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. 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. Where Ni denotes the neighbor set of the ith node, and the decision-making function for the binary consensus over ideal communication links, Υideal(., .), is defined as follows:. We discuss different strategies in terms of information flow and robustness to link error and characterize the underlying trade-offs

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

Diversity case

Integrated framework over regular ring lattice topologies

Findings

Conclusions