This thesis is concerned with the development of new mathematical models for the IEEE 802.11??s access mechanisms, with a particular focus on DCF and EDCA. Accurate mathematical models for the DCF and EDCA access mechanisms provide many benefits, such as improved performance analysis, easier network capacity planning, and robust network design. A feature that permeates the work presented in this thesis is the application of our new models to network environments where both saturated and non-saturated traffic sources are present. The scenario in which multiple traffic sources are present is more technically challenging, but provides for a more realistic setting. Our first contribution is the development of a new Markov model for non-saturated DCF in order to predict the network throughput. This model takes into account several details of the protocol that have been hitherto neglected. In addition, we apply a novel treatment of the packet service time within our model. We show how the inclusion of these effects provides more accurate predictions of network throughput than earlier works. Our second contribution is the development of a new analytical model for EDCA, again in order to predict network throughput. Our new EDCA model is based on a replacement of the normal AIFS parameter of EDCA with a new parameter more closely associated with DCF. This novel procedure allows EDCA to be viewed as a modified multi-mode version of DCF. Our third contribution is the simultaneous application of our new Markov models to both the non-saturated and the saturated regime. Hitherto, network throughput predictions for these regimes have required completely separate mathematical models. The convergence property of our model in the two regimes provides a new method to estimate the network capacity of the network. Our fourth contribution relates to predictions for the multimedia capacity of 802.11 networks. Our multimedia capacity analysis, which is based on modifications to our Markov model, is new in that it can be applied to a broad range of quality of service requirements. Finally, we highlight the use of our analysis in the context of emerging location-enabled networks.

This dissertation considers the design, evaluation and optimization of algorithms/ techniques/ system parameters for distributed wireless networks specifically ad-hoc and cognitive wireless networks. In the first part of the dissertation, we consider ad-hoc networks using opportunistic carrier sense multiple access (CSMA) protocols. The key challenge in optimizing the performance of such systems is to find a good compromise among three interdependent quantities: the density and channel quality of the scheduled transmitters, and the resulting interference seen at receivers. We propose two new channel-aware slotted CSMA protocols and study the tradeoffs they achieve amongst these quantities. In particular, we show that when properly optimized these protocols offer substantial improvements relative to regular CSMA -- particularly when the density of nodes is moderate to high. Moreover, we show that a simple quantile based opportunistic CSMA protocol can achieve robust performance gains without requiring careful parameter optimization. In the second part of the dissertation, we study a cognitive wireless network where licensed (primary) users and unlicensed 'cognitive' (secondary) users coexist on shared spectrum. In this context, many system design parameters affect the joint performance, e.g., outage and capacity, seen by the two user types. We explore the performance dependencies between primary and secondary users from a spatial reuse perspective, in particular, in terms of the outage probability, node density and joint network capacity. From the design perspective the key system parameters determining the joint transmission capacity, and tradeoffs, are the detection radius (detection signal to interference and noise power ratio (SINR) threshold) and decoding SINR threshold. We show how the joint network capacity region can be optimized by varying these parameters. In the third part of the dissertation, we consider a cognitive network in a heterogeneous environment, including indoor and outdoor transmissions. We characterize the joint network capacity region under three different spectrum (white space) detection techniques which have different degrees of radio frequency (RF) - environment awareness. We show that cognitive devices relying only on the classical signal energy detection method perform poorly due to limitations on detecting primary transmitters in environments with indoor shadowing. This can be circumvented through direct use (e.g., database access) of location information on primary transmitters, or better yet, on that of primary receivers. We also show that if cognitive devices have positioning information, then the secondary network's capacity increases monotonically with increased indoor shadowing in the environment. This dissertation extends the recent efforts in using stochastic geometric models to capture large scale performance characteristics of wireless systems. It demonstrates the usefulness of these models towards understanding the impact of physical /medium access (MAC) layer parameters and how they might be optimized. / text

