Enhanced Collision Resolution for the IEEE 802.11 Distributed Coordination Function

The IEEE 802.11 standard relies on the Distributed Coordination Function (DCF) as the fundamental medium access control method. DCF uses the Binary Exponential Backoff (BEB) algorithm to regulate channel access. The backoff period determined by BEB depends on a contention window (CW) whose size is doubled if a station suffers a collision and reset to its minimum value after a successful transmission. BEB doubles the CW size upon collision to reduce the collision probability in retransmission. However, this CW increase reduces channel access time because stations will spend more time sensing the channel rather than accessing it. Although resetting the CW to its minimum value increases channel access, it negatively affects fairness because it favours successfully transmitting stations over stations suffering from collisions. Moreover, resetting CW leads to increasing the collision probability and therefore increases the number of collisions. % Quality control editor: Please ensure that the intended meaning has been maintained in the edits of the previous sentence. Since increasing channel access time and reducing the probability of collisions are important factors to improve the DCF performance, and they conflict with each other, improving one will have an adverse effect on the other and consequently will harm the DCF performance. We propose an algorithm, \gls{ECRA}, that solves collisions once they occur without instantly increasing the CW size. Our algorithm reduces the collision probability without affecting channel access time. We also propose an accurate analytical model that allows comparing the theoretical saturation and maximum throughputs of our algorithm with those of benchmark algorithms. Our model uses a collision probability that is dependent on the station transmission history and thus provides a precise estimation of the probability that a station transmits in a random timeslot, which results in a more accurate throughput analysis. We present extensive simulations for fixed and mobile scenarios. The results show that on average, our algorithm outperformed BEB in terms of throughput and fairness. Compared to other benchmark algorithms, our algorithm improved, on average, throughput and delay performance

Design, Modeling, and Analysis for MAC Protocols in Ultra-wideband Networks

Ultra-wideband (UWB) is an appealing transmission technology for short-range, bandwidth demanded wireless communications. With the data rate of several hundred megabits per second, UWB demonstrates great potential in supporting multimedia streams such as high-definition television (HDTV), voice over Internet Protocol (VoIP), and console gaming in office or home networks, known as the wireless personal area network (WPAN). While vast research effort has been made on the physical layer issues of UWB, the corresponding medium access control (MAC) protocols that exploit UWB technology have not been well developed. Given an extremely wide bandwidth of UWB, a fundamental problem on how to manage multiple users to efficiently utilize the bandwidth is a MAC design issue. Without explicitly considering the physical properties of UWB, existing MAC protocols are not optimized for UWB-based networks. In addition, the limited processing capability of UWB devices poses challenges to the design of low-complexity MAC protocols. In this thesis, we comprehensively investigate the MAC protocols for UWB networks. The objective is to link the physical characteristics of UWB with the MAC protocols to fully exploit its advantage. We consider two themes: centralized and distributed UWB networks. For centralized networks, the most critical issue surrounding the MAC protocol is the resource allocation with fairness and quality of service (QoS) provisioning. We address this issue by breaking down into two scenarios: homogeneous and heterogeneous network configurations. In the homogeneous case, users have the same bandwidth requirement, and the objective of resource allocation is to maximize the network throughput. In the heterogeneous case, users have different bandwidth requirements, and the objective of resource allocation is to provide differentiated services. For both design objectives, the optimal scheduling problem is NP-hard. Our contributions lie in the development of low-complexity scheduling algorithms that fully exploit the characteristics of UWB. For distributed networks, the MAC becomes node-based problems, rather than link-based problems as in centralized networks. Each node either contends for channel access or reserves transmission opportunity through negotiation. We investigate two representative protocols that have been adopted in the WiMedia specification for future UWB-based WPANs. One is a contention-based protocol called prioritized channel access (PCA), which employs the same mechanisms as the enhanced distributed channel access (EDCA) in IEEE 802.11e for providing differentiated services. The other is a reservation-based protocol called distributed reservation protocol (DRP), which allows time slots to be reserved in a distributed manner. Our goal is to identify the capabilities of these two protocols in supporting multimedia applications for UWB networks. To achieve this, we develop analytical models and conduct detailed analysis for respective protocols. The proposed analytical models have several merits. They are accurate and provide close-form expressions with low computational effort. Through a cross-layer approach, our analytical models can capture the near-realistic protocol behaviors, thus useful insights into the protocol can be obtained to improve or fine-tune the protocol operations. The proposed models can also be readily extended to incorporate more sophisticated considerations, which should benefit future UWB network design

Time Dependent Performance Analysis of Wireless Networks

