We consider optimal power allocation policies for a single server, multiuser wireless communication system. The transmission channel may experience multipath fading. We obtain very efficient, low computational complexity algorithms which minimize power and ensure stability of the data queues. We also obtain policies when the users may have mean delay constraints. If the power required is a linear function of rate then we exploit linearity and obtain linear programs with low complexity. We also provide closed-form optimal power policies when there is a hard deadline delay constraint. Later on, we also extend single hop results to multihop networks. First we consider the case, when the transmission rate is a linear function of power. We provide low complexity algorithms for joint routing, scheduling and power control which ensure stability of the queues, certain minimum rates, end-to-end hard deadlines, and/or upper bounds on the end-to-end mean delays. Further we extend these results to the multihop networks where the power is a general monotonically increasing function of rate. For our algorithms, we also provide rates of convergence to the stationary distributions for the queue length process and also approximate end-to-end mean delays. Finally, we provide computationally efficient algorithms that minimize the total power when there is a end-to-end hard deadline delay constraint.

Optical WDM network is the suitable transport mechanism for ever increasing bandwidth intensive internet applications. The WDM technique transmits the data over several different wavelengths simultaneously through an opticalfiber and the switching is done at wavelength level. The connection between the source and destination is called the light path. Since the WDM network carries huge amount of tra c, any failure can cause massive data loss. Therefore protecting the network against failure is an important issue. Maintaining high level of service availability is an important aspect of service provider. To provide cost effective service, all-optical network is the suitable choice for the service provider. But in all optical network, the signals are forced to remain in optical domain from source to destination. In the firrst part of the thesis, we deal the physical layer impairments (PLIs) aware shared-path provisioning on a wavelength routed all-optical networks. As the signal travels longer distances, the quality of the signal gets degraded and the receiver may not be able to detect the optical signal properly. Our objective is to establish a light path for both the working path and protection path with acceptable signal quality at the receiver. We propose an impairment aware integer linear programming (ILP) and impairment aware heuristic algorithm that takes into account the PLIs. The ILP provides the optimal solution. It is solved using IBM ILOG CPLEX solver. It is intractable for large size net-work. Therefore we propose the heuristic algorithm for large size network. It is evaluated through discrete-event simulation. But the algorithm provides only the suboptimal solution. To know the performance of this algorithm, the simulation result is compared with the optimal solution. We compute total blocking probability, restoration delay, computation time, and connection setup delay with respect to network load for the heuristic algorithm. We compare the performance of shared-path protection with dedicated-path protection and evaluate the percentage of resource saving of shared-path protection over the dedicated-path protection. In the second and third part of the thesis, we address the issues related to flexible-grid optical networks. In wavelength routed optical network, the bandwidth of each wavelength is fixed and rigid. It supports coarse grained tra c grooming and leads to ancient spectrum utilization. To overcome this, flexible-grid optical networks are proposed. It supports flexible bandwidth, and ne grained tra c groom In the second part of the thesis, we address the routing and spectrum allocation (RSA) algorithm for variable-bit-rate data tra c for flexible-grid optical networks. The RSA problem is NP-complete. Therefore a two-step heuristic approach (routing and spectrum allocation) is proposed to solve the RSA problem. The first step is solved by using a classical shortest path algorithm. For the second step we propose two heuristic schemes for frequency-slot allocation: (i) largest number of free frequency-slot allocation scheme and (ii) largest number of free frequency-slot maintaining scheme. As the network load increases, the spectrum is highly fragmented. To mitigate the fragmentation of the spectrum, we propose a xed-path least-fragmentation heuristic algorithm which fragments the spectrum minimally. It also supports varying-bit-rate tra c and also supports dynamic arrival connection requests. Through extensive simulations the proposed algorithms have been evaluated. Our simulation results show that the algorithms perform better in terms of spectrum utilization, blocking probability, and fraction of fragmentation of the spectrum. The spectrum utilization can reach up to a maximum of 92% and that only 71% of the spectrum is fragmented under maximum network load condition. Finally in the third part of the thesis, we discuss PLIs-aware RSA for the transparent exible-grid optical network. In this network, not only the optical signal expected to travel longer distance, but also to support higher line rates, i.e., data rate is increased up to 1 Tb/s. In such a high data rate, the optical signals are more prone to impairments and noises. As the transmission distance increases, optical signals are subject to tra-verse over many bandwidth-variable wavelength cross connects (BV-WXC) and multiple fibber spans due to which the PLIs get accumulated and are added to the optical signal. These accumulated impairments degrades the signal quality to an unacceptable level at the receiver, the quality of transmission falls below the acceptable threshold value, and the receiver may not be able to detect the signal properly. Therefore our objective is to develop an impairment aware RSA algorithm which establishes the QoT satisfied empathy based on the available resources and the quality of the signal available at the receiver. We formulate the PLIs-RSA problem as an ILP that provides an optimal solution. The optimal solution is obtained by solving the ILP using IBM ILOG CPLEX optimization solver. Since ILP is not efficient for large-size networks, we propose a heuristic algorithm for such a large-size networks. The signal power is measured at the receiver and the connection is established only when the signal power lies above the threshold value. The heuristic algorithm is evaluated through discrete-event simulation. It gives the sub-optimal solution. The simulation result is compared with optimal solution. The result shows that heuristic algorithm performs closer to the ILP. We compute the total blocking probability versus the network load for different spectrum allocation schemes. Total blocking probability is the sum of frequency-slot blocking probability and QoT blocking probability. We compute spectrum efficiency for the proposed algorithm. We also compare our algorithm with the existing routing and spectrum allocation algorithm, and the result shows that our algorithm outperforms the existing algorithms in terms of blocking probability and spectrum utilization.