A wireless sensor network consists of a number of sensor devices and coordinator(s) or sink(s). A coordinator collects the sensed data from the sensor devices for further processing. In such networks, sensor devices are generally powered by batteries. Since wireless transmission of packets consumes significant amount of energy, it is important for a network to adopt a medium access control (MAC) technology which is energy efficient and satisfies the communication performance requirements. Carrier sense multiple access with collision avoidance (CSMA/CA), which is a popular access technique because of its simplicity, flexibility and robustness, suffers poor throughput and energy inefficiency performance in wireless sensor networks. On the other hand, time division multiple access (TDMA) is a collision free and delay bounded access technique but suffers from the scalability problem. For this reason, this thesis focuses on design and analysis of hybrid channel access schemes which combine the strengths of both the CSMA/CA and TDMA schemes. In a hybrid CSMA/CA-TDMA scheme, the use of the CSMA/CA period and the TDMA period can be optimized to enhance the communication performance in the network. If such a hybrid channel access scheme is not designed properly, high congestion during the CSMA/CA period and wastage of bandwidth during the TDMA period result in poor communication performance in terms of throughput and energy efficiency. To address this issue, distributed and centralized channel access schemes are proposed to regulate the activities (such as transmitting, receiving, idling and going into low power mode) of the sensor devices. This regulation during the CSMA/CA period and allocation of TDMA slots reduce traffic congestion and thus improve the network performance. In this thesis work, time slot allocation methods in hybrid CSMA/CA-TDMA schemes are also proposed and analyzed to improve the network performance. Finally, such hybrid CSMA/CA-TDMA schemes are used in a cellular layout model for the multihop wireless sensor network to mitigate the hidden terminal collision problem.

Aquesta tesi suggereix usar un compte enrere determinista després de les transmissions exitoses en les xarxes d'àrea local sense fils. Com que les estacions que han transmès amb èxit en el seu darrer intent no poden col·lisionar entre elles en el seu proper intent, el nombre de col·lisions es redueix. Per tant, anomenem el protocol accés múltiple per detecció de portadora amb evitament de col·lisions millorat. El protocol es modela i es simula en diversos escenaris per a la seva avaluació. S'arriba a la conclusió de que el protocol proposat ofereix un rendiment igual o major que l'existent. / This thesis suggests the use of a deterministic backoff after successful transmissions in the MAC protocol of WLANs. Since those stations that successfully transmitted in their last collision attempt cannot collide among them in their next transmission attempt, the number of collisions is reduced. Hence, the protocol is called Carrier Sense Multiple Access with Enhanced Collision Avoidance. The protocol is modelled and simulations are used to assess its performance in a variety of scenarios. It is concluded that the proposed protocol performs always equal or better than the legacy one.

This thesis is concerned with the development of new mathematical models for the IEEE 802.11??s access mechanisms, with a particular focus on DCF and EDCA. Accurate mathematical models for the DCF and EDCA access mechanisms provide many benefits, such as improved performance analysis, easier network capacity planning, and robust network design. A feature that permeates the work presented in this thesis is the application of our new models to network environments where both saturated and non-saturated traffic sources are present. The scenario in which multiple traffic sources are present is more technically challenging, but provides for a more realistic setting. Our first contribution is the development of a new Markov model for non-saturated DCF in order to predict the network throughput. This model takes into account several details of the protocol that have been hitherto neglected. In addition, we apply a novel treatment of the packet service time within our model. We show how the inclusion of these effects provides more accurate predictions of network throughput than earlier works. Our second contribution is the development of a new analytical model for EDCA, again in order to predict network throughput. Our new EDCA model is based on a replacement of the normal AIFS parameter of EDCA with a new parameter more closely associated with DCF. This novel procedure allows EDCA to be viewed as a modified multi-mode version of DCF. Our third contribution is the simultaneous application of our new Markov models to both the non-saturated and the saturated regime. Hitherto, network throughput predictions for these regimes have required completely separate mathematical models. The convergence property of our model in the two regimes provides a new method to estimate the network capacity of the network. Our fourth contribution relates to predictions for the multimedia capacity of 802.11 networks. Our multimedia capacity analysis, which is based on modifications to our Markov model, is new in that it can be applied to a broad range of quality of service requirements. Finally, we highlight the use of our analysis in the context of emerging location-enabled networks.

