As redes ópticas passivas (PON), em virtude da oferta de maior largura de banda a custos relativamente baixos, vêm se destacando como possível candidata para suprir a demanda dos novos serviços como, tráfego de voz, vídeo, dados e de serviços móveis, exigidos pelos usuários finais. Uma importante candidata, para realizar o controle de acesso nas PONs, é a técnica de acesso múltiplo por divisão de código óptico (OCDMA), por apresentar características relevantes, como maior segurança e capacidade flexível sob demanda. No entanto, agentes físicos externos, como as variações de temperatura ambiental no enlace, exercem uma influência considerável sobre as condições de operação das redes ópticas. Especificamente, nas OCDMA-PONs, os efeitos da variação de temperatura ambiental no enlace de transmissão, afetam o valor do pico do autocorrelação do código OCDMA a ser detectado, degradando a qualidade de serviço (QoS), além do aumento da taxa de erro de bit (BER) do sistema. O presente trabalho apresenta duas novas propostas de técnicas, utilizando sistemas inteligentes, mais precisamente, controladores lógicos fuzzy (FLC) aplicados nos transmissores e nos receptores das OCDMA-PONs, com o objetivo de mitigar os efeitos de variação de temperatura. Os resultados das simulações mostram que o desempenho da rede é melhorado quando as abordagens propostas são empregadas. Por exemplo, para a distância de propagação de 10 km e variações de temperatura de 20°C, o sistema com FLC, suporta 40 usuários simultâneos com a BER = 10-9, enquanto que, sem FLC, acomoda apenas 10. Ainda neste trabalho, é proposta uma nova técnica de classificação de códigos OCDMA, com o uso de redes neurais artificiais, mais precisamente, mapas auto-organizáveis de Kohonen (SOM), importante para que o sistema de gerenciamento da rede possa oferecer uma maior segurança para os usuários. Por fim, sem o uso de técnica inteligente, é apresentada, uma nova proposta de código OCDMA, cujo formalismo desenvolvido, permite generalizar a obtenção de código com propriedades distintas, como diversas ponderações e comprimentos de códigos. / Passive optical networks (PON), due to the provision of higher bandwidth at relatively low cost, have been excelling as a possible candidate to meet the demand of new services, such as voice traffic, video, data and mobile services, as required by end users. An important candidate to perform access control in PONs, is the Optical Code-Division Multiple-Access (OCDMA) technique, due to relevant characteristics, such as improved security and flexible capacity on demand. However, external physical agents, such as variations in environmental temperature on the Fiber Optic Link, have considerable influence on the operating conditions of optical networks. Specifically, in OCDMA-PONs, the effects of environmental temperature variation in the transmission link affect the peak value on the autocorrelation of the OCDMA code to be detected, degrading the quality of service (QoS), in addition to increasing the Bit Error Rate (BER) of the system. This thesis presents two new proposals of techniques using intelligent systems, more precisely, Fuzzy Logic Controllers (FLC) applied on the transmitters and receivers of OCDMA-PONs, in order to mitigate the effects of temperature variation. The simulation results show that the network performance is improved when the proposed approaches are employed. For example, for the propagation distance of 10 kilometers and temperature variations of 20°C, the FLC system supports 40 simultaneous users at BER = 10-9, whereas without the FLC, the system can accommodate only 10. Furthermore, in this work is proposed a new technique of OCDMA codes classification, using Artificial Neural Networks (ANN), more precisely, the Self-Organizing Maps (SOM) of Kohonen, important for the network management system to provide increased security for users. Finally, without the use of intelligent technique, it is presented a new proposal of OCDMA code, whose formalism developed, allows to generalize the code acquisition with distinct properties, such as different weights and length codes.

