On the use of Hidden Markov Processes and auto-regressive filters to incorporate indoor bursty wireless channels into network simulation platforms

In this paper we thoroughly analyze two alternatives to replicate the bursty behavior that characterizes real indoor wireless channels within Network Simulation platforms. First, we study the performance of an improved Hidden Markov Process model, based on a time-wise configuration so as to decouple its operation from any particular traffic pattern. We compare it with the behavior of Bursty Error Model Based on an Auto-Regressive Filter, a previous proposal of ours that emulates the received Signal to Noise Ratio by means of an auto-regressive filter that captures the “memory” assessed in real measurements. We also study the performance of one of the legacy approaches intrinsically offered by most network simulation frameworks. By means of a thorough simulation campaign, we demonstrate that our two models are able to offer a much more realistic behavior, yet maintaining an affordable response in terms of computational complexity.The authors would like to express their gratitude to the Spanish government for its funding in the project “Connectivity as a Service: Access for the Internet of the Future”, COSAIF (TEC2012-38574-C02-01

Packet Loss in Terrestrial Wireless and Hybrid Networks

The presence of both a geostationary satellite link and a terrestrial local wireless link on the same path of a given network connection is becoming increasingly common, thanks to the popularity of the IEEE 802.11 protocol. The most common situation where a hybrid network comes into play is having a Wi-Fi link at the network edge and the satellite link somewhere in the network core. Example of scenarios where this can happen are ships or airplanes where Internet connection on board is provided through a Wi-Fi access point and a satellite link with a geostationary satellite; a small office located in remote or isolated area without cabled Internet access; a rescue team using a mobile ad hoc Wi-Fi network connected to the Internet or to a command centre through a mobile gateway using a satellite link. The serialisation of terrestrial and satellite wireless links is problematic from the point of view of a number of applications, be they based on video streaming, interactive audio or TCP. The reason is the combination of high latency, caused by the geostationary satellite link, and frequent, correlated packet losses caused by the local wireless terrestrial link. In fact, GEO satellites are placed in equatorial orbit at 36,000 km altitude, which takes the radio signal about 250 ms to travel up and down. Satellite systems exhibit low packet loss most of the time, with typical project constraints of 10−8 bit error rate 99% of the time, which translates into a packet error rate of 10−4, except for a few days a year. Wi-Fi links, on the other hand, have quite different characteristics. While the delay introduced by the MAC level is in the order of the milliseconds, and is consequently too small to affect most applications, its packet loss characteristics are generally far from negligible. In fact, multipath fading, interference and collisions affect most environments, causing correlated packet losses: this means that often more than one packet at a time is lost for a single fading even

Cascading attacks in Wi-Fi networks: demonstration and counter-measures

Wi-Fi (IEEE 802.11) is currently one of the primary media to access the Internet. Guaranteeing the availability of Wi-Fi networks is essential to numerous online activities, such as e-commerce, video streaming, and IoT services. Attacks on availability are generally referred to as Denial-of-Service (DoS) attacks. While there exists signif- icant literature on DoS attacks against Wi-Fi networks, most of the existing attacks are localized in nature, i.e., the attacker must be in the vicinity of the victim. The purpose of this dissertation is to investigate the feasibility of mounting global DoS attacks on Wi-Fi networks and develop effective counter-measures. First, the dissertation unveils the existence of a vulnerability at the MAC layer of Wi-Fi, which allows an adversary to remotely launch a Denial-of-Service (DoS) attack that propagates both in time and space. This vulnerability stems from a coupling effect induced by hidden nodes. Cascading DoS attacks can congest an entire network and do not require the adversary to violate any protocol. The dissertation demonstrates the feasibility of such attacks through experiments with real Wi-Fi cards, extensive ns-3 simulations, and theoretical analysis. The simulations show the attack is effective both in networks operating under fixed and varying bit rates, as well as ad hoc and infrastructure modes. To gain insight into the root-causes of the attack, the network is modeled as a dynamical system and its limiting behavior is analyzed. The model predicts that a phase transition (and hence a cascading attack) is possible when the retry limit parameter of Wi-Fi is greater or equal to 7. Next, the dissertation identifies a vulnerability at the physical layer of Wi-Fi that allows an adversary to launch cascading attacks with weak interferers. This vulnerability is induced by the state machine’s logic used for processing incoming packets. In contrast to the previous attack, this attack is effective even when interference caused by hidden nodes do not corrupt every packet transmission. The attack forces Wi-Fi rate adaptation algorithms to operate at a low bit rate and significantly degrades network performance, such as communication reliability and throughput. Finally, the dissertation proposes, analyzes, and simulates a method to prevent such attacks from occurring. The key idea is to optimize the duration of packet transmissions. To achieve this goal, it is essential to properly model the impact of MAC overhead, and in particular MAC timing parameters. A new theoretical model is thus proposed, which relates the utilization of neighboring pairs of nodes using a sequence of iterative equations and uses fixed point techniques to study the limiting behavior of the sequence. The analysis shows how to optimally set the packet duration so that, on the one hand, cascading DoS attacks are avoided and, on the other hand, throughput is maximized. The analytical results are validated by extensive ns-3 simulations. A key insight obtained from the analysis and simulations is that IEEE 802.11 networks with relatively large MAC overhead are less susceptible to cascading DoS attacks than networks with smaller MAC overhead

802.11 Markov Channel Modelling

In order to understand the behavior of upper layer protocols and to design or fine tune their parameters over wireless networks, it is common to assume that the underlying channel is a flat Rayleigh fading channel. Such channels are commonly modeled as finite state Markov chains. Recently, hidden Markov models have also been employed to characterize these channels. Although Markov models have been widely used to study the performance of communications protocols at the link and transport layers, no validation of their accuracy has been performed against experimental data. These models are not applicable to frequency selective fading channels. Moreover, there are no good models to consider the effects of path loss (average received SNR), the packet size, and transmission rate variations which are significant in IEEE 802.11 wireless local area networks. This research performs validation of Markov models with experimental data and discusses the limitations of the process. In this dissertation, we present different models that have been proposed along with their validity analysis. We use the experimental data with stochastic modeling approaches to characterize the frame losses in IEEE 802.11 wireless LANs. We also characterize the important factor of current wireless LAN technology, the transmission rate variations. New guidelines for the construction of Markov and hidden Markov models for wireless LAN channels are developed and presented along the necessary data to implement them in performance studies. Furthermore we also evaluate the validity of using Markovian models to understand the effects on upper layer protocols such as TCP

Accurate simulation of 802.11 indoor links: a “bursty” channel model based on real measurements

We propose a novel channelmodel to be used for simulating indoor wireless propagation environments. An extensive measurement campaign was carried out to assess the performance of different transport protocols over 802.11 links. This enabled us to better adjust our approach, which is based on an autoregressive filter. One of the main advantages of this proposal lies in its ability to reflect the “bursty” behavior which characterizes indoor wireless scenarios, having a great impact on the behavior of upper layer protocols.We compare this channel model, integrated within the Network Simulator (ns-2) platform, with other traditional approaches, showing that it is able to better reflect the real behavior which was empirically assessed

Performance modelling and enhancement of wireless communication protocols

In recent years, Wireless Local Area Networks(WLANs) play a key role in the data communications and networking areas, having witnessed significant research and development. WLANs are extremely popular being almost everywhere including business,office and home deployments.In order to deal with the modem Wireless connectivity needs,the Institute of Electrical and Electronics Engineers(IEEE) has developed the 802.11 standard family utilizing mainly radio transmission techniques, whereas the Infrared Data Association (IrDA) addressed the requirement for multipoint connectivity with the development of the Advanced Infrared(Alr) protocol stack. This work studies the collision avoidance procedures of the IEEE 802.11 Distributed Coordination Function (DCF) protocol and suggests certain protocol enhancements aiming at maximising performance. A new, elegant and accurate analysis based on Markov chain modelling is developed for the idealistic assumption of unlimited packet retransmissions as well as for the case of finite packet retry limits. Simple equations are derived for the through put efficiency, the average packet delay, the probability of a packet being discarded when it reaches the maximum retransmission limit, the average time to drop such a packet and the packet inter-arrival time for both basic access and RTS/CTS medium access schemes.The accuracy of the mathematical model is validated by comparing analytical with OPNET simulation results. An extensive and detailed study is carried out on the influence of performance of physical layer, data rate, packet payload size and several backoff parameters for both medium access mechanisms. The previous mathematical model is extended to take into account transmission errors that can occur either independently with fixed Bit Error Rate(BER) or in bursts. The dependency of the protocol performance on BER and other factors related to independent and burst transmission errors is explored. Furthermore, a simple-implement appropriate tuning of the back off algorithm for maximizing IEEE 802-11 protocol performance is proposed depending on the specific communication requirements. The effectiveness of the RTS/CTS scheme in reducing collision duration at high data rates is studied and an all-purpose expression for the optimal use of the RTS/CTS reservation scheme is derived. Moreover, an easy-to-implement backoff algorithm that significantly enhances performance is introduced and an alternative derivation is developed based on elementary conditional probability arguments rather than bi-dimensional Markov chains. Finally, an additional performance improvement scheme is proposed by employing packet bursting in order to reduce overhead costs such as contention time and RTS/CTSex changes. Fairness is explored in short-time and long-time scales for both the legacy DCF and packet bursting cases. AIr protocol employs the RTS/CTS medium reservation scheme to cope with hidden stations and CSMA/CA techniques with linear contention window (CW) adjustment for medium access. A 1-dimensional Markov chain model is constructed instead of the bi-dimensional model in order to obtain simple mathematical equations of the average packet delay.This new approach greatly simplifies previous analyses and can be applied to any CSMA/CA protocol.The derived mathematical model is validated by comparing analytical with simulation results and an extensive Alr packet delay evaluation is carried out by taking into account all the factors and parameters that affect protocol performance. Finally, suitable values for both backoff and protocol parameters are proposed that reduce average packet delay and, thus, maximize performance