Este trabalho apresenta um modelo analítico para a análise de vazão (throughput) da camada MAC do IEEE 802.11. A proposta se diferencia da maioria dos desenvolvimentos realizados na área por apresentar uma modelagem de ambientes com estações não-saturadas, levando em consideração o perfil do tráfego gerado pelas camadas superiores ao nível de enlace. Dessa maneira, o modelo permite uma análise do desempenho de aplicações reais sobre redes sem fio, a partir de resultados provenientes de um modelo matemático, enquanto diversos outros trabalhos avaliam somente situações de saturação das estações. Simulações utilizando Network Simulator 2 e comparações com resultados obtidos em trabalhos análogos desenvolvidos por outros pesquisadores validam o modelo proposto. Cenários com variações na quantidade de estações e carga oferecida à rede são avaliados utilizando o modelo teórico e comparados aos resultados simulados, provendo uma análise do comportamento dos limites de vazão do sistema. As estruturas do IEEE 802.11 MAC foram estudadas a fim de embasar o desenvolvimento do modelo proposto. Também foi realizada uma pesquisa a respeito de Cadeias de Markov, que serve como estrutura básica para a descrição do IEEE 802.11 DCF. / This work provides an analytical model to compute the IEEE 802.11 DCF throughput. The proposed analysis differs from most of the related work by presenting scenario modeling with unsaturated stations, accounting for the traffic characteristics generated by the upper layers to the data link layer. As a consequence, the proposed model allows for an accurate analysis of real applications over wireless networks, based on mathematical model results, while several other researches evaluate only saturate stations situations. Simulations ran using Network Simulator 2 and comparisons with results obtained on similar works developed by other researchers are used to validate the proposed model. Scenarios with different number of stations and offered loads are evaluated using the theoretical model and compared to the simulated results, providing an analysis on the behavior of the maximum throughput provided by the network. A study was made on the structures and mechanisms of IEEE 802.11 MAC in order to support the development of the proposed model. A research on Markov Chains was also done, since it is the basic structure used to describe the IEEE 802.11 DCF.

Este trabalho apresenta um modelo analítico para a análise de vazão (throughput) da camada MAC do IEEE 802.11. A proposta se diferencia da maioria dos desenvolvimentos realizados na área por apresentar uma modelagem de ambientes com estações não-saturadas, levando em consideração o perfil do tráfego gerado pelas camadas superiores ao nível de enlace. Dessa maneira, o modelo permite uma análise do desempenho de aplicações reais sobre redes sem fio, a partir de resultados provenientes de um modelo matemático, enquanto diversos outros trabalhos avaliam somente situações de saturação das estações. Simulações utilizando Network Simulator 2 e comparações com resultados obtidos em trabalhos análogos desenvolvidos por outros pesquisadores validam o modelo proposto. Cenários com variações na quantidade de estações e carga oferecida à rede são avaliados utilizando o modelo teórico e comparados aos resultados simulados, provendo uma análise do comportamento dos limites de vazão do sistema. As estruturas do IEEE 802.11 MAC foram estudadas a fim de embasar o desenvolvimento do modelo proposto. Também foi realizada uma pesquisa a respeito de Cadeias de Markov, que serve como estrutura básica para a descrição do IEEE 802.11 DCF. / This work provides an analytical model to compute the IEEE 802.11 DCF throughput. The proposed analysis differs from most of the related work by presenting scenario modeling with unsaturated stations, accounting for the traffic characteristics generated by the upper layers to the data link layer. As a consequence, the proposed model allows for an accurate analysis of real applications over wireless networks, based on mathematical model results, while several other researches evaluate only saturate stations situations. Simulations ran using Network Simulator 2 and comparisons with results obtained on similar works developed by other researchers are used to validate the proposed model. Scenarios with different number of stations and offered loads are evaluated using the theoretical model and compared to the simulated results, providing an analysis on the behavior of the maximum throughput provided by the network. A study was made on the structures and mechanisms of IEEE 802.11 MAC in order to support the development of the proposed model. A research on Markov Chains was also done, since it is the basic structure used to describe the IEEE 802.11 DCF.

