The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
This paper studies a distributed algorithm for finding a common fixed point of a family of m > 1 nonlinear maps Mi: ℝn → ℝn assuming that each map is strongly quasi-nonexpansive, and that at least one such common fixed point exists. A common fixed point is simultaneously and recursively computed by m agents assuming that each agent i knows only Mi, the current estimates of the fixed point generated...
We are considering problem of estimating autoregressive signal coefficients over a network of agents. Noise and/or multipath are disturbing reception of the signals in network nodes. The autoregressive signals have different powers and delays at different nodes. Least-mean-square algorithms are used in nodes for the estimation as well as the cooperation strategy based on the adapt-then-combine diffusion...
We consider distributed prediction of signals modeled as autoregressive processes. A signal from this class is assumed to be received in different network nodes with different delays and attenuations. Each node can be affected by additive noise of different strength. Additionally, some nodes are affected by multipath effects and interference. Nodes cooperate using the adapt-then-combine least mean...
A digraph with positive weights on its edges is weight-balanced if, for each node, the sum of the weights of the incoming edges equals the sum of the weights of the outgoing edges. Weight-balanced digraphs play an important role in a variety of cooperative control problems and, in this work, we propose an iterative distributed algorithm which solves the integer weight balancing problem in a given...
This paper investigates the performance of averaging based distributed consensus algorithms in topology varying networks with existing non-uniform transmission delays. A finite power of the delay augmented system matrix is shown to be scrambling which confirms that non-uniform bounded delay does not affect the ultimate convergence of the distributed iterative algorithms considered in this paper. The...
Rate, energy and delay are three main parameters of interest in ad-hoc networks. In this paper, we discuss the problem of maximizing network utility and minimizing energy consumption while satisfying a given transmission delay constraint for each packet. We formulate this problem in the standard convex optimization form and subsequently discuss the tradeoff between utility, energy and delay in such...
Stability and delay constraints have significant impact on the design and operation of wireless sensor networks. In this paper, we propose a closed architecture for data sampling in wireless sensor networks. Examples show that the proposed scheme outperforms the traditional layered scheme, both in terms of stable operating region as well as the end-to-end delays. We then propose a distributed routing...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.