Many wireless networks are subject to frequent changes in a combination of network topology, traffic demand, and link capacity, such that nonstationary/transient conditions always exist in packet-level network behavior. Although there are extensive studies on the steady-state performance of wireless networks, little work exists on the systematic study of their packet-level time varying behavior. However, it is increasingly noted that wireless networks must not only perform well in steady state, but must also have acceptable performance under nonstationary/transient conditions. Furthermore, numerous applications in today's wireless networks are very critical to the real-time performance of delay, packet delivery ratio, etc, such as safety applications in vehicular networks and military applications in mobile ad hoc networks. Thus, there exists a need for techniques to analyze the time dependent performance of wireless networks. In this dissertation, we develop a performance modeling framework incorporating queuing and stochastic modeling techniques to efficiently evaluate packet-level time dependent performance of vehicular networks (single-hop) and mobile ad hoc networks (multi-hop). For vehicular networks, we consider the dynamic behavior of IEEE 802.11p MAC protocol due to node mobility and model the network hearability as a time varying adjacency matrix. For mobile ad hoc networks, we focus on the dynamic behavior of network layer performance due to rerouting and model the network connectivity as a time varying adjacency matrix. In both types of networks, node queues are modeled by the same fluid flow technique, which follows flow conservation principle to construct differential equations from a pointwise mapping of the steady-state queueing relationships. Numerical results confirm that fluid-flow based performance models are able to respond to the ongoing nonstationary/transient conditions of wireless networks promptly and accurately. Moreover, compared to the computation time of standard discrete event simulator, fluid-flow based model is shown to be a more scalable evaluation tool. In general, our proposed performance model can be used to explore network design alternatives or to get a quick estimate on the performance variation in response to some dynamic changes in network conditions

Experimenting with commodity 802.11 hardware: overview and future directions

The huge adoption of 802.11 technologies has triggered a vast amount of experimentally-driven research works. These works range from performance analysis to protocol enhancements, including the proposal of novel applications and services. Due to the affordability of the technology, this experimental research is typically based on commercial off-the-shelf (COTS) devices, and, given the rate at which 802.11 releases new standards (which are adopted into new, affordable devices), the field is likely to continue to produce results. In this paper, we review and categorise the most prevalent works carried out with 802.11 COTS devices over the past 15 years, to present a timely snapshot of the areas that have attracted the most attention so far, through a taxonomy that distinguishes between performance studies, enhancements, services, and methodology. In this way, we provide a quick overview of the results achieved by the research community that enables prospective authors to identify potential areas of new research, some of which are discussed after the presentation of the survey.This work has been partly supported by the European Community through the CROWD project (FP7-ICT-318115) and by the Madrid Regional Government through the TIGRE5-CM program (S2013/ICE-2919).Publicad

Energy efficiency in wireless communications for mobile user devices

