THE DESIGN AND ANALYSIS OF EXPERIMENTS. By Oscar Kempthorne. New York, John Wiley and Sons, Inc., 1952. 631 pp. $8.50. This book by a teacher of statistics (as well as a consultant for \"experimenters\") is a comprehensive study of the philosophical background for the statistical design of experiment. It is necessary to have some facility with algebraic notation and manipulation to be able to use the volume intelligently. The problems are presented from the theoretical point of view, without such practical examples as would be helpful for those not acquainted with mathematics. The mathematical justification for the techniques is given. As a somewhat advanced treatment of the design and analysis of experiments, this volume will be interesting and helpful for many who approach statistics theoretically as well as practically. With emphasis on the \"why,\" and with description given broadly, the author relates the subject matter to the general theory of statistics and to the general problem of experimental inference. MARGARET J. ROBERTSON

The Design and Analysis of Experiments

Probability Distributions.- Linear Models for Regression.- Linear Models for Classification.- Neural Networks.- Kernel Methods.- Sparse Kernel Machines.- Graphical Models.- Mixture Models and EM.- Approximate Inference.- Sampling Methods.- Continuous Latent Variables.- Sequential Data.- Combining Models.

Pattern Recognition and Machine Learning

The IEEE has standardized the 802.11 protocol for wireless local area networks. The primary medium access control (MAC) technique of 802.11 is called the distributed coordination function (DCF). The DCF is a carrier sense multiple access with collision avoidance (CSMA/CA) scheme with binary slotted exponential backoff. This paper provides a simple, but nevertheless extremely accurate, analytical model to compute the 802.11 DCF throughput, in the assumption of finite number of terminals and ideal channel conditions. The proposed analysis applies to both the packet transmission schemes employed by DCF, namely, the basic access and the RTS/CTS access mechanisms. In addition, it also applies to a combination of the two schemes, in which packets longer than a given threshold are transmitted according to the RTS/CTS mechanism. By means of the proposed model, we provide an extensive throughput performance evaluation of both access mechanisms of the 802.11 protocol.

https://www.cse.iitb.ac.in/~varsha/allpapers/wireless/802.11_DCF_analysis.pdf

Performance analysis of the IEEE 802.11 distributed coordination function

The Internet has led to the creation of a digital society, where (almost) everything is connected and is accessible from anywhere. However, despite their widespread adoption, traditional IP networks are complex and very hard to manage. It is both difficult to configure the network according to predefined policies, and to reconfigure it to respond to faults, load, and changes. To make matters even more difficult, current networks are also vertically integrated: the control and data planes are bundled together. Software-defined networking (SDN) is an emerging paradigm that promises to change this state of affairs, by breaking vertical integration, separating the network's control logic from the underlying routers and switches, promoting (logical) centralization of network control, and introducing the ability to program the network. The separation of concerns, introduced between the definition of network policies, their implementation in switching hardware, and the forwarding of traffic, is key to the desired flexibility: by breaking the network control problem into tractable pieces, SDN makes it easier to create and introduce new abstractions in networking, simplifying network management and facilitating network evolution. In this paper, we present a comprehensive survey on SDN. We start by introducing the motivation for SDN, explain its main concepts and how it differs from traditional networking, its roots, and the standardization activities regarding this novel paradigm. Next, we present the key building blocks of an SDN infrastructure using a bottom-up, layered approach. We provide an in-depth analysis of the hardware infrastructure, southbound and northbound application programming interfaces (APIs), network virtualization layers, network operating systems (SDN controllers), network programming languages, and network applications. We also look at cross-layer problems such as debugging and troubleshooting. In an effort to anticipate the future evolution of this new paradigm, we discuss the main ongoing research efforts and challenges of SDN. In particular, we address the design of switches and control platforms—with a focus on aspects such as resiliency, scalability, performance, security, and dependability—as well as new opportunities for carrier transport networks and cloud providers. Last but not least, we analyze the position of SDN as a key enabler of a software-defined environment.

https://publications.uni.lu/bitstream/10993/20596/1/survey_on_SDN.pdf

Software-Defined Networking: A Comprehensive Survey

It is shown that, particularly for terrestrial cellular telephony, the interference-suppression feature of CDMA (code division multiple access) can result in a many-fold increase in capacity over analog and even over competing digital techniques. A single-cell system, such as a hubbed satellite network, is addressed, and the basic expression for capacity is developed. The corresponding expressions for a multiple-cell system are derived. and the distribution on the number of users supportable per cell is determined. It is concluded that properly augmented and power-controlled multiple-cell CDMA promises a quantum increase in current cellular capacity. >

On the capacity of a cellular CDMA system

The IEEE 802.11 protocol for wireless local area networks adopts a CSMA/CA protocol with exponential backoff as medium access control technique. As the throughput performance of such a scheme becomes critical when the number of mobile stations increases, in this paper we propose an adaptive contention window mechanism, which dynamically selects the optimal backoff window according to the estimate of the number of contending stations. We show that this technique leads to stable behavior, and it outperforms the standard protocol when the network load and the number of mobile stations are high. We also investigate the CSMA/CA with the optional RTS/CTS technique, and we show that our adaptive technique reaches better performance only when the packet size is short. Finally, the performance of a system environment with hidden terminals show that the RTS/CTS mechanism, which can also be used in conjunction with the adaptive contention window mechanism, provides significant improvements.

/pdf/performance-evaluation-and-enhancement-of-the-csma-ca-mac-3lmvwwichs.pdf

Performance evaluation and enhancement of the CSMA/CA MAC protocol for 802.11 wireless LANs

Throughput performance of the IEEE 802.11 distributed coordination function (DCF) is very sensitive to the number n of competing stations. The contribute of this paper is threefold. First, we show that n can be expressed as function of the collision probability encountered on the channel; hence, it can be estimated based on run-time measurements. Second, we show that the estimation of n, based on exponential smoothing of the measured collision probability (specifically, an ARMA filter), results to be a biased estimation, with poor performance in terms of accuracy/tracking trade-offs. Third, we propose a methodology to estimate n, based on an extended Kalman filter coupled with a change detection mechanism. This approach shows both high accuracy as well as prompt reactivity to changes in the network occupancy status. Numerical results show that, although devised in the assumption of saturated terminals, our proposed approach results effective also in non-saturated conditions, and specifically in tracking the average number of competing terminals.

/pdf/kalman-filter-estimation-of-the-number-of-competing-4ung64tpgs.pdf

Kalman filter estimation of the number of competing terminals in an IEEE 802.11 network

To satisfy the emerging need of wireless data communications, the IEEE is currently standardizing the 802.11 protocol for wireless local area networks. This standard adopts a CSMA/CA medium access control protocol with exponential backoff. We present a simple analytical model to compute the saturation throughput performance in the presence of a finite number of terminals and in the assumption of ideal channel conditions. The model applies to both basic and request-to-send/clear-to-send (RTS/CTS) access mechanisms. Comparison with simulation results shows that the model is extremely accurate in predicting the system throughput.

/pdf/ieee-802-11-saturation-throughput-analysis-58ynunhwrt.pdf

IEEE 802.11-saturation throughput analysis

While celebrating the 21st year since the very first IEEE 802.11 “legacy” 2 Mbit/s wireless local area network standard, the latest Wi-Fi newborn is today reaching the finish line, topping the remarkable speed of 10 Gbit/s. IEEE 802.11ax was launched in May 2014 with the goal of enhancing throughput-per-area in high-density scenarios. The first 802.11ax draft versions, namely, D1.0 and D2.0, were released at the end of 2016 and 2017. Focusing on a more mature version D3.0, in this tutorial paper, we help the reader to smoothly enter into the several major 802.11ax breakthroughs, including a brand new orthogonal frequency-division multiple access-based random access approach as well as novel spatial frequency reuse techniques. In addition, this tutorial will highlight selected significant improvements (including physical layer enhancements, multi-user multiple input multiple output extensions, power saving advances, and so on) which make this standard a very significant step forward with respect to its predecessor 802.11ac.

/pdf/a-tutorial-on-ieee-802-11ax-high-efficiency-wlans-53scy74xu9.pdf

Giuseppe Bianchi

Papers

Performance analysis of the IEEE 802.11 distributed coordination function

Performance evaluation and enhancement of the CSMA/CA MAC protocol for 802.11 wireless LANs

Kalman filter estimation of the number of competing terminals in an IEEE 802.11 network

IEEE 802.11-saturation throughput analysis

A Tutorial on IEEE 802.11ax High Efficiency WLANs