Este trabalho apresenta um modelo analítico para a análise de vazão (throughput) da camada MAC do IEEE 802.11. A proposta se diferencia da maioria dos desenvolvimentos realizados na área por apresentar uma modelagem de ambientes com estações não-saturadas, levando em consideração o perfil do tráfego gerado pelas camadas superiores ao nível de enlace. Dessa maneira, o modelo permite uma análise do desempenho de aplicações reais sobre redes sem fio, a partir de resultados provenientes de um modelo matemático, enquanto diversos outros trabalhos avaliam somente situações de saturação das estações. Simulações utilizando Network Simulator 2 e comparações com resultados obtidos em trabalhos análogos desenvolvidos por outros pesquisadores validam o modelo proposto. Cenários com variações na quantidade de estações e carga oferecida à rede são avaliados utilizando o modelo teórico e comparados aos resultados simulados, provendo uma análise do comportamento dos limites de vazão do sistema. As estruturas do IEEE 802.11 MAC foram estudadas a fim de embasar o desenvolvimento do modelo proposto. Também foi realizada uma pesquisa a respeito de Cadeias de Markov, que serve como estrutura básica para a descrição do IEEE 802.11 DCF. / This work provides an analytical model to compute the IEEE 802.11 DCF throughput. The proposed analysis differs from most of the related work by presenting scenario modeling with unsaturated stations, accounting for the traffic characteristics generated by the upper layers to the data link layer. As a consequence, the proposed model allows for an accurate analysis of real applications over wireless networks, based on mathematical model results, while several other researches evaluate only saturate stations situations. Simulations ran using Network Simulator 2 and comparisons with results obtained on similar works developed by other researchers are used to validate the proposed model. Scenarios with different number of stations and offered loads are evaluated using the theoretical model and compared to the simulated results, providing an analysis on the behavior of the maximum throughput provided by the network. A study was made on the structures and mechanisms of IEEE 802.11 MAC in order to support the development of the proposed model. A research on Markov Chains was also done, since it is the basic structure used to describe the IEEE 802.11 DCF.

The usage of Wireless Local Area Networks is increasing rapidly throughout the world. The technology today is not quality proof for the market’s demands. We want to be able to completely wireless perform our demands, such as confer via video or IP-telephony. This is what we call multimedia real-time traffic. It may be achieved over the physical infrastructure in some areas with good results. The goal of this Master’s Thesis is to analyze the possibilities and give solutions and suggestions to achieve multimedia over the wireless networks, with emphasis on the protocol Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA). This Master’s Thesis is a theoretical study and the suggested solutions have not been tested in an actual wireless network. Instead they have been tested by computer simulation to give an indication of improvements. Basic configurations are set to the same as in the IEEE 802.11 standard. Different methods to reach possible improvements of a WLAN are studied, analyzed and simulated. Such methods are: priority, congestion management and multi-channel protocol. Simulations results show how the priority affects the wireless network and how a multi-channel protocol improves the latency and efficiency of the network. The simulation part is concentrated to show improvements of real-time traffic, which is time sensitive. With a multi- channel protocol the network can allow more users, i.e. more traffic. Also, the network will gain improvement in stability.

The thesis simulates the problem of network connectivity that occurs due to the dynamic nature of a network during flight. Nine nodes are provided with initial positions and are flown based on the path provided by leader-follower control algorithm using the server-client model. The application layer provides a point to point connection between the server and client and by using socket programming in the transport layer, a server and clients are established. Each node performs a neighbor discovery to discover its neighbors in the data link layer and physical layer performs the CSMA/CA using RTS/CTS. Finally, multi hop routing is achieved in network layer. Each client connects with server at dedicated interval to share each other location and then moves to next location. This process is continued over a period of several iterations until the relative distance is achieved. The constraints and limitations of the technology are network connectivity is lack of flexibility for random location of nodes, links established with a distant node having single neighbor is unstable. Performance of a system decreases with increase in number of nodes.