Abstract The past two decades have witnessed an unprecedented proliferation of mobile devices equipped with extremely innovative wireless technologies. Short range networks, such as wireless personal area networks (WPANs), wireless sensor networks (WSNs) and wireless body area networks (WBANs) have been defined and researched to deliver high speed home connectivity, environment and health monitoring. This thesis tackles design, analysis and simulation of medium access control (MAC) protocols tailored for short range networks. These have in common the use of battery operated devices but also certain design challenges connected with MAC protocols are common upon selecting the physical layer technology. Ultra wideband (UWB) technology and 60 GHz technology (which is referred to also as millimeter wave communications) are two valid examples of the wireless revolution of the past decade. Several existing standards, such as IEEE 802.15.3, ECMA-368, IEEE 802.15.4 and its amendment IEEE 802.15.4a, are considered in this thesis for MAC analysis in conjunction with UWB technology. With regard to millimeter wave communications the characteristics of the IEEE 802.15.3c standard are taken into account. Apart for the IEEE 802.15.3c all the MAC protocols have been modeled in the network simulator Opnet. One contribution of this thesis is to produce an innovative and in-depth analysis of the management aspects (e.g. ECMA-368 distributed beaconing) stemming from the above mentioned standards by means of analytical and simulation models. This study approach allows selecting the MAC features suitable for the applications and the technologies of interest. The key performance metric used to analyze all the protocols is energy efficiency, but also throughput is investigated. Another contribution brought by this thesis consists in the innovative way of studying slotted-based MAC protocols as an integrated concept connected with the type of network, the type of application and the selected physical technologies. This thesis also shows MAC performance in conjunction with UWB when false alarm, miss-detection and receiver capture (capture is modeled by means of an existing interference model) are taken into consideration. Most of the unrealistic, though common, assumptions in MAC analysis are removed and the performance of selected medical applications is evaluated through Opnet simulations. The well known binary exponential backoff is analyzed with an innovative though simplified one-dimensional Markov chain approach in the context of directional MAC for 60 GHz communications. As shown in the remainder of this thesis, the simplification introduced does not hinder the accuracy of the results, but rather allows accounting even for a finite number of retransmissions with a simple chain extension. / Tiivistelmä Kahden viime vuosikymmenen aikana innovatiivisella langattomalla tekniikalla varustettujen viestintälaiteiden määrä on kasvanut räjähdysmäisesti. Lyhyen kantaman verkkoja kuten langattomia henkilökohtaisen alueen verkkoja (WPAN), langattomia anturiverkkoja (WSN) ja langattomia vartaloalueen verkkoja (WBAN) on määritelty ja tutkittu, jotta voitaisiin tuottaa korkeanopeuksisia kotiyhteyksiä sekä välineitä ympäristön ja terveydentilan seurantaan. Tämä väitöskirja käsittelee lyhyen kantaman viestintään suunniteltujen linkinohjauskerroksen MAC-protokollien suunnittelua, analysointia ja simulointia. Näissä kaikissa käytetään akkukäyttöisiä laitteita, mutta myös tietyt MAC-protokollien suunnittelun haasteet ovat tavallisia fyysisen kerroksen teknologiaa valittaessa. Ultra-laajakaistainen (UWB) teknologia ja 60 GHz teknologia (eli millimetriaallonpituusalueen tietoliikenne) ovat hyviä esimerkkejä kuluneen vuosikymmenen langattomasta vallankumouksesta. Tässä väitöskirjassa huomioidaan UWB teknologiaan liittyvää MAC-kerroksen analyysiä tehtäessä useat olemassa olevat standardit, kuten IEEE 802.15.3, ECMA-368, IEEE 802.15.4 ja sen lisäys IEEE 802.15.4a. Millimetriaallonpituusalueen tietoliikenteessä huomioidaan myös IEEE 802.15.3c standardin erityispiirteet. IEEE 802.15.3c:tä lukuun ottamatta kaikki MAC-protokollat on mallinnettu Opnet verkkosimulaattorilla. Tämä tutkimus tarjoaa innovatiivisen ja syväluotaavan tutkimuksen näiden standardien pohjalta ja analyyttisten ja simuloitujen mallien avulla kehitetyistä hallinnallisista lähestymistavoista (esim. ECMA-368 hajautettu majakkasignaali). Näiden avulla voidaan valita kohteena oleviin sovelluksiin ja teknologioihin parhaiten soveltuvia MAC-ominaisuuksia. Kaikkien protokollien analysointiin käytetty ensisijainen suorituskykymittari on energiatehokkuus, mutta myös datanopeuksia on tarkasteltu. Tässä tutkimuksessa esitellään myös innovatiivinen tapa tutkia MAC protokollia integroituina konsepteina suhteessa verkon ja sovellusten tyyppiin sekä fyysisen kerroksen teknologiaan. Lisäksi tämä väitöskirja esittelee MAC suorituskykyä UWB verkossa silloin, kun siinä otetaan huomioon väärät hälytykset, väärä havainnointi ja vastaanottimen signaalinkaappaus (vastaanoton mallintamiseksi käytetään olemassa olevaa interferenssimallia). MAC analyysistä poistetaan useimmat epärealistiset, vaikkakin tavalliset, olettamukset, ja verkkojen suorituskykyä tarkastellaan valittujen kriittisten parametrien monitoroinnissa Opnet-simulaatioiden avulla. Tunnettua binäärijakoinen eksponentiaalinen perääntyminen -algoritmia analysoidaan innovatiivisella, yksinkertaistetulla yksiulotteisella Markov-ketju -mallilla 60 GHz:n suunta-antenni MAC:n yhteydessä. Kuten tässä tutkimuksessa tullaan osoittamaan, esitelty yksinkertaistus ei rajoita tulosten tarkkuutta, vaan mukaan voidaan lukea jopa rajallinen määrä uudelleenlähetyksiä yksinkertaisen Markovin ketjun laajennuksen avulla.

