One of the major driving elements behind the explosive boom in wireless revolution is the advances in the field of modulation which plays a fundamental role in any communication system, and especially in cellular radio systems. Hence, the elaborate choice of an efficient modulation scheme is of paramount importance in the design and employment of any communications system. Work presented in this thesis is an investigation (study) of the feasibility of whether multilevel FSK modulation scheme would provide a viable alternative modem that can be employed in TDMA cordless communications systems. In the thesis the design and performance analysis of a non-coherent multi-level modem that offers a great deal of bandwidth efficiency and hardware simplicity is studied in detail. Simulation results demonstrate that 2RC pre-modulation filter pulse shaping with a modulation index of 0.3, and pre-detection filter normalized equivalent noise bandwidth of 1.5 are optimum system parameter values. Results reported in chapter 5 signify that an adjacent channel rejection factor of around 40 dB has been achieved at channel spacing of 1.5 times the symbol rate while the DECT system standards stipulated a much lower rejection limit criterion (25-30dB), implying that CP-QFSK modulation out-performs the conventional GMSK as it causes significantly less ACI, thus it is more spectrally efficient in a multi-channel system. However, measured system performance in terms of BER indicates that this system does not coexist well with other interferers as at delay spreads between 100ns to 200ns, which are commonly encountered in such indoor environment, a severe degradation in system performance apparently caused by multi-path fading has been noticed, and there exists a noise floor of about 40 dB, i.e. high irreducible error rate of less than 5.10-3. Implementing MRC diversity combiner and BCH codec has brought in a good gain. / Higher Education Ministry

No description available.

No description available.

Neste trabalho propomos e analisamos algoritmos de alocação dinâmica de banda para rede óptica passiva (PON) de acesso padrão GPON (Gigabit PON). Estes algoritmos utilizam dados oriundos de SLA (service level agreement) para gerenciar a alocação de banda e classificar em 4 contêineres de tráfego (T-CONT) o tráfego gerado em 16 ONUs (optical network unit). Na transmissão upstream é utilizada a técnica de multiplexação por divisão de tempo (TDM) para gerenciar o acesso ao meio, evitando colisões. O primeiro algoritmo proposto aloca banda garantida para as ONUs e distribui a banda não utilizada de acordo com critério baseado em três SLAs. A taxa de bit upstream é 1,25 Gbps e o desempenho do algoritmo é analisado com base na variação do atraso de pacotes em função do tráfego gerado nas ONUs. O segundo algoritmo proposto utiliza ponderação de tráfego. Neste, analisamos o comportamento dos atrasos e a quantidade de banda solicitada e atendida por ONU quando as bandas garantida e extra são alteradas. Por fim, acrescentamos em nossa implementação um intervalo para o processamento do algoritmo de alocação dinâmica de banda (DBA) e resposta do hardware relacionado ao ciclo de interrogação. Então, analisamos o atraso de pacotes quando variamos o intervalo de processamento do DBA. Ao final, propomos uma solução preliminar para minimizar estes atrasos. Os resultados obtidos por meio de simulação computacional mostram a versatilidade dos algoritmos. / In this work we propose and analyze the performance of dynamic bandwidth allocation algorithms for optical passive networks (PON) in GPON standard (Gigabit PON). These algorithms use data from SLA (service level agreement) to manage bandwidth allocation and classify in 4 traffic containers (T-CONT) the traffic generated by 16 ONUs (optical network unit). In the upstream transmission the time division multiplexing (TDM) technique is used to manage the medium access, avoiding collisions. The first proposed algorithm allocates guaranteed bandwidth for the ONUs and distributes the bandwidth not used according to the criteria based on three SLAs. The upstream bit rate is 1.25 Gbps and the algorithm performance is analyzed based on the packets delay variation versus the traffic generated by ONUs. The second proposed algorithm uses weighted traffic. In this, we analyze the delay performance and the required bandwidth for each ONU and how much it is served when the guaranteed and extra bandwidth are changed. Finally, we added in our implementation an interval for the processing of the dynamic bandwidth allocation algorithm (DBA) and response of the hardware related to the interrogation cycle. In the end, we propose a preliminary solution to minimize these delays. The results obtained by means of computational simulation show the versatility of the algorithms.