Depuis quelques années, la thématique de la localisation a connu un regain d’intérêt,motivé en grande partie par le développement des réseaux de capteurs sans fil. Lespropositions ayant pour objectif d’apporter une réponse à cette problématique peuvent êtreclassées en deux catégories : les méthodes range-based, retenues pour cette thèse, dont lacaractéristique est de se fonder sur des mesures en temps réel du signal pour générer uneestimation relativement fiable de la distance, et les solutions range-free, économes enressources car se limitant à l’exploitation d’hypothèses concernant la connectivité des noeudsdans le réseau. Les contributions peuvent se focaliser sur l’un des trois aspects fondamentauxde la question : le développement d’une couche physique performante, la proposition d’unalgorithme de calcul permettant des résultats plus précis, et la mise en place d’un protocole decollecte de mesures.La contribution de cette thèse est par conséquent multiple : en premier lieu, nousproposons un nouveau protocole de mesure du temps de vol, nommé Parallel SymmetricDouble-Sided Two-Way Ranging (PSDS-TWR), dont l’objectif est la réduction de la chargeprotocolaire du service. Deuxièmement, nous avons mis en place un algorithme de calcul dela position désigné par interRing Localization Algorithm (iRingLA). Basé sur une recherchelinéaire, iRingLA accepte des données inexactes et en extrait une estimation de la positiondont l’erreur est inférieure à 2m dans 70% des cas, ceci en s’exécutant directement sur unnoeud mobile léger. Les données concernant l’algorithme ont été collectées grâce à unprototype utilisant la technologie Chirp Spread Spectrum tandis que l’étude de performancedu protocole a impliqué la conception d’un simulateur nommé DokoSim / The development of Wireless Sensor Networks has given a new life to research in thefield of localization. Many proposals have been made which can be classified as either rangefreeor range-based solutions. The range-free category relies on a priori knowledge of thenetwork while the latter uses the available hardware to measure signal characteristics fromwhich distance information can be derived. Although the information origin can vary, allproposals either introduce a new protocol, a novel algorithm or a new and improved physicallayer.Our work led to the definition of a new protocol and an efficient algorithm. Aside fromallowing the nodes to collect Time Of Flight related data, the Parallel Symmetric Double-Sided Two-Way Ranging protocol (PSDS-TWR) reduces overhead and energy consumption,making the localization service affordable for the network. The performance of this protocol,in terms of duration, has been studied using a homemade simulator named DokoSim. We alsointroduce an algorithm based on rings and linear search. This inter-Ring LocalizationAlgorithm (iRingLA) achieves a localization error of less than 2m in 70% of the cases whilebeing tested on our Chirp Spread Sprectrum based prototype