No description available.

A wireless sensor network is a distributed network system consisting of miniature spatially distributed autonomous devices designed for using sensors to sense the environment and cooperatively perform a specific goal. Each sensor node contains a limited power source, a sensor and a radio through which it can communicate with other sensor nodes within its communication radius. Since these sensor nodes may be deployed in inaccessible terrains, it might not be possible to replace their power sources. The radio transceiver is the hardware component that uses the most power in a sensor node and the optimisation of this element is necessary to reduce the overall energy consumption. In the data link layer there are several major sources of energy waste which should be minimised to achieve greater energy efficiency: idle listening, overhearing, over-emitting, network signalling overhead, and collisions. Sleep scheduling utilises the low-power sleep state of a transceiver and aims to reduce energy wastage caused by idle listening. Idle listening occurs when the radio is on, even though there is no data to transmit or receive. Collisions are reduced by using medium reservation and carrier sensing; collisions occur when there are simultaneous transmissions from several nodes that are within the interference range of the receiver node. The medium reservation packets include a network allocation vector field which is used for virtual carrier sensing which reduces overhearing. Overhearing occurs when a node receives and decodes packets that are not destined to it. Proper scheduling can avoid energy wastage due to over-emitting; over-emitting occurs when a transmitter node transmits a packet while the receiver node is not ready to receive packets. A protocol stack is proposed that achieves an ultra-low duty cycle sleep schedule. The protocol stack is aimed at large nodal populations, densely deployed, with periodic sampling applications. It uses the IEEE 802.15.4 Physical Layer (PHY) standard in the 2.4 GHz frequency band. A novel hybrid data-link/network cross-layer solution is proposed using the following features: a global sleep schedule, geographical data gathering tree, Time Division Multiple Access (TDMA) slotted architecture, Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA), Clear Channel Assessment (CCA) with a randomised contention window, adaptive listening using a conservative timeout activation mechanism, virtual carrier sensing, clock drift compensation, and error control. AFRIKAANS : 'n Draadlose sensor-netwerk is 'n verspreide netwerk stelsel wat bestaan uit miniatuur ruimtelik verspreide outonome toestelle wat ontwerp is om in harmonie saam die omgewing te meet. Elke sensor nodus besit 'n beperkte bron van energie, 'n sensor en 'n radio waardeur dit met ander sensor nodusse binne hulle kommunikasie radius kan kommunikeer. Aangesien hierdie sensor nodusse in ontoeganklike terreine kan ontplooi word, is dit nie moontlik om hulle kragbronne te vervang nie. Die radio is die hardeware komponent wat van die meeste krag gebruik in 'n sensor nodus en die optimalisering van hierdie element is noodsaaklik vir die verminder die totale energieverbruik. In die data-koppelvlak laag is daar verskeie bronne van energie vermorsing wat minimaliseer moet word: ydele luister, a uistering, oor-uitstraling, oorhoofse netwerk seine, en botsings. Slaap-skedulering maak gebruik van die lae-krag slaap toestand van 'n radio met die doel om energie vermorsing wat veroorsaak word deur ydele luister, te verminder. Ydele luister vind plaas wanneer die radio aan is selfs al is daar geen data om te stuur of ontvang nie. Botsings word verminder deur medium bespreking en draer deteksie; botsings vind plaas wanneer verskeie nodusse gelyktydig data stuur. Die medium bespreking pakkies sluit 'n netwerk aanwysing vektor veld in wat gebruik word vir virtuele draer deteksie om a uistering te verminder. Afluistering vind plaas wanneer 'n nodus 'n pakkie ontvang en dekodeer maar dit was vir 'n ander nodus bedoel. Behoorlike skedulering kan energie verkwisting as gevolg van oor-uistraling verminder; oor-uistraling gebeur wanneer 'n sender nodus 'n pakkie stuur terwyl die ontvang nog nie gereed is nie. 'n Protokol stapel is voorgestel wat 'n ultra-lae slaap-skedule dienssiklus het. Die protokol is gemik op draadlose sensor-netwerke wat dig ontplooi, groot hoeveelhede nodusse bevat, en met periodiese toetsing toepassings. Dit maak gebruik van die IEEE 802.15.4 Fisiese-Laag standaard in die 2.4 GHz frekwensie band. 'n Nuwe baster datakoppelvlak/netwerk laag oplossing is voorgestel met die volgende kenmerke: globale slaap-skedulering, geogra ese data rapportering, Tyd-Verdeling-Veelvuldige-Toegang (TVVT) gegleufde argitektuur, Draer-Deteksie-Veelvuldige-Toegang met Botsing-Vermyding (DDVT/BV), Skoon-Kanaal-Assessering (SKA) met 'n wisselvallige twis-tydperk, aanpasbare slaap-skedulering met 'n konserwatiewe aktiverings meganisme, virtuele draer-deteksie, klok-wegdrywing kompensasie, en fout beheer. Copyright / Dissertation (MEng)--University of Pretoria, 2012. / Electrical, Electronic and Computer Engineering / unrestricted