[Truncated abstract] This thesis develops a scheduled protocol (time division multiple access, TDMA) called flexible-schedule-based TDMA Protocol (FlexiTP), to address the problem of providing end-to-end guarantees on data delivery, whilst also respecting severe resource constraints of wireless sensor networks. FlexiTP achieves this balance through a distributed, synchronised, and loose slot structure in which sensor nodes can build, modify, or extend their schedules based on their local information. In FlexiTP, it is not necessary to predetermine the number of slots required for a network. FlexiTP's local repair scheme allows nodes to adjust their schedules dynamically and autonomously to recover from node and communication faults. Hence, it maintains a reliable and selforganising multihop network. Most sensor network protocols designed for data gathering applications implicitly assume a periodic rate of data collection from all nodes in the network to the base station. However, nodes may want to report their data more rapidly or slowly depending on the significance and importance of their data to the end-user. The problem is that traditional TDMA-based protocols are not flexible to changes in traffic patterns because of their rigid slot structure schemes. This thesis aims to solve this problem by developing an ondemand TDMA slot transfer method that leverages the flexible-slot structure algorithm of FlexiTP to transfer time slots from one part of the network to another part. ... While these communication patterns are sufficient for monitoring applications, individual sensor nodes may need to send their data to multiple destination nodes across the network in order to execute a distributed cooperative-function based on their local environment. This peer-to-peer communication pattern makes sensor networks more reactive to triggers from the environment. This thesis attempts to solve the problem of lack of peer-to-peer communication in the design of a TDMA-driven protocol by extending the idea of on-demand TDMA slot transfer method to allow each sensor node in the network to claim extra time slots to communicate with any other nodes (peers) in the network, without going through the base station. Nodes in the network may have different priorities of data because of event-triggering sensor readings or various types of sensor readings (e.g., light, temperature, and humidity) they provide. When nodes with high priority packets increase the frequency of their data collections, the network bandwidth may be dominated by these nodes. It is desirable to allow nodes with low priority packets to aggregate their packets and so enabling these nodes to send their data to the base station under the current available network bandwidth. This thesis proposes an on-demand data aggregation algorithm that enables sensor nodes to perform an in-network-aggregation based on their current sensing requirements and network capacity constraints. In summary, this thesis describes the design, implementation, and evaluation of protocols for wireless sensor networks that focus on achieving energy-efficiency, provisioning performance assurances, and supporting reactivity and adaptability in constantly changing environment.