La forte augmentation du nombre de terminaux connectés ces dernières années et l'utilisation croissante des technologies de communication impacte de manière non négligeable la facture énergétique. Pour enrayer cette augmentation de la consommation énergétique, il devient primordial de pouvoir comparer en termes de consommation les algorithmes de communications numériques, afin de développer l'architecture de transmission la moins énergivore. Dans cette thèse, la couche physique des standards Wi-Fi IEEE 802.11ac est analysée sous un angle énergétique. La puissance dissipée dans les circuits pour faire fonctionner les algorithmes de traitement de signal est prise en compte en plus de la puissance d'émission d'antenne classique. La méthodologie mise en œuvre inclut à la fois des simulations et des développements sur plateforme matérielle (FPGA), permettant d'obtenir des évaluations de la consommation plus réalistes. Nous avons dans un premier temps analysé de façon isolée les éléments composant les chaines de communications numériques. Puis nous avons intégré les périodes d'activité et d'inactivité de chaque élément dans le calcul de la consommation énergétique globale des chaines. Nous proposons une méthode pratique et efficace d'estimation de la consommation, incluant une base de données issue de simulations, et une analyse théorique des taux d'activité de chaque élément de la chaine. Ces résultats permettent d'analyser la répartition de la consommation en puissance des éléments composant les émetteurs et les récepteurs, et de comparer diverses architectures et jeux de paramètres. En particulier, nous avons évalué l'impact de deux architectures de Transformées de Fourier Rapides sur la consommation globale du système. / The strong increase of the number of connected devices in recent years and the increasing use of communication technologies has a significant impact on the energy bill. To stop the increase in energy consumption, it is essential to be able to compare the digital communication algorithms in terms of consumption, in order to develop the most energy-efficient transmission architecture.In this thesis, the IEEE 802.11ac Wi-Fi standard of physical layer is analyzed at an energy point of view. The power dissipated in the circuits for operating the signal processing algorithms is taken into account in addition to the antenna transmission power. The implemented methodology includes both simulations and developments on a hardware platform (FPGAs), resulting in more realistic consumption assessments.First, we analyzed separately the components of the digital communications chains. Then we integrated the periods of activity and inactivity of each element in the calculation of the global energy consumption of the chains. We propose a practical and efficient method of estimating consumption, including a database derived from simulations, and a theoretical analysis of the activity rates of each element of the chain.These results make it possible to analyze the distribution of the power consumption of the elements composing transmitters and receivers, and to compare various architectures and sets of parameters. In particular, we evaluated the impact of two Fast Fourier Transform architectures on overall system consumption.