Les réseaux de capteurs sans fil (RCSF) sont très largement utilisés dans divers domaines d'applications civiles et militaires, comme la surveillance de champs de bataille, la détection de phénomène environnementaux, ou encore les bâtiments intelligents. Cependant, les réseaux de capteurs sans fil sont caractérisés par de fortes limitations au niveau de l'énergie disponible et des communications radio. Les travaux réalisés dans cette thèse visent à proposer des solutions garantissant une certaine qualité de service dans le contexte des réseaux de capteurs sans fil. La première partie concerne la couche liaison de données avec l'objectif d'augmenter la durée de vie du réseau. L'accès au médium sans fil est analysé et modélisé sous la forme d'un problème d'ordonnancement des liens de communication, tenant compte des collisions. Nous étudions alors la complexité de ce problème. Une approche distribuée et tolérante aux défaillances avec garantie de performance est proposée (SS-DD2EC) pour résoudre ce problème. La seconde partie de la thèse concerne le routage des messages à l'aide du protocle IPv6 Routing Protocol for Low-Power and Lossy Network (RPL). Tout d'abord, un comparatif entre les différentes métriques de routage existantes pour l'optimisation de l'énergie consommée a été mené. En plus de la durée de vie, les critères de fiabilité et de latence de bout-en-bout sont considérés pour évaluer ces métriques. Enfin, deux nouvelles métriques (R_MinMax et R_Delai) ont été proposées pour RPL permettant d'atteindre des gains significatifs par rapport à l'état de l'art. La première ne tient compte que des critères de consommation d'énergie et de fiabilité, alors que la seconde intègre en plus la latence de bout-en-bout. / Wireless sensor networks (RCSF) is a technology that has a wide range of civil or military applications, including battlefield monitoring, environmental monitoring or smart city. However, WSN are characterized by high limitations in terms of energy (battery-operated nodes) and wireless links (low power and lossy links). The work done in this PhD thesis aims to provide solutions that guarantee a certain quality of service in the context of wireless sensor networks. The first part of this work concerns the medium access control layer with the aim of increasing the lifetime of the network. The access to the wireless medium is analyzed and modeled as a link scheduling problem, taking into account collisions. First, a study of the complexity of this problem is carried out, then a distributed and fault-tolerant approach with guaranteed performance is proposed (SS-DD2EC) to solve this problem. The second part is about message routing with the IPv6 Routing Protocol for Low Power and Lossy Network (RPL). First of all, a comparison between the various existing routing metrics for the optimization of the energy consumed has been carried out. In addition of lifetime, the reliability and end-to-end latency criteria are considered for evaluating these metrics. Then, two new RPL metrics (R_MinMax and R_Delai) were proposed, achieving significant gains over the state of the art. The first one only considers the energy consumption and reliability, while the second one takes also into account the end-to-end latency.

