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

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.

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

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.

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.

In this paper, we consider interference channel model in which transmissions from multiple users are partially correlated. This correlation arises in wireless sensor network (WSN) scenarios and temporally correlated models. Considering this model, two minimum mean squared error (MSE) based precoding methods are derived. With these formulations, an iterative convergent procedure is formulated similar to a typical interference alignment (IA) algorithm. Simulations show that the second method provides the best sum rates for different correlation values.