G. de Veciana

Transmission capacity of wireless ad hoc networks with outage constraints

In this paper, upper and lower bounds on the transmission capacity of spread-spectrum (SS) wireless ad hoc networks are derived. We define transmission capacity as the product of the maximum density of successful transmissions multiplied by their data rate, given an outage constraint. Assuming that the nodes are randomly distributed in space according to a Poisson point process, we derive upper and lower bounds for frequency hopping (FH-CDMA) and direct sequence (DS-CDMA) SS networks, which incorporate traditional modulation types (no spreading) as a special case. These bounds cleanly summarize how ad hoc network capacity is affected by the outage probability, spreading factor, transmission power, target signal-to-noise ratio (SNR), and other system parameters. Using these bounds, it can be shown that FH-CDMA obtains a higher transmission capacity than DS-CDMA on the order of M/sup 1-2//spl alpha//, where M is the spreading factor and /spl alpha/>2 is the path loss exponent. A tangential contribution is an (apparently) novel technique for obtaining tight bounds on tail probabilities of additive functionals of homogeneous Poisson point processes.

Transmission Capacity of Wireless Ad Hoc Networks With Successive Interference Cancellation

The transmission capacity (TC) of a wireless ad hoc network is defined as the maximum spatial intensity of successful transmissions such that the outage probability does not exceed some specified threshold. This work studies the improvement in TC obtainable with successive interference cancellation (SIC), an important receiver technique that has been shown to achieve the capacity of several classes of multiuser channels, but has not been carefully evaluated in the context of ad hoc wireless networks. This paper develops closed-form upper bounds and easily computable lower bounds for the TC of ad hoc networks with SIC receivers, for both perfect and imperfect SIC. The analysis applies to any multiuser receiver that cancels the K strongest interfering signals by a factor z isin [0, 1]. In addition to providing the first closed-form capacity results for SIC in ad hoc networks, design-relevant insights are made possible. In particular, it is shown that SIC should be used with direct sequence spread spectrum. Also, any imperfections in the interference cancellation rapidly degrade its usefulness. More encouragingly, only a few - often just one - interfering nodes need to be canceled in order to get the vast majority of the available performance gain.

Video Quality Assessment on Mobile Devices: Subjective, Behavioral and Objective Studies

We introduce a new video quality database that models video distortions in heavily-trafficked wireless networks and that contains measurements of human subjective impressions of the quality of videos. The new LIVE Mobile Video Quality Assessment (VQA) database consists of 200 distorted videos created from 10 RAW HD reference videos, obtained using a RED ONE digital cinematographic camera. While the LIVE Mobile VQA database includes distortions that have been previously studied such as compression and wireless packet-loss, it also incorporates dynamically varying distortions that change as a function of time, such as frame-freezes and temporally varying compression rates. In this article, we describe the construction of the database and detail the human study that was performed on mobile phones and tablets in order to gauge the human perception of quality on mobile devices. The subjective study portion of the database includes both the differential mean opinion scores (DMOS) computed from the ratings that the subjects provided at the end of each video clip, as well as the continuous temporal scores that the subjects recorded as they viewed the video. The study involved over 50 subjects and resulted in 5,300 summary subjective scores and time-sampled subjective traces of quality. In the behavioral portion of the article we analyze human opinion using statistical techniques, and also study a variety of models of temporal pooling that may reflect strategies that the subjects used to make the final decision on video quality. Further, we compare the quality ratings obtained from the tablet and the mobile phone studies in order to study the impact of these different display modes on quality. We also evaluate several objective image and video quality assessment (IQA/VQA) algorithms with regards to their efficacy in predicting visual quality. A detailed correlation analysis and statistical hypothesis testing is carried out. Our general conclusion is that existing VQA algorithms are not well-equipped to handle distortions that vary over time. The LIVE Mobile VQA database, along with the subject DMOS and the continuous temporal scores is being made available to researchers in the field of VQA at no cost in order to further research in the area of video quality assessment.

Resource management in wide-area ATM networks using effective bandwidths

This paper is principally concerned with resource allocation for connections tolerating statistical quality of service (QoS) guarantees in a public wide-area ATM network. Our aim is to sketch a framework, based on effective bandwidths, for call admission schemes that are sensitive to individual QoS requirements and account for statistical multiplexing. Results approximating the effective bandwidth required by heterogeneous streams sharing buffered links, including results for the packetized generalized processor sharing service discipline, are described. Extensions to networks follow via the concept of decoupling bandwidths, motivated by a study of the input-output properties of queues. Based on these results we claim that networks with sufficient routing diversity will inherently satisfy nodal decoupling. We then discuss on-line methods for estimating the effective bandwidth of connection. Using this type of traffic monitoring we propose an approach to usage parameter control (i.e., policing) for effective bandwidth descriptors. Finally, we suggest how on-line monitoring might be combined with admission control to exploit unknown statistical multiplexing gains and thus increase utilization. >

Effective bandwidths: Call admission, traffic policing and filtering for ATM networks