Mención Internacional en el título de doctorMobile user devices’ market has experi-enced an exponential growth worldwide over the last decade, and wireless communications are the main driver for the next generation of 5G networks. The ubiquity of battery-powered connected devices makes energy efficiency a major research issue. While most studies assumed that network interfaces dominate the energy consumption of wireless communications, a recent work unveils that the frame processing carried out by the device could drain as much energy as the interface itself for many devices. This discovery poses doubts on prior energy models for wireless communications and forces us to reconsider existing energy-saving schemes. From this standpoint, this thesis is de-voted to the study of the energy efficiency of mobile user devices at multiple layers. To that end, we assemble a comprehensive en-ergy measurement framework, and a robust methodology, to be able to characterise a wide range of mobile devices, as well as individual parts of such devices. Building on this, we first delve into the en-ergy consumption of frame processing within the devices’ protocol stack. Our results identify the CPU as the leading cause of this energy consumption. Moreover, we discover that the characterisation of the energy toll ascribed to the device is much more complex than the previous work showed. Devices with complex CPUs (several frequencies and sleep states) require novel methodologies and models to successfully characterise their consumption. We then turn our attention to lower levels of the communication stack by investigating the behaviour of idle WiFi interfaces. Due to the design of the 802.11 protocol, together with the growing trend of network densification, WiFi devices spend a long time receiving frames addressed to other devices when they might be dormant. In order to mitigate this issue, we study the timing constraints of a commercial WiFi card, which is developed into a standard-compliant algorithm that saves energy during such transmissions. At a higher level, rate adaptation and power control techniques adapt data rate and output power to the channel conditions. However, these have been typically studied with other metrics rather than energy efficiency in mind (i.e., performance figures such as throughput and capacity). In fact, our analyses and sim-ulations unveil an inherent trade-off between throughput and energy efficiency maximisa-tion in 802.11. We show that rate adaptation and power control techniques may incur inef-ficiencies at mode transitions, and we provide energy-aware heuristics to make such decisions following a conservative approach. Finally, our research experience on simula-tion methods pointed us towards the need for new simulation tools commited to the middle-way approach: less specificity than complex network simulators in exchange for easier and faster prototyping. As a result, we developed a process-oriented and trajectory-based discrete-event simulation package for the R language, which is designed as a easy-to-use yet pow-erful framework with automatic monitoring capabilities. The use of this simulator in net-working is demonstrated through the energy modelling of an Internet-of-Things scenario with thousands of metering devices in just a few lines of code.El mercado de los dispositivos de usuario móviles ha experimentado un crecimiento exponencial a nivel mundial en la última década, y las comunicaciones inalámbricas son el principal motor de la siguiente generación de redes 5G. La ubicuidad de estos dispos-itivos alimentados por baterías hace de la eficiencia energética un importante tema de investigación. Mientras muchos estudios asumían que la interfaz de red domina el consumo energético de las comuni-caciones inalámbricas, un trabajo reciente revela que el procesado de tramas que se lleva a cabo en el disposi-tivo podría gastar tanta energía como la propia interfaz para muchos dispositivos. Este descubrimiento plantea dudas sobre los anteriores modelos energéticos para comunicaciones inalámbricas y nos obliga a reconsid-erar los esquemas de ahorro energético existentes. Desde este punto de vista, esta tesis está dedicada al estudio de la eficiencia energética de dispositivos de usuario móviles en múltiples capas. Para ello, se construye un completo sistema de medida de energía, y una metodología robusta, capaz de caracterizar un amplio rango de dispositivos móviles, así como partes individuales de tales dispositivos. A partir de esto, en primer lugar se profundiza en el consumo energético del procesamiento de tramas en la pila de protocolos de los dispositivos. Nuestros resul-tados identifican a la CPU como principal causa de tal consumo. Además, se descubre que la caracterización de la cuota energética adscrita al dispositivo es mucho más compleja que lo mostrado por el trabajo ante-rior. Los dispositivos con CPU complejas (múltiples frecuencias y modos de apagado) requieren nuevas metodologías y modelos para caracterizar su consumo de manera existosa. En este punto, volvemos nuestra atención hacia niveles más bajos de la pila de comunicaciones para investigar el comportamiento de las interfaces WiFi en estado inactivo. Debido al diseño del protocolo 802.11, junto con la tendencia creciente hacia la densifi-cación de las redes, los dispositivos WiFi pasan mucho tiempo recibiendo tramas destinadas a otros dispos-itivos cuando podrían estar apagados. Para mitigar este problema, se estudian las limitaciones temporales de una tarjeta WiFi comercial, lo que posteriormente se utiliza para desarrollar un algoritmo conforme con el estándar que es capaz de ahorrar energía durante dichas transmisiones. A un nivel más alto, las técnicas de adaptación de tasa y control de potencia adaptan la tasa de datos y la potencia de salida a las condiciones del canal. No obstante, estas técnicas han sido típicamente es-tudiadas con otras métricas en mente (i.e., figuras de rendimiento como la tasa total y la capacidad). De hecho, nuestros análisis y simulaciones desvelan un conflicto entre la maximización de la tasa total y la efi-ciencia energética en 802.11. Se muestra que las técni-cas de adaptación de tasa y control de potencia pueden incurrir en ineficiencias en los cambios de modo, y se proporcionan heurísticos para tomar tales decisiones de un modo conservador y eficiente energéticamente. Finalmente, nuestra experiencia investigadora en métodos de simulación nos hizo conscientes de la necesidad de nuevas herramientas de simulación comprometidas con un enfoque intermedio: menos especificidad que los complejos simuladores de re-des a cambio de facilidad y rapidez en el prototipado. Como resultado, se desarrolló un paquete de simu-lación por eventos discretos para el lenguaje R orien-tado a procesos y basado en trayectorias, el cual está diseñado como una herramienta fácil de utilizar a la par que potente con capacidad de monitorización au-tomática integrada. El uso de este simulador en redes se demuestra mediante el modelado en energía de un escenario de la Internet de las Cosas con miles de dis-positivos de medida en tan solo unas pocas líneas de código.Programa Oficial de Doctorado en Ingeniería TelemáticaPresidente: Juan Manuel López Soler.- Secretario: Francisco Valera Pintor.- Vocal: Paul Horatiu Patra

Modelling and performance analysis of mobile ad hoc networks

