Les réseaux véhiculaires sont passés du stade de simple curiosité pour revêtir aujourd'hui un intérêt certain aussi bien du point de vue de l'industrie automobile que des opérateurs de réseaux et services. Ces réseaux sont en effet une classe émergente de réseaux sans fil permettant des échanges de données entre véhicules ou encore entre véhicules et infrastructure. Ils suscitent un intérêt certain aussi bien en Europe qu’au Japon et en Amérique du Nord, dans le but de fournir de nouvelles technologies capables d'améliorer la sécurité et l'efficacité des transports routiers. Suivant cette même vision, nous nous intéressons dans cette thèse aux communications inter-véhicules dans un environnement urbain. Notre objectif est de proposer des solutions de routage ad hoc et de dissémination géolocalisée, adaptées à un environnement ville, répondant à la fois aux exigences et besoins technologiques des cas d'utilisation envisagés (principalement des services d'information et de confort), mais aussi et surtout aux contraintes des communications inter-véhiculaires ad hoc (fragmentation fréquente du réseau, connectivité intermittente, etc…). Notre démarche consiste à prendre en compte un paramètre clé qui influence le bon fonctionnement du réseau ad hoc de véhicules, à savoir la densité du réseau. Dans un premier temps, nous proposons un mécanisme distribué qui permet de caractériser de manière plus fine la densité de trafic d'un tronçon de route entre deux intersections, en fournissant une distribution spatiale des véhicules mobiles sur la voie de circulation. Ensuite, nous proposons un nouveau protocole de routage géographique, qui tire partie des caractéristiques des voies urbaines et qui intègre le mécanisme d'estimation de densité de trafic pour le routage des paquets. Pour finir, et afin de compléter les mécanismes de communication véhiculaire ad hoc (couche réseau) proposés, nous nous intéressons à la dissémination des données. Nous proposons un nouveau mécanisme distribué et ad hoc qui permet d'émuler le fonctionnement d'une infrastructure classique destinée à diffuser localement (au niveau d'une intersection) des paquets de données de manière périodique. Certains aspects de nos solutions sont évalués analytiquement alors que leurs performances sont évaluées par simulation à l'aide de l'outil QNAP, du simulateur QualNet et du modèle de mobilité réaliste VanetMobiSim. / Inter-Vehicle Communication (IVC) is attracting considerable attention from the research community and the automotive industry, where it is beneficial in providing Intelligent Transportation System (ITS) as well as assistant services for drivers and passengers. In this context, Vehicular Networks are emerging as a novel category of wireless networks, spontaneously formed between moving vehicles equipped with wireless interfaces that could have similar or different radio interface technologies, employing short-range to medium-range communication systems. The distinguished characteristics of vehicular networks such as high mobility, potentially large scale, and network partitioning introduce several challenges, which can greatly impact the future deployment of these networks. In this thesis, we focus on inter-vehicle communication in urban environments. Our main goal is to propose new routing and dissemination algorithms, which efficiently adapts to the vehicular networks characteristics and applications. Temporary disconnection in vehicular network is unavoidable. It is thereby of imminent practical interest to consider the vehicular traffic density. Therefore, at first, we propose a completely distributed and infrastructure–free mechanism for city road density estimation. Then, and based on such traffic information system, we propose a novel intersection-based geographical routing protocol, capable to find robust and optimal routes within urban environments. Finally, in order to help the efficient support of dissemination-based applications, a self-organizing mechanism to emulate a geo-localized virtual infrastructure is proposed, which can be deployed in intersections with an acceptable level of vehicular density. The advocated techniques are evaluated by a combination of network simulation and a microscopic vehicular traffic model.

Many protocols and applications in wireless multi-hop networks indispensably use broad- casting to delivery messages to all nodes in a network. Wireless routing protocols such as DSR, AODV and ODRMP broadcast route discovery messages, and many application protocols exchange query and response messages by broadcasting. Hence, the efficiency of broadcasting is critical to efficiency of these wireless protocols. Efficient wireless broadcast- ing is a topic that this thesis studies where efficiency is measured by the total transmission number to broadcast one unit data to the whole network. The study is done in two ways: extending classical methods and utilizing a novel method, network coding. Classical broadcasting protocols are based on store-and-forward routing that views pack- ets as atomic objects and lets a node store incoming packets in its local queue for some delay, before forwarding one or several copies of the packets to its neighbors. Among the classical broadcast protocols, the simplest and most widely used broadcast protocol is pure flood- ing. Pure flooding reliably provides total coverage of a network, but causes redundancy of packets, resulting in unnecessary collisions, and enormous inefficiency. To combat this inef- ficiency, many efficient broadcast protocols have been studied using probabilistic algorithms such as a gossip protocol, or algorithms based on topology control such as a Multi-Point Relay (MPR) based protocol. These broadcast protocols have been successfully used in many wireless protocols standardized in IEEE 802.11 and IETF. One possible application of the broadcast protocols is wireless mesh networks standard- ized in 802.11Working Group S. The 802.11 mesh networks face challenges such as inefficient broadcasting of so-called associated station information that is partially updated; there ex- ists redundancy between newly updated data and already broadcasted data. This thesis addresses these challenges by introducing an Association Discovery Protocol (ADP) that is combined with MPR-based broadcasting and integrated with an extension of an Optimized Link State Routing (OLSR) protocol for the 802.11 mesh networks. The results of analysis with modeling and simulation show that the protocol effectively decreases control overhead. However, for continuous data traffic, there exists another possible broadcast solution, which could theoretically outperform the broadcast protocols with classical store-and-forward routing and would not require precise topology information. This solution is network coding. Theoretically, network coding enables an optimized solution for wireless broadcasting in a polynomial time, while it is NP-complete with classical store-and-forward routing and only approximation algorithms exist. Hence, broadcasting with network coding is, theoretically, at least as efficient as any other broadcasting. This thesis focuses on utilizing network coding specifically as a practical solution for efficient wireless broadcasting. For the practical solution, this thesis proposes simple al- gorithms based on intuitive rationale about optimal efficiency of wireless network coding. The efficiency of the proposed simple algorithms is theoretically analyzed, and proven to be asymptotically optimal. The efficiency also is experimentally analyzed and shown, in some examples, to outperform other broadcasting with classical store-and-forward routing. Finally, from these simple algorithms we derive a practical broadcasting protocol executing with a simple and efficient coding method (that is, random linear coding). In addition, we propose a simple novel method for real-time decoding that could be combined with the practical network coding broadcasting protocol.

This work examines error rate performance of Multi-Hop communication systems, employing Single Input Single Output (SISO) transmissions over Nakagami-m fading channel. Mobile multi-hop relaying (MMR) system has been adopted in several Broadband Wireless Access Networks (BWAN) as a cost-effective means of extending the coverage and improving the capacity of these wireless networks. In a MMR system, communication between the source node and destination node is achieved through an intermediate node (i.e., Relay Station). It is widely accepted that multi-hop relaying communication can provide higher capacity and can reduce the interference in BWANs. Such claims though have not been quantified. Quantification of such claims is an essential step to justify a better opportunity for wide deployment of relay stations.In this thesis, Bit Error Rate (BER) of multi-hop communication systems has been analysed. Different kinds of fading channels have been used to estimate the error rate performance for wireless transmission. Binary Phase Shift Keying (BPSK) has been employed as the modulation technique and Additive White Gaussian Noise (AWGN) has been used as the channel noise. The same Signal to Noise Ratio (SNR) was used to estimate the channel performance. Three channels were compared by simulating their BER, namely, Rayleigh, Rician and Nakagami. Matlab has been used for simulation.

Wireless sensor network(WSN) is made up of a large number which are deployed in the environment to collect observations. Each sensor node preprocesses and extracts information from the raw observations. Each sensor node also has the ability to communicate with other sensor nodes or a fusion center via wireless channels. Many aspects of WSNs have been investigated recently, such as efficient routing protocols, distributed data compression and transmission, and collaborative signal processing. We investigate the information processing task at the fusion center. Radio transmission is one of the major power consumer, and the required transmission power not linear in distance between the transmitter and the receiver. Hence in this thesis, we consider a decision made at local sensor may need to go through multi- hop for minimal energy consumption. Sensor and relay employed decode and forward protocol. We investigate how to transmission reliability and how to combine the reliability and we proposed a fusion rule when observations are encoded by Turbo code.

Multiple Input Multiple Output (MIMO) systems use multiple transmit and receive antennas to achieve higher data rates by transmitting multiple independent data systems. Transmission errors can be reduced by using Hybrid Automatic Repeat request (HARQ) combining techniques with MIMO systems. In this thesis, the use of HARQ for MIMO multi-hop communication is studied. We propose two MIMO HARQ combining methods which are based on using pre-combiningonly and a joint pre and post combining techniques. In addition to conventional single-hop transmission, HARQ schemes for MIMO multi-hop relay systems are also investigated. A novel approach is proposed to deal with the parallel HARQ processes in MIMO relay scenario. An information theoretic throughput analysis is performed to evaluate the performance of the relay system by employing various transmission techniques for relay-destination link. Evaluation is carried out on the delay involved while employing the relay systems as compared to single hop systems. Simulation results show that the proposed system can enhance the overall throughput performance of MIMO single-hop and multi-hop relay systems. Considering the recent research interest in green radio and requirements of reduced energy consumption by the wireless networks, we evaluated the energy efficiency of existing and proposed MIMO HARQ techniques for sensor and cellular networks. The results show that the proposed scheme is more energy efficient compared to other schemes in single-hop as well as multi-hop scenarios.

The purpose of this project was to produce signal relay stations that could receive information via 2.4 GHz radio and relay the information to a designated target station. If a relay station was located outside of signal range for the target station it was supposed to utilize other relay stations to transfer the information to the target station, so called multi-hop. The would-be application of the relay stations was orienteering. When an orienteer punches a checkpoint the signal stations would relay information of who punched the control, when it was punched and the checkpoint that was punched to the speaker tower in the goal area. The work resulted in prototypes which fulfilled the statement of purpose and was tested at an orienteering competition with satisfactory results. The performance of the prototypes was tested and found adequate for the would-be application.

"Fading is one of the most fundamental impairments to wireless communications. The standard approach to combating fading is by adding redundancy - or diversity - to help increase coverage and transmission speed. Motivated by the results in multiple-input multiple-output technologies, which are usually used at base stations or access points, cooperation commutation has been proposed to improve the performance of wireless networks which consist of low-cost single antenna devices. While the majority of the research in cooperative communication focuses on flat fading for its simplicity and easy analysis, in practice the underlying channels in broadband wireless communication systems such as cellular systems (UMTS/LTE) are more likely to exhibit frequency selective fading. In this dissertation, we consider a frequency selective fading channel model and explore distributed diversity techniques in broadband wireless relay networks, with consideration to practical issues such as channel estimation and complexity-performance tradeoffs. We first study a system model with one source, one destination and multiple decode-and-forward (DF) relays which share a single channel orthogonal to the source. We derive the diversity-multiplexing tradeoff (DMT) for several relaying strategies: best relay selection, random relay selection, and the case when all decoding relays participate. The best relay selection method selects the relay in the decoding set with the largest sum-squared relay-to-destination channel coefficients. This scheme can achieve the optimal DMT of the system at the expense of higher complexity, compared to the other two relaying strategies which do not always exploit the spatial diversity offered by the relays. Different from flat fading, we find special cases when the three relaying strategies have the same DMT. We further present a transceiver design and prove it can achieve the optimal DMT asymptotically. Monte Carlo simulations are presented to corroborate the theoretical analysis. We provide a detailed performance comparison of the three relaying strategies in channels encountered in practice. The work has been extended to systems with multiple amplify-and-forward relays. We propose two relay selection schemes with maximum likelihood sequential estimator and linear zero- forcing equalization at the destination respectively and both schemes can asymptotically achieve the optimal DMT. We next extend the results in the two-hop network, as previously studied, to multi-hop networks. In particular, we consider the routing problem in clustered multi-hop DF relay networks since clustered multi-hop wireless networks have attracted significant attention for their robustness to fading, hierarchical structure, and ability to exploit the broadcast nature of the wireless channel. We propose an opportunistic routing (or relay selection) algorithm for such networks. In contrast to the majority of existing approaches to routing in clustered networks, our algorithm only requires channel state information in the final hop, which is shown to be essential for reaping the diversity offered by the channel. In addition to exploiting the available diversity, our simple cross-layer algorithm has the flexibility to satisfy an additional routing objective such as maximization of network lifetime. We demonstrate through analysis and simulation that our proposed routing algorithm attains full diversity under certain conditions on the cluster sizes, and its diversity is equal to the diversity of more complicated approaches that require full channel state information. The final part of this dissertation considers channel estimation in relay networks. Channel state information is vital for exploiting diversity in cooperative networks. The existing literature on cooperative channel estimation assumes that block lengths are long and that channel estimation takes place within a fading block. However, if the forwarding delay needs to be reduced, short block lengths are preferred, and adaptive estimation through multiple blocks is required. In particular, we consider estimating the relay-to-destination channel in DF relay systems for which the presence of forwarded information is probabilistic since it is unknown whether the relay participates in the forwarding phase. A detector is used so that the update of the least mean square channel estimate is made only when the detector decides the presence of training data. We use the generalized likelihood ratio test and focus on the detector threshold for deciding whether the training sequence is present. We also propose a heuristic objective function which leads to a proper threshold to improve the convergence speed and reduce the estimation error. Extensive numerical results show the superior performance of using this threshold as opposed to fixed thresholds."

<p>This paper deals with performance measurements in 802.11g Wireless Multi-Hop Net- </p><p>works at different locations. After an introduction to 802.11g Wireless LANs and </p><p>Wireless Multi-Hop Networks, the testing environment consisting of hardware, soft- </p><p>ware, configuration, and three different locations is described. Before test series for the </p><p>actual measurements are defined, carried out reference tests provide reference perfor- </p><p>mance data and prove that the used hardware is suitable for testing Wireless Multi-Hop </p><p>Networks. Then the results of the measurements are discussed which show the influ- </p><p>ence of multiple hops on throughput and latency for single and multi channel Multi-Hop </p><p>Networks in indoor, outdoor, and urban environment. Finally, an outlook to further </p><p>tests and improvements of Wireless Multi-Hop Networks is given.</p>

A significant challenge for fourth generation cellular systems is the reliable delivery of high speed (up to 1 gigabit per second) data to mobile or nomadic users throughout a cluttered urban environment. The wireless channel is a difficult channel over which to achieve high rate reliable communications. The wireless channel suffers many impairments such as small-scale multipath fading, shadowing, high path loss, co-channel interference, and Doppler shift due to mobility of the terminals and mobility in the propagation environment. Since radio spectrum is a scarce resource it is necessary to build cellular networks with high spectral efficiency. Two promising methods to solve this problem are multihop (MH) relaying and multiple-input multiple-output (MIMO) antenna techniques. The most difficult mobile users to serve reliably are those close to cell edges and those shadowed by large objects such as buildings. With MH relaying, a number of simple and inexpensive wireless relays are deployed throughout the cell to relay transmissions around obstacles and to reduce the path loss to distant mobile users. Also, MH relaying enables the deployment of small subcells throughout the cell, increasing the system's area averaged spectral efficiency. Various MIMO techniques can be used in scattering channels to increase capacity and reliability of data links in a wireless network. MH relaying and MIMO are key inclusions in emerging cellular standards such as IEEE 802.16 and LTE-Advanced, so it is necessary to study how these may be used jointly in a cellular environment. We look at various techniques available in MH relaying and MIMO, and assess the benefits and difficulties of these techniques when used in cellular systems. We put together a realistic cellular system model, with typical cellular topologies and well-accepted propagation models, and assess the performance of a multihop MIMO system. We find that there are tradeoffs in using these techniques jointly since they provide gains by somewhat conflicting methods. MH relaying lowers path loss and mitigates scattering in the channel, while MIMO benefits from significant scattering. As a result, it is necessary to understand how to design a MH-MIMO network carefully in order to maximize the net benefit. / Communications

In computer science, real-time research is an interesting topic. Nowadays real-time applications are close to us in our daily life. Skype, MSN, satellite communication, automation car and Ethernet are all things related to the real-time field. Many of our computer systems are also real-time, such as RT-Linux, Windows CE. In other words, we live in a “real-time” world. However, not everyone knows much about its existence. Hence, we chose this thesis in order to take a knowledge journey in the real-time field. For an average reader, we hope to provide some basic knowledge about real-time. For a computer science student, we will try to provide a discussion on switched multi-hop network with offsets, and the influence of offsets on real-time network performance. We try to prove that offsets provide networks of high predictability and utilization because offsets adjust packet‟s sending time. A packet‟s sending time is the time when a sender/router starts to transmit a date packet. Packets are sent one after the other. Therefore, we need to lower the time interval between one packet and another. Hence, in our network model, network performance is more predictable and effective. There might be some things left to discuss in future, so we would like to receive any advice and also suggestions for future discussions.