Η επιθυμία του ανθρώπου για ποιοτική και αδιάκοπη επικοινωνία, έχει ωθήσει την τεχνολογία να κάνει άλματα εξέλιξης. Η συνεχής ανάπτυξη των απαιτήσεων των χρηστών των τηλεπικοινωνιακών δικτύων, καθιστά αναγκαία την ανανέωση των τεχνολογιών και ιδιαίτερα την αύξηση του παρεχόμενου εύρους ζώνης, ώστε να συμβαδίζει με τις ανάγκες τους. Γι’αυτό το λόγο τα τελευταία χρόνια έχουν εμφανιστεί οι οπτικές ίνες, που με τα πλεονεκτήματα που παρουσιάζουν, κερδίζουν ολοένα και περισσότερο τις αγορές και τους καταναλωτές. Στην παρούσα διπλωματική παρουσιάζονται τα πλεονεκτήματα και οι τεχνολογίες που χρησιμοποιεί ένα δίκτυο βασισμένο σε οπτικές ίνες (παθητικό οπτικό δίκτυο – PON). Εξετάζεται τόσο η τεχνολογία TDMA, όσο και η WDMA στα PONs. Η μελέτη γίνεται πάνω στο πρότυπο ΕΡΟΝ (Ethernet-PON), που ορίστηκε ως το καταλληλότερο συγκριτικά με άλλα παρόμοιά του. Πιο συγκεκριμένα, εξετάζεται η διάθεση εύρους ζώνης στο ανοδικό κανάλι (από τον χρήστη προς το τηλεπικοινωνιακό κέντρο) στα συστήματα ΕΡΟΝ και τι αποτελέσματα και συμπεράσματα μπορούν να ληφθούν. Αρχικά, αναφέρεται μια προηγούμενη μελέτη ενός ΕΡΟΝ η οποία κάνει χρήση του αλγορίθμου IPACT, της περιορισμένης υπηρεσίας (limited service) του αλγορίθμου και υποστηρίζει μονοδιάστατη ανοδική κίνηση δεδομένων. Το δίκτυο ΕΡΟΝ μοντελοποιείται και προσφέρει αποτελέσματα ύστερα από μαθηματική ανάλυση με χρήση της γλώσσας προγραμματισμού C, καθώς και αποτελέσματα με τη χρήση της γλώσσας προσομοίωσης SIMSCRIPT II.5. Στη συνέχεια, περιγράφεται και μοντελοποιείται ένα δίκτυο ΕΡΟΝ που κάνει χρήση της σταθερής υπηρεσίας (fixed service) του αλγορίθμου IPACT και υποστηρίζει πολλαπλές κατηγορίες υπηρεσιών ανοδικής κίνησης δεδομένων με διαφορετικές προτεραιότητες. Και σε αυτή την περίπτωση, το δίκτυο ΕΡΟΝ προσφέρει αποτελέσματα τόσο από ένα αναλυτικό μοντέλο, όσο και από ένα μοντέλο προσομοίωσης. Τέλος, περιγράφεται και μοντελοποιείται ένα δίκτυο όμοιο με το προηγούμενο δίκτυο ΕΡΟΝ, με τη διαφορά να έγκειται στη χρήση της τεχνολογίας WDM στο ΕΡΟΝ. Η μελέτη σε αυτό το τμήμα της εργασίας γίνεται με χρήση επίσης της σταθερής υπηρεσίας (fixed service) του αλγορίθμου IPACT και υποστηρίζει πολλαπλές κατηγορίες υπηρεσιών ανοδικής κίνησης δεδομένων με διαφορετικές προτεραιότητες. Με αυτόν τον τρόπο επιτυγχάνεται μια σημαντική αύξηση του διαθέσιμου εύρους ζώνης του ανοδικού καναλιού που προσφέρεται στους χρήστες. Για άλλη μια φορά παρουσιάζονται αποτελέσματα ύστερα από ανάλυση και προσομοίωση του μοντέλου, με χρήση, όπως και προηγουμένως, της γλώσσας προγραμματισμού C και της γλώσσας προσομοίωσης SIMSCRIPT II.5. Τα συμπεράσματα που εξάγονται, ύστερα από τις παραπάνω μελέτες, είναι άξια προσοχής. / In the past few years technology, in the communication field, has made great progress due to the fact that people desire more and more good quality of service. The continuous demand for development of the subscribers using the telecommunication services, necessitates the technological renewal and especially the increase of the available bandwidth. For this reason, optical fibers have appeared in the networking field and they are becoming more known by the users and in the market every day. In this dissertation the advantages and the technologies a network, based on optical fiber uses, are presented. An optical fiber network it is also called Passive Optical Network (PON). The TDMA (Time Division Multiplexing Access) and WDMA (Wavelength Division Multiplexing Access) technologies are examined. The study is based on an EPON (Ethernet-PON) standard, which was chosen as the most suitable among others. More specifically, the available upstream (from the users to the Central Office) bandwidth in an EPON model and the results that can be deduced are examined. In the beginning, a previous study of an EPON which uses the IPACT (Interleaved Polling with Cycle Time) algorithm is reported. The EPON network uses the limited service of the IPACT algorithm and supports a single rate. A specific model of an EPON network is studied and results using the C programming language and the simulation language SIMSCRIPT II.5 are given. Moreover, an EPON network which uses the fixed service of the IPACT algorithm which supports a multi-rate upstream with different priorities is described and modeled. In this case as well, the EPON model network gives results based on analysis and simulation. In the end, a same EPON network, as the one described before, is studied and modeled having as a difference that a WDM technology is used. The fixed service of the IPACT algorithm is used and a multi-rate upstream with different priorities are supported again. With this different technology, an important increase in the available upstream bandwidth which is provided to the users is accomplished. Once again, the results are presented after an analysis and a simulation of the model, using the programming language C and the simulation language SIMISCRIPT II.5. The extracted results which the models can offer are worthy of attention.