Aiming to achieve the better efficiency in the use of bandwidth (spectral efficiency), as well as a compromise with the energy utilized in the process (power efficiency), the service operators are obliged to change the way in which the information is conveyed. The simplicity of the OOK modulation format has always been the main reason for using it in optical communications. Hence, once the coherent technologies had reached the maturity from a commercial point of view, they have become real alternatives to extend the capacity of networks. In this thesis, the performance of single and multirate FFH-OCDMA networks based on coherent modulation formats is addressed. The following modulation formats are assumed: binary and quadrature phase shift keying (BPSK and QPSK). For single rate networks, BPSK or QPSK are used as the modulation format for all users. For multirate networks, on the other hand, BPSK and QPSK modulation formats are employed for low and high rate transmission users, respectively. For both networks, new bit error rate (BER) formalisms regarding the main deleterious source in OCDMA are derived, namely multipleaccess interference (MAI). The mathematical formalism developed here accounts for any kind of users\' signal waveforms (which are accurately accounted for at the desired user\'s receiver). As a result, it can be successfully used to carry out performance analysis of any OCDMA network. Moreover, it is shown that both low and high rate users can surprisingly achieve similar BER levels. In addition, it is demonstrated that incoherent OOK-based networks are not good candidates for future single and multirate FFH-OCDMA implementations in this interference limited scenario. On the other hand, our results pave the way for BPSK- and QPSK -based networks, which are seen as potential candidates for next generation passive optical networks (NG-PON2), where higher data rates and a vast amount of users will be major network requirements. / No intuito de alcançar uma melhor eficiência no uso da largura de banda (eficiência espectral), bem como um compromisso com a energia utilizada no processo de transmissão de informações (eficiência em potência), as operadoras de serviços estão sendo obrigadas a alterar o modo em que a informações estão sendo transmitidas. Neste sentido, a simplicidade do formato de modulação OOK sempre foi a principal razão para a sua utilização em sistemas de comunicações ópticas. Assim, uma vez que a tecnologia coerente tem alcançado a maturidade do ponto de vista comercial, estas são reais alternativas para aumentar a capacidade das redes de comunicação ópticas. Nesta tese, são avaliados os desempenhos de redes FFH-OCDMA convencionais e de múltiplas taxas baseadas em formatos de modulação coerentes. Os seguintes formatos de modulação assumidos são: modulação por chaveamento de fase binário e por quadratura (BPSK e QPSK). Para redes convencionais, BPSK e QPSK são utilizados como formatos de modulação para todos os usuários. Por outro lado, para redes de múltiplas taxas de transmissão, os formatos de modulação BPSK e QPSK são empregados para baixas e altas taxas, respectivamente. Para ambas as redes, foram derivados novos formalismos matemáticos considerando a principal fonte deletéria de desempenho em OCDMA, comumente chamada de MAI, no cálculo da BER. Os formalismos matemáticos desenvolvidos são generalizados para quaisquer tipos de formas de onda empregada nos sinais dos usuários (as quais são contabilizadas precisamente no receptor do usuário de interesse). Como resultados, o formalismo matemático pode ser utilizado com sucesso para realizar a análise de desempenho de qualquer rede OCDMA. Adicionalmente, é demonstrado que ambos os usuários em baixa ou alta taxa de transmissão podem surpreendentemente alcançar níveis similares de BER. Concomitantemente, é observado que redes incoerentes baseadas em OOK não são boas candidatas para implementações convencionais e de múltiplas taxas de transmissão considerando esse cenário limitado por interferência. Por outro lado, os resultados trilham o caminho para redes baseadas em BPSK e QPSK, as quais são potenciais candidatas para a próxima geração de redes ópticas passivas (NG-PON2), onde os maiores requisitos são as altas taxas de transmissão e grande capacidade de inserção simultânea de usuários.

