64,565 research outputs found
Predicting expected TCP throughput using genetic algorithm
Predicting the expected throughput of TCP is important for several aspects such as e.g. determining handover criteria for future multihomed mobile nodes or determining the expected throughput of a given MPTCP subflow for load-balancing reasons. However, this is challenging due to time varying behavior of the underlying network characteristics. In this paper, we present a genetic-algorithm-based prediction model for estimating TCP throughput values. Our approach tries to find the best matching combination of mathematical functions that approximate a given time series that accounts for the TCP throughput samples using genetic algorithm. Based on collected historical datapoints about measured TCP throughput samples, our algorithm estimates expected throughput over time. We evaluate the quality of the prediction using different selection and diversity strategies for creating new chromosomes. Also, we explore the use of different fitness functions in order to evaluate the goodness of a chromosome. The goal is to show how different tuning on the genetic algorithm may have an impact on the prediction. Using extensive simulations over several TCP throughput traces, we find that the genetic algorithm successfully finds reasonable matching mathematical functions that allow to describe the TCP sampled throughput values with good fidelity. We also explore the effectiveness of predicting time series throughput samples for a given prediction horizon and estimate the prediction error and confidence.Peer ReviewedPostprint (author's final draft
Cooperative Relaying in Wireless Networks under Spatially and Temporally Correlated Interference
We analyze the performance of an interference-limited, decode-and-forward,
cooperative relaying system that comprises a source, a destination, and
relays, placed arbitrarily on the plane and suffering from interference by a
set of interferers placed according to a spatial Poisson process. In each
transmission attempt, first the transmitter sends a packet; subsequently, a
single one of the relays that received the packet correctly, if such a relay
exists, retransmits it. We consider both selection combining and maximal ratio
combining at the destination, Rayleigh fading, and interferer mobility.
We derive expressions for the probability that a single transmission attempt
is successful, as well as for the distribution of the transmission attempts
until a packet is transmitted successfully. Results provide design guidelines
applicable to a wide range of systems. Overall, the temporal and spatial
characteristics of the interference play a significant role in shaping the
system performance. Maximal ratio combining is only helpful when relays are
close to the destination; in harsh environments, having many relays is
especially helpful, and relay placement is critical; the performance improves
when interferer mobility increases; and a tradeoff exists between energy
efficiency and throughput
A Simple Cooperative Diversity Method Based on Network Path Selection
Cooperative diversity has been recently proposed as a way to form virtual
antenna arrays that provide dramatic gains in slow fading wireless
environments. However most of the proposed solutions require distributed
space-time coding algorithms, the careful design of which is left for future
investigation if there is more than one cooperative relay. We propose a novel
scheme, that alleviates these problems and provides diversity gains on the
order of the number of relays in the network. Our scheme first selects the best
relay from a set of M available relays and then uses this best relay for
cooperation between the source and the destination. We develop and analyze a
distributed method to select the best relay that requires no topology
information and is based on local measurements of the instantaneous channel
conditions. This method also requires no explicit communication among the
relays. The success (or failure) to select the best available path depends on
the statistics of the wireless channel, and a methodology to evaluate
performance for any kind of wireless channel statistics, is provided.
Information theoretic analysis of outage probability shows that our scheme
achieves the same diversity-multiplexing tradeoff as achieved by more complex
protocols, where coordination and distributed space-time coding for M nodes is
required, such as those proposed in [7]. The simplicity of the technique,
allows for immediate implementation in existing radio hardware and its adoption
could provide for improved flexibility, reliability and efficiency in future 4G
wireless systems.Comment: To appear, IEEE JSAC, special issue on 4
Dispensing with channel estimation: differentially modulated cooperative wireless communications
As a benefit of bypassing the potentially excessive complexity and yet inaccurate channel estimation, differentially encoded modulation in conjunction with low-complexity noncoherent detection constitutes a viable candidate for user-cooperative systems, where estimating all the links by the relays is unrealistic. In order to stimulate further research on differentially modulated cooperative systems, a number of fundamental challenges encountered in their practical implementations are addressed, including the time-variant-channel-induced performance erosion, flexible cooperative protocol designs, resource allocation as well as its high-spectral-efficiency transceiver design. Our investigations demonstrate the quantitative benefits of cooperative wireless networks both from a pure capacity perspective as well as from a practical system design perspective
Thresholds Optimization for One-Bit Feedback Multi-User Scheduling
We propose a new one-bit feedback scheme with scheduling decision based on
the maximum expected weighted rate. We show the concavity of the -user case
and provide the optimal solution which achieves the maximum weighted rate of
the users. For the general asymmetric M-user case, we provide a heuristic
method to achieve the maximum expected weighted rate. We show that the sum rate
of our proposed scheme is very close to the sum rate of the full channel state
information case, which is the upper bound performance
Effects of pedigree errors on the efficiency of conservation decisions
Conservation schemes often aim at increasing genetic diversity by minimizing kinship, and the best method to achieve this goal, when pedigree data is available, is to apply optimal contributions. Optimal contributions calculate contributions per animal so that the weighted average mean kinship among candidate parents is minimized. This approach assumes that pedigree data is correct and complete. However, in practice, pedigrees often contain errors: parents are recorded incorrectly or even missing. We used simulations to investigate the effect of these two types of errors on minimizing kinship. Our findings show that a low percentage of wrong parent information reduces the effect of optimal contributions. When the percentage of wrong parent information is above 15%, the population structure and type of errors, should be taken into account before applying optimal contributions. Optimal contributions based on pedigrees with missing parent information hampers conservation of genetic diversity; however, missing parent information can be corrected. It is crucial to know which animals are founders. We strongly recommend that pedigree registration include whether missing parents are either true founders or non-founders
- …