<p>Many efforts have been carried out to provide transmission reliability in the history of communication systems. As the demand for real-time applications increased, providing a reliable communication in a timely manner for such applications is strongly desired. Considering timing constraints makes the issue of achieving reliability more difficult. This thesis concentrates on providing reliability for real-time communication in embedded networks by achieving a timing analysis and using the ARQ concept. What is carried out in this thesis is providing retransmission in a real-time manner for embedded networks according to application request. The thesis work focuses on one packet retransmission over a point to point link, but the concept is rich and can be extended to cover application request in real-time embedded networks. Two methods have been fulfilled, and a simulation has been done on the timing analysis focusing on the performance in accepting real-time traffic in the form of separate channels for each application request. The protocol combines ARQ and a scheduling algorithm as a base to support retransmission for hard real-time applications in embedded networks.</p>

Many efforts have been carried out to provide transmission reliability in the history of communication systems. As the demand for real-time applications increased, providing a reliable communication in a timely manner for such applications is strongly desired. Considering timing constraints makes the issue of achieving reliability more difficult. This thesis concentrates on providing reliability for real-time communication in embedded networks by achieving a timing analysis and using the ARQ concept. What is carried out in this thesis is providing retransmission in a real-time manner for embedded networks according to application request. The thesis work focuses on one packet retransmission over a point to point link, but the concept is rich and can be extended to cover application request in real-time embedded networks. Two methods have been fulfilled, and a simulation has been done on the timing analysis focusing on the performance in accepting real-time traffic in the form of separate channels for each application request. The protocol combines ARQ and a scheduling algorithm as a base to support retransmission for hard real-time applications in embedded networks.

In this dissertation, we study cross-layer design for cooperative wireless data communication networks. Based on the characteristics of cooperative wireless communications, and the requirement of Quality of Service (QoS) provisioning for data networks, we consider cross-layer system design for cooperative wireless networking. Three major design issues which cover cooperative link establishment, information security of cooperative communications, and cross-layer cooperative transmission scheduling, are investigated. Specifically, we follow the communication procedure in cooperative wireless systems and investigate several cross-layer design problems. Considering the queueing behavior of data buffers at the candidate relays, we study relay selection from a queue-aware perspective which takes into account the queueing systems at both the source and the potential relays. With the cooperative link established, we then study the secret key establishment problem by cross-layer cooperative discussion. Then cross-layer transmission scheduling is investigated from two perspectives. We first look at cross-layer adaptive modulation and coding (AMC), which takes both the channel condition and traffic intensity into consideration in the scheduling design. A more general queue-aware scheduler state selection mechanism based on buffer queue occupancy is studied, and optimization by nonlinear integer programming is presented. / Graduate / 0544

