We present a unified analytical framework within which power control and routing for wireless networks can be optimized on a node-by-node basis. We consider a multicommodity flow model for an interference-limited wire...
详细信息
ISBN:
(纸本)142440505X
We present a unified analytical framework within which power control and routing for wireless networks can be optimized on a node-by-node basis. We consider a multicommodity flow model for an interference-limited wireless network in which power control and routing variables are chosen to minimize convex link costs. Distributed scaled gradient projection algorithms are developed to iteratively adjust power control and routing schemes at individual nodes. We specify appropriate scaling matrices with which the algorithms quickly converge to the global optimum from any initial point. These scaling matrices can be computed locally at each node with limited control message overhead
We present a unified analytical framework within which power control, routing, and congestion control for wireless networks can be optimized on a node-by-node basis. We consider a multi-commodity flow model for interf...
详细信息
We present a unified analytical framework within which power control, routing, and congestion control for wireless networks can be optimized on a node-by-node basis. We consider a multi-commodity flow model for interference-limited wireless networks, and develop distributed scaled gradient projection algorithms which iteratively adjust power control and routing schemes at individual nodes to minimize convex link costs. We provide locally computable scaling matrices which guarantee fast convergence of the algorithms to the global optimum from any initial condition. Furthermore, we show that congestion control can be seamlessly incorporated into our framework with the introduction of virtual overflow links.
In this paper, computational aspects of the panel aggregation problem are addressed. Motivated primarily by applications of risk assessment, an algorithm is developed for fusing large corpora of internally incoherent ...
详细信息
ISBN:
(纸本)1424409535
In this paper, computational aspects of the panel aggregation problem are addressed. Motivated primarily by applications of risk assessment, an algorithm is developed for fusing large corpora of internally incoherent probability assessments. The algorithm is characterized by a provable performance guarantee, and is demonstrated to be orders of magnitude faster than existing tools when tested on several real-world data-sets. In addition, unexpected connections between research in risk assessment and wireless sensor networks are exposed, as several key ideas are illustrated to be useful in both fields
It is well known that the Least Mean Square (LMS) algorithm convergence speed degrades considerably when the input signal is correlated. On the other hand, the Affine projection Algorithm (APA) was recently developed ...
详细信息
It is well known that the Least Mean Square (LMS) algorithm convergence speed degrades considerably when the input signal is correlated. On the other hand, the Affine projection Algorithm (APA) was recently developed and has faster convergence for correlated inputs compared to LMS. Convergence Analysis done on APA to date has been based on either a modification of the independence assumption, a special regression model, or a Gaussian regression data model, In this paper, an analysis of the standard APA algorithm under the assumption of a finite strong memory and finite moments for the regression data is done. We prove that under steady state conditions, the weight error covariance is lower bounded and dependent on the step size and not the correlation of the input regression matrix.
In this work we introduce a new methodology to build a kernel matrix from a collection of kernels. The key idea is to build a unique kernel that eliminates spurious differences between kernels. We propose a method bas...
详细信息
In this work we introduce a new methodology to build a kernel matrix from a collection of kernels. The key idea is to build a unique kernel that eliminates spurious differences between kernels. We propose a method based on the Procrustes problems that uses the alternating projections method to minimize a certain error measure. The resulting kernel will be used for classification purposes using support vector machines (SVMs). The proposed method has been successfully evaluated against alternative kernel combination techniques
For discrete-time linear systems with inputs amplitude and rate constraints, we show that there exists a finite horizon such that the infinite horizon constrained LQR problem can turn to a finite horizon constrained L...
详细信息
For discrete-time linear systems with inputs amplitude and rate constraints, we show that there exists a finite horizon such that the infinite horizon constrained LQR problem can turn to a finite horizon constrained LQR problem and give an upper bound of this horizon for any given initial state. We also give an upper bound of this finite horizon for all initial states inside the stability region, finally, we give a mixed controller which stabilizes the system
A discrete-time model with delay was derived, aiming at the sewage overflow and operational cost caused by unexpected time variation and delay in flows of drainage system. Based on the model, an adaptive multi-model s...
详细信息
A discrete-time model with delay was derived, aiming at the sewage overflow and operational cost caused by unexpected time variation and delay in flows of drainage system. Based on the model, an adaptive multi-model switching control strategy using predictive functional control (PFQ is developed. The strategy can estimate the flow to the pumping station and predict the depth of pump well. Combining on-line identification using improved projection algorithm with multi-model switching abates model mismatch and system chattering under the influence of switching over frequently. Initial value matching up to each sub-model was employed to accelerate convergence of estimates, which was identified by off-line estimation. Simulation results indicate that the proposed control approach is robust and effective. The discharge of the downstream pumps is varied automatically by tracking the outflow mainly from upstream pumping stations that the predetermined water level of pump well is maintained by the adoption of this control strategy, which minimizes the overflow pollution
In this paper, a simple yet efficient randomized algorithm (Exterior Random Covering) for finding the maximum distance from a point set to an arbitrary compact set in R-d is presented. This algorithm can be used for a...
详细信息
In this paper, a simple yet efficient randomized algorithm (Exterior Random Covering) for finding the maximum distance from a point set to an arbitrary compact set in R-d is presented. This algorithm can be used for accelerating the computation of the Hausdorff distance between complex polytopes.
The paper proposes a robust and stable fast affine projection algorithm based on the Gauss-Seidel method, the so called modified Gauss-Seidel fast affine projection algorithm. The proposed algorithm is generalized for...
详细信息
The paper proposes a robust and stable fast affine projection algorithm based on the Gauss-Seidel method, the so called modified Gauss-Seidel fast affine projection algorithm. The proposed algorithm is generalized for simplified Volterra filters as well. The computational complexity of both the modified Gauss-Seidel fast affine projection algorithm and its generalization for simplified Volterra filters is derived and their performance for acoustic echo cancellation is assessed.
The article presents a modification of cross-correlated back projection algorithm for UWB imaging. The modified algorithm has improved performance in a sense of better quality of reconstructed 2D or 3D images of the p...
详细信息
The article presents a modification of cross-correlated back projection algorithm for UWB imaging. The modified algorithm has improved performance in a sense of better quality of reconstructed 2D or 3D images of the propagation environment. The performance of the new imaging algorithm is demonstrated on numerical examples.
暂无评论