Abstract Impulse radio ultra-wideband (IR-UWB) technology, due to its baseband signaling, potentially offers a low cost, low complexity and low power consumption option for different short range sensor network applications. These sensor networks can be applied to many kinds of future implementations, including the Internet of Things (IoT) applications. In the medical and healthcare context, the term wireless body area network (WBAN) is often used, but, as mentioned, the wireless technology itself can be applied to any kind of body, e.g., to car or robot body networks. This thesis studies IR-UWB receivers’ performances in different hospital environment channel models by means of computer simulation. The main focus is on receivers that are capable of detecting the signals specified either in the IEEE 802.15.4-2015 or in the IEEE 802.15.6-2012 standards. The used channel models from two independent research groups include both on-body to on-body and on-body to off-body scenarios in different hospital environments. The evaluations and comparisons of various receivers include energy detector (ED) and rake receivers, the latter with both selective- and partial-rake structures. One of the studied receiver structures is further analyzed as it was noticed that the simulation results did not correspond to the assumed theoretical bit error probability (BEP) curves. Along the standards based studies, some modifications are also suggested for the two existing IR-UWB standards for increased compatibility and improved performance. One of the propositions resulted a Patent Cooperation Treaty (PCT) patent application. Additionally, an extensive survey is provided offering a compilation which includes presentations of IR-UWB research by other researchers, existing standards’ IR-UWB physical layer (PHY) specifications and the main global regulations concerning UWB. / Tiivistelmä Erittäin laajakaistainen impulssiradioteknologia (IR-UWB) tarjoaa potentiaalisen vaihtoehdon yksinkertaisille, edullisille ja matalan tehonkulutuksen omaaville lähetin-vastaanotin-ratkaisuille, jotka soveltuvat lyhyen kantaman sensoriverkkoihin. Nämä sensoriverkot ovat monikäyttöisiä soveltuen esimerkiksi tulevaisuuden esineiden internetin (IoT) tiedonsiirtoratkaisuiksi. Esimerkiksi sairaanhoidon ja terveydenhuollon asiayhteyksissä käytetään monesti termiä langaton kehoverkko (WBAN), joka voidaan asentaa monenlaisiin eri sovelluskohteisiin kuten autoon tai vaikkapa robotin "keholle". Tässä väitöskirjassa on tutkittu tietokonesimulaatioiden avulla erilaisten IR-UWB vastaanotinrakenteiden suorituskykyä sairaalaympäristöä mallintavissa radiokanavissa. Tutkimuksen painopiste on vastaanottimissa, jotka kykenevät vastaanottamaan joko IEEE 802.15.4-2015- tai IEEE 802.15.6-2012-standardeissa määritellyn signaalin. Sairaalaympäristöä mallintavat radiokanavat perustuvat kahden toisistaan riippumattoman tutkijaryhmän mallinnuksiin, jotka sisältävät sekä keholta-keholle että keholta-kehon ulkopuolelle -radiokanavamallit. Energiailmaisin (ED) ja erilaiset harava-vastaanottimet ovat niitä vastaanotinrakenteita, joita tähän väitöskirjaan kuuluvissa artikkeleissa on arvioitu ja vertailtu. Yhtä vastaanotinrakennetta on myös analysoitu tarkemmin, kun havaittiin, etteivät kyseistä rakennetta koskevat simulaatiotulokset vastanneet oletettuja teoreettisia bittivirhetodennäköisyyksiä. Tutkimuksessa kehitettiin lisäksi olemassa olevien standardien ratkaisuihin liittyviä parannusehdotuksia, joita esitettiin muutamissa tähän väitöskirjaan sisällytetyissä artikkeleissa. Yhdestä ehdotuksesta tehtiin myös PCT-sopimuksen alainen patentointihakemus. Lisäksi yhdessä tähän väitöskirjaan sisällytetyssä artikkelissa on paitsi laaja kirjallisuuskatsaus sisältäen katsauksen muiden tekemiin IR-UWB- tutkimuksiin, myös olemassa olevien standardien fyysisten kerroksien määritykset koskien IR-UWB-teknologiaa ja tärkeimmät maailmanlaajuiset UWB-tekniikkaa koskevat signaalin tehotiheysmääräykset.

