We consider link error or physical channel error in wireless networks and propose a new ratebased congestion control scheme for wireless networks, which is based on the NUM framework developed for TCP-like congestion control model in wired networks. This scheme is distributed and can be implemented by changing the number of connections opened by one user and requires no modification to either t...

In this paper, we consider the problem of verification of certain frequency-domain tests for stability of delay systems of the neutral type. We show that several frequency-domain conditions can be reduced to optimization problems on the cone of positive semidefinite matrices. Such an approach is an alternative to the classical graphical tests (e.g. the Nyquist criterion). The motivation for usi...

In this note, we consider the feedback connection of a plant M with a random matrix gain , and study the statistical properties of the loop gain L = M , under the hypothesis that the random feedback has a unitarily invariant distribution. This setup has interesting connections with two open problems related to the entropy of the plant, and to a probabilistic version of the multivariate Nyquist ...

We study robust consensus of linear Multi-Agent Systems (MAS) with heterogeneous delays. We provide a very accurate set-valued condition that guarantees consensus for arbitrary bounded delays and arbitrary connected topologies. This condition is proven using the generalized Nyquist criterion. From the set-valued condition, an explicit analytical formula is derived for single integrator MAS. In ...

This paper is concerned with the problem of assessing the stability of linear systems with a single timedelay. Stability analysis of linear systems with time-delays is complicated by the need to locate the roots of a transcendental characteristic equation. In this paper we show that a linear system with a single time-delay is stable independent of delay if and only if a certain rational functio...

The present paper investigates the robustness of the consensus protocol over weighted directed graphs using the Nyquist criterion. The limit to which a single weight can vary, while consensus among the agents can be achieved, is explicitly derived. It is shown that even with a negative weight on one of the edges, consensus may be achieved. The result obtained in this paper is applied to a direc...

In this technical report we provide a corrected proof for the main result of a paper of ours.

Sinc-shaped Nyquist pulses possess a rectangular spectrum, enabling data to be encoded in a minimum spectral bandwidth and satisfying by essence the Nyquist criterion of zero inter-symbol interference (ISI). This property makes them very attractive for communication systems since data transmission rates can be maximized while the bandwidth usage is minimized. However, most of the pulse-shaping ...

Donoho and Stark have shown that a precise deterministic recovery of missing information contained in a time interval shorter than the time-frequency uncertainty limit is possible. We analyze this signal recovery mechanism from a physics point of view and show that the well-known Shannon-Nyquist sampling theorem, which is fundamental in signal processing, also uses essentially the same mechanis...