Conselho Nacional de Desenvolvimento CientÃfico e TecnolÃgico / CoordenaÃÃo de AperfeiÃoamento de Pessoal de NÃvel Superior / Neste trabalho, alÃm dos capÃtulos que envolvem a teoria e definiÃÃes, foi basicamente divido em trÃs estudos: Primeiro (capÃtulo 4), apresentamos uma investigaÃÃo numÃrica do desempenho de um filtro passa-banda totalmente Ãptico composto por um acoplador direcional duplo seguido de duas grades de Bragg simetricamente iguais gravadas nos seus braÃos de saÃda. Esta configuraÃÃo caracteriza um InterferÃmetro de Michelson com caracterÃsticas de um filtro add/drop. As caracterÃsticas de transmissÃo (T), taxa de extinÃÃo (XR) e âcrosstalkâ (XT) foram estudadas a partir da aplicaÃÃo de um sinal CW (onda contÃnua) na entrada do dispositivo. A teoria de modos acoplados e o mÃtodo de Runge Kutta de 4a ordem foram aplicados, respectivamente para resolver as equaÃÃes diferenciais acopladas. Este à o primeiro estudo feito considerando a nÃo linearidade do acoplador e a linearidade das grades de Bragg. O dispositivo apresenta um comportamento altamente nÃo-linear em funÃÃo do defasamento entre as amplitudes dos feixes refletidos e em funÃÃo da potÃncia de entrada. Num segundo momento (capÃtulo 5) apresentamos a propagaÃÃo e chaveamento de pulsos ultracurto (~2ps) usando um interferÃmetro de Michelson de Fibras Ãpticas. Neste estudo o desempenho do interferÃmetro à estudado como uma funÃÃo das caracterÃsticas nÃo lineares do acoplador e das grades de Bragg. Os estudos numÃricos foram feitos a partir das equaÃÃes de modos acoplados resolvidas usando o mÃtodo de Runge-Kutta de 4 ordem. As caracterÃsticas de chaveamento do pulso foram analisadas em funÃÃo da potÃncia de entrada e do defasamento aplicado em uma das grades de Bragg. As caracterÃsticas de transmissÃo (T), coeficiente de ExtinÃÃo (XR), âcrosstalkâ (XT), fator de compressÃo (FC). Utilizamos trÃs valores de potÃncia de entrada: abaixo da potÃncia critica (P0=1W), igual a potÃncia crÃtica (P0=1,73W) e acima da potÃncia crÃtica (P0=1,95W). AtravÃs deste estudo, pode-se verificar que a transmissÃo, taxa de extinÃÃo, âcrosstalkâ e fator de compressÃo dependem da potÃncia da bombeio inserida no dispositivo e da defasagem aplicada. O interferÃmetro de Michelson em fibras implementa componente de grande importÃncia para aplicaÃÃes em redes Ãpticas, como os demultiplexadores add/drop. Este dispositivo tem atraÃdo bastante interesse no campo das telecomunicaÃÃes devido a sua alta capacidade de taxas de transmissÃo. Num terceiro momento foi apresentado um estudo de simulaÃÃo numÃrica do desempenho da codificaÃÃo e decodificaÃÃo de pulsos Ãpticos curtos (ps) em sistemas OCDMA (Optical Code Division Multiple Access â acesso VIII mÃltiplo por divisÃo de cÃdigo no domÃnio Ãptico) baseado em FBG (Fiber Bragg Grating â grade de Bragg em fibra Ãptica) onde os cÃdigos sÃo inseridos atravÃs de saltos discretos na fase Ãptica (Âπ). Para geraÃÃo de pulsos codificados foram utilizados cÃdigos de Gold obtidos analiticamente. Analisamos como a inserÃÃo de cÃdigos adicionais afetam a autocorrelaÃÃo e correlaÃÃo cruzada. O interferÃmetro de Michelson inicialmente estudado no capÃtulo 4 foi utilizado para propagaÃÃo e chaveamento de sinais codificados. Baseados nas caracterÃsticas de TransmissÃo (T) e Taxa de extinÃÃo (XR) fizemos um estudo do dispositivo como multiplexador /demultiplexador add/drop na recuperaÃÃo de pulsos codificados. / This work, in addition the chapters which involves both theory and definitions, was basically divided three studies: First (chapter 4),we present a numerical investigation of the performance of a bandpass filter composed of an all-optical directional coupler, followed by two double bars Bragg recorded symmetrically equal outputs in their arms. This configuration features a Michelson interferometer with characteristics of an add/ drop filter. The transmission characteristics (T), extinction rate (XR) and "crosstalk" (XT) were studied based on the application of a CW signal (continuous wave) into the device. Theory of coupled modes and the Runge Kutta fourth order were applied respectively to solve the coupled differential equations. This is the first study considering the nonlinearity of the coupler and the linearity of Bragg gratings. The device features a highly nonlinear behavior as a function of dephasing between the amplitudes of the reflected beams and depending on the input power. In a second step (section 5), the propagation and switching of ultrashort pulse (~ 2PS) Michelson interferometer using an optical fiber. In this study the performance of the interferometer is studied as a function of the nonlinear characteristics of the coupler and Bragg gratings. The numerical studies were made from the coupled mode equations solved using the Runge-Kutta 4th order. The pulse switching characteristics were analyzed as a function of input power and applied to one dephasing Bragg gratings. The transmission characteristics (T), extinction coefficient (XR), "crosstalk" (XT), the compression factor (CF)and shape of the pulses were analyzed for different values of phase and different input powers. We use three values of input power: below the critical power (1W = P0), equal to the critical power (P0 = 1.73W) and above the critical power (P0 = 1.95W). Through this study, it is found that the transmission rate of extinction, "crosstalk" and compression factor depends on the power of the pump device inserted into the gap and applied The Michelson interferometer fiber implement major component with applications in optical networks, such as demultiplexers add/drop. This device has attracted considerable interest in the field of telecommunications due to its ability of high transmission rates. In the third place was presented a numerical simulation study of the performance of encoding and decoding of short optical pulses (ps) systems OCDMA (Optical Code Division Multiple Access based on FBG (Fiber Bragg Grating ) where codes are inserted through discrete jumps in the optical phase ( π). For generation of coded pulses were used Gold codes obtained analytically. We look at how the inclusion of additional codes affect the autocorrelation and cross correlation.The Michelson interferometer initially studied Chapters 4 was used for propagation and switching of encrypted signals. Based on the characteristics of transmission (T) and extinction rate (XR) did a study of the device as multiplexer/demultiplexer add / drop in the recovery of coded pulses.

Neste trabalho propomos e analisamos algoritmos de alocação dinâmica de banda para rede óptica passiva (PON) de acesso padrão GPON (Gigabit PON). Estes algoritmos utilizam dados oriundos de SLA (service level agreement) para gerenciar a alocação de banda e classificar em 4 contêineres de tráfego (T-CONT) o tráfego gerado em 16 ONUs (optical network unit). Na transmissão upstream é utilizada a técnica de multiplexação por divisão de tempo (TDM) para gerenciar o acesso ao meio, evitando colisões. O primeiro algoritmo proposto aloca banda garantida para as ONUs e distribui a banda não utilizada de acordo com critério baseado em três SLAs. A taxa de bit upstream é 1,25 Gbps e o desempenho do algoritmo é analisado com base na variação do atraso de pacotes em função do tráfego gerado nas ONUs. O segundo algoritmo proposto utiliza ponderação de tráfego. Neste, analisamos o comportamento dos atrasos e a quantidade de banda solicitada e atendida por ONU quando as bandas garantida e extra são alteradas. Por fim, acrescentamos em nossa implementação um intervalo para o processamento do algoritmo de alocação dinâmica de banda (DBA) e resposta do hardware relacionado ao ciclo de interrogação. Então, analisamos o atraso de pacotes quando variamos o intervalo de processamento do DBA. Ao final, propomos uma solução preliminar para minimizar estes atrasos. Os resultados obtidos por meio de simulação computacional mostram a versatilidade dos algoritmos. / In this work we propose and analyze the performance of dynamic bandwidth allocation algorithms for optical passive networks (PON) in GPON standard (Gigabit PON). These algorithms use data from SLA (service level agreement) to manage bandwidth allocation and classify in 4 traffic containers (T-CONT) the traffic generated by 16 ONUs (optical network unit). In the upstream transmission the time division multiplexing (TDM) technique is used to manage the medium access, avoiding collisions. The first proposed algorithm allocates guaranteed bandwidth for the ONUs and distributes the bandwidth not used according to the criteria based on three SLAs. The upstream bit rate is 1.25 Gbps and the algorithm performance is analyzed based on the packets delay variation versus the traffic generated by ONUs. The second proposed algorithm uses weighted traffic. In this, we analyze the delay performance and the required bandwidth for each ONU and how much it is served when the guaranteed and extra bandwidth are changed. Finally, we added in our implementation an interval for the processing of the dynamic bandwidth allocation algorithm (DBA) and response of the hardware related to the interrogation cycle. In the end, we propose a preliminary solution to minimize these delays. The results obtained by means of computational simulation show the versatility of the algorithms.

[pt] Os esquemas de alocação fixa de canais - FCA - conferem aos Sistemas de Comunicação Móveis Celulares estabilidade com o custo da necessidade de um pré-planejamento de freqüências, trazendo como conseqüência a baixa tolerância à variabilidade de tráfego. Algoritmos de alocação dinâmica de canais - DCA - tem sido propostos por diversos autores com o intuito de minimizar estes problemas, permitindo ao sistema flexibilidade no momento da escolha do canal candidato para servir a uma ligação. Esquemas de alocação híbrida de canais - HCA, combinam as técnicas de alocação fixa com alocação dinâmica de canais, conferindo ao mesmo tempo estabilidade e flexibilidade ao sistema.Este trabalho compara os algoritmos FCA, DCA e HCA sobre um mesmo cenário de simulação, permitindo analisar o desempenho dos mesmos. O esquema FCA utilizado é o mais simples, onde o primeiro canal com o nível aceitável de relação sinal interferência é escolhido para ser alocado. O esquema DCA utiliza a técnica de Segregação de Canais - CS, permitindo ao sistema maior flexibilidade no momento da escolha do canal candidato, devido a não existência do pré-planejamento de freqüências. O terceiro algoritmo, HCA, combina os dois esquemas anteriores. Ao final, será analisado o impacto de se priorizar o procedimento de handoff utilizando-se a técnica conhecida como Canais de Guarda. / [en] Fixed channel assignment -FCA- brings to the Cellular Communication Systems stability at the cost of the use of frequency planning, leading to low tolerance to traffic variability. Dynamic channel assignment -DCA- algorithms have been proposed by several authors in order to minimize these problems,incorporating flexibility to the system with respect to channel selection. Hybrid channel assignment - HCA- combines the techniques of fixed and dynamic channel assignment, giving to the system stability and flexibility at the same time. This work compares the FCA, DCA and HCA algorithms on the same simulation scenario, allowing a complete analysis of these approaches. The FCA used is the simplest. In this algorithm, the first channel with an acceptable level of signal to interference ratio is chosen to be allocated. The DCA uses the technique of Channel Segregation -CS-, a distributed self-learning algorithm that is shown to yield very good performance. The third algorithm,HCA, combine the two previous techniques. At the end, the impact of prioritizing the procedure of handoff will be analyzed, using the technique known as Guard Channel.

Les accidents routiers et leurs dommages représentent un problème croissant dans le monde entier. Dans ce contexte, les réseaux véhiculaires (VANETs) peuvent être déployés pour réduire les risques et pour améliorer le confort. Ils permettent aux véhicules d'échanger différents types de données qui vont des applications de sécurité et de gestion du trafic aux applications de confort. De nos jours, les applications de sécurité sont l’objet de beaucoup d'attention des chercheurs ainsi que des fabricants d'automobiles. Dans cette thèse, nous étudierons les applications critiques pour la sécurité routière visant à fournir une assistance dans des situations dangereuses ou difficiles. Notre objectif principal sera de proposer de nouveaux protocoles de contrôle d'accès au support de transmission (MAC) et de routage, qui peuvent s’adapter dynamiquement aux changements fréquents de topologies des VANETs. Après un aperçu des protocoles d’accès sans contention dans les VANETs, nous proposons des solutions basées sur la technique de division du temps: Time Division Multiple Access (TDMA). D’abord, nous nous concentrons sur le développement d’un nouveau protocole distribué (DTMAC), qui ne repose pas sur l’utilisation d’infrastructure. DTMAC utilise les informations de localisation et un mécanisme de réutilisation des slots pour assurer que les véhicules accèdent au canal efficacement et sans collision. Les résultats obtenus ont confirmé l’efficacité de notre protocole, DTMAC se comporte très significativement mieux que VeMAC (protocole MAC basé sur TDMA.) Ensuite nous proposons TRPM, un protocole de routage basé sur une approche cross-layer. Dans TRPM, l’ordonnancement des slots TDMA construit par DTMAC et la position de la destination sont utilisés pour choisir le meilleur relais. Les résultats montrent que TRPM offre de meilleures performances, du nombre moyen de relais et de la fiabilité de livraison des messages comparé à d’autres protocoles. Dans la deuxième partie de cette thèse, nous nous focaliserons sur les mécanismes centralisés d’allocation de slots qui utilisent des coordinateurs. D’abord, nous proposons CTMAC, un protocole basé sur TDMA centralisé utilisant les RSUs (RoadSide Units) pour créer et maintenir les ordonnancements. CTMAC met en œuvre un mécanisme qui permet d’empêcher les “Access Collisions” de se produire plus que deux fois entre les véhicules qui tentent d’acquérir un même slot disponible. Les résultats ont montré que CTMAC permet de mieux minimiser les collisions, ainsi que le surcoût généré pour créer et maintenir les ordonnancements par rapport aux protocoles MAC, basés sur TDMA distribué. Cependant, dans CTMAC, les véhicules roulant vite devront acquérir des nouveaux slots après une courte période de temps à chaque fois qu’ils quittent les zones de leurs RSUs courants. Cette situation rend les protocoles centralisés inefficaces et couteux dans les réseaux à grande vitesse. Afin de pallier à ce problème inhérent à l’utilisation des RSUs, nous adaptons un algorithme d’ordonnancement basé sur le clustering dans lequel certains véhicules sont élus pour gérer l'accès au canal. Ceci permet aux véhicules de rester attachés à leurs clusters plus longtemps. Pour ce faire, nous proposons 1- un protocole de clustering nommé AWCP afin de former des clusters stables avec une longue durée de vie. AWCP est basé sur l’algorithme de clustering pour les réseaux mobiles WCA dans lequel les têtes des clusters sont élues en se basant sur une fonction de poids. 2- Nous formulons le réglage des paramètres de protocole AWCP comme un problème d’optimisation multi-objective et nous proposons un outil d’optimisation qui combine la version multi-objective de l’algorithme génétique appelé NSGA-II avec le simulateur de réseau ns-2 pour trouver les meilleurs paramètres du protocole AWCP. 3- Nous proposons ASAS, une stratégie adaptative pour l’attribution des slots temporels basée sur une approche cross-layer entre TDMA et AWCP / Road crashes and their damages represent a serious issue and are one of the main causes of people death. In this context, Vehicular Ad hoc NETworks (VANETs) are deployed to reduce the risk of road accident as well as to improve passengers’ comfort by allowing vehicles to exchange different kinds of data which ranges widely from road safety and traffic management to infotainment. Nowadays, safety applications are receiving a great deal of attention from researchers as well as from automobile manufacturers. In this thesis, we particularly focus on safety-critical applications, designed to provide drivers assistance in dangerous situations and to avoid accidents in highway environments. Such applications must guarantee to the vehicles access to the medium and have strict requirements regarding end-to-end delay and packet loss ratio. Therefore, our main goal is to propose new medium access control and routing protocols, which can efficiently adapt to frequent changing VANET network topologies. After a comprehensive overview of free-contention MAC protocols, we propose several solutions, based on Time Division Multiple Access Technique (TDMA). We have designed DTMAC, a fully distributed TDMA-based MAC protocol, which does not rely on an expensive infrastructure. DTMAC uses vehicles’ locations and a slot reuse concept to ensure that vehicles in adjacent areas have collision-free schedule. Using simulations, we prove that DTMAC provides a lower rate of access and merging collisions than VeMAC, a well-known TDMA based MAC protocol in VANET. Then, in order to ensure that event-driven safety messages can be sent over a long distance, we propose TRPM, a TDMA aware Routing Protocol for Multi-hop communication. Our routing scheme is based on a cross layer approach between the MAC and the routing layers, in which the intermediate vehicles are selected using TDMA scheduling information. Simulation results show that TRPM provides better performances in terms of average end-to-end delay, average number of hops and average delivery ratio. In the second part, we focus on coordinator-based TDMA scheduling mechanisms. First, we propose the Centralized TDMA based MAC protocol (CTMAC) which uses Road Side Units (RSUs) as a central coordinator to create and maintain the TDMA schedules. CTMAC implements an Access Collision Avoidance mechanism that can prevent the access collision problem occurring more than twice between the same vehicles that are trying to access the channel at the same time. Using simulation we show an improvement in terms of access and merging collisions as well as the overhead required to create and maintain the TDMA schedules compared to distributed scheduling mechanisms. However, in the CTMAC protocol, fast moving vehicles will need to compete for new slots after a short period of time when they leave their current RSU area, which makes a centralized scheduling approach very expensive. In order to further improve the performance of coordinator-based TDMA scheduling mechanisms, we focus on cluster-based TDMA MAC protocols in which some vehicles in the network are elected to coordinate the channel access, allowing the vehicles to remain connected with their channel coordinator for a longer period of time. To this end, first we propose an adaptive weighted clustering protocol, named AWCP, which is road map dependent and uses road IDs and vehicle directions to make the clusters’ structure as stable as possible. Then, we formulate the AWCP parameter tuning as a multi-objective problem and we propose an optimization tool to find the optimal parameters of AWCP to ensure its QoS. Next, we propose ASAS, an adaptive slot assignment strategy for a cluster-based TDMA MAC protocol. This strategy is based on a cross layer approach involving TDMA and AWCP. The objective is to overcome the inter-cluster interference issue in overlapping areas by taking into account vehicles’ locations and directions when the cluster head assign slots