Les réseaux locaux sans fil (WLAN) constituent encore le moyen le plus populaire de connexion à domicile et au bureau. Initialement conçus pour le transfert de données, avec des débits relativement faibles, il y a eu ces dernières années de fortes évolutions technologiques avec de nouveaux standards et des débits allant jusqu’à plusieurs dizaines de Mbps voire même plusieurs Gbps (IEEE 802.11n/ac). La gestion de la QoS sur les réseaux locaux sans fil basés sur la technique d’accès aléatoire constitue une problématique et un défi majeur pour les prochaines années, surtout si l’on considère la volonté des opérateurs de faire transiter des flux tels que la voix ou la vidéo. De nouvelles améliorations sont aujourd’hui plus que nécessaires afin de prendre en compte la QoS. Après l’analyse de l’état de l’art, notre première contribution concerne un mécanisme d’agrégation adaptative qui permet une différentiation de la QoS pour chaque classe de service. Nous avons ensuite étudié la Qualité d’Expérience (QoE). Nous l’avons évaluée pour le service vidéo avec différentes conditions radio et de charge. Nous avons ensuite proposé un système de prédiction de la QoE utilisant les systèmes de réseaux de neurones aléatoires (Random Neural Networks). Cette solution est ensuite utilisée pour l’analyse de l’impact des différents paramètres MAC sur la QoE pour le service vidéo. Nous avons ensuite proposé deux améliorations du mécanisme MAC. La première amélioration consiste à sélectionner des valeurs appropriées pour le Backoff. La seconde amélioration permet de renforcer la propriétarisation des flux en agissant sur les valeurs du paramètre AIFSN (Arbitration Inter-Frame Space Number). Les analyses de performances montrent que la solution proposée permet d’améliorer considérablement la QoS, particulièrement en permettant un accès assez régulier, minimiser les collisions et d’accroitre l’efficacité de l’usage des ressources radio disponibles / Wireless Local Area Networks (WLAN) are today the most popular access networking solution at homes and offices. Although initially, WLANs were designed to carry best effort traffic, users today are adopting them for various multimedia services and applications that have stringent QoS requirements. WLAN standards based on CSMA/CA technique are not able to provide QoS guarantees and furthermore lead to bad performances when the number of competing stations/flows increases. Moreover, standard QoS solutions rely on centralized approaches (e.g. PCF, HCCA) that are not widely used on terminals. The distributed approach, based on concurrent access remains fundamental in WLAN. In this thesis, we propose solutions to improve both QoS and QoE (Quality of Experience) of multimedia services over WLAN. The main contributions include proposal of an aggregation scheme that relies on QoS differentiation for different service classes. We then evaluated the QoE of video services over IEEE 802.11n networks for various radio, MAC and load conditions. Based on this study, a random neural network solution is then proposed to automate video QoE prediction from system parameters. Furthermore, an enhancement to the distributed access mechanism in IEEE 802.11 networks is also proposed. First, we proposed to select appropriate and specific Backoff values according to QoS requirements. Second, a new flow prioritization based on AIFSN (Arbitration Inter-Frame Space Number) values, allocated according to traffic load and traffic types is proposed. Through analysis, we showed that these solutions can enhance QoS and provide regular access, minimize collisions and provide better resource utilization