In this thesis, we investigate physical-layer network coding in an L × M × K relay network, where L source nodes want to transmit messages to K sink nodes via M relay nodes. We focus on the information processing at the relay nodes and the compute-and-forward framework. Nested lattice codes are used, which have the property that every linear combination of codewords is a valid codeword. This property is essential for physical-layer network coding. Because the actual network coding occurs on the physical layer, the network coding coefficients are determined by the channel realizations. Finding the optimal network coding coefficients for given channel realizations is a non-trivial optimization problem. In this thesis, we provide an algorithm to find network coding coefficients that result in the highest data rate at a chosen relay. The solution of this optimization problem is only locally optimal, i.e., it is optimal for a particular relay. If we consider a multi-hop network, each potential receiver must get enough linear independent combinations to be able to decode the individual messages. If this is not the case, outage occurs, which results in data loss. In this thesis, we propose a new strategy for choosing the network coding coefficients locally at the relays without solving the optimization problem globally. We thereby reduce the solution space for the relays such that linear independence between their decoded linear combinations is guaranteed. Further, we discuss the influence of spatial correlation on the optimization problem. Having solved the optimization problem, we combine physical-layer network coding with physical-layer secrecy. This allows us to propose a coding scheme to exploit untrusted relays in multi-user relay networks. We show that physical-layer network coding, especially compute-and-forward, is a key technology for simultaneous and secure communication of several users over an untrusted relay. First, we derive the achievable secrecy rate for the two-way relay channel. Then, we enhance this scenario to a multi-way relay channel with multiple antennas. We describe our implementation of the compute-and-forward framework with software-defined radio and demonstrate the practical feasibility. We show that it is possible to use the framework in real-life scenarios and demonstrate a transmission from two users to a relay. We gain valuable insights into a real transmission using the compute-and-forward framework. We discuss possible improvements of the current implementation and point out further work. / In dieser Arbeit untersuchen wir Netzwerkcodierung auf der Übertragungsschicht in einem Relay-Netzwerk, in dem L Quellen-Knoten Nachrichten zu K Senken-Knoten über M Relay-Knoten senden wollen. Der Fokus dieser Arbeit liegt auf der Informationsverarbeitung an den Relay-Knoten und dem Compute-and-Forward Framework. Es werden Nested Lattice Codes eingesetzt, welche die Eigenschaft besitzen, dass jede Linearkombination zweier Codewörter wieder ein gültiges Codewort ergibt. Dies ist eine Eigenschaft, die für die Netzwerkcodierung von entscheidender Bedeutung ist. Da die eigentliche Netzwerkcodierung auf der Übertragungsschicht stattfindet, werden die Netzwerkcodierungskoeffizienten von den Kanalrealisierungen bestimmt. Das Finden der optimalen Koeffizienten für gegebene Kanalrealisierungen ist ein nicht-triviales Optimierungsproblem. Wir schlagen in dieser Arbeit einen Algorithmus vor, welcher Netzwerkcodierungskoeffizienten findet, die in der höchsten Übertragungsrate an einem gewählten Relay resultieren. Die Lösung dieses Optimierungsproblems ist zunächst nur lokal, d. h. für dieses Relay, optimal. An jedem potentiellen Empfänger müssen ausreichend unabhängige Linearkombinationen vorhanden sein, um die einzelnen Nachrichten decodieren zu können. Ist dies nicht der Fall, kommt es zu Datenverlusten. Um dieses Problem zu umgehen, ohne dabei das Optimierungsproblem global lösen zu müssen, schlagen wir eine neue Strategie vor, welche den Lösungsraum an einem Relay soweit einschränkt, dass lineare Unabhängigkeit zwischen den decodierten Linearkombinationen an den Relays garantiert ist. Außerdem diskutieren wir den Einfluss von räumlicher Korrelation auf das Optimierungsproblem. Wir kombinieren die Netzwerkcodierung mit dem Konzept von Sicherheit auf der Übertragungsschicht, um ein Übertragungsschema zu entwickeln, welches es ermöglicht, mit Hilfe nicht-vertrauenswürdiger Relays zu kommunizieren. Wir zeigen, dass Compute-and-Forward ein wesentlicher Baustein ist, um solch eine sichere und simultane Übertragung mehrerer Nutzer zu gewährleisten. Wir starten mit dem einfachen Fall eines Relay-Kanals mit zwei Nutzern und erweitern dieses Szenario auf einen Relay-Kanal mit mehreren Nutzern und mehreren Antennen. Die Arbeit wird abgerundet, indem wir eine Implementierung des Compute-and-Forward Frameworks mit Software-Defined Radio demonstrieren. Wir zeigen am Beispiel von zwei Nutzern und einem Relay, dass sich das Framework eignet, um in realen Szenarien eingesetzt zu werden. Wir diskutieren mögliche Verbesserungen und zeigen Richtungen für weitere Forschungsarbeit auf.

