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

Diffusion kernel algorithms are interesting tools for distributed nonlinear estimation. However, for the sake of feasibility, it is essential in practice to restrict their computational cost and the number of communications. In this paper, we propose a censoring algorithm for adaptive kernel diffusion networks based on random Fourier features that locally adapts the number of nodes censored according to the estimation error.

Categories:
16 Views

We propose a throughput-optimal biased backpressure (BP) algorithm for routing, where the bias is learned through a graph neural network that seeks to minimize end-to-end delay. Classical BP routing provides a simple yet powerful distributed solution for resource allocation in wireless multi-hop networks but has poor delay performance. A low-cost approach to improve this delay performance is to favor shorter paths by incorporating pre-defined biases in the BP computation, such as a bias based on the shortest path (hop) distance to the destination.

Categories:
37 Views

We propose a wireless localization algorithm based on complex-domain super multidimensional scaling (CD-SMDS) augmented with a self-localization (SL) component, whereby each target tracks its own motion by incorporating bearing in- formation, obtained e.g., from integrated inertial sensors.

Categories:
22 Views

Artificial Intelligent (AI) tools can be useful to address model deficits in the design of communication systems. However, conventional learning-based AI algorithms yield poorly calibrated decisions, unabling to quantify their outputs uncertainty. While Bayesian learning can enhance calibration by capturing epistemic uncertainty caused by limited data availability, formal calibration guarantees only hold under strong assumptions about the ground-truth, unknown, data generation mechanism.

Categories:
20 Views

A fundamental problem in the design of wireless networks is to efficiently schedule transmission in a distributed manner. The main challenge stems from the fact that optimal link scheduling involves solving a maximum weighted independent set (MWIS) problem, which is NP-hard. For practical link scheduling schemes, distributed greedy approaches are commonly used to approximate the solution of the MWIS problem. However, these greedy schemes mostly ignore important topological information of the wireless networks.

Categories:
155 Views

A consensus based distributed algorithm to compute
the spectral radius of a network is proposed. The spectral radius
of the graph is the largest eigenvalue of the adjacency matrix, and
is a useful characterization of the network graph. Conventionally,
centralized methods are used to compute the spectral radius, which
involves eigenvalue decomposition of the adjacency matrix of the
underlying graph. Our distributed algorithm uses a simple update
rule to reach consensus on the spectral radius, using only local

Categories:
3 Views

In this work, we investigate differential chaos shift keying (DCSK), a communication-based waveform, in the context of wireless power transfer (WPT). Particularly, we present a DCSK-based WPT architecture, that employs an analog correlator at the receiver in order to boost the energy harvesting (EH) performance. By taking into account the nonlinearities of the EH process, we derive closed-form analytical expressions for the peak-to-average-power-ratio of the received signal as well as the harvested power.

Categories:
17 Views

A wireless sensing system with n sensors, observing independent and identically distributed continuous random variables with a symmetric probability density function, and one non-collocated estimator acting as a fusion center is considered. The sensors transmit information to the fusion center via a limited capacity communication medium modeled by a collision channel. It is assumed that there is no communication among the sensors prior to transmission, and the collision channel allows at most k<n simultaneous transmissions.

Categories:
14 Views

Pages