No / Avoiding collision among contending customer premise equipments (CPEs) attempting to associate with a base station (BS) in a wireless regional area network (WRAN) is a challenging issue. The collision probability is highly dependent upon the size of the initial contention window and the number of contending CPEs. To reduce the collision probability among CPEs in order to start the ranging process in an IEEE 802.22 network, the BS needs to adjust the initial contention window size. This paper provides an analytical framework to estimate the ranging request collision probability depending upon the size of the initial contention window and the number of CPEs attempting to join the IEEE WRAN cell. The accuracy of the estimated curve is analyzed for various numbers of contention CPEs on the basis of the relative errors. The numerical results confirm that the approximation works reasonably well for finding the ranging request collision probability for any number of contention CPEs at a particular value of initial contention window size. Moreover, this approximation provides the threshold size for a contention window to start the initial ranging process for any number of CPEs in an IEEE 802.22 network. (C) 2014 Elsevier B.V. All rights reserved.

In order to efficiently utilize the scarce wireless resource as well as keep up with the ever-increasing demand for Quality-of-Service (QoS) of multimedia applications, wireless networks are undergoing rapid development and dramatic changes in the underlying technologies and protocols. The Medium Access Control (MAC) protocol, which coordinates the channel access and data transmission of wireless stations, plays a pivotal role in wireless networks. Performance modelling and analysis has been and continues to be of great theoretical and practical importance in the design and development of wireless networks. This research is devoted to developing efficient and cost-effective analytical tools for the performance analysis and enhancement of MAC protocols in Wireless Local Area Networks (WLANs) under heterogeneous multimedia traffic. To support the MAC-layer QoS in WLANs, the IEEE 802.11e Enhanced Distributed Channel Access (EDCA) protocol has proposed three QoS differentiation schemes in terms of Arbitrary Inter-Frame Space (AIFS), Contention Window (CW), and Transmission Opportunity (TXOP). This research starts with the development of new analytical models for the TXOP scheme specified in the EDCA protocol under Poisson traffic. A dynamic TXOP scheme is then proposed to adjust the TXOP limits according to the status of the transmission queue. Theoretical analysis and simulation experiments show that the proposed dynamic scheme largely improves the performance of TXOP. To evaluate the TXOP scheme in the presence of ii heterogeneous traffic, a versatile analytical model is developed to capture the traffic heterogeneity and model the features of burst transmission. The performance results highlight the importance of taking into account the heterogeneous traffic for the accurate evaluation of the TXOP scheme in wireless multimedia networks. To obtain a thorough and deep understanding of the performance attributes of the EDCA protocol, a comprehensive analytical model is then proposed to accommodate the integration of the three QoS schemes of EDCA in terms of AIFS, CW, and TXOP under Poisson traffic. The performance results show that the TXOP scheme can not only support service differentiation but also improve the network performance, whereas the AIFS and CW schemes provide QoS differentiation only. Moreover, the results demonstrate that the MAC buffer size has considerable impact on the QoS performance of EDCA under Poisson traffic. To investigate the performance of EDCA in wireless multimedia networks, an analytical model is further developed for EDCA under heterogeneous traffic. The performance results demonstrate the significant effects of heterogeneous traffic on the total delay and frame losses of EDCA with different buffer sizes. Finally, an efficient admission control scheme is presented for the IEEE 802.11e WLANs based on analytical modelling and a game-theoretical approach. The admission control scheme can maintain the system operation at an optimal point where the utility of the Access Point (AP) is maximized with the QoS constraints of various users.

