Approved for public release; distribution in unlimited. / In spite of the fact that wireless network technology has been available for long period of time, there has been very limited wireless networks deployments around the world before 1997 due to the lack of widely recognized standard for wireless networks. Thanks to the approval of the IEEE 802.11 family of standards in 1997, the world has witnessed tremendous deployment and proliferation of wireless networks in all aspects of life. Although the IEEE 802.11 family of standards has been ratified to design radio transceivers for wireless computer stations capable of interconnecting with other wireless computer stations in close proximity, the technology has been successfully employed to design and implement wireless networks with great number of distant wireless computer stations with reasonable data throughput and flexibility. This thesis explores the wireless network technology and the primary building blocks and components of a wireless network. It also explores the IEEE 802.11 standard and its technical specifications including the Physical layer (PHY), the Media Access Control layer (MAC) and the ongoing task forces. Additionally, the thesis examines the wireless network security including the vulnerabilities, ongoing improvements and recommendations. Next, it investigates the market for available wireless devices compatible with the IEEE 802.11 standard that can be used to build a wireless network with high data throughput and high level of security. Subsequently, the thesis formulates a design plan for civilian wireless network with different scenarios in order to provide a speedy solution to the limited broadband service availability in the Sultanate of Oman. Additionally, the thesis formulates a generic design plan for a military wireless network with different scenarios that can be rapidly deployed in the field of operations. / Computer Engineer, Royal Army of Oman

Made available in DSpace on 2016-04-04T18:31:36Z (GMT). No. of bitstreams: 1 Rodrigo Frandsen da Silva.pdf: 3782928 bytes, checksum: cd013447a70916926978a2ddc8e42dbb (MD5) Previous issue date: 2012-12-19 / Pontif?cia Universidade Cat?lica de Campinas / In this dissertation we evaluate a new technique that performs optical encryption of signals travelling through transparent optical networks (TON). It is, thus, intended to prevent eavesdroppers to capture and retrieve optical signals. The technique consists in dividing an optical signal into several spectral slices and applying different attenuation and delays to each of them. After this process the signal is again multiplexed and transmitted through the considered TON. At this point the signal is ideally unintelligible to any receiver who does not know the encryption key, i.e. the set of utilized attenuations and delays. To evaluate the strength of such key, we measure the bit error rate (Bit Error Rate, BER) of the encoded signal, BERC. Generally speaking, the higher BERC, the lower is the chance of the encrypted signal being decoded by an eavesdropper. At the authorized receiver side, signal is again divided into spectral slices which are subjected to a set of attenuations and delays that are complementary to the ones utilized as the encryption key. All slices are again multiplexed and, as a result, at the output of the decoder the original encoder input signal is ideally reconstructed. The quality of the decoded signal is measured by evaluating the BER of the decoded signal, BERd, which should be low enough to allow proper reception of the signal transmitted by the TON. Simulations with the software VPITransmissionMaker, VPIPhotonics Company Inc., were used to investigate the performance of the technique for different gains and delays. For the operation of spectral slicing, the profiles of the utilized filters were adjusted to represent the ones of state-of-the-art off-the-shelf equipment. Results indicate that BERC may reach values of up to 42% and 32% for non-return to zero (NRZ) and differential quadrature phase shift keying (DQPSK) signals, respectively. In both of these cases it was possible to find results of BERd lower than 10-12, after properly adjusting the spacing between the filters; this was observed even for propagation over amplified standard fiber links with lengths as long as 400 km. To the best of our knowledge, this is the first time that such analyses are presented. / Neste trabalho avaliamos uma t?cnica para realizar a criptografia totalmente ?ptica em redes ?pticas transparentes. Dessa maneira, pretende-se impedir que um intruso consiga capturar e analisar o sinal ?ptico. A t?cnica consiste em dividir um sinal ?ptico em diversas fatias espectrais e aplicar diferentes atenua??es e atrasos a cada uma delas. Ap?s este processo o sinal ? novamente multiplexado e transmitido por uma rede ?ptica transparente. Neste ponto o sinal est? idealmente inintelig?vel para qualquer receptor que n?o conhe?a a chave criptogr?fica (conjunto de atenua??es e atrasos) utilizada. Para avaliar a for?a da chave criptogr?fica, mede-se a taxa de erros de bit (Bit Error Rate, BER) do sinal codificado, BERC. De forma geral, quanto maior BERC, menor ? a chance de o sinal ser decodificado por um receptor n?o autorizado. Na decodifica??o o sinal ? novamente dividido em fatias espectrais, e para todas as fatias s?o aplicados valores distintos de atenua??o e atraso de forma a reconstituir o sinal de entrada. Na sa?da do decodificador, avalia-se a BER do sinal decodificado BERD, que deve ser suficientemente baixa para permitir a recep??o do sinal transmitido pela TON. Simula??es com o software VPITransmissionMaker, da empresa VPIPhotonics Inc, foram utilizadas para investigar o desempenho da t?cnica para diferentes ganhos e atrasos. Para a opera??o de fatiamento espectral, os perfis dos filtros usados foram ajustados para representar equipamentos de mercado. Resultados indicam que BERC pode atingir valores de at? 42% e 32% para sinais com modula??o non return to zero - on-off keying (NRZ-OOK) e por deslocamento de fase diferencial em quadratura (differential quadrature phase shift keying, DQPSK), respectivamente. Em ambos os casos foi poss?vel encontrar resultados de BERd inferiores a 10-12, mediante ajuste adequado do espa?amento entre os filtros, mesmo ap?s 400 km de propaga??o por enlaces de fibra padr?o. No melhor de nosso conhecimento, esta ? a primeira vez que tais an?lises s?o apresentadas.

