Further Properties of Wireless Channel Capacity
Yuming Jiang2015, arXiv (Cornell University)
Sign up for access to the world's latest research
checkGet notified about relevant papers
checkSave papers to use in your research
checkJoin the discussion with peers
checkTrack your impact
Abstract
Future wireless communication calls for exploration of more efficient use of wireless channel capacity to meet the increasing demand on higher data rate and less latency. However, while the ergodic capacity and instantaneous capacity of a wireless channel have been extensively studied, they are in many cases not sufficient for use in assessing if data transmission over the channel meets the quality of service (QoS) requirements. To address this limitation, we advocate a set of wireless channel capacity concepts, namely "cumulative capacity", "maximum cumulative capacity", "minimum cumulative capacity", and "range of cumulative capacity", and for each, study its properties by taking into consideration the impact of the underlying dependence structure of the corresponding stochastic process. Specifically, their cumulative distribution function (CDFs) are investigated extensively, where copula is adopted to express the dependence structures. Results considering both generic and specific dependence structures are derived. In particular, in addition to i.i.d., a specially investigated dependence structure is comonotonicity, i.e, the time series of wireless channel capacity are increasing functions of a common random variable. Appealingly, copula can serve as a unifying technique for obtaining results under various dependence assumptions, e.g. i.i.d. and Markov dependence, which are widely seen in stochastic network calculus. Moreover, some other characterizations of cumulative capacity are also studied, including moment generating function, Mellin transform, and stochastic service curve. With these properties, we believe QoS assessment of data transmission over the channel can be further performed, e.g. by applying analytical techniques and results of the stochastic network calculus theory.
Related papers
A Statistical Property of Wireless Channel Capacity: Theory and Application
ACM SIGMETRICS Performance Evaluation Review, 2018
This paper presents a set of new results on wireless channel capacity by exploring its special characteristics. An appealing discovery is that the instantaneous and cumulative capacity distributions of typical fading channels are lighttailed. An implication of this property is that these distributions and subsequently the distributions of delay and backlog for constant arrivals can be upper-bounded by some exponential functions, which is often assumed but not justified in the literature of wireless network performance analysis. In addition, three representative dependence structures of the capacity process are studied, namely comonotonicity, independence, and Markovian, and bounds are derived for the cumulative capacity distribution and delay-constrained capacity. To help gain insights in the performance of a wireless channel whose capacity process may be too complex or detailed dependence information is lacking, stochastic orders are introduced to the capacity process, based on whi...
Stochastic Dependence in Wireless Channel Capacity: A Hidden Resource
2017
This paper dedicates to exploring and exploiting the hidden resource in wireless channel. We discover that the stochastic dependence in wireless channel capacity is a hidden resource, specifically, if the wireless channel capacity bears negative dependence, the wireless channel attains a better performance with a smaller capacity. We find that the dependence in wireless channel is determined by both uncontrollable and controllable parameters in the wireless system, by inducing negative dependence through the controllable parameters, we achieve dependence control. We model the wireless channel capacity as a Markov additive process, i.e., an additive process defined on a Markov process, and we use copula to represent the dependence structure of the underlying Markov process. Based on a priori information of the temporal dependence of the uncontrollable parameters and the spatial dependence between the uncontrollable and controllable parameters, we construct a sequence of temporal copu...
An Analytical Model for Wireless Networks with Stochastic Capacity
2007
In wireless networks, the system capacity can vary unpre- dictably with time, due to mobility of users and dynamic channel assignment protocols. This variation in capacity with time, known as 'stochastic capacity', can have a major impact on the performance measures such as call blocking probabil- ity and queueing delay, of the wireless networks. The depen- dence of the stochastic
Towards a Calculus for Wireless Networks
2017
This paper presents a set of new results directly exploring the special characteristics of the wireless channel capacity process. An appealing finding is that, for typical fading channels, their instantaneous capacity and cumulative capacity are both light-tailed. A direct implication of this finding is that the cumulative capacity and subsequently the delay and backlog performance can be upper-bounded by some exponential distributions, which is often assumed but not justified in the wireless network performance analysis literature. In addition, various bounds are derived for distributions of the cumulative capacity and the delay-constrained capacity, considering three representative dependence structures in the capacity process, namely comonotonicity, independence, and Markovian. To help gain insights in the performance of a wireless channel whose capacity process may be too complex or detailed information is lacking, stochastic orders are introduced to the capacity process, based ...
A Hidden Resource in Wireless Channel Capacity: Dependence Control in Action
2018
This paper aims to initiate the research on dependence control, which transforms the dependence structure of a stochastic process in the system through dependence manipulation, to improve the system performance. Specifically, we develop a dependence control theory for wireless channels, focusing on three principles in dependence control: (i) the asymptotic decay rates of delay and backlog in the system are the measures for dependence comparison and ordering, (ii) the dependence in the arrival process and the service process have a dual potency to influence the system performance, and (iii) the manipulation of the dependence in the free dimensions of the arrival or service process transforms the dependence structure of the arrival or service process. In addition, we apply the theory to the Markov additive process, which is a general model for a class of arrival processes and a versatile model for wireless channel capacity, and derive a set of results for various performance measures,...
Outage, Local Throughput, and Capacity of Random Wireless Networks
IEEE Transactions on Wireless Communications, 2009
Outage probabilities and single-hop throughput are two important performance metrics that have been evaluated for certain specific types of wireless networks. However, there is a lack of comprehensive results for larger classes of networks, and there is no systematic approach that permits the convenient comparison of the performance of networks with different geometries and levels of randomness.
Network Connectivity: Stochastic vs. Deterministic Wireless Channels
—We study the effect of stochastic wireless channel models on the connectivity of ad hoc networks. Unlike in the deterministic geometric disk model where nodes connect if they are within a certain distance from each other, stochastic models attempt to capture small-scale fading effects due to shadowing and multipath received signals. Through analysis of local and global network observables, we present conclusive evidence suggesting that network behaviour is highly dependent upon whether a stochastic or deterministic connection model is employed. Specifically we show that the network mean degree is lower (higher) for stochastic wireless channels than for deterministic ones, if the path loss exponent is greater (lesser) than the spatial dimension. Similarly, the probability of forming isolated pairs of nodes in an otherwise dense random network is much less for stochastic wireless channels than for deterministic ones. The latter realisation explains why the upper bound of k-connectivity is tighter for stochastic wireless channels. We obtain closed form analytic results and compare to extensive numerical simulations.
Probability Distributions for Channel Utilisation
Lecture Notes in Computer Science, 2005
Sensor nets have many undisputed fields of application. A paradigm of communication is the use of one control channel in the MAC layer. We challenge this paradigm for nodes with very restricted hardware resources. In our model nodes support the use of different channels and use clock synchronisation. We present a simple probabilistic synchronised channel utilisation scheme for wireless communication. The main features are its simplicity, robustness against radio interference, the high throughput caused by less interfering signals, and predictable energy consumption. For this, the channel selection is based on a carefully chosen probability distribution maximising the expected number of successfully delivered packets up to a constant factor. Combined with a standard synchronisation scheme it provides a novel energyefficient, robust, and fast message delivery service for sensor networks where data gathering is not available due to memory restrictions.
Reuse efficiency of wireless access networks under physical carrier sense: A Markovian analysis
Journal of Parallel and Distributed Computing, 2011
The setting of the physical carrier sense is critical in wireless networks, since it often has to account for contrasting objectives like limiting the overall interference while ensuring high concurrency among wireless transmissions. This paper proposes an analytical approach for evaluating the impact of carrier sense setting on the throughput efficiency of wireless access networks. A time continuous Markov chain is used to describe the system, and to further gathering performance measures in terms of throughput and collision probability. Numerical results obtained through the model and further validated against simulations are used to derive qualitative dimensioning criteria for the carrier sense under different network conditions.
Wireless Fading Channel Models: from Classical to Stochastic Differential Equations
Stochastic Control, 2010
Stochastic Control 300 (DPSD). Aulin [11] presented a methodology to find the Doppler power spectrum by computing the Fourier transform of the autocorrelation function of the channel impulse response with respect to time. A different approach, leading to the same Doppler power spectrum relation was presented by Gans [13]. These STF models suggest various distributions for the received signal amplitude such as Rayleigh, Rician, or Nakagami. Models based on autoregressive and moving averages (AR) are proposed in [14, 15]. However, these models assume that the channel state is completely observable, which in reality is not the case due to additive noise, and requires long observation intervals. First order Markov models for Raleigh fading have been proposed in [16, 17], and the usefulness of a finite-state Markov channel model is argued in [18]. Mobile-to-mobile (or ad hoc) wireless networks comprise nodes that freely and dynamically self-organize into arbitrary and/or temporary network topology without any fixed infrastructure support [19]. They require direct communication between a mobile transmitter and a mobile receiver over a wireless medium. Such mobile-to-mobile communication systems differ from the conventional cellular systems, where one terminal, the base station, is stationary, and only the mobile station is moving. As a consequence, the statistical properties of mobile-to-mobile links are different from cellular ones [20, 21]. Copious ad hoc networking research exists on layers in the open system interconnection (OSI) model above the physical layer. However, neglecting the physical layer while modeling wireless environment is error prone and should be considered more carefully [22]. The experimental results in [23] show that the factors at the physical layer not only affect the absolute performance of a protocol, but because their impact on different protocols is nonuniform, it can even change the relative ranking among protocols for the same scenario. The importance of the physical layer is demonstrated in [24] by evaluating the Medium Access Control (MAC) performance. Most of the research conducted on wireless channel modeling, such as [1-4, 25, 26], deals mainly with deterministic wireless channel models. In these models, the speeds of the nodes are assumed to be constant and the statistical characteristics of the received signal are assumed to be fixed with time. But in reality, the propagation environment varies continuously due to mobility of the nodes at variable speeds and movement of objects or scatter across transmitters and receivers resulting in appearance or disappearance of existing paths from one instant to the next. As a result, the current models that assume fixed statistics are unable to capture and track complex time variations in the propagation environment. These time variations compel us to introduce more advanced dynamical models based on stochastic differential equations (SDEs), in order to capture higher order dynamics of the wireless channels. The random variables characterizing the instantaneous power in static (deterministic) channel models are generalized to dynamical (stochastic) models including random processes with time-varying statistics [27-31]. The advantage of using SDE methods is due to computational simplicity simply because estimation and identification can be performed recursively and in real time. Parts of the results appearing in this chapter were presented in [27-31]. This chapter is organized as follows. In Section 2, the general time-varying (TV) wireless channel impulse response is introduced. The TV stochastic LTF, STF, and ad hoc wireless channel models are discussed in Sections 3, 4, and 5, respectively. Link performance for cellular and ad hoc channels is presented in Section 6. Finally, Section 7 provides the conclusion.
Related topics
Related papers
Stochastic Performance Analysis of a Wireless Finite-State Markov Channel
IEEE Transactions on Wireless Communications, 2000
Wireless networks, as an indispensable part of the Internet, are expected to support diverse quality of service requirements and traffic characteristics. This paper presents stochastic performance analysis of a wireless network with finite-state Markov channel (FSMC). The analysis is based on stochastic network calculus. Specifically, the analytical principle behind stochastic network calculus is first presented. Then, based on this principle, delay and backlog upper bounds are derived. Both the single user case and the multi-user case are considered. For the multi-user case, two channel sharing methods among eligible users are studied, which are the even sharing method and the exclusive use method. In the former, the channel service rate is evenly divided among eligible users; in the latter, it is exclusively used by a user randomly selected from the eligible users. When the even sharing method is studied, the problem that the state space is exponentially increased with the user number is addressed through a novel approach. The essential idea of this approach is to construct a new Markov modulation process from the channel state process. In the new process, the multi-user effects are equivalently reflected by its transition and steady-state probabilities and the state space size is kept unchanged even with the increase of the user number, which significantly reduces the complexity in calculating the obtained backlog and delay bounds. Finally, the proposed analytical principle and methods are validated through comparison between analytical and simulation results.
The Uplink Capacity Evaluation of Wireless Networks: Spectral Analysis Approach
Journal of Computing and Information Technology, 2009
CITATIONS 2 READS 21 5 authors, including:
A wireless channel capacity model for quality of service
IEEE Transactions on Wireless Communications, 2007
A key issue in supporting quality of service (QoS) over wireless networks is to estimate the wireless channel capacity that varies randomly with time and space. In this paper, we propose a new model named effective channel capacity to predict the available channel capacity during any given time interval with the required degree of confidence. By leveraging large deviations techniques, we relate the fading channel capacity with the theory of effective bandwidth and establish a connection between the theory of effective bandwidth and information theory. We derive a set of algorithms and apply them to Nakagami-m fading channels. Consequently, our results provide a foundation for the performance analysis of upper layer algorithms and protocols for QoS provisioning over wireless networks.
Loss performance model for wireless channels with autocorrelated arrivals and losses
Computer Communications, 2006
In this paper we firstly propose simple and computationally efficient wireless channel modeling algorithm that explicitly takes into account firstand second-order statistics of frame error observations. For this purpose we use discrete-time Markov modulated processes with at most single event (error) at any time slot. We then adopt the special solution of the inverse eigenvalue problem initially proposed in [1] and show that its complexity significantly decreases when the time series is covariance stationary binary in nature. Then, we identify a class of priority queuing systems of G+G/GI/1/K type capable to model the frame transmission process over wireless channels with correlated arrival and loss processes. Using the proposed frame error process, performance evaluation model of the wireless channel at the datalink layer is then reduced to the spacial case of i D-BMAP i /D/1/K queuing system with non-preemptive priority discipline. The proposed queuing representation allows to capture forward error correlation (FEC) and automatic * Dmitri Moltchanov, repeat request (ARQ) functionality of the data-link layer as well as distributional and autocorrelational properties of the frame arrival and frame loss processes. This model is further analyzed for a number of performance parameters of interest including probability function of the number of frames in the system and probability function of the number of lost frames. It is shown that the channel response in terms of the mean number of frames in the buffer and the mean number of lost frames varies substantially for different first-and second-order frame error and arrival statistics. This impact of statistics is also different for normal (ρ < 1) and overloaded conditions (ρ ≥ 1) of i D-BMAP i /D/1/K queuing system.
1 Towards a System Theoretic Approach to Wireless Network Capacity in Finite Time and Space
2016
In asymptotic regimes, both in time and space (network size), the derivation of network capacity results is grossly simplified by brushing aside queueing behavior in non-Jackson networks. This simplifying double-limit model, however, lends itself to conservative numerical results in finite regimes. To properly account for queueing behavior beyond a simple calculus based on average rates, we advocate a system theoretic methodology for the capacity problem in finite time and space regimes. This methodology also accounts for spatial correlations arising in networks with CSMA/CA scheduling and it delivers rigorous closed-form capacity results in terms of probability distributions. Unlike numerous existing asymptotic results, subject to anecdotal practical concerns, our transient one can be used in practical settings: for example, to compute the time scales at which multi-hop routing is more advantageous than single-hop routing.
Towards a system theoretic approach to wireless network capacity in finite time and space
IEEE INFOCOM 2014 - IEEE Conference on Computer Communications, 2014
In asymptotic regimes, both in time and space (network size), the derivation of network capacity results is grossly simplified by brushing aside queueing behavior in non-Jackson networks. This simplifying double-limit model, however, lends itself to conservative numerical results in finite regimes. To properly account for queueing behavior beyond a simple calculus based on average rates, we advocate a system theoretic methodology for the capacity problem in finite time and space regimes. This methodology also accounts for spatial correlations arising in networks with CSMA/CA scheduling and it delivers rigorous closed-form capacity results in terms of probability distributions. Unlike numerous existing asymptotic results, subject to anecdotal practical concerns, our transient one can be used in practical settings: for example, to compute the time scales at which multi-hop routing is more advantageous than single-hop routing.
Delay constrained throughput analysis of CDMA using stochastic network calculus
2011 17th IEEE International Conference on Networks, 2011
Code-division multiple-access (CDMA) has the potential to support traffic sources with a wide range of quality of service (QoS) requirements. The traffic carrying capacity of CDMA channels under QoS constraints (such as delay guarantee) is, however, less well-understood. In this work, we propose a method based on stochastic network calculus and large system analysis to quantify the maximum traffic that can be carried by a multiuser CDMA network under the QoS constraints. At the physical layer, we have linear minimum-mean square error receivers and adaptive modulation and coding, while the channel service process is modeled by using a finite-state Markov chain. We study the impact of delay requirements, violation probability and the user load on the traffic carrying capacity under different signal strengths. A key insight provided by the numerical results is as to how much one has to back-off from capacity under the different delay requirements.
A Formula for Successful Transmission Probability in Opportunistic Networks Under Memory-Time Correlated Channel Availability
IEEE Access
Dynamic Spectrum Access (DSA) technology in wireless Cognitive Radio Networks (CRNs) provides opportunistic access for unlicensed users, also known as Secondary Users (SUs), which can offer huge bandwidth to enable future wireless communication. Mainly, this technology aims to improve the endto-end throughput by allowing SUs to exploit the licensed channels only when their licensed users, also known as Primary Users (PUs), are not using them. Most existing communication protocols designed for CRNs are based on the assumption that the channel availability time is considered based on a memoryless distribution for PUs arrivals. Unfortunately, this assumption is impractical because the PU channels' activity and availability are memory-time correlated. Worse yet, designing communication protocols for CRNs under this assumption can result in overestimating the Probability of Success (PoS) for SU packet transmissions, resulting in severe degradation in network performance in realistic scenarios. This paper derives a closed-form formula under memory-time correlation for channel availability that quantifies the PoS for SUs' packet transmission in CRNs. This will empower the network designers to get practical expectations about network efficiency rather than the overestimated PoS. Therefore, this work is also useful for emerging wireless networks with multi-hop routing, such as 5G, 6G, vehicular networks, etc., which incorporate DSA techniques. Our numerical and simulation results demonstrate that the PoS is overestimated in most of the literature due to adopting memoryless-based distribution in modeling channels' availability; such overestimation can impact communication protocol decisions, resulting in severe network performance degradation.
Elusive Statistical Property of Arrival Rate and Holding Time used in Mobile Communication Networks
International Journal of Computer Applications, 2012
This research work is aimed at the study of arrival rate and holding time used in mobile communication networks, also to determine the best suitable statistical probability distribution of both arrival rate and holding time or service time in mobile communication network. The most general acceptable assumption about arrival rate is Poisson distribution and the holding time is exponential distribution in traffic modeling of mobile communication networks. Exhaustive literature review is deployed for details explanation on discrete random variables of arrival rate and continuous holding time use in traffic modeling of mobile communication networks. From the research work, the arrival rate is explained using point process or counting process, which leads to two unique properties, they are orderly and memorylessness. These unique properties are possessed by Bernoulli process with is discrete time, having Geometric distribution function, also with Poisson process, which is continuous time and discrete space, having Exponential distribution function which is used to characterize arrival rate based on interarrival rate process. Therefore, from the research work, it is assumed that arrivals rate is Poisson distribution and service time or holding time is exponentially distributed in traffic situation in mobile communication networks. These statistical properties since to the best suitable in mobile communication networks because of their unique parameters and are simple to analyses.
Statistical Analysis of Ratio of Random Variables and Its Application in Performance Analysis of Multihop Wireless Transmissions
Mathematical Problems in Engineering, 2012
The distributions of random variables are of interest in many areas of science. In this paper, the probability density function PDF and cumulative distribution function CDF of ratio of products of two random variables and random variable are derived. Random variables are described with Rayleigh, Nakagami-m, Weibull, and α-μ distributions. An application of obtained results in performance analysis of multihop wireless communication systems in different transmission environments described in detail . The proposed mathematical analysis is also complemented by various graphically presented numerical results.
Loading Preview
Sorry, preview is currently unavailable. You can download the paper by clicking the button above.