Denna rapport behandlar prestandaproblem i den nyligen standardiserade Mesh kommunikationsstandarden (IEEE 802.11s). I denna rapport, undersöker och förbättra vi ett förhållande som resulterar i reduktion av genomströmningen i en kedja av noder topologi. IEEE802.11s är mycket lovande med många fördelar för både IoT-systemen och trådlösa nätverk i båda hemmet och arbete.Vi arbetar med frågan om orättvisa när CSMA/CA tillämpas, vilket orsakar genomströmningsreduktion på grund av paketförluster och indikerar svältning. Vi analyserar konsekvenserna av Collision Avoidance (CA) mekanism och föreslår en ersättning för CA som är både rättvist och samtidigt kan upprätthålla undvikande av kollisioner. Vi implementera detta i en simulator och resultatet visar på betydligt högre end-to-end-genomströmning än standard CSMA/CA och inga paketförluster på grund av buffertspill. / This thesis rapport deals with the performance issues of the newly standardized Wireless mesh protocol (IEEE 802.11s). In this thesis, we work on improving the conditions that results in throughput degradation in a chain of nodes topology. The mesh standard is very promising with many advantages for both IoT systems and home wireless networks.We work on the issue of unfairness when CSMA/CA is applied, which causes throughput degradation due to packet loss and indicates starvation. We analyze the implication of the Collision Avoidance (CA) mechanism and propose a replacement for the CA that is both fair and able to maintain collision avoidance. We implement this in a simulator and the result shows significantly higher end-to-end throughput compared to the original CSMA/CA and no packet loss due to buffer overflow.

"A distributed queueing Medium Access Control (MAC) protocol is used in Distributed Queue Dual Bus (DQDB) networks. A modified version of the MAC protocol was proposed by R.R. Pillai and U. Mukherji in an attempt to overcome some of the shortcomings of the DQDB MAC protocol. They analyzed the performance of the system for Bernoulli arrivals and for large propagation delays between the nodes. We extend the performance analysis of the modified MAC protocol for a DQDB type of Network. The parameter of interest to us is the bus access delay. This has two components, viz., the request bus access delay and the data bu6 access delay. We use the model at the request point at node and present methods to evaluate the delay experienced in such a model. The model is an n-priority ./D/l queue with D vacations (non-preemptive priority) where n is the number of nodes sending requests on the request bus for transmission on the data bus. The methods presented help to evaluate the request bus access delay when the arrivals at each node are Markovian Arrival Processes (MAPs). The algorithms for evaluating the mean request bus access delay are based on matrix geometric techniques. Thus, one can use the algorithms developed in the literature to solve for the finite buffers case too. This model, for the request bus access delay, holds irrespective of the propagation delay between the nodes. We also evaluate the inter-departure time of class 1 customers and virtual customers in a 2-priority M/G/l system with G vacations (non-preemptive priority). In the case of Poisson arrivals at all the nodes, we would have a 2-priority M/D/l system with D vacations (non-preemptive priority). We thus evaluate the inter-arrival time of the free slots on the data bus as seen by Node 2. Note that this is independent of the number of active nodes in the network We then develop methods to evaluate the mean data bus access delay experienced by the customers at Node 2 in a three-node network with 2 nodes communicating with the third when the propagation delay between the nodes is large. We consider the case of finite Local Queue buffers at the two nodes. Using this assumption we arrive at process of arrivals to the Combined Queue and the process of free slots on the data bus to be Markov Modulated Bernoulli processes. The model at the combined queue at Node 2 then has a Quasi Birth-Death evolution. Thus, this system is solved by using the Ramaswami-Latouche algorithm. The stationary probabilities are then used to evaluate the mean data bus access delay experienced at Node 2. The finite buffer case of this system can be solved by G.Wi Stewart's algorithm. The method in modelling the system and the results are presented in detail for Poisson arrivals. The extension of this to more complex processes is also explained. We encounter in the analysis an explosion of the state-space of the system. We try to counter this by considering approximations to the process of free slots on the data bus. The approximations considered are on the basis of what are known as Idealized Aggregates. The performance of the approximation is also detailed. It works very well under low and moderate load but underestimates the mean delay under heavy load. Thereafter, we discuss the performance of the system with reference to the mean of the access delay and the standard deviation of the access delay under varying traffic at the two nodes. For this part we use simulation results to discuss the performance. The comparison between the performance measures at both the nodes is also done. Then we develop methods/techniques to understand the performance of the system when we have finite propagation delays between the nodes. We concentrate on the 3-node problem and calculate performance bounds based on linear programs. This is illustrated in detail for Bernoulli arrivals for the case of 1 slot propagation delay between the nodes as well as for the case of 2 slots propagation delay. The performance of the bounds obtained is also detailed. The presence of an idling system at the combined queue of Node 2 makes the bounds somewhat loose. Finally, we discuss the performance of the system with reference to the mean access delay and the standard deviation of the access delay under varying load on the system. Again, we rely on simulation studies. Finally, we study the performance of the system as a multiplexer. For this, we re­strict the traffic to Markov Modulated Processes (or those which would satisfy the Gartner-Ellis Theorem requirements). The traffic is characterized by what are known as Envelope Processes - Lower and Upper. The class of processes which satisfy the conditions of the Gartner-Ellis theorem come under the category where both the Envelope Processes exist and the Minimum Envelope Rate and the Maximum Lower Envelope Rate are the same. We use the system evolution equations at the combined queue at any node to develop re­lations between the various input and output processes. First, this is done for a. system of this kind, in isolation. Then, we consider this system as a part of the modified protocol and present relations, among the various input and output processes, which are specific to the modified protocol. The possible use of all of the above to do Admission Control at the entry point to the Asynchronous Transfer Mode (ATM) network is also presented.