This thesis proposes and analyzes data fusion algorithms that operate on the physical layer of a wireless sensor network, in the context of three applications of cognitive radios: 1. Cooperative spectrum sensing via binary consensus; 2. Multiple transmitter localization and communication footprint identification; 3.Target self-localization using beacon nodes. For the first application, a co-phasing based data combining scheme is studied under imperfect channel knowledge. The evolution of network consensus state is modeled as a Markov chain, and the average transition probability matrix is derived. Using this, the average hitting time and average consensus duration are obtained, which are used to determine and optimize the performance of the consensus procedure. Second, using the fact that a typical communication footprint map admits a sparse representation, two novel compressed sensing based schemes are proposed to construct the map using 1-bit decisions from sensors deployed in a geographical area. The number of transmitters is determined using the K-means algorithm and a circular fitting technique, and a design procedure is proposed to determine the power thresholds for signal detection at sensors. Third, an algorithm is proposed for self-localization of a target node using power measurements from beacon nodes transmitting from known locations. The geographical area is overlaid with a virtual grid, and the problem is treated as one of testing overlapping subsets of grid cells for the presence of the target node. The column matching algorithm from group testing literature is considered for devising the target localization algorithm. The average probability of localizing the target within a grid cell is derived using the tools from Poisson point processes and order statistics. This quantity is used to determine the minimum required node density to localize the target within a grid cell with high probability. The performance of all the proposed algorithms is illustrated through Monte Carlo simulations.

