Sorry, you need to enable JavaScript to visit this website.

We consider a cooperative cognitive wireless network sce- nario where a primary wireless network is co-located with a cognitive (or secondary) network. In the considered scenario, the nodes of the secondary network make local binary de- cisions about the presence of a signal emitted by a primary node. Then, they transmit their decisions to a fusion center (FC). The final decision about the channel state is up to the FC by means of a proper fusion rule.

Categories:
10 Views

This work examines the problem of learning the topology of a network (graph learning) from the signals produced at a subset of the network nodes (partial observability). This challenging problem was recently tackled assuming that the topology is drawn according to an Erdős-Rényi model, for which it was shown that graph learning under partial observability is achievable, exploiting in particular homogeneity across nodes and independence across edges.

Categories:
1 Views

This work examines the problem of learning the topology of a network (graph learning) from the signals produced at a subset of the network nodes (partial observability). This challenging problem was recently tackled assuming that the topology is drawn according to an Erdős-Rényi model, for which it was shown that graph learning under partial observability is achievable, exploiting in particular homogeneity across nodes and independence across edges.

Categories:
3 Views

The cooperative relay network is a type of multi-terminal communication system. We present in this paper a Neural Network (NN)-based autoencoder (AE) approach to optimize its design. This approach implements a classical three-node cooperative system as one AE model, and uses a two-stage scheme to train this model and minimize the designed losses. We demonstrate that this approach shows performance close to the best baseline in decode-and-forward (DF), and outperforms the best baseline in amplify-and-forward (AF), over a wide range of signal-to-noise-ratio (SNR) values.

Categories:
16 Views

The problem of maximizing the information flow through a sensor network tasked with an inference objective at the fusion center is considered. The sensor nodes take observations, compress, and send them to the fusion center through a network of relays. The network imposes capacity constraints on the rate of transmission in each connection and flow conservation constraints. It is shown that this rate-constrained inference problem can be cast as a Network Utility Maximization problem by suitably defining the utility functions for each sensor, and can be solved using existing techniques.

Categories:
3 Views

Pages