A oferta de novos serviços para os usuários finais, como o denominado triple play, que consiste no tráfego simultâneo de voz, vídeo e dados utilizando a mesma infra-estrutura de comunicação, vem exigindo que as estruturas de rede das operadoras ofereçam largura de banda adequada e qualidade de serviço. Nesse contexto, as redes ópticas passivas (PON) vêm se destacando em virtude de oferecerem maior largura de banda a custos relativamente baixos. Nas redes ópticas passivas, trechos de fibras ópticas podem ser compartilhados entre diversos assinantes, exigindo, para isso, a utilização de técnicas de controle de acesso múltiplo. Destaque maior é dado à técnica de acesso múltiplo por divisão de códigos ópticos (OCDMA), por apresentar características tais como maior segurança e capacidade flexível sob demanda. O desempenho dessa tecnologia é basicamente limitado pela interferência de acesso múltiplo, ou interferência multiusuário (MAI). No presente trabalho, cenários OCDMA-PON utilizando códigos ópticos unidimensionais, baseados na codificação prima modificada (MPC), e bidimensionais, baseados na codificação óptica ortogonal de múltiplos comprimentos de onda (MWOOC), são descritos, e seus respectivos desempenhos investigados. Os desempenhos desses sistemas são verificados utilizando-se os seguintes esquemas de modulação: 1) On-off Keying (OOK), cujo formalismo para a codificação padded MPC (PMPC) e double padded MPC (DPMPC) foi aqui desenvolvido, 2) por posição de pulso (PPM), considerando os ruídos poissonianos de deteção, cujo formalismo foi também aqui desenvolvido, 3) por posição de pulso (PPM) considerando apenas a interferência de acesso múltiplo (MAI), 4) semelhante ao (3), porém, utilizando a técnica mitigadora de MAI via cancelamento paralelo de interferência (PIC), e 5) semelhante ao (4) porém utilizando modulação por chaveamento de frequência (FSK). Em seguida, a codificação bidimensional MWOOC, utilizando modulação OOK, é analisada com e sem a utilização de PIC. Além desses esquemas, são também incluídas, pela primeira vez nesses formalismos, técnicas de correção posterior de erro (FEC) baseadas no algoritmo Reed-Solomon (RS). A figura de mérito adotada nas simulações é baseada no cálculo da taxa de erro de bit (BER). Os resultados obtidos para os diversos casos investigados neste trabalho indicam que a combinação PIC/FEC deve ser considerada de modo a se obter níveis de BER compatíveis com a região livre de erros (BER < \'10 POT.-12\') para os cenários de redes de acesso atuais e futuros (visando atender a 32 ou 64 usuários simultâneos). / The advent of new services offered to end users, such as the so called triple play, which consists in the simultaneous traffic of voice, video, and data through the same communication infrastructure, has been pushing telecom operators towards providing adequate bandwidth as well as quality of service. This has brought the spotlight to passive optical networks (PONs) by virtue of their considerably higher bandwidth at relatively low cost. In PONs, certain fiber optic spans can be shared among different users as long as multiple access control techniques are used. One such technique is the optical code division multiple access (OCDMA) technique, which, in addition, presents improved data security and flexible capacity on demand. The performance of this technology is basically limited by multi access interference (MAI), which becomes more severe as the number of simultaneous users increases. In the present work, OCDMA-PON scenarios utilizing one- and two-dimensional optical codes separately such as modified prime codes (MPC) and multi-wavelength optical orthogonal codes (MWOOC), are described and thoroughly investigated. The performances of these systems are investigated based on the following modulation schemes: 1) On-off keying (OOK), where a new formalism for the double-padded MPC is proposed, 2) Pulse position modulation (PPM), and 3) Frequency shift keying (FSK) together with MAI mitigation technique based on parallel interference cancelation (PIC). Besides these schemes, it is also included for the first time in these formalisms forward error correction techniques (FEC) based on the Reed-Solomon (RS) algorithm. The figure of merit adopted in all simulations is the bit error rate (BER). The results obtained for the cases investigated in this work indicate that the combination PIC/FEC must be considered if one is interested in obtaining BER levels compatible with the error-free region (BER < \'10 POT.-12\') for the current and future access network scenarios (aiming at attending 32 or 64 simultaneous users).

The significant advances in fiber-optic technology have broadened the optical network\'s reach into end-user business premises and even homes, allowing new services and technologies to be delivered to the customers. The next wave of innovation will certainly generate numerous opportunities provided by the widespread popularity of emerging solutions and applications such as tactile Internet, telemedicine and real time 3-D content generation, making them part of everyday life. Nevertheless, to support such an unprecedented and insatiable demand of data traffic, higher capacity and security, flexible bandwidth allocation and cost-efficiency have become crucial requirements for technologies candidate for future optical access networks. To this aim, optical code-division multiple-access (OCDMA) technology is considered as a prospective candidate, particularly due to features like asynchronous transmissions, flexible as well as conscious bandwidth resource distribution and support to differentiated services at the physical layer, to name but a few. In this context, this thesis proposes new mathematical formalisms for bit error rate, packet throughput and packet delay to assess the performance of flexible OCDMA networks capable of providing multiservice multirate transmissions according to users\' requirements. The proposed analytical formalisms do not require the knowledge a priori of the users\' code sequences, which means that the network performance can be addressed in a simple and straightforward manner using the code parameters only. In addition, the developed analytical formalisms account for a general number of distinct users\' classes as well as general probability of interference among users. Hence, these formalisms can be successfully applied for performance evaluation of flexible OCDMA networks not only under any number of users\' classes in a network, but also for most spreading codes with good correlation properties. The packet throughput expression is derived assuming Poisson, binomial and Markov chain approaches for the composite packet arrivals with the latter defined as benchmark. Then, it is shown via numerical simulation the Poisson-based expression is not appropriate for a reliable throughput estimate when compared to the benchmark (Markov) results. The binomial-based throughput equation, by its turn, provides results as accurate as the benchmark. In addition, the binomial-based throughput is numerically more convenient and computationally more efficient than the Markov chain approach, whereas the Markov-based one is computationally expensive, particularly if the number of users is large. The bit error rate (BER) expressions are derived considering gaussian and binomial distributions for the multiple-access interference and it is shown via numerical simulations that accurate performance of flexible OCDMA networks is only obtained with the binomial-based BER expression. This thesis also proposes and investigates a network architecture for Internet protocol traffic over flexible OCDMA with support to multiservice multirate transmissions, which is independent of the employed spreading code and does not require any new optical processing technology. In addition, the network performance assumes users transmitting asynchronously using receptors based on intensity-modulation direct-detection schemes. Numerical simulations shown that the proposed network performs well when its users are defined with high-weight code or when the channel utilization is low. The BER and packet throughput performance of an OCDMA network that provides multirate transmissions via multicode technique with two codes assigned to each single user is also addressed. Numerical results show that this technique outperforms classical techniques based on multilength code. Finally, this thesis addresses a new breakthrough technology that might lead to higher levels of security at the physical layer of optical networks. This technology consists in the generation of deterministic chaos from a commercial free-running vertical-cavity surface-emitting laser (VCSEL). The chaotic dynamics is generated by means of mechanical strains loaded onto an off-the-shelf quantum-well VCSEL using a simple and easily replicable holder. Deterministic chaos is then achieved, for the first time, without any additional complexity of optical feedback, parameter modulation or optical injection. The simplicity of the proposed system, which is based entirely on low-cost and easily available components, opens the way to the widespread use of commercial and free-running VCSEL devices for chaos-based applications. This off-the-shelf and cost-effective optical chaos generator has the potential for not only paving the way towards new security platforms in optical networks like, for example, successfully hiding the user information in an unpredictable, random-like signal against eventual eavesdroppers, but also for influencing emerging chaos applications initially limited or infeasible due to the lack of low-cost solutions. Furthermore, it leads the way to future realization of emerging applications with high-integrability and -scalability such as two-dimensional arrays of chaotic devices comprising hundreds of individual sources to increase requirements for random bit generation, cryptography or large-scale quantum networks. / Os avanços relacionados a tecnologia fotônica ampliaram o alcance das redes de comunicação óptica tanto em instalações de estabelecimentos comerciais quanto em residências, permitindo que novos serviços e tecnologias fossem entregues aos clientes. A próxima onda de inovação certamente gerará inúmeras oportunidades proporcionadas pela popularidade de soluções emergentes e aplicações como a Internet tátil, a telemedicina e a geração de conteúdo 3-D em tempo real, tornando-os parte da vida cotidiana. No entanto, para suportar a crescente demanda de tráfego atual, uma maior capacidade e segurança, alocação flexível de largura de banda e custo-eficiência tornaram-se requisitos cruciais para as tecnologias candidatas a futuras redes de acesso óptico. Para este fim, a tecnologia de acesso múltiplo por divisão de código óptico (OCDMA) é considerada um candidato em potencial, particularmente devido a características como transmissões assíncronas, distribuição flexível de banda larga e suporte a serviços diferenciados na camada física, para citar apenas alguns. Neste contexto, esta tese propõe novos formalismos matemáticos para a taxa de erro de bits, taxa de transferência de pacotes e atraso de pacotes para avaliar o desempenho de redes OCDMA flexíveis capazes de fornecer transmissões em múltiplas qualidades de serviço (QoS) de acordo com as necessidades dos usuários. Os formalismos analíticos propostos não requerem o conhecimento a priori das sequências de código dos usuários, o que significa que o desempenho da rede pode ser abordado de forma simples e direta usando apenas os parâmetros de código. Além disso, os formalismos analíticos desenvolvidos representam um número geral de classes de usuários distintos, bem como a probabilidade geral de interferência entre os usuários. Portanto, esses formalismos podem ser aplicados com sucesso na avaliação de desempenho de redes OCDMA flexíveis não apenas em qualquer número de classes de usuários em uma rede, mas também para a maioria dos códigos de espalhamento com boas propriedades de correlação. A expressão de taxa de transferência de pacotes é derivada assumindo aproximações de Poisson, binomial e de cadeia de Markov para as chegadas de pacotes compostos, com a última definida como benchmark. Em seguida, é mostrado via simulação numérica que a expressão baseada em Poisson não é apropriada para uma estimativa confiável de taxa de transferência quando comparada aos resultados de benchmark (Markov). A equação de taxa de transferência binomial, por sua vez, fornece resultados tão precisos quanto o benchmark. Além disso, a taxa de transferência binomial é numericamente mais conveniente e computacionalmente eficiente quando comparada com abordagem de Markov, enquanto esta última é computacionalmente dispendiosa, particularmente se o número de usuários é grande. As expressões de taxa de erro de bit (BER) são derivadas considerando distribuições gaussianas e binomiais para a interferência de acesso múltiplo e é mostrado por meio de simulações numéricas que o desempenho exato de redes OCDMA flexíveis é obtido somente com a expressão binomial de BER. Esta tese também propõe e investiga uma arquitetura de rede para o tráfego de protocolo de Internet sobre OCDMA flexível com suporte a transmissões de QoS e de múltiplas taxas, que é independente do código de espalhamento empregado e não requer qualquer nova tecnologia de processamento óptico. Além disso, o desempenho da rede assume que os usuários transmitem de forma assíncrona usando receptores baseados em esquemas de detecção direta de modulação de intensidade. As simulações numéricas mostraram que a rede proposta possui melhor desempenho quando seus usuários são definidos com peso de código alto ou quando a utilização do canal é baixa. O desempenho da BER e da taxa de transferência de pacotes de uma rede OCDMA que fornece transmissões de múltiplas taxas por meio de uma técnica multi-código com dois códigos atribuídos a cada usuário é também abordado. Os resultados numéricos mostram que esta técnica supera as técnicas clássicas baseadas no código de comprimento múltiplo. Finalmente, esta tese aborda uma nova tecnologia que pode levar a níveis mais elevados de segurança na camada física de redes ópticas. Esta tecnologia consiste na geração de caos determinístico a partir de um laser de emissão superficial com cavidade vertical (VCSEL). A dinâmica caótica é gerada através da aplicação de forças mecânicas em um VCSEL comercial usando um suporte simples e facilmente replicável. O caos determinístico é então alcançado, pela primeira vez, sem qualquer complexidade adicional de realimentação óptica, modulação de parâmetros ou injeção óptica. A simplicidade do sistema proposto, o qual se baseia inteiramente em componentes de baixo custo e que são facilmente encontrados, abre o caminho para o uso de dispositivos VCSEL comerciais para aplicações baseadas em caos. Este gerador de caos óptico tem o potencial não só de pavimentar o caminho para novas plataformas de segurança em redes ópticas, como, por exemplo, ocultar com êxito as informações do usuário em um sinal imprevisível e aleatório contra eventuais invasores, como também tem o potencial de influenciar aplicações de caos emergentes inicialmente limitadas ou inviáveis devido à falta de soluções de baixo custo. Além disso, ele conduz o caminho para a realização futura de aplicações emergentes com alta integridade e escalabilidade, tais como matrizes bidimensionais de dispositivos caóticos que compreendem centenas de fontes individuais para aumentar as necessidades de geração de bit aleatória, criptografia ou redes quânticas de grande escala.

Cette thèse a pour but d'évaluer la performance théorique des approches coopératives pour la fiabilisation des transmissions dans les réseaux autour du corps humain. Ces réseaux sont formés d'un nombre limité de capteurs communicants disposés sur et dans le corps. Les techniques de coopération dans les réseaux de cette taille sont extrêmement dépendantes de l'information disponible quand à la qualité des canaux de communication au moment de la transmission. Sous une hypothèse de connaissance de la valeur moyenne à moyen et long terme de l'affaiblissement de ces canaux, nous dérivons une approximation du taux d'erreur paquet de bout en bout pour des techniques de relayage. Nous présentons également, pour certains de ces modèles, une allocation de puissance asymptotiquement optimale, fournissant un gain sur une large plage des puissances d'émission. En supposant ensuite que les noeuds ont une connaissance parfaite de l'état du réseau, nous étudions la capacité de Shannon sur des canaux à relais, et des canaux comprenant deux émetteurs coopérant entre eux. Pour ces deux modèles, nous montrons que lorsque l'on cherche à optimiser la répartition de puissance totale disponible à l'émission, l'étude se réduit à celle d'un modèle de canal équivalent simplifiant grandement l'analyse de la capacité et fournissant des solutions analytiques aux problèmes d'allocation de ressources. Nous présentons enfin une plate-forme de mesures pour les réseaux autour du corps humain, permettant de relever de manière quasi-simultanée l'intégralité des affaiblissements des liens entre les nœuds du réseau. Cette plateforme nous permet de traiter de la stabilité de ces liens et de la validité de l'hypothèse de réciprocité. Nous évaluons également la corrélation spatiale de l'affaiblissement des liens et nous montrons en particulier que celle-ci varie fortement au cours du mouvement, mais de façon suffisamment lente pour être estimée au fil de l'eau. / This thesis aimed at studying the theoretical performance bounds of cooperative techniques in Body Area Networks (BAN). These networks are sensor networks, with a small number of nodes located on and inside the human body. Cooperative techniques are extremely dependent on the channel side information available at the time of transmission. Considering statistical information about the channel fading and the short-term mean of the signal, we derive an asymptotic approximation of the packet error rate under the so-called block fading channel model. Using this approximation, we can express in closed-form asymptotically optimal power allocation among transmitting nodesfor various models of relay channels. Under a complete channel knowledge hypothesis, we then study the Shannon capacity of small-scale cooperative networks, namely relay channels and cooperative multiple access channels. We show that for these networks, when you aim at optimizing the global power allocation of the whole network, the problem is equivalent to a simpler problem on an equivalent channel model. Using this equivalence, we are able to derive a number of closed-form resource allocation for relay channels and cooperative multiple access channels. In the last part of the manuscript, we present a measurement platform for BAN where the quality of every link in the network is gathered in a quasi-simultaneous manner. This platform allows us to discuss results and assess hypotheses on the stability and reciprocity of BAN links. We also evaluate the variation of the spatial correlation of the links during a walking scenario, and show that although the correlation matrix may vary a lot during the movement, it does so sufficiently slowly to be estimated on-line by an adequate protocole, paving the way to more precise resource allocation techniques and relay selection protocols.

A wireless sensor network (WSN) is a collection of sensor nodes distributed over a geographical region to obtain the environmental data. It can have different types of applications ranging from low data rate event driven and monitoring applications to high data rate real time industry and military applications. Energy efficiency and reliability are the two major design issues which should be handled efficiently at all the layers of communication protocol stack, due to resource constraint sensor nodes and erroneous nature of wireless channel respectively. Media access control (MAC) is the protocol which deals with the problem of packet collision due to simultaneous transmissions by more than one neighboring sensor nodes. Time Division Multiple Access based (TDMA-based) and contention-based are the two major types of MAC protocols used in WSNs. In general, the TDMA-based channel access mechanisms perform better than the contention-based channel access mechanisms, in terms of channel utilization, reliability and power consumption, specially for high data rate applications in wireless sensor networks (WSNs). TDMA-based channel access employs a predefined schedule so that the nodes can transmit at their allotted time slots. Based on the frequency of scheduling requirement, the existing distributed TDMA-scheduling techniques can be classified as either static or dynamic. The primary purpose of static TDMA-scheduling algorithms is to improve the channel utilization by generating a schedule of smaller length. But, they usually take longer time to generate such a schedule, and hence, are not suitable for WSNs, in which the network topology changes dynamically. On the other hand, dynamic TDMA-scheduling algorithms generate a schedule quickly, but they are not efficient in terms of generated schedule length. We suggest a new approach to TDMA-scheduling for WSNs, that can bridge the gap between these two extreme types of TDMA-scheduling techniques, by providing the flexibility to trade-off between the schedule length and the time required to generate the schedule, as per the requirements of the underlying applications and channel conditions. The suggested TDMA-scheduling works in two phases. In the first phase, we generate a valid TDMA schedule quickly, which need not have to be very efficient in terms of schedule length. In the second phase, we iteratively reduce the schedule length in a manner, such that the process of schedule length reduction can be terminated after the execution of an arbitrary number of iterations, and still be left with a valid schedule. This step provides the flexibility to trade-off the schedule length with the time required to generate the schedule. In the first phase of above TDMA-scheduling approach, we propose two randomized, distributed and parallel TDMA-scheduling algorithms viz., Distributed TDMA Slot Scheduling (DTSS) and Randomized and Distributed TDMA (RD-TDMA) scheduling algorithm. Both the algorithms are based on graph coloring approach, which generate a TDMA schedule quickly with a fixed schedule length ( Colouring), where is the maximum degree of any node in the graph to be colored. The two algorithms differ in the channel access mechanism used by them to transmit control messages, and in the generated schedule for different modes of communication, i.e., unicast, multicast and broadcast. The novelty of the proposed algorithms lies in the methods, by which an uncolored node detects that the slot picked by it is different from the slots picked by all the neighboring nodes, and the selection of probabilities with which the available slots can be picked up. Furthermore, to achieve faster convergence we introduce the idea of dynamic slot-probability update as per which the nodes update their slot-probability by considering the current slot-probability of their neighboring nodes. Under the second phase of the proposed TDMA-scheduling approach, we provide two randomized and distributed schedule compaction algorithms, viz., Distributed Schedule Compaction (DSC) and Distributed Schedule Length Reduction (DSLR) algorithm, as the mechanism to trade-off the scheduling time with the generated schedule length. These algorithms start with a valid TDMA schedule and progressively compress it in each round of execution. Additionally, Furthermore, the execution of these algorithms can be stopped after an arbitrary number of rounds as per the requirements of underlying applications. Even though TDMA-based MAC protocols avoid packet loss due to collision, due to erroneous nature of wireless medium, they alone are not sufficient to ensure the reliable transmission in WSNs. Automatic Repeat reQuest (ARQ) is the technique commonly used to provide error control for unicast data transmission. Unfortunately, ARQ mechanisms cannot be used for reliable multicast/broadcast transmission in WSNs. To solve this issue, we propose a virtual token-based channel access and feedback protocol (VTCAF) for link level reliable multicasting in single-hop wireless networks. The VTCAF protocol introduces a virtual (implicit) token passing mechanism based on carrier sensing to avoid the collision between feedback messages. The delay performance is improved in VTCAF protocol by reducing the number of feedback messages. Besides, the VTCAF protocol is parametric in nature and can easily trade-off reliability with the delay as per the requirements of the underlying applications. Finally, by integrating all the works, viz., TDMA-scheduling algorithms (DTSS/RD-TDMA), schedule compaction algorithms and link layer feedback mechanism for reliable multicast/ broadcast, we propose a TDMA-based energy aware and reliable MAC protocol, named TEA-MAC for multi-hop WSNs. Similar to VTCAF, TEA-MAC protocol uses the combination of ACK-based and NACK-based approaches to ensure reliable communication. But, instead of using virtual token-based channel access, it uses contention-based channel access for NACK transmission. All the algorithms and protocols proposed in this thesis are distributed, parallel and fault tolerant against packet losses to support scalability, faster execution and robustness respectively. The simulations have been performed using Castalia network simulator to evaluate the performance of proposed algorithms/protocols and also to compare their performance with the existing algorithms/protocols. We have also performed theoretical analysis of these algorithms/protocols to evaluate their performance. Additionally, we have shown the correctness of proposed algorithms/protocols by providing the necessary proofs, whenever it was required. The simulation results together with theoretical analysis show that, in addition to the advantage of trading the runtime with schedule length, the proposed TDMA scheduling approach achieves better runtime and schedule length performance than existing algorithms. Additionally, the TEA-MAC protocol is able to considerably improve the reliability and delay performance of multicast communication in WSNs.

Motivated by the increasing demand for higher data rates, coverage, and spectral efficiency, current and next generation wireless systems adapt transmission parameters and even who is being transmitted to, based on the instantaneous channel states. For example, frequency-domain scheduling(FDS) is an instance of adaptation in orthogonal frequency division multiple access(OFDMA) systems in which the base station opportunistically assigns different subcarriers to their most appropriate user. Likewise ,transmit antenna selection(AS) is another form of adaptation in which the transmitter adapts which subset of antennas it transmits with. Cognitive radio(CR), which is a next generation technology, itself is a form of adaptation in which secondary users(SUs) adapt their transmissions to avoid interfering with the licensed primary users(PUs), who own the spectrum. However, adaptation requires channel state information(CSI), which might not be available apriori at the node or nodes that are adapting. Further, the CSI might not be perfect due to noise or feedback delays. This can result in suboptimal adaptation in OFDMA systems or excessive interference at the PUs due to transmissions by the SUs in CR. In this thesis, we focus on adaptation techniques in current and next generation wireless systems and evaluate the impact of CSI –both perfect and imperfect –on it. We first develop a novel model and analysis for characterizing the performance of AS in frequency-selective OFDMA systems. Our model is unique and comprehensive in that it incorporates key LTE features such as imperfect channel estimation based on dense, narrow band demodulation reference signal and coarse, broad band sounding reference signal. It incorporates the frequency-domain scheduler, the hardware constraint that the same antenna must be used to transmit over all the subcarriers that are allocated to a user, and the scheduling constraint that the allocated subcarriers must all be contiguous. Our results show the effectiveness of combined AS and FDS in frequency-selective OFDMA systems even at lower sounding reference signal powers. We then investigate power adaptation in underlay CR, in which the SU can transmit even when the primary is on but under stringent interference constraints. The nature of the interference constraint fundamentally decides how the SU adapts its transmit power. To this end, assuming perfect CSI, we propose optimal transmit power adaptation policies that minimize the symbol error probability of an SU when they are subject to different interference and transmit power constraints. We then study the robustness of these optimal policies to imperfections in CSI. An interesting observation that comes out of our study is that imperfect CSI can not only increase the interference at the PU but can also decrease it, and this depends on the choice of the system parameters, interference, and transmit power constraints. The regimes in which these occur are characterized.

Network coding has emerged as an attractive alternative to routing because of the through put improvement it provides by reducing the number of channel uses. In a wireless scenario, in addition, further improvement can be obtained through Physical layer Network Coding (PNC), a technique in which nodes are allowed to transmit simultaneously, instead of transmitting in orthogonal slots. In this thesis, the design and analysis of network coding schemes are considered, for wireless two-way relaying, multi-user Multiple Access Relay Channel (MARC) and wireline networks. In a wireless two-way relay channel with PNC, the simultaneous transmissions of user nodes result in Multiple Access Interference (MAI) at there lay node. The harmful effect of MAI is the presence of signal set dependent deep channel fade conditions, called singular fade states, under which the minimum distance of the effective constellation at the relay become zero. Adaptively changing the network coding map used at the relay according to channel conditions greatly reduces the impact of this MAI. In this work, we obtain these adaptive PNC maps, which are finite in number ,by completing partially filled Latin Squares and using graph vertex coloring. Having obtained the network coding maps, the set of all possible channel realizations is quantized into a finite number of regions, with a specific network coding map chosen in a particular region and such a quantization is obtained analytically for 2λ-PSK signal set. The performance of the adaptive PNC scheme for two-way relaying is analyzed and tight high SNR upper bounds are obtained for the average end-to-end symbol error probability, in terms of the average error probability of a point-to-point fading channel. The adaptive PNC scheme is generalized for two-way relaying with multiple antennas at the nodes. As an alternative to the adaptive PNC scheme for two-way relaying, a Distributed Space Time Coding (DSTC) scheme is proposed, which effectively re-moves the effect of singular fade states at the transmitting nodes itself without any Channel State Information at the Transmitter (CSIT), and without any need to change the PNC map as a function of channel fade conditions. It is shown that the singular fade states can be viewed equivalently as vector subspaces of C2, which are referred to as the singular fade subspaces. DSTC design criterion to minimize the number of singular fade subspaces and maximize the coding gain is formulated and explicit low decoding complexity DSTC designs are provided. For the K-user MARC, in which K source nodes want to transmit messages to a destination node D with the help of are lay node R, a new PNC scheme is proposed. Use of a many-to-one PNC map with conventional minimum squared Euclidean distance decoding at D, results in a loss of diversity order due to error propagation from the relay node. To counter this, we propose a novel low complexity decoder which offers the maximum diversity order of two. Next, we consider wire line networks and explore the connections between linear network coding, linear index coding and discrete polymatroids, which are the multi-set analogue of matroids. We define a discrete polymatroidal network and show that a fractional vector linear solution over a field Fq exists for a network if and only if the network is discrete polymatroidal with respect to a discrete polymatroid representable over Fq.An algorithm to construct networks starting from certain class of discrete polymatroids is provided. Every representation over Fq for the discrete polymatroid, results in a fractional vector linear solution over Fq for the constructed network. It is shown that a linear solution to an index coding problem exists if and only if there exists a representable discrete polymatroid satisfying certain conditions which are determined by the index coding problem considered. El Rouayheb et. al. showed that the problem of finding a multi-linear representation for a matroid can be reduced to finding a perfect linear index coding solution for an index coding problem obtained from that matroid. Multi-linear representation of a matroid can be viewed as a special case of representation of an appropriate discrete polymatroid. We generalize the result of El Rouayheb et. al. by showing that the problem of finding a representation for a discrete polymatroid can be reduced to finding a perfect linear index coding solution for an index coding problem obtained from that discrete polymatroid.

This master’s thesis deals with satellite transponders. Firstly, satellite communication basics, satellite services definitions, frequency bands and satellite orbits are investigated. The second chapter forms the satellite transponders analysis. The transparent transponder and the transponder with on-board processing are described. Finally, a transponder model is designed and simulated in communication chain.

本論文は、多端子通信路に対するマルチユーザ符号化および復号の研究成果をまとめたものである。多重接続加算通信路による情報伝送において、複数ユーザの稼働状態を識別するための誤り訂正可能なシグネチャ符号の構成を論ず,全伝送率の高いシグネチャ符号の一般的な構成法を解明する.双方向中継通信路では、2ユーザターボ符号に対する復号の演算量を低減させる復号法を提案する。加法性白色ガウス雑音環境下では復号性能を劣化することなく、レイリーフェージング環境下では僅かな劣化にとどめながら、復号の演算量を約半分程度に低減することができる. / Coding and decoding for multiuser communication systems are investigated. For MAAC, we propose a coding scheme of (k + 1)-ary error-correcting signature codes. We give binary and non-binary signature codes. They are the best error-correcting signature codes for MAAC, in the sense that they have highest sum rates known. For TWRC, we propose a low-complexity two-user turbo decoding scheme when turbo codes are applied in two users. The approximate decoding algorithm preserves low decoding complexity over the Gaussian TWRC, without much performance degradation. / 博士(工学) / Doctor of Philosophy in Engineering / 同志社大学 / Doshisha University