Spelling suggestions: "subject:"powerline communications"" "subject:"powerlines communications""
1 |
Channel modelling and relay for powerline communicationsTan, Bo January 2013 (has links)
The thesis discusses the channel modelling and relay techniques in powerline communications (PLC) which is considered as a promising technology for the Smart Grid communications, Internet access and home area network (HAN). In this thesis, the statistical PLC channel characteristics are investigated, a new statistical channel modelling method is proposed for the in-door PLC. Then a series of the relay protocols are suggested for the broadband communications over power grid. The statistical channel modelling method is proposed to surmount the limits of the traditional deterministic PLC channel models such as multipath model and transmission line model. To develop the channel model, the properties of the multipath magnitudes, interval between the paths, cable loss and the channel classification are investigated in detail. Then, each property is described by statistical distribution or formula. The simulation results show that the statistical model can describe the PLC channels as accurate as deterministic models without the topology information which is a time-consuming work for collecting. The relay transmission is proposed to help PLC adapting the diverse application scenarios. The protocols covers the main relay aspects which include decode/amplify forwarding, single/ multiple relay nodes, full/half duplex relay working mode. The capacity performance of each protocol is given and compared. A series of the facts which improve the performance of the PLC networks are figured out according to simulation results. The facts include that the decode-and-forward is more suitable for the PLC environment, deviation or transforming station is better location for placing relay node and full duplex relay working mode help exploiting the capacity potential of the PLC networks. Some future works are pointed out based on the work of statistical channel model and relay. In the last part of this thesis, an unit based statistical channel model is initialled for adapting various PLC channel conditions, a more practical relay scenario which contains multiple data terminals is proposed for approaching the realistic transmission scenario. At last, the relay for the narrowband PLC Smart Grid is also mentioned as future research topic.
|
2 |
Robust transceivers to combat impulsive noise in powerline communicationsLin, Jing, active 2014 25 June 2014 (has links)
Future smart grid systems will intelligently monitor and control energy flows in order to improve the efficiency and reliability of power delivery. This monitoring and control requires low-power, low-cost and highly reliable two-way communications between customers and utilities. To enable these two-way communication links, powerline communication (PLC) systems are attractive because they can be deployed over existing outdoor and indoor power lines. Power lines, however, have traditionally been designed for one-directional power delivery and remain hostile environments for communication signal propagation. In particular, non-Gaussian noise that is dominated by asynchronous impulsive noise and periodic impulsive noise, is one of the primary factors that limit the communication performance of PLC systems. For my PhD dissertation, I propose transmitter and receiver methods to mitigate the impact of asynchronous impulsive noise and periodic impulsive noise, respectively, on PLC systems. The methods exploit sparsity and/or cyclostationarity of the noise in both time and frequency domains, and require no or minor training overhead prior to data transmission. Compared to conventional PLC systems, the proposed transceivers achieve dramatic improvement (up to 1000x) in coded bit error rates in simulations, while maintaining similar throughput. / text
|
3 |
Opportunistic Routing with Network Coding in Powerline CommunicationsTsokalo, Ievgenii 30 November 2018 (has links)
Opportunistic Routing (OR) can be used as an alternative to the legacy routing (LR) protocols in networks with a broadcast lossy channel and possibility of overhearing the signal. The power line medium creates such an environment. OR can better exploit the channel than LR because it allows the cooperation of all nodes that receive any data. With LR, only a chain of nodes is selected for communication. Other nodes drop the received information. We investigate OR for the one-source one-destination scenario with one traffic flow. First, we evaluate the upper bound on the achievable data rate and advocate the decentralized algorithm for its calculation. This knowledge is used in the design of Basic Routing Rules (BRR). They use the link quality metric that equals the upper bound on the achievable data rate between the given node and the destination. We call it the node priority. It considers the possibility of multi-path communication and the packet loss correlation. BRR allows achieving the optimal data rate pertaining certain theoretical assumptions. The Extended BRR (BRR-E) are free of them. The major difference between BRR and BRR-E lies in the usage of Network Coding (NC) for prognosis of the feedback. In this way, the protocol overhead can be severely reduced. We also study Automatic Repeat-reQuest (ARQ) mechanism that is applicable with OR. It differs to ARQ with LR in that each sender has several sinks and none of the sinks except destination require the full recovery of the original message. Using BRR-E, ARQ and other services like network initialization and link state control, we design the Advanced Network Coding based Opportunistic Routing protocol (ANChOR). With the analytic and simulation results we demonstrate the near optimum performance of ANChOR. For the triangular topology, the achievable data rate is just 2% away from the theoretical maximum and it is up to 90% higher than it is possible to achieve with LR. Using the G.hn standard, we also show the full protocol stack simulation results (including IP/UDP and realistic channel model). In this simulation we revealed that the gain of OR to LR can be even more increased by reducing the head-of-the-line problem in ARQ. Even considering the ANChOR overhead through additional headers and feedbacks, it outperforms the original G.hn setup in data rate up to 40% and in latency up to 60%.:1 Introduction 2
1.1 Intra-flow Network Coding 6
1.2 Random Linear Network Coding (RLNC) 7
2 Performance Limits of Routing Protocols in PowerLine Communications (PLC) 13
2.1 System model 14
2.2 Channel model 14
2.3 Upper bound on the achievable data rate 16
2.4 Achieving the upper bound data rate 17
2.5 Potential gain of Opportunistic Routing Protocol (ORP) over Common Single-path Routing Protocol (CSPR) 19
2.6 Evaluation of ORP potential 19
3 Opportunistic Routing: Realizations and Challenges 24
3.1 Vertex priority and cooperation group 26
3.2 Transmission policy in idealized network 34
3.2.1 Basic Routing Rules (BRR) 36
3.3 Transmission policy in real network 40
3.3.1 Purpose of Network Coding (NC) in ORP 41
3.3.2 Extended Basic Routing Rules (BRR) (BRR-E) 43
3.4 Automatic ReQuest reply (ARQ) 50
3.4.1 Retransmission request message contents 51
3.4.2 Retransmission Request (RR) origination and forwarding 66
3.4.3 Retransmission response 67
3.5 Congestion control 68
3.5.1 Congestion control in our work 70
3.6 Network initialization 74
3.7 Formation of the cooperation groups (coalitions) 76
3.8 Advanced Network Coding based Opportunistic Routing protocol (ANChOR) header 77
3.9 Communication of protocol information 77
3.10 ANChOR simulation . .79
3.10.1 ANChOR information in real time .80
3.10.2 Selection of the coding rate 87
3.10.3 Routing Protocol Information (RPI) broadcasting frequency 89
3.10.4 RR contents 91
3.10.5 Selection of RR forwarder 92
3.10.6 ANChOR stability 92
3.11 Summary 95
4 ANChOR in the Gigabit Home Network (G.hn) Protocol 97
4.1 Compatibility with the PLC protocol stack 99
4.2 Channel and noise model 101
4.2.1 In-home scenario 102
4.2.2 Access network scenario 102
4.3 Physical layer (PHY) layer implementation 102
4.3.1 Bit Allocation Algorithm (BAA) 103
4.4 Multiple Access Control layer (MAC) layer 109
4.5 Logical Link Control layer (LLC) layer 111
4.5.1 Reference Automatic Repeat reQuest (ARQ) 111
4.5.2 Hybrid Automatic Repeat reQuest (HARQ) in ANChOR 114
4.5.3 Modeling Protocol Data Unit (PDU) erasures on LLC 116
4.6 Summary 117
5 Study of G.hn with ANChOR 119
5.1 ARQ analysis 119
5.2 Medium and PHY requirements for “good” cooperation 125
5.3 Access network scenario 128
5.4 In-home scenario 135
5.4.1 Modeling packet erasures 136
5.4.2 Linear Dependence Ratio (LDR) 139
5.4.3 Worst case scenario 143
5.4.4 Analysis of in-home topologies 145
6 Conclusions . . . . . . . . . . . . . . . 154
A Proof of the neccessity of the exclusion rule 160
B Gain of ORPs to CSRPs 163
C Broadcasting rule 165
D Proof of optimality of BRR for triangular topology 167
E Reducing the retransmission probability 168
F Calculation of Expected Average number of transmissions (EAX) for topologies with bi-directional links 170
G Feedback overhead of full coding matrices 174
H Block diagram of G.hn physical layer in ns-3 model 175
I PER to BER mapping 177
|
4 |
Electromagnetic compatibility in wireline communicationsLauder, David Maxwell January 2007 (has links)
This document is a thesis submitted in partial fulfilment of the requirements of the University of Hertfordshire for the degree of Doctor of Philosophy (Part Time) in 'EMC in Wire-line Communications' in the School of Electronic, Communication and Electrical Engineering at the University of Hertfordshire. It describes a programme of research into the modelling and measurement of radio frequency interference emissions from various communication networks including Power Line (Tele)communications (PLC/PLT) and Digital Subscriber Line (DSL). An introduction and literature review are followed by the results of practical measurements on installed networks. These measurements include antenna gain and Longitudinal Conversion Loss (LCL). Power line communication networks, splitterless DSL and home phoneline networks in buildings are studied and modelled and the models are compared with the measured results. Improved EMC test methods are also described, in particular the modelling and design of four types of portable antennas for use in radiated EMC measurements with improved sensitivity at frequencies up to 30 MHz. The first type is a set of three manually tuned loop antennas covering 100 kHz - 30 MHz. The second is a set of three loop antennas that cover a similar frequency range but with remote tuning via an optical fibre link, under the control of software which also controls an EMC measuring receiver. The third type is a larger (1.6 m diameter) tuned loop covering 1.75 - 10 MHz that allows the measuring system noise floor to be below the typical atmospheric noise floor. The fourth type is an electrically short dipole covering 10 - 30 MHz with improved matching. The protection requirements for various types of radio communication services are analysed and are compared with emission levels from various types of wireline communication network. A review of existing applicable EMC standards and standards under development is also presented.
|
5 |
Datové přenosy po silových vedeních / Power-line data communicationŠádek, Michal January 2009 (has links)
This master's thesis describes a principle of the systems for data communication over powerline. The frequency we can divide to narrowband and broadband. Various modulatory techniques with their usage and access method technology according to norms are mentioned. Engineering constraints as are frequency subband and sources disturbance are mentioned. A conception laboratory net is designed, where are effected trial measurement in data communications for systems ModemTec, Homeplug AV a DS2. This demonstration of communication contains display communications spectrum of choice systems and their matching. To comparison is used synthetic created nets LISN (Line Impedance Stabilizing Network) in narrowband transmissions. Long - term metering of systems ModemTec is is effected in laboratory net VUT and in the working condition in Swiss extension companies Daetwyler Rubber where are produced robust rubbery production. System DS2 is measured in home network, where are supposes low disturbance and in industrial environment company Daetwyler Rubber. On the basis report information of phase quality recorder a powerline and measured rate of communication, it is evaluate an influence disturbance on a data transmission and response time. At the close are mentioned principles of usage this communication.
|
6 |
Codes et tableaux de permutations, construction, énumération et automorphismes /Permutation codes and permutations arrays: construction, enumeration and automorphismsBogaerts, Mathieu 22 June 2009 (has links)
Un code de permutations G(n,d) un sous-ensemble C de Sym(n) tel que la distance de Hamming D entre deux éléments de C est supérieure ou égale à d. Dans cette thèse, le groupe des isométries de (Sym(n),D) est déterminé et il est prouvé que ces isométries sont des automorphismes du schéma d'association induit sur Sym(n) par ses classes de conjugaison. Ceci mène, par programmation linéaire, à de nouveaux majorants de la taille maximale des G(n,d) pour n et d fixés et n compris entre 11 et 13. Des algorithmes de génération avec rejet d'objets isomorphes sont développés. Pour classer les G(n,d) non isométriques, des invariants ont été construits et leur efficacité étudiée. Tous les G(4,3) et les G(5,4) ont été engendrés à une isométrie près, il y en a respectivement 61 et 9445 (dont 139 sont maximaux et décrits explicitement). D’autres classes de G(n,d) sont étudiées.
A permutation code G(n,d) is a subset C of Sym(n) such that the Hamming distance D between two elements of C is larger than or equal to d. In this thesis, we characterize the isometry group of the metric space (Sym(n),D) and we prove that these isometries are automorphisms of the association scheme induced on Sym(n) by the conjugacy classes. This leads, by linear programming, to new upper bounds for the maximal size of G(n,d) codes for n and d fixed and n between 11 and 13. We develop generating algorithms with rejection of isomorphic objects. In order to classify the G(n,d) codes up to isometry, we construct invariants and study their efficiency. We generate all G(4,3) and G(4,5)codes up to isometry; there are respectively 61 and 9445 of them. Precisely 139 out of the latter codes are maximal and explicitly described. We also study other classes of G(n,d)codes.
|
7 |
Graphical models and message passing receivers for interference limited communication systemsNassar, Marcel 15 October 2013 (has links)
In many modern wireless and wireline communication networks, the interference power from other communication and non-communication devices is increasingly dominating the background noise power, leading to interference limited communication systems. Conventional communication systems have been designed under the assumption that noise in the system can be modeled as additive white Gaussian noise (AWGN). While appropriate for thermal noise, the AWGN model does not always capture the interference statistics in modern communication systems. Interference from uncoordinated users and sources is particularly harmful to communication performance because it cannot be mitigated by current interference management techniques. Based on previous statistical-physical models for uncoordinated wireless interference, this dissertation derives similar models for uncoordinated interference in PLC networks. The dissertation then extends these models for wireless and powerline interference to include temporal dependence among amplitude samples. The extensions are validated with measured data. The rest of this dissertation utilizes the proposed models to design receivers in interference limited environments. Prior designs generally adopt suboptimal approaches and often ignore the problem of channel estimation which limits their applicability in practical systems. This dissertation uses the graphical model representation of the OFDM system to propose low-complexity message passing OFDM receivers that leverage recent results in soft-input soft-output decoding, approximate message passing, and sparse signal recovery for joint channel/interference estimation and data decoding. The resulting receivers provide huge improvements in communication performance (more than 10dB) over the conventional receivers at a comparable computational complexity. Finally, this dissertation addresses the design of robust receivers that can be deployed in rapidly varying environments where the interference statistics are constantly changing. / text
|
8 |
Space-time-frequency methods for interference-limited communication systemsNieman, Karl Frazier 20 January 2015 (has links)
Traditionally, noise in communication systems has been modeled as an additive, white Gaussian noise process with independent, identically distributed samples. Although this model accurately reflects thermal noise present in communication system electronics, it fails to capture the statistics of interference and other sources of noise, e.g. in unlicensed communication bands. Modern communication system designers must take into account interference and non-Gaussian noise to maximize efficiencies and capacities of current and future communication networks. In this work, I develop new multi-dimensional signal processing methods to improve performance of communication systems in three applications areas: (i) underwater acoustic, (ii) powerline, and (iii) multi-antenna cellular. In underwater acoustic communications, I address impairments caused by strong, time-varying and Doppler-spread reverberations (self-interference) using adaptive space-time signal processing methods. I apply these methods to array receivers with a large number of elements. In powerline communications, I address impairments caused by non-Gaussian noise arising from devices sharing the powerline. I develop and apply a cyclic adaptive modulation and coding scheme and a factor-graph-based impulsive noise mitigation method to improve signal quality and boost link throughput and robustness. In cellular communications, I develop a low-latency, high-throughput space-time-frequency processing framework used for large scale (up to 128 antenna) MIMO. This framework is used in the world's first 100-antenna MIMO system and processes up to 492 Gbps raw baseband samples in the uplink and downlink directions. My methods prove that multi-dimensional processing methods can be applied to increase communication system performance without sacrificing real-time requirements. / text
|
9 |
Προσδιορισμός της απόδοσης αγωγών υψηλής τάσης για τη χρήση PowerLine Communication (PLC)Μουστάκα, Μαρία, Σταμούλη, Αλεξία 16 June 2011 (has links)
Ο στόχος της διπλωματικής αυτής είναι η περιγραφή της αναδυόμενης τεχνολογίας PLC (PowerLine Communication). Η τεχνολογία αυτή με τη χρήση του πανταχού παρόντος ηλεκτρικού δικτύου προσφέρει ακόμα και σε απομακρυσμένους χρήστες πληθώρα ευρυζωνικών υπηρεσιών και πρόσβαση στο διαδίκτυο, αποτελώντας μια ανταγωνιστική επιλογή τρόπου επικοινωνίας. Για την κατανόηση της PLC τεχνολογίας αρχικά κρίνουμε απαραίτητη την λεπτομερή περιγραφή της δομής του ηλεκτρικού δικτύου, του εξοπλισμού που απαιτείται για την εφαρμογή της και των αρχιτεκτονικών της. Στη συνέχεια γίνεται αναφορά στα προβλήματα που παρουσιάζονται και χρήζουν αντιμετώπισης. Επιπρόσθετα, γίνεται σύντομη παρουσίαση των εναλλακτικών υπηρεσιών και σύγκριση των PLC με αυτές. Η μετάδοση μέσω ηλεκτροφόρων καλωδίων προσφέρει ένα μεγάλο εύρος ζώνης, παρέχοντας μία γκάμα πολυάριθμων υπηρεσιών, όπως το έξυπνο σπίτι ή το AMR (Automatic Meter Reading) για τη διευκόλυνση τόσο των οικιακών χρηστών όσο και των επιχειρησιακών. Η χρήση των γραμμών ηλεκτρικής ενέργειας ως τηλεπικοινωνιακό κανάλι απαιτεί την εφαρμογή των κατάλληλων τεχνικών πρόσβασης. Οι πιο διαδεδομένες τεχνικές είναι οι FDMA (Frequency Division Multiple Access), TDMA (Time Division Multiple Access) και CDMA (Code Division Multiple Access) . Η παρούσα διπλωματική επικεντρώθηκε στην TDMA και την FDMA με διαμόρφωση σήματος OFDM (Orthogonal Frequency Division Multiplexing) η οποία ονομάζεται OFDMA (Orthogonal Frequency Division Multiple Access). Πραγματοποιήθηκαν εξομοιώσεις σε Matlab διάφορων αλγορίθμων αναλογικής δικαιοσύνης με τεχνική OFDMA και ταυτόχρονη εξομοίωση της TDMA. Στόχος είναι να συγκρίνουμε τους αλγόριθμους αυτούς ως προς το συνολικό ρυθμό μετάδοσης και τη δικαιοσύνη κατανομής των πόρων στους χρήστες. Από τη σύγκριση αυτή προκύπτει ότι η τεχνική TDMA αποδίδει λιγότερο, ενώ από τους υπόλοιπους αλγόριθμους τα καλύτερα αποτελέσματα επιφέρει ο αλγόριθμος των Bill et al., με ισορροπία του συνολικού ρυθμού μετάδοσης και της επιθυμητής δικαιοσύνης. / Main goal of this diploma thesis is the description of the up and coming PLC (PowerLine Communication) technology. This technology offers access to the web and to several broadband services to even distant and isolated users, by exploiting the power line grid, widely spread to nearly all surface land sites, consisting this way a competitive communication alternative. For a better comprehension of the PLC technology, this work starts with a detailed description of the power line grid, the several PLC technology architectures and the necessary equipment for their application. Following this work, there is a reference to any possible problems that need to be overcome and a short comparative presentation of the PLC technology versus other alternatives to it. The data transmission over electricity lines offers a wide bandwidth and thus it may support a variety of applications, as the smart home and AMR (Automatic Meter Reading) for the proper service of either domestic or industrial users. The use of electricity power lines as a communication channel necessitates the application of multiple access Strategies as FDMA (Frequency Division Multiple Access), TDMA (Time Division Multiple Access) and CDMA (Code Division Multiple Access), which are currently the most popular. This thesis is focused on TDMA and FDMA with OFDM signal modulation. This technique is called OFDMA (Orthogonal Frequency Division Multiple Access). Several proportional rate constraints algorithms were simulated in Matlab applying both OFDMA and TDMA strategies in order to compare these algorithms in terms of the maximized total throughput and the fair allocation of resources to the end users (fairness). From this comparison it comes up that TDMA technique is less efficient, whereas from the other algorithms the most efficient is the one of Bill et al., that offers a good balance between total throughput and fairness.
|
10 |
Codes et tableaux de permutations, construction, énumération et automorphismes / Permutation codes and permutations arrays: construction, enumeration and automorphismsBogaerts, Mathieu 22 June 2009 (has links)
<p>Un code de permutations G(n,d) un sous-ensemble C de Sym(n) tel que la distance de Hamming D entre deux éléments de C est supérieure ou égale à d. Dans cette thèse, le groupe des isométries de (Sym(n),D) est déterminé et il est prouvé que ces isométries sont des automorphismes du schéma d'association induit sur Sym(n) par ses classes de conjugaison. Ceci mène, par programmation linéaire, à de nouveaux majorants de la taille maximale des G(n,d) pour n et d fixés et n compris entre 11 et 13. Des algorithmes de génération avec rejet d'objets isomorphes sont développés. Pour classer les G(n,d) non isométriques, des invariants ont été construits et leur efficacité étudiée. Tous les G(4,3) et les G(5,4) ont été engendrés à une isométrie près, il y en a respectivement 61 et 9445 (dont 139 sont maximaux et décrits explicitement). D’autres classes de G(n,d) sont étudiées.<p><p><p><p> <p><p><p><p>A permutation code G(n,d) is a subset C of Sym(n) such that the Hamming distance D between two elements of C is larger than or equal to d. In this thesis, we characterize the isometry group of the metric space (Sym(n),D) and we prove that these isometries are automorphisms of the association scheme induced on Sym(n) by the conjugacy classes. This leads, by linear programming, to new upper bounds for the maximal size of G(n,d) codes for n and d fixed and n between 11 and 13. We develop generating algorithms with rejection of isomorphic objects. In order to classify the G(n,d) codes up to isometry, we construct invariants and study their efficiency. We generate all G(4,3) and G(4,5)codes up to isometry; there are respectively 61 and 9445 of them. Precisely 139 out of the latter codes are maximal and explicitly described. We also study other classes of G(n,d)codes.<p><p><p><p> / Doctorat en sciences, Spécialisation mathématiques / info:eu-repo/semantics/nonPublished
|
Page generated in 0.1419 seconds