Les systèmes de communication sans fil actuels évoluent vers un renforcement des réactivités des protocles de la gestion des ressources radio (RRM) et adaptation du lien radipe (FLA) afin d'optimiser conjointement les couches MAC et PHY. En parallèle, la technologie d'antenne multiples et turbo récepteurs avancés ont un grand potentiel pour augmenter l’efficacité spectrale dans les futurs systèmes de communication sans fil. Ces deux tendances, à savoir, l'optimisation inter couche et le traitement de turbo, nécessitent le développement de nouvelles abstractions de la couche PHY (aussi appelée méthode de prédiction de la performance) qui peuvent capturer les performances du récepteur itératif par itération pour permettre l'introduction en douceur de ces récepteurs avancés dans FLA et RRM.La thèse de doctorat revisite en détail l'architecture du turbo récepteur, plus particulièrement, la classe d'algorithme itératif effectuant la détection linéaire par minimisation d’erreur quadratique moyenne avec l'annulation d’interférence (LMMSE-IC). Ensuite, une méthode semi-analytique de prédiction de la performance est proposée pour analyser son l'évolution par la modélisation stochastique de chacun des composants. Intrinsèquement, la méthode de prédiction de la performance est subordonnée à la disposition de connaissance d’information d’état du canal au niveau du récepteur (CSIR), le type de codage de canal (code convolutif ou un code turbo), le nombre de mots de code ainsi que le type d’information probabilistic sur les bits codés réinjectée par le décodeur pour la reconstruction et l'annulation d'interférence à l'intérieur d’algorithme de LMMSE -IC itératif.Dans la deuxième partie, l’adaptation du lien en boucle fermée dans les systèmes MIMO codés basés sur les abstractions de la couche PHY proposées pour les récepteurs LMMSE -IC itératifs ont été abordés. Le schéma proposé d'adaptation de liaison repose sur un faible taux de rétroaction et exploite la sélection du précodeur spatiale (par exemple, la sélection d'antennes) et du schéma de modulation et de codage (MCS) de façon à maximiser le taux moyen soumis à une contrainte de taux d'erreur de bloc. Différents schémas de codage sont testés, tels qu’un codage parcourant tous les antennes où un codage par antenne. Les simulations montrent bien le gain important obtenu avec les turbo récepteurs comparée à celui d’un récepteur MMSE classique. / Current wireless communication systems evolve toward an enhanced reactivity of Radio Resource Management (RRM) and Fast Link Adaptation (FLA) protocols in order to jointly optimize the Media Access Control (MAC) and Physical (PHY) layers. In parallel, multiple antenna technology and advanced turbo receivers have a large potential to increase the spectral efficiency of future wireless communication system. These two trends, namely, cross layer optimization and turbo processing, call for the development of new PHY-layer abstractions (also called performance prediction method) that can capture the iterative receiver performance per iteration to enable the smooth introduction of such advanced receivers within FLA and RRM. The PhD thesis first revisits in detail the architecture of the turbo receiver, more particularly, the class of iterative Linear Minimum Mean-Square Error (soft) Interference Cancellation (LMMSE-IC) algorithms. Then, a semi-analytical performance prediction method is proposed to analyze its evolution through the stochastic modeling of each of the components. Intrinsically, the performance prediction method is conditional on the available Channel State Information at Receiver (CSIR), the type of channel coding (convolutional code or turbo code), the number of codewords and the type of Log Likelihood Ratios (LLR) on coded bits fed back from the decoder for interference reconstruction and cancellation inside the iterative LMMSE-IC algorithms. In the second part, closed-loop FLA in coded MIMO systems based on the proposed PHY-layer abstractions for iterative LMMSE-IC receiver have been tackled. The proposed link adaptation scheme relies on a low rate feedback and operates joint spatial precoder selection (e.g., antenna selection) and Modulation and Coding Scheme (MCS) selection so as to maximize the average rate subject to a target block error rate constraint. The cross antenna coding (the transmitter employs a Space-Time Bit-Interleaved Coded Modulation (STBICM) ) and per antenna coding (Each antenna employs an independent Bit-Interleaved Coded Modulation(BICM)) cases are both considered. The simulations clearly show the significant gain obtained with turbo receivers compared to that of a conventional MMSE receiver.

<p>Background: Many systems that Enea Epact AB develops for theirs customers communicates with computers. In order to meet the customers demands on cost effective solutions, Enea Epact wants to know if it is possible to implement a gigabit Ethernet controller in an FPGA. The controller shall be designed with the intent to meet the requirements of IEEE 802.3. </p><p>Aim: Find out if it is feasible to implement a gigabit Ethernet controller using an FPGA. In the meaning of feasible, certain constraints for size, speed and device must be met. </p><p>Method: Get an insight of the standard IEEE 802.3 and make a rough design of a gigabit Ethernet controller in order to identify parts in the standard that might cause problem when implemented in an FPGA. Implement the selected parts and evaluate the results. </p><p>Conclusion: It is possible to implement a gigabit Ethernet controller using an FPGA and the FPGA does not have to be a state-of-the-art device.</p>

<p>The number of vehicles has increased significantly in recent years, which causeshigh density in traffic and further problems like accidents and road congestions.A solution regarding to this problem is vehicle-to-vehicle communication, wherevehicles are able to communicate with their neighboring vehicles even in the absenceof a central base station, to provide safer and more efficient roads and toincrease passenger safety.The goal of this thesis is to investigate basic physical layer parameters of ainter-vehicle communication system, like emission power, spectral emission, errorvector magnitude, guard interval, ramp-up/down time, and third order interceptpoint. I also studied the intelligent transportation system’s channel layout inEurope, how the interference of other systems are working in co-channel and adjacentchannels, and some proposals to use the allocated frequency bands. On theother hand, the fundamentals of OFDM transmission and definitions of OFDMkey parameters in IEEE 802.11p are investigated.The focus of this work is on the measurement of transmitter frontend parametersof a new testbed designed and fabricated in order to be used at inter-vehiclecommunication based on IEEE 802.11p.</p> / Road safety applications, Vehicle-to-Vehicle communication

Secure communication under channel uncertainty is an important and challenging problem in physical-layer security and cryptography. In this dissertation, we take a fundamental information-theoretic view at three concrete settings and use them to shed insight into efficient secure communication techniques for different scenarios under channel uncertainty. First, a multi-input multi-output (MIMO) Gaussian broadcast channel with two receivers and two messages: a common message intended for both receivers (i.e., channel uncertainty for decoding the common message at the receivers) and a confidential message intended for one of the receivers but needing to be kept asymptotically perfectly secret from the other is considered. A matrix characterization of the secrecy capacity region is established via a channel-enhancement argument and an extremal entropy inequality previously established for characterizing the capacity region of a degraded compound MIMO Gaussian broadcast channel. Second, a multilevel security wiretap channel where there is one possible realization for the legitimate receiver channel but multiple possible realizations for the eavesdropper channel (i.e., channel uncertainty at the eavesdropper) is considered. A coding scheme is designed such that the number of secure bits delivered to the legitimate receiver depends on the actual realization of the eavesdropper channel. More specifically, when the eavesdropper channel realization is weak, all bits delivered to the legitimate receiver need to be secure. In addition, when the eavesdropper channel realization is strong, a prescribed part of the bits needs to remain secure. We call such codes security embedding codes, referring to the fact that high-security bits are now embedded into the low-security ones. We show that the key to achieving efficient security embedding is to jointly encode the low-security and high-security bits. In particular, the low-security bits can be used as (part of) the transmitter randomness to protect the high-security ones. Finally, motivated by the recent interest in building secure, robust and efficient distributed information storage systems, the problem of secure symmetrical multilevel diversity coding (S-SMDC) is considered. This is a setting where there are channel uncertainties at both the legitimate receiver and the eavesdropper. The problem of encoding individual sources is first studied. A precise characterization of the entire admissible rate region is established via a connection to the problem of secure coding over a three-layer wiretap network and utilizing some basic polyhedral structure of the admissible rate region. Building on this result, it is then shown that the simple coding strategy of separately encoding individual sources at the encoders can achieve the minimum sum rate for the general S-SMDC problem.

The security of information is an indispensable element of a communication system when transmitted signals are vulnerable to eavesdropping. This issue is a challenging problem in a wireless network as propagated signals can be easily captured by unauthorized receivers, and so achieving a perfectly secure communication is a desire in such a wiretap channel. On the other hand, cryptographic algorithms usually lack to attain this goal due to the following restrictive assumptions made for their design. First, wiretappers basically have limited computational power and time. Second, each authorized party has often access to a reasonably large sequence of uniform random bits concealed from wiretappers. To guarantee the security of information, Information Theory (IT) offers the following two approaches based on physical-layer security. First, IT suggests using wiretap (block) codes to securely and reliably transmit messages over a noisy wiretap channel. No confidential common key is usually required for the wiretap codes. The secrecy problem investigates an optimum wiretap code that achieves the secrecy capacity of a given wiretap channel. Second, IT introduces key agreement (block) codes to exchange keys between legitimate parties over a wiretap model. The agreed keys are to be reliable, secure, and (uniformly) random, at least in an asymptotic sense, such that they can be finally employed in symmetric key cryptography for data transmission. The key agreement problem investigates an optimum key agreement code that obtains the key capacity of a given wiretap model. In this thesis, we study the key agreement problem for two wiretap models: a Discrete Memoryless (DM) model and a Gaussian model. Each model consists of a wiretap channel paralleled with an authenticated public channel. The wiretap channel is from a transmitter, called Alice, to an authorized receiver, called Bob, and to a wiretapper, called Eve. The Probability Transition Function (PTF) of the wiretap channel is controlled by a random sequence of Channel State Information (CSI), which is assumed to be non-causally available at Alice. The capacity of the public channel is C_P₁∈[0,∞) in the forward direction from Alice to Bob and C_P₂∈[0,∞) in the backward direction from Bob to Alice. For each model, the key capacity as a function of the pair (C_P₁, C_P₂) is denoted by C_K(C_P₁, C_P₂). We investigate the forward key capacity of each model, i.e., C_K(C_P₁, 0) in this thesis. We also study the key generation over the Gaussian model when Eve's channel is less noisy than Bob's. In the DM model, the wiretap channel is a Discrete Memoryless State-dependent Wiretap Channel (DM-SWC) in which Bob and Eve each may also have access to a sequence of Side Information (SI) dependent on the CSI. We establish a Lower Bound (LB) and an Upper Bound (UB) on the forward key capacity of the DM model. When the model is less noisy in Bob's favor, another UB on the forward key capacity is derived. The achievable key agreement code is asymptotically optimum as C_P₁→ ∞. For any given DM model, there also exists a finite capacity C⁰_P₁, which is determined by the DM-SWC, such that the forward key capacity is achievable if C_P₁≥ C⁰_P₁. Moreover, the key generation is saturated at capacity C_P₁= C⁰_P₁, and thus increasing the public channel capacity beyond C⁰_P₁ makes no improvement on the forward key capacity of the DM model. If the CSI is fully known at Bob in addition to Alice, C⁰_P₁=0, and so the public channel has no contribution in key generation when the public channel is in the forward direction. The achievable key agreement code of the DM model exploits both a random generator and the CSI as resources for key generation at Alice. The randomness property of channel states can be employed for key generation, and so the agreed keys depend on the CSI in general. However, a message is independent of the CSI in a secrecy problem. Hence, we justify that the forward key capacity can exceed both the main channel capacity and the secrecy capacity of the DM-SWC. In the Gaussian model, the wiretap channel is a Gaussian State-dependent Wiretap Channel (G-SWC) with Additive White Gaussian Interference (AWGI) having average power Λ. For simplicity, no side information is assumed at Bob and Eve. Bob's channel and Eve's channel suffer from Additive White Gaussian Noise (AWGN), where the correlation coefficient between noise of Bob's channel and that of Eve's channel is given by ϱ. We prove that the forward key capacity of the Gaussian model is independent of ϱ. Moreover, we establish that the forward key capacity is positive unless Eve's channel is less noisy than Bob's. We also prove that the key capacity of the Gaussian model vanishes if the G-SWC is physically degraded in Eve's favor. However, we justify that obtaining a positive key capacity is feasible even if Eve's channel is less noisy than Bob's according to our achieved LB on the key capacity for case (C_P₁, C_P₂)→ (∞, ∞). Hence, the key capacity of the Gaussian model is a function of ϱ. In this thesis, an LB on the forward key capacity of the Gaussian model is achieved. For a fixed Λ, the achievable key agreement code is optimum for any C_P₁∈[0,∞) in both low Signal-to-Interference Ratio (SIR) and high SIR regimes. We show that the forward key capacity is asymptotically independent of C_P₁ and Λ as the SIR goes to infinity, and thus the public channel and the interference have negligible contributions in key generation in the high SIR regime. On the other hand, the forward key capacity is a function of C_P₁ and Λ in the low SIR regime. Contributions of the interference and the public channel in key generation are significant in the low SIR regime that will be illustrated by simulations. The proposed key agreement code asymptotically achieves the forward key capacity of the Gaussian model for any SIR as C_P₁→ ∞. Hence, C_K(∞,0) is calculated, and it is suggested as a UB on C_K(C_P₁,0). Using simulations, we also compute the minimum required C_P₁ for which the forward key capacity is upper bounded within a given tolerance. The achievable key agreement code is designed based on a generalized version of the Dirty Paper Coding (DPC) in which transmitted signals are correlated with the CSI. The correlation coefficient is to be determined by C_P₁. In contrast to the DM model, the LB on the forward key capacity of a Gaussian model is a strictly increasing function of C_P₁ according to our simulations. This fact is an essential difference between this model and the DM model. For C_P₁=0 and a fixed Λ, the forward key capacity of the Gaussian model exceeds the main channel capacity of the G-SWC in the low SIR regime. By simulations, we show that the interference enhances key generation in the low SIR regime. In this regime, we also justify that the positive effect of the interference on the (forward) key capacity is generally more than its positive effect on the secrecy capacity of the G-SWC, while the interference has no influence on the main channel capacity of the G-SWC.

This thesis investigates channel-coded physical layer network coding, in which the relay directly transforms the noisy superimposed channel-coded packets received from the two end nodes, to the network-coded combination of the source packets. This is in contrast to the traditional multiple-access problem, in which the goal is to obtain each message explicitly at the relay. Here, the end nodes $A$ and $B$ choose their symbols, $S_A$ and $S_B$, from a small non-binary field, $\mathbb{F}$, and use non-binary PSK constellation mapper during the transmission phase. The relay then directly decodes the network-coded combination ${aS_A+bS_B}$ over $\mathbb{F}$ from the noisy superimposed channel-coded packets received from two end nodes. Trying to obtain $S_A$ and $S_B$ explicitly at the relay is overly ambitious when the relay only needs $aS_B+bS_B$. For the binary case, the only possible network-coded combination, ${S_A+S_B}$ over the binary field, does not offer the best performance in several channel conditions. The advantage of working over non-binary fields is that it offers the opportunity to decode according to multiple decoding coefficients $(a,b)$. As only one of the network-coded combinations needs to be successfully decoded, a key advantage is then a reduction in error probability by attempting to decode against all choices of decoding coefficients. In this thesis, we compare different constellation mappers and prove that not all of them have distinct performance in terms of frame error rate. Moreover, we derive a lower bound on the frame error rate performance of decoding the network-coded combinations at the relay. Simulation results show that if we adopt concatenated Reed-Solomon and convolutional coding or low density parity check codes at the two end nodes, our non-binary constellations can outperform the binary case significantly in the sense of minimizing the frame error rate and, in particular, the ternary constellation has the best frame error rate performance among all considered cases.

In this thesis, we propose a novel architecture for hybrid radio frequency (RF)/free–space optics (FSO) wireless systems. Hybrid RF/FSO systems are attractive since the RF and FSO sub–systems are affected differently by weather and fading phenomena. We give a thorough introduction to the RF and FSO technology, respectively. The state of the art of hybrid RF/FSO systems is reviewed. We show that a hybrid system robust to different weather conditions is obtained by joint bit–interleaved coded modulation (BICM) of the bit streams transmitted over the RF and FSO sub–channels. An asymptotic performance analysis reveals that a properly designed convolutional code can exploit the diversity offered by the independent sub–channels. Furthermore, we develop code design and power assignment criteria and provide an efficient code search procedure. The cut–off rate of the proposed hybrid system is also derived and compared to that of hybrid systems with perfect channel state information at the transmitter. Simulation results show that hybrid RF/FSO systems with BICM outperform previously proposed hybrid systems employing a simple repetition code and selection diversity.

The number of vehicles has increased significantly in recent years, which causeshigh density in traffic and further problems like accidents and road congestions.A solution regarding to this problem is vehicle-to-vehicle communication, wherevehicles are able to communicate with their neighboring vehicles even in the absenceof a central base station, to provide safer and more efficient roads and toincrease passenger safety.The goal of this thesis is to investigate basic physical layer parameters of ainter-vehicle communication system, like emission power, spectral emission, errorvector magnitude, guard interval, ramp-up/down time, and third order interceptpoint. I also studied the intelligent transportation system’s channel layout inEurope, how the interference of other systems are working in co-channel and adjacentchannels, and some proposals to use the allocated frequency bands. On theother hand, the fundamentals of OFDM transmission and definitions of OFDMkey parameters in IEEE 802.11p are investigated.The focus of this work is on the measurement of transmitter frontend parametersof a new testbed designed and fabricated in order to be used at inter-vehiclecommunication based on IEEE 802.11p. / Road safety applications, Vehicle-to-Vehicle communication