Spelling suggestions: "subject:"delaying"" "subject:"relaying""
21 |
Energy-Efficient AF Relay Assisted OFDM with Index ModulationZhou, Jiusi 04 1900 (has links)
To broaden the application scenario and reduce energy consumption, we propose an energy-efficient fixed-gain (FG) amplify-and-forward (AF) relay assisted orthog- onal frequency-division multiplexing with index modulation (OFDM-IM) scheme in this thesis. The proposed system needs neither instantaneous channel state informa- tion (CSI) nor performing complicated processing at the relay node. It operates based on a new design of power allocation that minimizes the sum of transmit power at both source and relay node, given an outage probability constraint. Considering the actual situation and combining with the characteristics of normalization research, the pro- posed scheme can be discussed in two scenarios regarding to whether the subcarriers are interfered with by fading and noise independently. Based on the consistency of statistical CSI for each subcarrier, through a series of problem transformation and simplification, this thesis converts the original power allocation problem to a relaxed version and solve the relaxed problem using the convex optimization techniques. To reveal the computing efficiency of the proposed power allocation scheme, we analyze its computational complexity. Numerical simulations substantiate that the proposed optimization scheme has a neglectable loss compared with the brute force search, while the computational complexity could be considerably reduced. As for the sce- nario about the independence of statistical CSI for each subcarrier, an approach of artificial neural network (ANN) based on deep learning is incorporated into the sys- tem, enabling the proposed scheme to achieve a high accuracy comparing perfect optimization scheme. In the processing of power minimization, this study utilizes the adaptive moment estimation (Adam) method to implement back-propagation learn- ing and achieve the power allocation needed.
|
22 |
Performance analysis of cooperative communication for wireless networksChembil Palat, Ramesh 08 January 2007 (has links)
The demand for access to information when and where you need has motivated the transition of wireless communications from a fixed infrastructure based cellular communications technology to a more pervasive adhoc wireless networking technology. Challenges still remain in wireless adhoc networks in terms of meeting higher capacity demands, improved reliability and longer connectivity before it becomes a viable widespread commercial technology. Present day wireless mesh networking uses node-to-node serial multi-hop communication to convey information from source to destination in the network. The performance of such a network depends on finding the best possible route between the source and destination nodes. However the end-to-end performance can only be as good as the weakest link within a chosen route. Unlike wired networks, the quality of point-to-point links in a wireless mesh network is subject to random fluctuations. This adversely affects the performance resulting in poor throughput and poor energy efficiency.
In recent years, a new paradigm for communication called cooperative communications has been proposed for which initial information theoretic studies have shown the potential for improvements in capacity over traditional multi-hop wireless networks. Cooperative communication involves exploiting the broadcast nature of the wireless medium to form virtual antenna arrays out of independent single-antenna network nodes for transmission. In this research we explore the fundamental performance limits of cooperative communication under more practical operating scenarios. Specifically we provide a framework for computing the outage and ergodic capacities of non identical distributed MIMO links, study the effect of time synchronization error on system performance, analyze the end-to-end average bit error rate (ABER) performance under imperfect relaying, and study range extension and energy efficiency offered by the system when compared to a traditional system. / Ph. D.
|
23 |
Electromechanical Wave Propagation in Large Electric Power SystemsHuang, Liling 03 November 2003 (has links)
In a large and dense power network, the transmission lines, the generators and the loads are considered to be continuous functions of space. The continuum technique provides a macro-scale analytical tool to gain an insight into the mechanisms by which the disturbances initiated by faults and other random events propagate in the continuum. This dissertation presents one-dimensional and two-dimensional discrete models to illustrate the propagation of electromechanical waves in a continuum system. The more realistic simulations of the non-uniform distribution of generators and boundary conditions are also studied. Numerical simulations, based on the swing equation, demonstrate electromechanical wave propagation with some interesting properties. The coefficients of reflection, reflection-free termination, and velocity of propagation are investigated from the numerical results. Discussions related to the effects of electromechanical wave propagation on protection systems are given. In addition, the simulation results are compared with field data collected by phasor measurement units, and show that the continuum technique provides a valuable tool in reproducing electromechanical transients on modern power systems. Discussions of new protection and control functions are included. A clear understanding of these and related phenomena will lead to innovative and effective countermeasures against unwanted trips by the protection systems, which can lead to system blackouts. / Ph. D.
|
24 |
Coding Schemes for Relay NetworksNasiri Khormuji, Majid January 2011 (has links)
Cooperative communications by pooling available resources—for example, power and bandwidth—across the network, is a distributed solution for providing robust wireless transmission. Motivated by contemporary applications in multi-hop transmission and ad hoc networks, the classical three-node relay channel (RC) consisting of a source–destination pair and a relay node has received a renewed attention. One of the crucial aspects of the communication over relay networks (RNs) is the design of proper relaying protocols; that is, how the relay should take part in the transmission to meet a certain quality of service. In this dissertation, we address the design of reliable transmission strategies and quantification of the associated transmission rates over RNs. We consider three canonical examples of RNs: the classical RC, the multiple-access RC (MARC) and the two-way RC.We also investigate the three-node RC and MARC with state. The capacity of the aforementioned RNs is an open problem in general except for some special cases. In the thesis, we derive various capacity bounds, through which we also identify the capacity of some new classes of RNs. In particular, we introduce the class of state-decoupled RNs and prove that the noisy network coding is capacity achieving under certain conditions. In the thesis, we also study the effect of the memory length on the capacity of RNs. The investigated relaying protocols in the thesis can be categorized into two groups: protocols with a finite relay memory and those with infinite relay memory requirement. In particular, we consider the design of instantaneous relaying (also referred to as memoryless relaying) in which the output of the relay depends solely on the presently received signal at the relay. For optimizing the relay function, we present several algorithms constructed based on grid search and variational methods. Among other things, we surprisingly identify some classes of semi-deterministic RNs for which a properly constructed instantaneous relaying strategy achieves the capacity. We also show that the capacity of RNs can be increased by allowing the output of the relay to depend on the past received signals as well the current received signal at the relay. As an example, we propose a hybrid digital–analog scheme that outperforms the cutset upper bound for strictly causal relaying. / <p>QC 20110909</p>
|
25 |
On the performance analysis of full-duplex networksAlves, H. (Hirley) 17 March 2015 (has links)
Abstract
In this thesis we study Full-Duplex (FD) cooperative networks from different perspectives, using concepts of information theory, communication theory and applied statistics. We provide a comprehensive performance analysis of cooperative communications systems operating with FD relays. We demonstrate that FD relaying is feasible even when experiencing strong self-interference, and we show its application under different scenarios. More importantly, the results attained through this work serve as a benchmark for design as well as deployment of current and future wireless communications technologies.
Our first contribution is a comprehensive overview of the state-of-the-art on FD communications, more specifically on FD relaying, and we revisit some of the main properties of cooperative schemes. Another contribution comes from an extensive analysis of outage probability, throughput and energy efficiency of FD relaying over Rayleigh fading channels. Besides the mathematical framework introduced herein, we also show that in some cases cooperative Half-Duplex (HD) schemes achieve better performance than FD relaying with self-interference. Therefore, we draw a discussion on the trade-offs between HD and FD schemes as well as between throughput and energy efficiency. Then, we investigate the performance of FD relaying protocols under general fading settings, namely Nakagami-m fading. Our findings allow a better understanding of effects of the residual self-interference and line-of-sight on a FD relaying setup. Our final contribution lies on the performance analysis of secure cooperative networks relying on information theoretical metrics to provide enhanced privacy and confidentiality to wireless networks. Thus, we provide a comprehensive mathematical framework for composite fading channels. Even though experiencing strong self-interference, we demonstrate that FD relaying is feasible also under secrecy constraints, thus perfect secrecy can be achieved. / Tiivistelmä
Tässä työssä tutkitaan kaksisuuntaisia (Full-Duplex, FD) yhteistoiminnallisia verkkoja informaatioteorian, tietoliikenneteorian ja sovelletun tilastotieteen näkökulmista. Työssä suoritetaan kattava suorityskykyarviointi yhteistoiminnallisten FD-välittimien muodostamassa tietoliikenneverkossa. FD-releointi osoitetaan toimintakelpoiseksi useissa toimintaympäristöissä ja sovelluksissa jopa voimakkaan omahäiriön vallitessa. Mikä tärkeintä, työssä saavutetut tulokset muodostavat vertailukohdan sekä nykyisten että tulevien langattomien verkkoteknologioiden suunnitteluun ja toteutukseen.
Aluksi esitetään perusteellinen katsaus uusimpiin FD-tiedonsiirtomenetelmiin, etenkin FD-välitykseen, sekä kerrataan yhteistoiminnallisten tekniikoiden pääpiirteet. Seuraavaksi analysoidaan laajasti FD-välitinyhteyden luotettavuutta sekä spektrinkäyttö- ja energiatehokkuutta Rayleigh-häipyvissä radiokanavissa. Matemaattisen viitekehyksen lisäksi osoitetaan myös, että joissain tapauksissa yhteistoiminnalliset vuorosuuntaiset (Half-Duplex, HD) menetelmät ovat parempia kuin FD-releointi omahäiriön vallitessa. Niinpä työssä käydään keskustelua kaupankäynnistä HD- ja FD -menetelmien kesken kuten myös spektrinkäyttö- ja energiatehokkuuden kesken. Seuraavaksi tutkitaan FD-releoinnin suorityskykyä yleistetymmässä häipymäympäristössä eli Nakagami-m -kanavassa. Saavutetut tulokset auttavat ymmärtämään paremmin jäljelle jäävän omahäiriön ja näköyhteyslinkkien vuorovaikutussuhteet FD-välitinjärjestelmän suunnittelussa. Lopuksi käsitellään tietoturvattuja yhteistoiminnallisia verkkoja informaatioteoreettisin mittarein, joilla pyritään tarjoamaan langattomien verkkojen käyttäjille parempaa yksityisyyden suojaa ja luottamuksellisuutta. Tätä varten työssä esitetään perusteelliset matemaattiset puitteet yhdistettyjen häipyvien kanavien tutkimiseen. Tuloksena osoitetaan, että myös salassapitokriteerien kannalta on mahdollista käyttää voimakkaan omahäiriön kokemaa FD-releointia vahvan salauksen saavuttamiseen.
|
26 |
Improper Gaussian Signaling in Interference-Limited SystemsGaafar, Mohamed 05 1900 (has links)
In the last decade, wireless applications have witnessed a tremendous growth. This can be envisioned in the surge of smart devices which became almost in everyone's possession, demand for high speed connection and the internet of things (IoT) along with its enabling technologies. Hence, the multiuser interference became the main limiting
factor in wireless communications. Moreover, just like diamonds and emeralds, the electromagnetic spectrum is limited and precious. Therefore, the high data rate application may not be satisfied by our current technologies. In order to solve this spectrum scarcity problem, researchers have steered their focus to develop new techniques such as cognitive radio (CR) and in-band full-duplex (FD). However, these systems suffer from the interference problem that can dramatically impede their quality-of-service (QoS). Therefore, investigating communication techniques/systems that can relieve the interference adverse signature becomes imperative. Improper Gaussian signaling (IGS) has been recently shown to outperform the traditional proper Gaussian signaling (PGS) in several interference-limited systems. In this thesis, we use IGS in order to mitigate the interference issue in three different communication settings. IGS has the ability to control the interference signal dimension, and hence, it can be considered as one form of interference alignment. In the first part, we investigate an underlay CR system with in-band FD primary users (PUs) and one-way communication for the secondary user (SU). IGS is employed to alleviate the interference introduced by the SU on the PUs. First, we derive a closed form expression and an upper bound for the SU and PUs outage probabilities, respectively. Second, we optimize the SU signal parameters, represented in its power and the circularity coefficient, to achieve the design objectives of the SU while satisfying certain QoS constraints for the PU under instantaneous, average and partial channel state information (CSI). Finally, we provide some numerical results that demonstrate the advantages that can be reaped by using IGS to access the spectrum of the FD PUs. Specifically, with the existence of week PU direct channels and/or strong SU interference channels, PGS tends to use less transmit power while
IGS uses more power along with increasing the signal impropriety.
Part 2 studies the potential employment of IGS in FD cooperative settings with non-negligible residual self-interference (RSI). In this part, IGS is used in an attempt to alleviate the RSI adverse effect in full-duplex relaying (FDR). To this end, we derive a tight upper bound expression for the end-to-end outage probability in terms of the relay signal parameters. We further show that the derived upper bound is either monotonic or unimodal in the relay's circularity coefficient. This result allows for easily locating the global optimal point using known numerical methods. Based on the analysis, IGS allows FDR systems to operate even with high RSI. It is shown that, while the communication totally fails with PGS as the RSI increases, the IGS outage probability approaches a fixed value that depends on the channel statistics and target rate. The obtained results show that IGS can leverage higher relay power budgets than PGS to improve the performance, meanwhile it relieves its RSI impact via tuning the signal impropriety. In part 3, we investigate the potential benefits of adopting IGS in a two-hop alternate relaying (AR) system. Given the known benefits of using IGS in interference-limited networks, we propose to use IGS to relieve the inter-relay interference (IRI) impact on the AR system assuming no CSI is available at the source. In this regard, we assume that the two relays use IGS and the source uses PGS. Then, we optimize the degree of impropriety of the relays signal, measured by the circularity coefficient, to maximize the total achievable rate. Simulation results show that using IGS yields a significant performance improvement over PGS, especially when the first hop is a bottleneck due to weak source-relay channel gains and/or strong IRI.
|
27 |
Performance analysis of wireless relay systemsVien, Hoai Nam 15 June 2010
There has been phenomenal interest in applying space-time coding techniques in wireless communications in the last two decades. In general, the benefit of applying space-time codes in multiple-input, multiple-output (MIMO) wireless channels is an increase in transmission reliability or system throughput (capacity). However, such a benefit cannot be obtained in some wireless systems where size or other constraints preclude the use of multiple antennas. As such, wireless relay communications has recently been proposed as a means to provide spatial diversity in the face of this limitation. In this approach, some users or relay nodes assist the transmission of other users information. This dissertation contributes to the advancement of wireless relay communications by investigating the performance of various relaying signal processing methods under different practical fading environments. In particular, it examines two main relaying methods, namely decode-and-forward (DF) and amplify-and-forward (AF).<p>
For DF, the focus is on the diversity analysis of relaying systems under various practical protocols when detection error at relays is taken into account. In order to effectively mitigate the phenomenon of error propagation, the smart relaying technique proposed by Wang et al. in [R1] is adopted. First, diversity analysis of a single-relay system under the scenario that only the relay is allowed to transmit in the second
time slot (called Protocol II) is carried out. For Nakagami and Hoyt generalized fading
channels, analytical and numerical results are provided to demonstrate that the system always obtains the maximal diversity when binary phase shift keying (BPSK) modulation is used. Second, a novel and low-complexity relaying system is proposed when smart relaying and equal gain combing (EGC) techniques are combined. In
the proposed system, the destination requires only the phases of the channel state
information in order to detect the transmitted signals. For the single-relay system with M-ary PSK modulation, it is shown that the system can achieve the maximal diversity under Nakagami and Hoyt fading channels. For the K-relay system, simulation results suggest that the maximal diversity can also be achieved. Finally, the diversity analysis for a smart relaying system under the scenario when both the source
and relay are permitted to transmit in the second time slot (referred to as Protocol I) is presented. It is shown that Protocol I can achieve the same diversity order as Protocol II for the case of 1 relay. In addition, the diversity is very robust to the quality of the feedback channel as well as the accuracy of the quantization of the power scaling implemented at the relay.<p>
For AF, the dissertation considers a fixed-gain multiple-relay system with maximal ratio combining (MRC) detection at the destination under Nakagami fading channels. Different from the smart relaying for DF, all the channel state information is assumed to be available at the destination in order to perform MRC for any number of antennas. Upperbound and lowerbound on the system performance are then derived.
Based on the bounds, it is shown that the system can achieve the maximal diversity. Furthermore, the tightness of the upperbound is demonstrated via simulation results. With only the statistics of all the channels available at the destination, a novel power allocation (PA) is then proposed. The proposed PA shows significant performance
gain over the conventional equal PA.
|
28 |
Performance analysis of wireless relay systemsVien, Hoai Nam 15 June 2010 (has links)
There has been phenomenal interest in applying space-time coding techniques in wireless communications in the last two decades. In general, the benefit of applying space-time codes in multiple-input, multiple-output (MIMO) wireless channels is an increase in transmission reliability or system throughput (capacity). However, such a benefit cannot be obtained in some wireless systems where size or other constraints preclude the use of multiple antennas. As such, wireless relay communications has recently been proposed as a means to provide spatial diversity in the face of this limitation. In this approach, some users or relay nodes assist the transmission of other users information. This dissertation contributes to the advancement of wireless relay communications by investigating the performance of various relaying signal processing methods under different practical fading environments. In particular, it examines two main relaying methods, namely decode-and-forward (DF) and amplify-and-forward (AF).<p>
For DF, the focus is on the diversity analysis of relaying systems under various practical protocols when detection error at relays is taken into account. In order to effectively mitigate the phenomenon of error propagation, the smart relaying technique proposed by Wang et al. in [R1] is adopted. First, diversity analysis of a single-relay system under the scenario that only the relay is allowed to transmit in the second
time slot (called Protocol II) is carried out. For Nakagami and Hoyt generalized fading
channels, analytical and numerical results are provided to demonstrate that the system always obtains the maximal diversity when binary phase shift keying (BPSK) modulation is used. Second, a novel and low-complexity relaying system is proposed when smart relaying and equal gain combing (EGC) techniques are combined. In
the proposed system, the destination requires only the phases of the channel state
information in order to detect the transmitted signals. For the single-relay system with M-ary PSK modulation, it is shown that the system can achieve the maximal diversity under Nakagami and Hoyt fading channels. For the K-relay system, simulation results suggest that the maximal diversity can also be achieved. Finally, the diversity analysis for a smart relaying system under the scenario when both the source
and relay are permitted to transmit in the second time slot (referred to as Protocol I) is presented. It is shown that Protocol I can achieve the same diversity order as Protocol II for the case of 1 relay. In addition, the diversity is very robust to the quality of the feedback channel as well as the accuracy of the quantization of the power scaling implemented at the relay.<p>
For AF, the dissertation considers a fixed-gain multiple-relay system with maximal ratio combining (MRC) detection at the destination under Nakagami fading channels. Different from the smart relaying for DF, all the channel state information is assumed to be available at the destination in order to perform MRC for any number of antennas. Upperbound and lowerbound on the system performance are then derived.
Based on the bounds, it is shown that the system can achieve the maximal diversity. Furthermore, the tightness of the upperbound is demonstrated via simulation results. With only the statistics of all the channels available at the destination, a novel power allocation (PA) is then proposed. The proposed PA shows significant performance
gain over the conventional equal PA.
|
29 |
Performance of a Non-Orthogonal Multiple Access System with Full-duplex Relaying over Nakagami-m FadingErpina, Rahul Chowdary, Gopireddy, Viswakanth Reddy January 2021 (has links)
In our thesis work, we analyze the performance analysis of a power domain NonOrthogonal Multiple Access (NOMA) system in which the closer user acts as fullduplex relaying to forward the signal to farther user. Because Nakagami-m distribution is a generalized case including the two common fading distributions as specialcases: Rayleigh distribution (m=1), Rician distribution (m>1). We assume that thesystem experiences Nakagami-m fading. Then, we have to analyze outage probabilityof NOMA system. Numerical results are provided for outage probability to show theeffect of system parameters on the performance of the NOMA system in full duplexrelaying over Nakagami-m fading.
|
30 |
Distance Protection Aspects of Transmission Lines Equipped with Series Compensation CapacitorsSummers, Clinton Thomas 22 October 1999 (has links)
In order to meet the high demand for power transmission capacity, some power companies have installed series capacitors on power transmission lines. This allows the impedance of the line to be lowered, thus yielding increased transmission capability. The series capacitor makes sense because it's simple and could be installed for 15 to 30% of the cost of installing a new line, and it can provide the benefits of increased system stability, reduced system losses, and better voltage regulation.1
Protective distance relays, which make use of impedance measurements in order to determine the presence and location of faults, are "fooled" by installed series capacitance on the line when the presence or absence of the capacitor in the fault circuit is not known a priori. This is because the capacitance cancels or compensates some of the inductance of the line and therefore the relay may perceive a fault to be in its first zone when the fault is actually in the second or third zone of protection. Similarly, first zone faults can be perceived to be reverse faults! Clearly this can cause some costly operating errors.
The general approach of interest is a method leading to the determination of the values of series L and C of the line at the time of the fault. This is done by analyzing the synchronous and subsynchronous content of the V and I signals seperately which provides adequate information to compute the series L and C of the line. / Master of Science
|
Page generated in 0.0551 seconds