In this paper we review and extend the effective bandwidth results of Kelly [28], and Kesidis, Walrand and Chang [29, 6]. These results provide a framework for call admission schemes which are sensitive to constraints on the mean delay or the tail distribution of the workload in buffered queues. We present results which are valid for a wide variety of traffic streams and discuss their applicability for traffic management in ATM networks. We discuss the impact of traffic policing schemes, such as thresholding and filtering, on the effective bandwidth of sources. Finally we discuss effective bandwidth results for Brownian traffic models for which explicit results reveal the interaction arising in finite buffers.

Dynamic Association for Load Balancing and Interference Avoidance in Multi-cell Networks

Next-generation cellular networks will provide higher cell capacity by adopting advanced physical layer techniques and broader bandwidth. Even in such networks, boundary users would suffer from low throughput due to severe intercell interference and unbalanced user distributions among cells, unless additional schemes to mitigate this problem are employed. In this paper, we tackle this problem by jointly optimizing partial frequency reuse and load-balancing schemes in a multicell network. We formulate this problem as a network-wide utility maximization problem and propose optimal offline and practical online algorithms to solve this. Our online algorithm turns out to be a simple mixture of inter- and intra-cell handover mechanisms for existing users and user association control and cell-site selection mechanisms for newly arriving users. A remarkable feature of the proposed algorithm is that it uses a notion of expected throughput as the decision making metric, as opposed to signal strength in conventional systems. Extensive simulations demonstrate that our online algorithm can not only closely approximate network-wide proportional fairness but also provide two types of gain, interference avoidance gain and load balancing gain, which yield 20~100% throughput improvement of boundary users (depending on traffic load distribution), while not penalizing total system throughput.We also demonstrate that this improvement cannot be achieved by conventional systems using universal frequency reuse and signal strength as the decision making metric.

A paradigm for quality-of-service in wireless ad hoc networks using synchronous signaling and node states

Most limitations in mechanisms geared at achieving quality-of-service (QoS) in wireless ad hoc networking can be traced to solutions based on mapping wireless networks to a wireline paradigm of nodes and links. We contend that this paradigm is not appropriate since links are not physical entities and do not accurately represent the radio frequency (RF) media. Using the link abstraction makes arbitration of the use of the RF media cumbersome leaving only overprovisioning techniques to deliver QoS. In this paper, we argue that an appropriate paradigm should match the physics of the network. The critical resource is electromagnetic spectrum in a space; in turn, this results in a complex paradigm since the part of the spectrum-space that each node wants to use is unique to that node and its destination and will overlap with parts that other nodes may want to use creating interdependences among nodes. This paper describes protocol approaches for access and routing that seek solutions within this wireless paradigm. Access is arbitrated using synchronous signaling and topology is resolved through the dissemination of node states. This approach provides an intuitive framework that provides mechanisms that can be exploited to arbitrate RF media use and implement traffic engineering techniques to deliver QoS. Our proposed approach provides a novel way of tracking the state of the network that can serve as a unified state dissemination mechanism to simultaneously support routing, multicasting, and most QoS heuristics.

Design challenges for new application specific processors

Embedded systems form a market that is already larger and growing more rapidly than that of general-purpose computers. In fact, real-time multimedia and signal processing embedded applications currently account for over 90% of all computer cycles. This article discusses challenges in developing retargetable compilers and synthesis tools for application-specific processor cores targeted at embedded portable digital communications and multimedia systems.

Explicit rate flow control for ABR services in ATM networks

We propose a novel explicit rate flow control algorithm intended for available-bit-rate (ABR) service on an ATM network subject to loss and fairness constraints. The goal is to guarantee low cell loss in order to avoid throughput collapse due to retransmission by higher level protocols. The mechanism draws on measuring the current queue length and bandwidth availability, as well as tracking the current number of active sessions contending for capacity, to adjust an explicit bound on the source transmission rates. We identify the factors that affect queue overflows and propose simple design rules aimed at achieving transmission with controlled loss in a dynamic environment. We also discuss how conservative design rules might be relaxed by accounting for statistical multiplexing in bandwidth sharing among bursty ABR sources and variable-bit-rate (VBR) sources.

Interference Shaping for Improved Quality of Experience for Real-Time Video Streaming

The unpredictability of the wireless medium poses a major challenge to delivering a high quality of experience (QoE) for real-time video services. Bursty co-channel interference is a prominent cause of wireless throughput variability, which leads to video QoE degradation, even for a fixed average channel quality. In this paper, we propose and analyze a network-level resource management algorithm termed interference shaping to smooth out the throughput variations (and hence improve the QoE) of video users by decreasing the peak rate of co-channel best effort users. Wireless link capacity variations are mapped to the real-time video packet loss rate, and the interference shaping QoE gain for video users is quantified by benchmarking against a modified multi-scale structural similarity (H-MS-SSIM) index. H-MS-SSIM is an accurate perceptual video quality metric that incorporates the important hysteresis effect whereby the current QoE (which is subjective) may strongly depend on the recent past. The proposed technique increases mean QoE and reduces the QoE variability over time, with a net perceptual increase of about 2-3x in illustrative settings while incurring insignificant decrease in the QoE for co-channel best effort users. Interference shaping can be implemented in both unicast and multicast real-time video streaming with much higher potential gains for multicast.