Spelling suggestions: "subject:"date allocation"" "subject:"date collocation""
1 |
Across-Peer Rate Allocation Algorithm in Peer-to-peer NetworksSu, Yang 16 December 2013 (has links)
We introduce a new across-peer rate allocation algorithm with successive refinement to improve the video transmission performance in P2P networks, based on the combination of multiple description coding and network coding. Successive refinement is implemented through layered multiple description codes. The algorithm is developed to maximize the expected video quality at the receivers by partitioning video bitstream into different descriptions depending on different bandwidth conditions of each peer. Adaptive rate partition adjustment is applied to ensure the real reflection of the packet drop rate in the network. Also the granularity is changed to the scale of atomic blocks instead of stream rates in prior works. Through simulation results we show that the algorithm outperforms prior algorithms in terms of video playback quality at the peer ends, and helps the system adjust better to the peer dynamics.
|
2 |
Measurement Quantization in Compressive ImagingLin, Yuzhang, Lin, Yuzhang January 2016 (has links)
In compressive imaging the measurement quantization and its impact on the overall system performance is an important problem. This work considers several challenges that derive from quantization of compressive measurements. We investigate the design of scalar quantizer (SQ), vector quantizer (VQ), and tree-structured vector quantizer (TSVQ) for information-optimal compressive imaging. The performance of these quantizer designs is quantified for a variety of compression rates and measurement signal-to-noise-ratio (SNR) using simulation studies. Our simulation results show that in the low SNR regime a low bit-depth (3 bit per measurement) SQ is sufficient to minimize the degradation due to measurement quantization. However, in mid-to-high SNR regime, quantizer design requires higher bit-depth to preserve the information in the measurements. Simulation results also confirm the superior performance of VQ over SQ. As expected, TSVQ provides a good tradeoff between complexity and performance, bounded by VQ and SQ designs on either side of performance/complexity limits. In compressive image the size of final measurement data (i.e. in bits) is also an important system design metric. In this work, we also optimize the compressive imaging system using this design metric, and investigate how to optimally allocate the number of measurement and bits per measurement, i.e. the rate allocation problem. This problem is solved using both an empirical data driven approach and a model-based approach. As a function of compression rate (bits per pixel), our simulation results show that compressive imaging can outperform traditional (non-compressive) imaging followed by image compression (JPEG 2000) in low-to-mid SNR regime. However, in high SNR regime traditional imaging (with image compression) offers a higher image fidelity compare to compressive imaging for a given data rate. Compressive imaging using blockwise measurements is partly limited due to its inability to perform global rate allocation. We also develop an optimal minimum mean-square error (MMSE) reconstruction algorithm for quantized compressed measurements. The algorithm employs Monte-Carlo Markov Chain (MCMC) sampling technique to estimate the posterior mean. Simulation results show significant improvement over approximate MMSE algorithms.
|
3 |
Resource Allocation for Smart Phones in 4G LTE-Advanced Carrier AggregationKurrle, Rebecca Lynne 10 December 2012 (has links)
The purpose of this thesis is to explore the concept of resource scheduling and pricing and its relation to carrier aggregation. The first main topic is a modified Frank Kelly algorithm that allows for the use of utility functions that are piecewise concave, but not a member of a strictly \'diminishing return\' model. This adjustment to the Frank Kelly algorithm allows resource allocation to take into account devices with multiple applications. The second topic introduces the idea of scheduling resources in a carrier aggregation scenario assuming the carriers are scheduled sequentially. / Master of Science
|
4 |
Network Selection and Rate Allocation in Heterogeneous Wireless Networks and SystemsWang, Xiaoyuan January 2009 (has links)
No description available.
|
5 |
Analysis of coded OFDM system over frequency-selective fading channelsZheng, Jun 15 November 2004 (has links)
This thesis considers the analysis of system performance and resource allocation for a coded OFDM system over frequency selective fading channels. Due to the inseparable role taken by channel coding in a coded OFDM system, an information theoretical analysis is carried out and taken as the basis for the system performance and throughput.
Based on the results of the information theoretical analysis, the optimal system BER performance of a coded OFDM system is first shown to converge to the outage probability for large OFDM block lengths. Instead of evaluating the outage probability numerically, we provide in this thesis a simple analytical closed form approximation of the outage probability for a coded OFDM system over frequency selective quasi-static fading channels. Simulation results of the turbo-coded OFDM systems further confirm the approximation of the outage probability.
By taking the instantaneous channel capacity as the analytical building block, system throughput of a coded OFDM system is then provided. With the aim to compare the performance difference between adaptive and uniform resource allocation strategies, the system throughput of different allocation schemes under various channel conditions is analyzed. First, it is demonstrated that adaptive power allocation over
OFDM sub-carriers at the transmitter achieves very little gain in terms of throughput over a uniform power distribution scheme. Theoretical analysis is then provided of the throughput increase of adaptive-rate schemes compared with fixed-rate schemes under various situations. Two practical OFDM systems implementing rate-compatible-punctured-turbo-code-based (RCPT-based) hybrid automatic-repeat-request (Hybrid-ARQ) and redundancy incremental Hybrid-ARQ protocols are also provided to verify the analytical results.
|
6 |
Source and channel aware resource allocation for wireless networksJose, Jubin 21 October 2011 (has links)
Wireless networks promise ubiquitous communication, and thus facilitate an array of applications that positively impact human life. At a fundamental level, these networks deal with compression and transmission of sources over channels. Thus, accomplishing this task efficiently is the primary challenge shared by these applications. In practice, sources include data and video while channels include interference and relay networks. Hence, effective source and channel aware resource allocation for these scenarios would result in a comprehensive solution applicable to real-world networks.
This dissertation studies the problem of source and channel aware resource allocation in certain scenarios. A framework for network resource allocation that stems from rate-distortion theory is presented. Then, an optimal decomposition into an application-layer compression control, a transport-layer congestion control and a network-layer scheduling is obtained. After deducing insights into compression and congestion control, the scheduling problem is explored in two cross-layer scenarios. First, appropriate queue architecture for cooperative relay networks is presented, and throughput-optimality of network algorithms that do not assume channel-fading and input-queue distributions are established. Second, decentralized algorithms that perform rate allocation, which achieve the same overall throughput region as optimal centralized algorithms, are derived.
In network optimization, an underlying throughput region is assumed. Hence, improving this throughput region is the next logical step. This dissertation addresses this problem in the context of three significant classes of interference networks. First, degraded networks that capture highly correlated channels are explored, and the exact sum capacity of these networks is established. Next, multiple antenna networks in the presence of channel uncertainty are considered. For these networks, robust optimization problems that result from linear precoding are investigated, and efficient iterative algorithms are derived. Last, multi-cell time-division-duplex systems are studied in the context of corrupted channel estimates, and an efficient linear precoding to manage interference is developed. / text
|
7 |
Control over Low-Rate Noisy ChannelsBao, Lei January 2009 (has links)
Networked embedded control systems are present almost everywhere. A recent trendis to introduce radio communication in these systems to increase mobility and flex-ibility. Network nodes, such as the sensors, are often simple devices with limitedcomputing and transmission power and low storage capacity, so an important prob-lem concerns how to optimize the use of resources to provide sustained overall sys-tem performance. The approach to this problem taken in the thesis is to analyzeand design the communication and control application layers in an integrated man-ner. We focus in particular on cross-layer design techniques for closed-loop controlover non-ideal communication channels, motivated by future control systems withvery low-rate and highly quantized sensor communication over noisy links. Severalfundamental problems in the design of source–channel coding and optimal controlfor these systems are discussed.The thesis consists of three parts. The first and main part is devoted to the jointdesign of the coding and control for linear plants, whose state feedback is trans-mitted over a finite-rate noisy channel. The system performance is measured by afinite-horizon linear quadratic cost. We discuss equivalence and separation proper-ties of the system, and conclude that although certainty equivalence does not holdin general it can still be utilized, under certain conditions, to simplify the overalldesign by separating the estimation and the control problems. An iterative opti-mization algorithm for training the encoder–controller pairs, taking channel errorsinto account in the quantizer design, is proposed. Monte Carlo simulations demon-strate promising improvements in performance compared to traditional approaches.In the second part of the thesis, we study the rate allocation problem for statefeedback control of a linear plant over a noisy channel. Optimizing a time-varyingcommunication rate, subject to a maximum average-rate constraint, can be viewedas a method to overcome the limited bandwidth and energy resources and to achievebetter overall performance. The basic idea is to allow the sensor and the controllerto communicate with a higher data rate when it is required. One general obstacle ofoptimal rate allocation is that it often leads to a non-convex and non-linear problem.We deal with this challenge by using high-rate theory and Lagrange duality. It isshown that the proposed method gives a good performance compared to some otherrate allocation schemes.In the third part, encoder–controller design for Gaussian channels is addressed.Optimizing for the Gaussian channel increases the controller complexity substan-tially because the channel output alphabet is now infinite. We show that an efficientcontroller can be implemented using Hadamard techniques. Thereafter, we proposea practical controller that makes use of both soft and hard channel outputs. / QC 20100623
|
8 |
Stochastic Control of Time-varying Wireless NetworksLotfinezhad, Mahdi 19 February 2010 (has links)
One critical step to successfully integrate wireless data networks to the high-speed wired backbone is the design of network control policies that efficiently utilize resources to provide Quality of Service (QoS) to the users in the integrated networks. Such a design has remained a challenge since wireless networks are time-varying in nature, not only in terms of user/packet arrivals but also in terms of physical channel conditions and access opportunities. In this thesis, we study the stochastic control of time-varying networks to design efficient scheduling and resource allocation policies.
In particular, in Chapter 3, we focus on a broad class of control policies that work based on a pick-and-compare principle for networks with time-varying channels. By trading the throughput for complexity and memory requirement, these policies require less complexity compared to the well-investigated throughput-optimal Generalized Maximum Weight Matching (GMWM) policy and also require only linear-memory storage with the number of data-flows. Through Lyapunov analysis tools, we characterize the stability region and delay performance of the studied policies and show how they vary in response to the channel variations.
In Chapter 4, we go into further detail and consider the problem of network control from a new perspective through which we carefully incorporate the time-efficiency of underlying scheduling algorithms. Specifically, we develop a policy that dynamically adjusts the time given to the available scheduling algorithms according to queue-backlog and channel correlations. We study the resulting stability region of developed policy and show that the region is at least as large as the one for any static policy.
Finally, motivated by the current under-utilization of wireless spectrum, in Chapter 5, we investigate the control of cognitive radio networks as a special example of networks that provide time-varying access opportunities. We assume that users dynamically join and leave the network and may have different utility functions, or could collaborate for a common purpose. We develop a policy that performs joint admission and resource control and works for any user load, either inside or outside the capacity region. Through Lyapunov Optimization techniques, we show that the developed policy can achieve a utility performance arbitrarily close to the optimality with a tradeoff in the average service delay of admitted users.
|
9 |
Precoding and Resource Allocation for Multi-user Multi-antenna Broadband Wireless SystemsKhanafer, Ali 06 January 2011 (has links)
This thesis is targeted at precoding methods and resource allocation for the downlink of
fixed multi-user multi-antenna broadband wireless systems. We explore different utilizations
of precoders in transmission over frequency-selective channels. We first consider
the weighted sum-rate (WSR) maximization problem for multi-carrier systems using
linear precoding and propose a low complexity algorithm which exhibits near-optimal
performance. Moreover, we offer a novel rate allocation method that utilizes the signalto-
noise-ratio (SNR) gap to capacity concept to choose the rates to allocate to each
data stream. We then study a single-carrier transmission scheme that overcomes known
impairments associated with multi-carrier systems. The proposed scheme utilizes timereversal
space-time block coding (TR-STBC) to orthogonalize the downlink receivers and
performs the required pre-equalization using Tomlinson-Harashima precoding (THP).We
finally discuss the strengths and weaknesses of the proposed method.
|
10 |
Precoding and Resource Allocation for Multi-user Multi-antenna Broadband Wireless SystemsKhanafer, Ali 06 January 2011 (has links)
This thesis is targeted at precoding methods and resource allocation for the downlink of
fixed multi-user multi-antenna broadband wireless systems. We explore different utilizations
of precoders in transmission over frequency-selective channels. We first consider
the weighted sum-rate (WSR) maximization problem for multi-carrier systems using
linear precoding and propose a low complexity algorithm which exhibits near-optimal
performance. Moreover, we offer a novel rate allocation method that utilizes the signalto-
noise-ratio (SNR) gap to capacity concept to choose the rates to allocate to each
data stream. We then study a single-carrier transmission scheme that overcomes known
impairments associated with multi-carrier systems. The proposed scheme utilizes timereversal
space-time block coding (TR-STBC) to orthogonalize the downlink receivers and
performs the required pre-equalization using Tomlinson-Harashima precoding (THP).We
finally discuss the strengths and weaknesses of the proposed method.
|
Page generated in 0.1103 seconds