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.

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.

No description available.

L'objectif de cette thèse est de traiter trois problèmes relatifs aux réseaux de grande taille. Les outils utilisés à cette fin sont issus des probabilités et plus spécifiquement de la théorie des files d'attente. En plus d'améliorer la compréhension des systèmes étudiés, les travaux réalisés dans cette thèse ont permis de prouver des résultats théoriques nouveaux ainsi que d'illustrer certains phénomènes probabilistes. Dans le Chapitre II, un modèle de réseau à partage de bande passante est étudié. Contrairement à ce qui avait été étudié dans la littérature, les utilisateurs n'utilisent pas de contrôle de congestion. On suppose qu'ils envoient des données avec un débit maximum et protègent leur transmission à l'aide d'un mécanisme basé sur des codes correcteurs d'erreur. Le modèle obtenu est analysé pour deux topologies de réseaux spécifiques : les réseaux linéaires et les arbres montants. A l'aide de limites fluides, les conditions de stabilité de ces réseaux sont établies. Ces limites fluides donnent lieu à un phénomène intéressant de moyennage stochastique. Ensuite, une autre méthode de renormalisation est utilisée pour prouver que la région de stabilité de ces processus converge vers la région optimale lorsque que les débits maximaux des utilisateurs deviennent infiniment petits par rapport à la taille des liens du réseau. Dans le Chapitre III, on se propose d'étudier CSMA/CA, un algorithme d'accès implémenté dans certains standards de réseaux sans fil. Chaque lien est constitué d'un émetteur et d'un récepteur et un graphe d'interférence modélise les collisions potentielles entre les liens. Les arrivées et les départs de ces derniers sont prises en compte. Une approximation est faite en supposant que la dynamique d'accès au canal est infiniment plus rapide que la dynamique des arrivées et départs de liens. Il est alors établi que le CSMA permet une utilisation optimale des ressources radio dans le cadre des réseaux ad-hoc. Cependant, il est également prouvé que ce même algorithme n'est pas efficace pour les réseaux avec une station de base ; dans ce cas, un biais en faveur des transmissions vers la station de base est observé. A la fin du chapitre, l'hypothèse simplificatrice est discutée. Les deux derniers chapitres de la thèse sont consacrés à l'étude d'un grand système distribué de stockage de données avec pertes. L'objectif est d'estimer la vitesse de perte des fichiers ou la durée de vie d'un fichier donné. Dans le Chapitre IV, c'est le premier point de vue qui est adopté. Le système est considéré de manière globale. Le système est constitué d'un grand nombre de fichiers qui peuvent avoir chacun deux copies au maximum. Chaque copie disparaît au bout d'un temps aléatoire. Un mécanisme centralisé de sauvegarde permet alors de restaurer les copies perdues. Un fichier dont les deux copies ont été détruites est définitivement perdu. Le système est étudié dans le cas limite où le nombre de fichiers tend vers l'infini. Afin de décrire correctement le système, trois échelles de temps différentes sont étudiées. Ralentir le temps permet de comprendre le mécanisme de sauvegarde ; laisser le temps inchangé permet de définir la capacité du système ; accélérer le temps permet d'évaluer la vitesse de perte des fichiers. Le principe de moyennage stochastique est également observé à l'échelle de temps la plus rapide. Dans le chapitre V, le point de vue d'un fichier donné est adopté. Des liens sont établis avec les modèles classiques d'Ehrenfest, issu de la physique statistique, et d'Erlang, issu des télécommunications. Des méthodes basées sur les martingales sont utilisées pour calculer la transformée de Laplace des temps d'atteinte de ces deux processus. Ces transformées permettent alors d'estimer le comportement asymptotique de ces temps d'atteinte et notamment le temps de disparition d'un fichier.

Providing access to telecommunication services in rural areas is of paramount importance for the development of any country. Since the cost is the main inhibiting factor, any technical solution for access in sparsely populated rural areas has to be reliable, efficient, and deployable at low-cost. This thesis studies the utilization of Multihop Wireless Networks (MWN) as an appealing alternative for rural communication. MWN are designed with a self-configuring capability and can adapt to the addition or removal of network radio units (nodes). This makes them simple to install, allowing unskilled users to set up the network quickly. To increase the performance and cost-efficiency, this thesis focuses on the use of Advanced Antenna Systems (AAS) in rural access networks. AAS promise to increase the overall capacity in MWN, improving the link quality while suppressing or reducing the multiple access interference. To effectively exploit the capabilities of AAS, a proper design of Medium Access Control (MAC) protocols is needed. Hence, the results of system level studies into MAC protocols and AAS are presented in this thesis. Two different MAC protocols are examined: Spatial Time Division Multiple Access (STDMA) and Carrier Sense Multiple Access Collision Avoidance (CSMA/CA) with handshaking. The effects of utilizing advanced antennas on the end-to-end network throughput and packet delay are analyzed with routing, power control and adaptive transmission data rate control separately and in combination. Many of the STDMA-related research questions addressed in this thesis are posed as nonlinear optimization problems that are solved by the technique called "column generation" to create the transmission schedule using AAS. However, as finding the optimal solution is computationally expensive, we also introduce low-complexity algorithms that, while simpler, yield reasonable results close to the optimal solution. Although STDMA has been found to be very efficient and fair, one potential drawback is that it may adapt slower than a distributed approach like CSMA/CA to network changes produced e.g. by traffic variations and time-variant channel conditions. In CSMA/CA, nodes make their own decisions based on partial network information and the handshaking procedure allows the use of AAS at the transmitter and the receiver. How to effectively use AAS in CSMA/CA with handshaking is addressed in this thesis. Different beam selection policies using switched beam antenna systems are investigated. Finally, we demonstrate how the proposed techniques can be applied in a rural access scenario in Nicaragua. The result of a user-deployed MWN for Internet access shows that the supported aggregated end-to-end rate is higher than an Asymmetric Digital Subscriber Line (ADSL) connection. / QC 20100908

Due to the rapid development of semiconductor technology, the number of transistors of integrated circuits in unit area increases by double in roughly every two years. We then can add more circuits and functionality into a single chip. The size of electronic products certainly is reduced. Besides, because of the blooming popularity of wireless network standards in recently year, sensors have been wireless connected to provide more functionality and intelligence. They are, namely, wireless sensor network (WSN). Before long, the integrated circuit design will not only be emphasized on front-end circuits and hardware design, but also integration and functionality, which is so-called the system-on-chip (SOC) design. The first topic of this thesis is the implementation of IEEE 802.15.4 network prototype and hardware design. The main purpose of prototyping is to realize the highly portable IEEE 802.15.4 protocol stack library which can be quickly transferred to different hardwares. Thus, it shortens the time to market. In ASIC hardware design, we use WISHBONE bus as the interconnection architecture which can be easily integrated into current SOC design for an embedded system. The second topic is an application of IEEE 802.15.4 in medical monitoring, including system prototyping and ASIC hardware design, which collects the bladder pressure readings by a wireless link and ECG signals from our ASIC sensors. Finally, we realize the medical monitoring in a prototypical system.