PhD ThesisMobile Ad hoc Networks (MANETs) are becoming very attractive and useful in many kinds of communication and networking applications. This is due to their efficiency, relatively low cost, and flexibility provided by their dynamic infrastructure. Performance evaluation of mobile ad hoc networks is needed to compare various architectures of the network for their performance, study the effect of varying certain network parameters and study the interaction between various parameters that characterise the network. It can help in the design and implementation of MANETs. It is to be noted that most of the research that studies the performance of MANETs were evaluated using discrete event simulation (DES) utilising a broad band of network simulators. The principle drawback of DES models is the time and resources needed to run such models for large realistic systems, especially when results with a high accuracy are desired. In addition, studying typical problems such as the deadlock and concurrency in MANETs using DES is hard because network simulators implement the network at a low abstraction level and cannot support specifications at higher levels. Due to the advantage of quick construction and numerical analysis, analytical modelling techniques, such as stochastic Petri nets and process algebra, have been used for performance analysis of communication systems. In addition, analytical modelling is a less costly and more efficient method. It generally provides the best insight into the effects of various parameters and their interactions. Hence, analytical modelling is the method of choice for a fast and cost effective evaluation of mobile ad hoc networks. To the best of our knowledge, there is no analytical study that analyses the performance of multi-hop ad hoc networks, where mobile nodes move according to a random mobility model, in terms of the end-to-end delay and throughput. This work ii presents a novel analytical framework developed using stochastic reward nets and mathematical modelling techniques for modelling and analysis of multi-hop ad hoc networks, based on the IEEE 802.11 DCF MAC protocol, where mobile nodes move according to the random waypoint mobility model. The proposed framework is used to analysis the performance of multi-hop ad hoc networks as a function of network parameters such as the transmission range, carrier sensing range, interference range, number of nodes, network area size, packet size, and packet generation rate. The proposed framework is organized into several models to break up the complexity of modelling the complete network and make it easier to analyse each model as required. This is based on the idea of decomposition and fixed point iteration of stochastic reward nets. The proposed framework consists of a mathematical model and four stochastic reward nets models; the path analysis model, data link layer model, network layer model and transport layer model. These models are arranged in a way similar to the layers of the OSI protocol stack model. The mathematical model is used to compute the expected number of hops between any source-destination pair; and the average number of carrier sensing, hidden, and interfering nodes. The path analysis model analyses the dynamic of paths in the network due to the node mobility in terms of the path connection availability and rate of failure and repair. The data link layer model describes the behaviour of the IEEE 802.11 DCF MAC protocol. The actions in the network layer are modelled by the network layer model. The transport layer model represents the behaviour of the transport layer protocols. The proposed models are validated using extensive simulations

Proceedings of the Third Edition of the Annual Conference on Wireless On-demand Network Systems and Services (WONS 2006)

Ce fichier regroupe en un seul documents l'ensemble des articles accéptés pour la conférences WONS2006/http://citi.insa-lyon.fr/wons2006/index.htmlThis year, 56 papers were submitted. From the Open Call submissions we accepted 16 papers as full papers (up to 12 pages) and 8 papers as short papers (up to 6 pages). All the accepted papers will be presented orally in the Workshop sessions. More precisely, the selected papers have been organized in 7 session: Channel access and scheduling, Energy-aware Protocols, QoS in Mobile Ad-Hoc networks, Multihop Performance Issues, Wireless Internet, Applications and finally Security Issues. The papers (and authors) come from all parts of the world, confirming the international stature of this Workshop. The majority of the contributions are from Europe (France, Germany, Greece, Italy, Netherlands, Norway, Switzerland, UK). However, a significant number is from Australia, Brazil, Canada, Iran, Korea and USA. The proceedings also include two invited papers. We take this opportunity to thank all the authors who submitted their papers to WONS 2006. You helped make this event again a success

Performance issues in cellular wireless mesh networks

This thesis proposes a potential solution for future ubiquitous broadband wireless access networks, called a cellular wireless mesh network (CMESH), and investigates a number of its performance issues. A CMESH is organized in multi-radio, multi-channel, multi-rate and multi-hop radio cells. It can operate on abundant high radio frequencies, such as 5-50 GHz, and thus may satisfy the bandwidth requirements of future ubiquitous wireless applications. Each CMESH cell has a single Internet-connected gateway and serves up to hundreds of mesh nodes within its coverage area. This thesis studies performance issues in a CMESH, focusing on cell capacity, expressed in terms of the max-min throughput. In addition to introducing the concept of a CMESH, this thesis makes the following contributions. The first contribution is a new method for analyzing theoretical cell capacity. This new method is based on a new concept called Channel Transport Capacity (CTC), and derives new analytic expressions for capacity bounds for carrier-sense-based CMESH cells. The second contribution is a new algorithm called the Maximum Channel Collision Time (MCCT) algorithm and an expression for the nominal capacity of CMESH cells. This thesis proves that the nominal cell capacity is achievable and is the exact cell capacity for small cells within the abstract models. Finally, based on the MCCT algorithm, this thesis proposes a series of greedy algorithms for channel assignment and routing in CMESH cells. Simulation results show that these greedy algorithms can significantly improve the capacity of CMESH cells, compared with algorithms proposed by other researchers