Distributed Estimation and Control of Algebraic Connectivity over Random Graphs

In this paper we propose a distributed algorithm for the estimation and control of the connectivity of ad-hoc networks in the presence of a random topology. First, given a generic random graph, we introduce a novel stochastic power iteration method that allows each node to estimate and track the algebraic connectivity of the underlying expected graph. Using results from stochastic approximation theory, we prove that the proposed method converges almost surely (a.s.) to the desired value of connectivity even in the presence of imperfect communication scenarios. The estimation strategy is then used as a basic tool to adapt the power transmitted by each node of a wireless network, in order to maximize the network connectivity in the presence of realistic Medium Access Control (MAC) protocols or simply to drive the connectivity toward a desired target value. Numerical results corroborate our theoretical findings, thus illustrating the main features of the algorithm and its robustness to fluctuations of the network graph due to the presence of random link failures.Comment: To appear in IEEE Transactions on Signal Processin

Técnicas de igualização adaptativas com estimativas imperfeitas do canal para os futuros sistemas 5G

Wireless communication networks have been continuously experiencing an exponential growth since their inception. The overwhelming demand for high data rates, support of a large number of users while mitigating disruptive interference are the constant research focus and it has led to the creation of new technologies and efficient techniques. Orthogonal frequency division multiplexing (OFDM) is the most common example of a technology that has come to the fore in this past decade as it provided a simple and generally ideal platform for wireless data transmission. It’s drawback of a rather high peak-to-average power ratio (PAPR) and sensitivity to phase noise, which in turn led to the adoption of alternative techniques, such as the single carrier systems with frequency domain equalization (SC-FDE) or the multi carrier systems with code division multiple access (MC-CDMA), but the nonlinear Frequency Domain Equalizers (FDE) have been of special note due to their improved performance. From these, the Iterative Block Decision Feedback Equalizer (IB-DFE) has proven itself especially promising due to its compatibility with space diversity, MIMO systems and CDMA schemes. However, the IB-DFE requires the system to have constant knowledge of the communication channel properties, that is, to have constantly perfect Channel State Information (CSI), which is both unrealistic and impractical to implement. In this dissertation we shall design an altered IB-DFE receiver that is able to properly detect signals from SC-FDMA based transmitters, even with constantly erroneous channel states. The results shall demonstrate that the proposed equalization scheme is robust to imperfect CSI (I-CSI) situations, since its performance is constantly close to the perfect CSI case, within just a few iterations.Redes sem fios têm crescido de maneira contínua e exponencial desde a sua incepção. A tremenda exigência para altas taxas de dados e o suporte para um elevado número de utilizadores sem aumentar a interferência disruptiva originada por estes são alguns dos focos que levaram ao desenvolvimento de técnicas de compensação e novas tecnologias. “Orthogonal frequency division multiplexing” (OFDM) é um dos exemplos de tecnologias que se destacaram nesta última década, visto ter fornecido uma plataforma para transmissão de dados sem-fio eficaz e simples. O seu maior problema é a alta “peak-to-average power ratio” (PAPR) e a sua sensibilidade a ruído de fase que deram motivo à adoção de técnicas alternativas, tais como os sistemas “single carrier” com “frequency domain equalization” (SC-FDE) ou os sistemas “multi-carrier” com “code division multiple access” (MC-CDMA), mas equalizadores não lineares no domínio de frequência têm sido alvo de especial atenção devido ao seu melhor desempenho. Destes, o “iterative block decision feedback equalizer” (IB-DFE) tem-se provado especialmente promissor devido à sua compatibilidade com técnicas de diversidade no espaço, sistemas MIMO e esquemas CDMA. No entanto, IB-DFE requer que o sistema tenha constante conhecimento das propriedades dos canais usados, ou seja, necessita de ter perfeito “channel state information” (CSI) constantemente, o que é tanto irrealista como impossível de implementar. Nesta dissertação iremos projetar um recetor IB-DFE alterado de forma a conseguir detetar sinais dum transmissor baseado em tecnologia SC-FDMA, mesmo com a informação de estado de canal errada. Os resultados irão então demonstrar que o novo esquema de equalização proposto é robusto para situações de CSI imperfeito (I-CSI), visto que o seu desempenho se mantém próximo dos valores esperados para CSI perfeito, em apenas algumas iterações.Mestrado em Engenharia Eletrónica e Telecomunicaçõe

An objective based classification of aggregation techniques for wireless sensor networks

Wireless Sensor Networks have gained immense popularity in recent years due to their ever increasing capabilities and wide range of critical applications. A huge body of research efforts has been dedicated to find ways to utilize limited resources of these sensor nodes in an efficient manner. One of the common ways to minimize energy consumption has been aggregation of input data. We note that every aggregation technique has an improvement objective to achieve with respect to the output it produces. Each technique is designed to achieve some target e.g. reduce data size, minimize transmission energy, enhance accuracy etc. This paper presents a comprehensive survey of aggregation techniques that can be used in distributed manner to improve lifetime and energy conservation of wireless sensor networks. Main contribution of this work is proposal of a novel classification of such techniques based on the type of improvement they offer when applied to WSNs. Due to the existence of a myriad of definitions of aggregation, we first review the meaning of term aggregation that can be applied to WSN. The concept is then associated with the proposed classes. Each class of techniques is divided into a number of subclasses and a brief literature review of related work in WSN for each of these is also presented

An efficient bit-loading algorithm with peak BER constraint for the band-extended PLC

ISBN: 978-1-4244-2936-3International audiencePowerline communications (PLC) have become a viable local area network (LAN) solution for in-home networks. In order to achieve high bit rate over powerline, the current technology bandwidth is increased up to 100 MHz within the European project OMEGA. In this paper, an efficient bit-loading algorithm with peak BER constraint is proposed. This algorithm tries to maximize the overall data rate based on linear precoded discrete multitone (LP-DMT), which enables reliable high bit rate transmission. A fast computational algorithm with mean BER constraint is also proposed. Simulations are run over PLC channels and it is shown that peak BER constraint algorithm combined with linear precoding component gives better performance than mean BER constraint algorithm