9 research outputs found
Video Smoothing of Aggregates of Streams with Bandwidth Constraints
Compressed variable bit rate (VBR) video transmission is acquiring a growing importance in the telecommunication world. High data rate variability of compressed video over multiple time scales makes an efficient bandwidth resource utilization difficult to obtain. One of the approaches developed to face this problem are smoothing techniques. Various smoothing algorithms that exploit client buffers have been proposed, thus reducing the peak rate and high rate variability by efficiently scheduling the video data to be transmitted over the network. The novel smoothing algorithm proposed in this paper, which represents a significant improvements over the existing methods, performs data scheduling both for a single stream and for stream aggregations, by taking into account available bandwidth constraints. It modifies, whenever possible, the smoothing schedule in such a way as to eliminate frame losses due to available bandwidth limitations. This technique can be applied to any smoothing algorithm already present in literature and can be usefully exploited to minimize losses in multiplexed stream scenarios, like Terrestrial Digital Video Broadcasting (DVB-T), where a specific known available bandwidth must be shared by several multimedia flows. The developed algorithm has been exploited for smoothing stored video, although it can also be quite easily adapted for real time smoothing. The obtained numerical results, compared with the MVBA, another smoothing algorithm that is already presented and discussed in literature, show the effectiveness of the proposed algorithm, in terms of lost video frames, for different multiplexed scenarios
Resource Allocation in Relay Enhanced Broadband Wireless Access Networks
The use of relay nodes to improve the performance of broadband wireless access (BWA) networks has been the subject of intense research activities in recent years. Relay enhanced BWA networks are anticipated to support multimedia traffic (i.e., voice,
video, and data traffic). In order to guarantee service to network users, efficient resource distribution is imperative. Wireless multihop networks are characterized by two inherent dynamic characteristics: 1) the existence of wireless interference and 2) mobility of user nodes. Both mobility and interference greatly influence the ability of users to obtain the necessary resources for service. In this dissertation we conduct a comprehensive research study on the topic of resource allocation in the presence of interference and mobility. Specifically, this dissertation investigates the impact interference and mobility have on various aspects of resource allocation, ranging from fairness to spectrum utilization. We study four important resource allocation algorithms for relay enhanced BWA networks. The problems and our research achievements are briefly outlined as follows.
First, we propose an interference aware rate adaptive subcarrier and power allocation
algorithm using maximum multicommodity
flow optimization. We consider the impact of
the wireless interference constraints using Signal to Interference Noise Ratio (SINR). We
exploit spatial reuse to allocate subcarriers in the network and show that an intelligent
reuse of resources can improve throughput while mitigating the impact of interference.
We provide a sub-optimal heuristic to solve the rate adaptive resource allocation problem. We demonstrate that aggressive spatial reuse and fine tuned-interference modeling garner advantages in terms of throughput, end-to-end delay and power distribution.
Second, we investigate the benefits of decoupled optimization of interference aware
routing and scheduling using SINR and spatial reuse to improve the overall achievable
throughput. We model the routing optimization problem as a linear program using maximum concurrent flows. We develop an optimization formulation to schedule the link traffic such that interference is mitigated and time slots are reused appropriately based on spatial TDMA (STDMA). The scheduling problem is shown to be NP-hard and is solved using the column generation technique. We compare our formulations to conventional counterparts in the literature and show that our approach guarantees higher throughput by mitigating the effect of interference effectively.
Third, we investigate the problem of multipath flow routing and fair bandwidth allocation under interference constraints for multihop wireless networks. We first develop a novel isotonic routing metric, RI3M, considering the influence of interflow and intraflow interference. Second, in order to ensure QoS, an interference-aware max-min fair bandwidth allocation algorithm, LMX:M3F, is proposed where the lexicographically largest bandwidth allocation vector is found among all optimal allocation vectors while considering constraints of interference on the flows. We compare with various interference based routing metrics and interference aware bandwidth allocation algorithms established in the literature to show that RI3M and LMX:M3F succeed in improving network performance in terms of delay, packet loss ratio and bandwidth usage.
Lastly, we develop a user mobility prediction model using the Hidden Markov Model(HMM) in which prediction control is transferred to the various fixed relay nodes in the
network. Given the HMM prediction model, we develop a routing protocol which uses
the location information of the mobile user to determine the interference level on links
in its surrounding neighborhood. We use SINR as the routing metric to calculate the
interference on a specific link (link cost). We minimize the total cost of routing as a
cost function of SINR while guaranteeing that the load on each link does not exceed
its capacity. The routing protocol is formulated and solved as a minimum cost
flow optimization problem. We compare our SINR based routing algorithm with conventional counterparts in the literature and show that our algorithm reinforces routing paths with high link quality and low latency, therefore improving overall system throughput.
The research solutions obtained in this dissertation improve the service reliability and QoS assurance of emerging BWA networks
Recommended from our members
Signal Processing in Wireless Communications: Device Fingerprinting and Wide-Band Interference Rejection
The rapid progress of wireless communication technologies that has taken place in recent years has significantly improved the quality of everyday life. However with this expansion of wireless communication systems come significant security threats and significant technological challenges, both of which are due to the fact that the communication medium is shared. The ubiquity of open wireless Internet access networks creates a new avenue for cyber-criminals to impersonate and act in an unauthorized way. The increasing number of deployed wide-band wireless communication systems entails technological challenges for effective utilization of the shared medium, which implies the need for advanced interference rejection methods. Wireless security and interference rejection in wide-band wireless communications are therefore often considered as the two main challenges in wireless network\u27s design and research. Important aspects of these challenges are illuminated and addressed in this dissertation.
This dissertation considers signal processing approaches for exploiting or mitigating the effects of non-ideal components in wireless communication systems. In the first part of the dissertation, we introduce and study a novel, model-based approach to wireless device identification that exploits imperfections in the transmitter caused by manufacturing process nonidealities. Previous approaches to device identification based on hardware imperfections vary from transient analysis to machine learning but have not provided verifiable accuracy. Here, we detail a model-based approach, that uses statistical models of RF transmitter components: digital-to-analog converter, power amplifier and RF oscillator, which are amenable for analysis. Our proposed approach examines the key device characteristics that cause anonymity loss, countermeasures that can be applied by the nodes to regain the anonymity, and ways of thwarting such countermeasures. We develop identification algorithms based on statistical signal processing methods and address the challenging scenario when the units that need to be distinguished from one another are of the same model and from the same manufacturer. Using simulations and measurements of components that are commonly used in commercial communications systems, we show that our anonymity breaking techniques are effective.
In the second part of the dissertation, we consider innovative approaches for the acquisition of frequency-sparse signals with wide-band receivers when a weak signal of interest is received in the presence of a very strong interference, and the effects of the nonlinearities in the low-noise amplifier at the receiver must be mitigated. All samples with amplitude above a given threshold, dictated by the linear input range of the receiver, are discarded to avoid the distortion caused by saturation of the low noise amplifier. Such a sampling scheme, while avoiding nonlinear distortion that cannot be corrected in the digital domain, poses challenges for signal reconstruction techniques, as the samples are taken non-uniformly, but also non-randomly. The considered approaches fall into the field of compressive sensing (CS); however, what differentiates them from conventional CS is that a structure is forced upon the measurement scheme. Such a structure causes a violation of the core CS assumption of the measurements\u27 randomness. We consider two different types of structured acquisition: signal independent and signal dependent structured acquisition. For the first case, we derive bounds on the number of samples needed for successful CS recovery when samples are drawn at random in predefined groups. For the second case, we consider enhancements of CS recovery methods when only small-amplitude samples of the signal that needs to be recovered are available for the recovery. Finally, we address a problem of spectral leakage due to the limited processing block size of block processing, wide-band receivers and propose an adaptive block size adjustment method, which leads to significant dynamic range improvements
Lexicographically Optimal Smoothing for Broadband Traffic Multiplexing
We investigate the problem of smoothing multiplexed network trac, when either a streaming server transmits data to multiple clients, or a server accesses data from multiple storage devices or other servers. We introduce ecient algorithms for lexicographically optimally smoothing the aggregate bandwidth requirements over a shared network link. In the data transmission problem, we consider the case in which the clients have dierent buer capacities but no bandwidth constraints, or no buer capacities but dierent bandwidth constraints. For the data access problem, we handle the general case of a shared buer capacity and individual network bandwidth constraints. Previous approaches in the literature for the data access problem handled either the case of only a single stream or did not compute the lexicographically optimal schedule
Lexicographically Optimal Smoothing for Broadband Traffic Multiplexing
We investigate the problem of smoothing multiplexed network traffic, when either a streaming server transmits data to multiple clients, or a server accesses data from multiple storage devices or other servers. We introduce efficient algorithms for lexicographically optimally smoothing the aggregate bandwidth requirements over a shared network link. In the data transmission problem, we consider the case in which the clients have different buffer capacities but no bandwidth constraints, or no buffer capacities but different bandwidth constraints. For the data access problem, we handle the general case of a shared buffer capacity and individual network bandwidth constraints. Previous approaches in the literature for the data access problem handled either the case of only a single stream or did not compute the lexicographically optimal schedule. Lexicographically optimal smoothing (lexopt smoothing) has several advantages. By provably minimizing the variance of the required aggregate bandwidth, maximum resource requirements within the network become more predictable, and useful resource utilization increases. Fairness in shar