Le nombre croissant d'applications des Réseaux de Capteurs Sans Fils (RCSFs) a conduit les industriels à concevoir ces réseaux avec une couche Physique (PHY) suivant le standard IEEE 802.15.4. Actuellement, cette couche est implémentée en matériel souffrant d'un manque de flexibilité du changement des paramètres radio, telles que bandes de fréquences et modulations. Ce problème est accentué par la rareté du spectre radio fréquences. La Radio Logiciel (RL) est une nouvelle solution pour reconfigurer plus facilement ces paramètres. A partir d'une RL, il est possible de développer une radio cognitive permettant une écoute de spectre et un Accès Dynamique au Spectre (ADS). Ces deux possibilités sont utiles pour surmonter le problème de la rareté du spectre. Cette thèse propose une nouvelle solution Radio logicielle pour un RCSF basé sur le standard IEEE 802.15.4. Notre objectif est de caractériser une plate-forme RL qui implémente à la fois deux couches PHY standardisées et une radio cognitive pour des RCSFs. Dans cette thèse, nous avons réalisé des implémentations RL en utilisant une plateforme composée de la solution Universal Software Peripheral Radio (USRP) d'Ettus Research et de GNU Radio. Nous avons choisi cette plateforme particulière puisqu'elle est parmi les outils les plus performants et les plus pratiques d'après notre état de l'art. Une étude minutieuse a été effectuée pour analyser l'architecture logicielle de la GNU Radio avant son utilisation. Des USRPs avec leurs cartes filles ont été aussi analysés à travers des mesures expérimentales radio fréquences. L'analyse de cette plate-forme a apporté une description détaillée de son architecture et de ses performances. Nous avons prouvé que les performances mesurées sont plus faibles que ceux attendus pour certaines cartes filles d'USRP. Malgré ces résultats, certaines cartes ont de nombreuses caractéristiques intéressantes, comme de grandes bandes de fréquences couvertes et une puissance de sortie linéaire. Un modèle empirique a été introduit pour caractériser avec précision la puissance de sortie moyenne d'une carte fille particulière. Nous avons ensuite implémenté une nouvelle couche PHY standardisée pour la bande de fréquence 868/915 MHz basée sur le standard 802.15.4. Un processus de rétro-ingénierie d'une autre implémentation développée pour la bande 2.4GHz a été effectué. Ces deux couches ont été décrites par des chaines de communications ou des graphes de flux. Nous avons finalement proposé une nouvelle radio cognitive par une reconfiguration de ces graphes de flux dans les deux bandes de fréquences correspondantes. La particularité de notre radio cognitive est de reconfigurer les graphes de flux en fonction de la fréquence sélectionnée. Cette sélection est effectuée par un ADS et une écoute de spectre basé sur une détection d'énergie, validés tous les deux au travers des réelles communications sans fil. Nous avons introduit un algorithme à base de messages afin de reconfigurer les graphes de flux et de synchroniser la sélection sur une fréquence porteuse. Les deux couches physiques en RL pour les bandes 2.4 GHz et 868/915 MHz ont été testées et sont fonctionnelles. La première a été testée en échangeant des paquets de données avec des nœuds capteurs réels. La deuxième a été expérimentée par l'échange de paquets, à travers une communication entre deux radios logicielles USRP/GNU Radio. Nous avons réussi à mesurer deux paramètres réels d'une communication sans fil : le taux d'erreur binaire et le taux de succès des paquets. Les couches PHY résultantes ont servi à la réalisation et à l'expérimentation d'un ADS de notre radio cognitive. Un ADS a amélioré significativement le taux de succès de paquets par rapport à celui obtenu avec un accès statique dans un environnement indoor. Les résultats de cette thèse conduisent à expérimenter une radio cognitive avec une RL non seulement pour un RCSF, mais pour d'autres réseaux sans fil et standards radio / The Increasing number of Wireless Sensor Networks (WSNs) applications has led industries to design the physical layer (PHY) of these networks following the IEEE 802.15.4 standard. The traditional design of that layer is on hardware suffering from a lack of flexibility of radio parameters, such as changing both frequency bands and modulations. This problem is emphasized by the scarcity of the radio-frequency spectrum. Software Defined Radio (SDR) is an attracting solution to easily reconfigure radio parameters. In addition to SDR, a cognitive radio concept can be proposed by spectrum sensing and Dynamic Spectrum Access (DSA) both to overcome the spectrum scarcity problem. This thesis proposes a new SDR solution for WSNs based on the IEEE 802.15.4 standard. Our aim is to characterize an SDR platform that implements two standardized PHY layers and cognitive radio for WSNs. In this thesis, we carried out SDR implementations using a GNU Radio and Universal Software Peripheral Radio (USRP) platform. We chose this particular platform because it is one of the most practical and well-performed ones. A thorough study was performed to analyze GNU Radio software architecture before its usage. USRPs and their daughter boards were also analyzed through experimental radio-frequency measurements. The analysis of the GNU Radio USRP platform brought a detailed description of its architecture and performances as well as the way to implement an SDR. This description particularly assists researchers to quickly develop efficient SDR receivers and transmitters. We show through our experiments that the measured performances of daughter boards mounted on a USRP are lower than expected ones. Despite these results, some daughter boards have many interesting features such as large covered frequency bands and with a linear output power. An empirical model was introduced to accurately characterize the average output power of a particular daughter board. Then, we implemented a new possible standardized PHY layer for the 868/915 MHz frequency band. A reverse engineering process of another implementation was performed for the 2450 MHz frequency band. These two PHY layers were described by communication chains or flow graphs. We suggested a new Cognitive Radio by a reconfiguration of these flow graphs within the corresponding frequency bands. The particularity of our cognitive radio is to reconfigure flow graphs in function to the selected frequency. This selection is performed by DSA and spectrum sensing based on energy detection both through real wireless communications. We introduced a message based algorithm in order to reconfigure the flow graphs and to synchronize the selection of a carrier frequency. Our two implemented PHY layers for the 2450 MHz and the 868/915 frequency bands were found functional. The first one was tested by exchanging data packets with real sensor nodes. The second was also experienced by a packet exchange, but via GNURadio/USRP communications. Both tests were carried out through real communications. We were also able to measure two wireless communication parameters: Bit Error Rate (BER) and the Packet Success Rate (PSR). The result of functional PHY layers was beneficial for realization and experiments of our cognitive radio. We found that our DSA significantly improves the packet success rate compared to that obtained with static spectrum access in an indoor environment. The results of this thesis lead to experiment a cognitive radio with an SDR not only for a WSN, but for other wireless networks and radio standards

This thesis is focused on the creation of functional authentication process of users into computer network in company Wistron InfoComm s.r.o. and discusses issues related to this process. The main aim of the thesis is to implement a functional and simultaneously realistic solution based on the company's requirements as well as described problems associated with the implementation of this solution.

The thesis is focused on the research and development of a new hybrid one-wire bus with special use enabling microelectronic integration. The bus, its physical layer and protocol have been developed based on applied research to meet the complex requirements of a new application group. These requirements are especially laid on the bus robustness and its immunity to interference and to work under real operating conditions. Part of the thesis is a description of existing solutions of one-wire buses, definition of current solutions and setting of goals for research of the new bus. Further are made the design of protocol and operating parameters of the bus operating in low power and power mode. In conclusion, the thesis deals with the practical verification of the proposed solution and there is also suggested a perspective of follow-up research in this area.