Analytical Bit Error Rate Performance of DS-CDMA Ad Hoc Networks using Large Area Synchronous Spreading Sequences

The performance of large area synchronous (LAS) direct sequence code division multiple access (DS-CDMA) assisted ad hoc networks is investigated in the context of a single-hop infinite mesh of rectilinearly located ad hoc nodes. It is shown that LAS DS-CDMA exhibits a significantly better performance than the family of traditional spreading sequences used in a quasisynchronous DS-CDMA scenario having a low number of resolvable multipath components and a sufficiently high number of RAKE receiver branches. The benefits of LAS codes in ad hoc networks are multifold: (i) Their performance is noise-limited, rather than interference-limited, provided that the multipath and multi-user interference arrives within their interference free window. (ii) Under the same conditions LAS codes are robust against the ‘near–far’ effects imposed by ad hoc networks operating without base-station-aided power control, without accurate synchronisation and without implementationally complex interference cancellers

Data Unfolding with Wiener-SVD Method

Data unfolding is a common analysis technique used in HEP data analysis. Inspired by the deconvolution technique in the digital signal processing, a new unfolding technique based on the SVD technique and the well-known Wiener filter is introduced. The Wiener-SVD unfolding approach achieves the unfolding by maximizing the signal to noise ratios in the effective frequency domain given expectations of signal and noise and is free from regularization parameter. Through a couple examples, the pros and cons of the Wiener-SVD approach as well as the nature of the unfolded results are discussed.Comment: 26 pages, 12 figures, match the accepted version by JINS

Filtering for networked stochastic time-delay systems with sector nonlinearity

Copyright [2009] IEEE. This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of Brunel University's products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to [email protected]. By choosing to view this document, you agree to all provisions of the copyright laws protecting it.This paper is concerned with the filtering problem for a class of discrete-time stochastic nonlinear networked control systems with network-induced incomplete measurements. The incomplete measurements include both the multiple random communication delays and random packet losses, which are modeled by a unified stochastic expression in terms of a set of indicator functions that is dependent on certain stochastic variable. The nonlinear functions are assumed to satisfy the sector nonlinearities. The purpose of the addressed filtering problem is to design a linear filter such that the filtering-error dynamics is exponentially mean-square stable. By using the linear-matrix-inequality (LMI) method and delay-dependent technique, sufficient conditions are derived which are dependent on the occurrence probability of both the random communication delays and missing measurement. The filter gain is then characterized by the solution to a set of LMIs. A simulation example is exploited to demonstrate the effectiveness of the proposed design procedures

Modelling and stability of FAST TCP

We introduce a discrete-time model of FAST TCP that fully captures the effect of self-clocking and compare it with the traditional continuous-time model. While the continuous-time model predicts instability for homogeneous sources sharing a single link when feedback delay is large, experiments suggest otherwise. Using the discrete-time model, we prove that FAST TCP is locally asymptotically stable in general networks when all sources have a common round-trip feedback delay, no matter how large the delay is. We also prove global stability for a single bottleneck link in the absence of feedback delay. The techniques developed here are new and applicable to other protocols

Robust filtering for gene expression time series data with variance constraints

This is the post print version of the article. The official published version can be obtained from the link below - Copyright 2007 Taylor & Francis Ltd.In this paper, an uncertain discrete-time stochastic system is employed to represent a model for gene regulatory networks from time series data. A robust variance-constrained filtering problem is investigated for a gene expression model with stochastic disturbances and norm-bounded parameter uncertainties, where the stochastic perturbation is in the form of a scalar Gaussian white noise with constant variance and the parameter uncertainties enter both the system matrix and the output matrix. The purpose of the addressed robust filtering problem is to design a linear filter such that, for the admissible bounded uncertainties, the filtering error system is Schur stable and the individual error variance is less than a prespecified upper bound. By using the linear matrix inequality (LMI) technique, sufficient conditions are first derived for ensuring the desired filtering performance for the gene expression model. Then the filter gain is characterized in terms of the solution to a set of LMIs, which can easily be solved by using available software packages. A simulation example is exploited for a gene expression model in order to demonstrate the effectiveness of the proposed design procedures.This work was supported in part by the Engineering and Physical Sciences Research Council (EPSRC) of the UK under Grants GR/S27658/01 and EP/C524586/1, the Biotechnology and Biological Sciences Research Council (BBSRC) of the UK under Grants BB/C506264/1 and 100/EGM17735, the Nuffield Foundation of the UK under Grant NAL/00630/G, and the Alexander von Humboldt Foundation of Germany

FAST TCP: Motivation, Architecture, Algorithms, Performance

We describe FAST TCP, a new TCP congestion control algorithm for high-speed long-latency networks, from design to implementation. We highlight the approach taken by FAST TCP to address the four difficulties which the current TCP implementation has at large windows. We describe the architecture and summarize some of the algorithms implemented in our prototype. We characterize its equilibrium and stability properties. We evaluate it experimentally in terms of throughput, fairness, stability, and responsiveness