Au cours des dernières années, on a observé l'intérêt croissant envers l'accessibilité à l'information et, en particulier, envers des approches innovantes utilisant les services à distance accessibles depuis les appareils mobiles à travers le monde. Parallèlement, la communication des véhicules, utilisant des capteurs embarqués et des dispositifs de communication sans fil, a été introduite pour améliorer la sécurité routière et l'expérience de conduite à travers ce qui est communément appelé réseaux véhiculaires (VANET). L'accès sans fil à l’Internet à partir des véhicules a déclenché l'émergence de nouveaux services pouvant être disponibles à partir ceux-ci. Par ailleurs, une extension du paradigme des réseaux véhiculaires a été récemment promue à un autre niveau. Le nuage véhiculaire (Vehicular Cloud) (VC) est la convergence ultime entre le concept de l’infonuagique (cloud computing) et les réseaux véhiculaires dans le but de l’approvisionnement et la gestion des services. Avec cette approche, les véhicules peuvent être connectés au nuage, où une multitude de services sont disponibles, ou ils peuvent aussi être des fournisseurs de services. Cela est possible en raison de la variété des ressources disponibles dans les véhicules: informatique, bande passante, stockage et capteurs. Dans cette thèse, on propose des méthodes innovantes et efficaces pour permettre la délivrance de services par des véhicules dans le VC. Plusieurs schémas, notamment la formation de grappes ou nuages de véhicules, la planification de transmission, l'annulation des interférences et l'affectation des fréquences à l'aide de réseaux définis par logiciel (SDN), ont été développés et leurs performances ont été analysées. Les schémas de formation de grappes proposés sont DHCV (un algorithme de clustering D-hop distribué pour VANET) et DCEV (une formation de grappes distribuée pour VANET basée sur la mobilité relative de bout en bout). Ces schémas de regroupement sont utilisés pour former dynamiquement des nuages de véhicules. Les systèmes regroupent les véhicules dans des nuages qui ne se chevauchent pas et qui ont des tailles adaptées à leurs mobilités. Les VC sont créés de telle sorte que chaque véhicule soit au plus D sauts plus loin d'un coordonnateur de nuage. La planification de transmission proposée implémente un contrôle d'accès moyen basé sur la contention où les conditions physiques du canal sont entièrement analysées. Le système d'annulation d'interférence permet d'éliminer les interférences les plus importantes; cela améliore les performances de planification d’utilisation de la bande passante et le partage des ressources dans les nuages construits. Enfin, on a proposé une solution à l'aide de réseaux définis par logiciel, SDN, où différentes bandes de fréquences sont affectées aux différentes liens de transmission de chaque VC afin d’améliorer les performances du réseau. / Abstract : In recent years, we have observed a growing interest in information accessibility and especially innovative approaches for making distant services accessible from mobile devices across the world. In tandem with this growth of interest, there was the introduction of vehicular communication, also known as vehicular ad hoc networks (VANET), leveraging onboard sensors and wireless communication devices to enhance road safety and driving experience. Vehicles wireless accessibility to the internet has triggered the emergence of service packages that can be available to or from vehicles. Recently, an extension of the vehicular networks paradigm has been promoted to a new level. Vehicular cloud (VC) is the ultimate convergence between the cloud computing concept and vehicular networks for the purpose of service provisioning and management. Vehicles can get connected to the cloud, where a multitude of services are available to them. Also vehicles can offer services and act as service providers rather than service consumers. This is possible because of the variety of resources available in vehicles: computing, bandwidth, storage and sensors. In this thesis, we propose novel and efficient methods to enable vehicle service delivery in VC. Several schemes including cluster/cloud formation, transmission scheduling, interference cancellation, and frequency assignment using software defined networking (SDN) have been developed and their performances have been analysed. The proposed cluster formation schemes are DHCV (a distributed D-hop clustering algorithm for VANET) and DCEV (a distributed cluster formation for VANET based on end-to-end relative mobility). These clustering schemes are used to dynamically form vehicle clouds. The schemes group vehicles into non-overlapping clouds, which have adaptive sizes according to their mobility. VCs are created in such a way that each vehicle is at most D-hops away from a cloud coordinator. The proposed transmission scheduling implements a contention-free-based medium access control where physical conditions of the channel are fully analyzed. The interference cancellation scheme makes it possible to remove the strongest interferences; this improves the scheduling performance and resource sharing inside the constructed clouds. Finally, we proposed an SDN based vehicular cloud solution where different frequency bands are assigned to different transmission links to improve the network performance.

In this paper, a cooperative underwater multi-channel MAC (CUMAC) protocol has been proposed with both delay mapping and channel allocation assessment in order to improve network performance and handle triple hidden terminal (THT) problems in underwater sensor networks. A novel channel allocation matrix (CAM) was developed for estimating propagation delay and increasing utilization of channel. In the proposed scheme, every node maintains a database for delay mapping, based on which the sender runs a scheduling algorithm prior to transmitting any data. This delay mapping database assists a node in predicting packet collision probability. The overall objectives are—first, to increase the rate of successful transmission through mitigation of THT problems in multi-channel underwater sensor networks; and second, to increase channel utilization leveraging the database of delay mapping and channel allocation assessment. Results from performance evaluation demonstrate the efficiency of the proposed CUMAC-CAM protocol in terms of packet delivery ratio, energy consumption, end-to-end delay, network throughput, collision probability, packet loss ratio and fairness index compared to the contemporary CUMAC protocol and RTS/CTS based multi-channel MAC protocols.