L'objectif de la thèse est d'étudier la variation temporelle de la qualité des liens dans les réseaux de capteurs sans fil à grande échelle, de concevoir des estimateurs permettant la différenciation, à court terme et long terme, entre liens de qualité hétérogène. Tout d'abord, nous étudions les caractéristiques de deux paramètres de la couche physique: RSSI (l'indicateur de puissance du signal reçu) et LQI (l'indicateur de la qualité de liaison) sur SensLab, une plateforme expérimentale de réseau de capteurs à grande échelle situé à l'intérieur de bâtiments. Nous observons que le RSSI et le LQI permettent de discriminer des liens de différentes qualités. Ensuite, pour obtenir un estimateur de PRR, nous avons approximé le diagramme de dispersion de la moyenne et de l'écart-type du LQI et RSSI par une fonction Fermi-Dirac. La fonction nous permet de trouver le PRR à partir d'un niveau donné de LQI. Nous avons évalué l'estimateur en calculant le PRR sur des fenêtres de tailles variables et en le comparant aux valeurs obtenues avec l'estimateur. Par ailleurs, nous montrons en utilisant le modèle de Gilbert-Elliot (chaîne de Markov à deux états) que la corrélation des pertes de paquets dépend de la catégorie de lien. Le modèle permet de distinguer avec précision les différentes qualités des liens, en se basant sur les probabilités de transition dérivées de la moyenne et de l'écart-type du LQI. Enfin, nous proposons un modèle de routage basé sur la qualité de lien déduite de la fonction de Fermi-Dirac approximant le PRR et du modèle Markov Gilbert-Elliot à deux états. Notre modèle est capable de distinguer avec précision les différentes catégories de liens ainsi que les liens fortement variables. / The goal of the thesis is to investigate the issues related to the temporal link quality variation in large scale WSN environments, to design energy efficient link quality estimators able to distinguish among links with different quality on a short and a long term. First, we investigate the characteristics of two physical layer metrics: RSSI (Received Signal Strength Indication) and LQI (Link Quality Indication) on SensLAB, an indoor large scale wireless sensor network testbed. We observe that RSSI and LQI have distinct values that can discriminate the quality of links. Second, to obtain an estimator of PRR, we have fitted a Fermi-Dirac function to the scatter diagram of the average and standard variation of LQI and RSSI. The function enables us to find PRR for a given level of LQI. We evaluate the estimator by computing PRR over a varying size window of transmissions and comparing with the estimator. Furthermore, we show using the Gilbert-Elliot two-state Markov model that the correlation of packet losses and successful receptions depend on the link category. The model allows to accurately distinguish among strongly varying intermediate links based on transition probabilities derived from the average and the standard variation of LQI. Finally, we propose a link quality routing model driven from the F-D fitting functions and the Markov model able to discriminate accurately link categories as well as high variable links.