• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 10
  • 5
  • 2
  • 1
  • Tagged with
  • 18
  • 18
  • 18
  • 18
  • 8
  • 8
  • 6
  • 6
  • 6
  • 6
  • 5
  • 4
  • 3
  • 3
  • 3
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

Timing Synchronization at the Relay Node in Physical Layer Network Coding

Basireddy, Ashish 2012 May 1900 (has links)
In recent times, there has been an increased focus on the problem of information exchange between two nodes using a relay node. The introduction of physical layer network coding has improved the throughput efficiency of such an exchange. In practice, the reliability of information exchange using this scheme is reduced due to synchronization issues at the relay node. In this thesis, we deal with timing synchronization of the signals received at the relay node. The timing offsets of the signals received at the relay node are computed based on the propagation delays in the transmitted signals. However, due to the random attenuation of signals in a fading channel, the near far problem is inherent in this situation. Hence, we aim to design near far resistant delay estimators for this system. We put forth four algorithms in this regard. In all the algorithms, propagation delay of each signal is estimated using a known preamble sent by the respective node at the beginning of the data packet. In the first algorithm, we carefully construct the preamble of each data packet and apply the MUSIC algorithm to overcome the near far problem. The eigenstructure of the correlation matrix is exploited to estimate propagation delay. Secondly, the idea of interference cancellation is implemented to remove the near far problem and delay is estimated using a correlator. Thirdly, a modified decorrelating technique is presented to negate the near far problem. Using this technique we aim to obtain an estimate of the weak user's delay that is more robust to errors in the strong user's delay estimate. In the last algorithm, pilot signals with desired autocorrelation and cross correlation functions are designed and a sliding correlator is used to estimate delay. Even though this approach is not near far resistant, performance results demonstrate that for the length's of preamble considered, this algorithm performs similar to the other algorithms.
2

Physical-Layer Network Coding for MIMO Systems

Xu, Ning 05 1900 (has links)
The future wireless communication systems are required to meet the growing demands of reliability, bandwidth capacity, and mobility. However, as corruptions such as fading effects, thermal noise, are present in the channel, the occurrence of errors is unavoidable. Motivated by this, the work in this dissertation attempts to improve the system performance by way of exploiting schemes which statistically reduce the error rate, and in turn boost the system throughput. The network can be studied using a simplified model, the two-way relay channel, where two parties exchange messages via the assistance of a relay in between. In such scenarios, this dissertation performs theoretical analysis of the system, and derives closed-form and upper bound expressions of the error probability. These theoretical measurements are potentially helpful references for the practical system design. Additionally, several novel transmission methods including block relaying, permutation modulations for the physical-layer network coding, are proposed and discussed. Numerical simulation results are presented to support the validity of the conclusions.
3

Apport de la gestion des interférences aux réseaux sans-fil multi-sauts. Le cas du Physical-Layer Network Coding / Interference management in multi-hop wireless networks

Naves, Raphaël 19 November 2018 (has links)
Fréquemment exploités pour venir en complément aux réseaux mobiles traditionnels, les réseaux sans-fil multi-sauts, aussi appelés réseaux ad-hoc, sont particulièrement mis à profit dans le domaine des communications d'urgence du fait de leur capacité à s'affranchir de toute infrastructure. Néanmoins, la capacité de ces réseaux étant limitée dès lors que le nombre d'utilisateurs augmente, la communauté scientifique s'efforce à en redéfinir les contours afin d'étendre leur utilisation aux communications civiles. La gestion des interférences, considérée comme l'un des principaux défis à relever pour augmenter les débits atteignables dans les réseaux sans-fil multi-sauts, a notamment connu un changement de paradigme au cours des dernières années. Alors qu'historiquement cette gestion est régie par les protocoles de la couche d'accès dont l'objectif consiste à éviter les interférences entre utilisateurs, il est désormais possible, grâce à différentes techniques avancées de communication numérique, de traiter ces interférences, et même de les exploiter. Ces techniques de transmission, dites techniques de gestion des interférences, viennent alors concurrencer les mécanismes d'ordonnancement traditionnels en autorisant plusieurs transmissions simultanées et dans la même bande de fréquence vers un même récepteur. Dans cette thèse, nous nous intéressons à l'une de ces techniques, le Physical-Layer Network Coding (PLNC), en vue de son intégration dans des réseaux ad-hoc composés de plusieurs dizaines de nœuds. Les premiers travaux se concentrant principalement sur des petites topologies, nous avons tout d'abord développé un framework permettant d'évaluer les gains en débit à large échelle du PLNC par rapport à des transmissions traditionnelles sans interférence. Motivés par les résultats obtenus, nous avons ensuite défini un nouveau cadre d'utilisation à cette technique visant à élargir sa sphère d'application. Le schéma de PLNC proposé, testé à la fois sur de vrais équipements radio et par simulation, s'est alors révélé offrir des gains significatifs en débit et en fiabilité en comparaison aux solutions existantes. / Frequently used to complement the traditional mobile networks, multi-hop wireless networks, also referred to as ad-hoc networks, are particularly useful in emergency situations due to the fact that they do not rely on any infrastructure. Nevertheless, as the capacity of such networks does not scale with the number of users, the scientific community has strived to rethink their use in order to extend their application to civil communications. For instance, long considered as one of the most formidable challenges in multi-hop wireless networks, interference management has recently undergone a paradigm shift. While interference management is traditionally carried out by the access layer protocols whose objective is to avoid interference between users, it is now possible to exploit the interference thanks to new advanced communication techniques. These transmission techniques, so-called interference management techniques, go against the communication paradigm underlying existing scheduling mechanisms by allowing multiple simultaneous transmissions to a common receiver in the same frequency band. In this thesis, we focus on one of these techniques, namely the Physical-Layer Network (PLNC), with the objective of integrating it in ad-hoc networks. Mostly studied from both the theoretical and practical perspective in small topologies, we first design a framework for quantifying the large-scale PLNC gains over the traditional interference-free transmissions. Driven by the obtained results, we introduce a solution to increase the PLNC sphere of operation in large multi-hop wireless networks. Our comprehensive evaluation methodology, including experimental testbed validations for credibility, as well as realistic simulations, show that the proposed PLNC scheme brings important gains in terms of throughput and reliability when compared to state-of-the-art approaches.
4

Frequency Rendezvous and Physical Layer Network Coding for Distributed Wireless Networks

Pu, Di 22 October 2009 (has links)
"In this thesis, a transmission frequency rendezvous approach for secondary users deployed in decentralized dynamic spectrum access networks is proposed. Frequency rendezvous is a critical step in bootstrapping a wireless network that does not possess centralized control. Current techniques for enabling frequency rendezvous in decentralized dynamic spectrum access networks either require pre-existing infrastructure or use one of several simplifying assumptions regarding the architecture, such as the use of regularly spaced frequency channels for communications. Our proposed approach is designed to be operated in a strictly decentralized wireless networking environment, where no centralized control is present and the spectrum does not possess pre-defined channels. In our proposed rendezvous algorithm, the most important step is pilot tone detection and receiver query. In order to realize a shortest search time for the target receiver, an efficient scanning rule should be employed. In this thesis, three scanning rules are proposed and evaluated, namely: frequency sequence scanning, pilot tone strength scanning, and cluster scanning. To validate our result, we test our scanning rules with actual paging band spectrum measurements. Previous research on security of network coding focuses on the protection of data dissemination procedures and the detection of malicious activities such as pollusion attacks. The capabilities of network coding to detect other attacks has not been fully explored. In this thesis, a new mechanism based on physical layer network coding to detect wormhole attacks is proposed. When two signal sequences collide at the receiver, the difference between the two received sequences is determined by its distances to the senders. Therefore, by comparing the differences between the received sequences at two nodes, we can estimate the distance between them and detect those fake neighbor connections through wormholes. While the basic idea is clear, we design many schemes at both physical and network layers to turn the idea into a practical approach. Simulations using BPSK modulation at the physical layer show that the wireless nodes can effectively detect fake neighbor connections without the adoption of any special hardware on them."
5

Apport de la gestion des interférences aux réseaux sans-fil multi-sauts. Le cas du Physical-Layer Network Coding

Naves, Raphaël 19 November 2018 (has links) (PDF)
Fréquemment exploités pour venir en complément aux réseaux mobiles traditionnels, les réseaux sans-fil multi-sauts, aussi appelés réseaux ad-hoc, sont particulièrement mis à profit dans le domaine des communications d'urgence du fait de leur capacité à s'affranchir de toute infrastructure. Néanmoins, la capacité de ces réseaux étant limitée dès lors que le nombre d'utilisateurs augmente, la communauté scientifique s'efforce à en redéfinir les contours afin d'étendre leur utilisation aux communications civiles. La gestion des interférences, considérée comme l'un des principaux défis à relever pour augmenter les débits atteignables dans les réseaux sans-fil multi-sauts, a notamment connu un changement de paradigme au cours des dernières années. Alors qu'historiquement cette gestion est régie par les protocoles de la couche d'accès dont l'objectif consiste à éviter les interférences entre utilisateurs, il est désormais possible, grâce à différentes techniques avancées de communication numérique, de traiter ces interférences, et même de les exploiter. Ces techniques de transmission, dites techniques de gestion des interférences, viennent alors concurrencer les mécanismes d'ordonnancement traditionnels en autorisant plusieurs transmissions simultanées et dans la même bande de fréquence vers un même récepteur. Dans cette thèse, nous nous intéressons à l'une de ces techniques, le Physical-Layer Network Coding (PLNC), en vue de son intégration dans des réseaux ad-hoc composés de plusieurs dizaines de nœuds. Les premiers travaux se concentrant principalement sur des petites topologies, nous avons tout d'abord développé un framework permettant d'évaluer les gains en débit à large échelle du PLNC par rapport à des transmissions traditionnelles sans interférence. Motivés par les résultats obtenus, nous avons ensuite défini un nouveau cadre d'utilisation à cette technique visant à élargir sa sphère d'application. Le schéma de PLNC proposé, testé à la fois sur de vrais équipements radio et par simulation, s'est alors révélé offrir des gains significatifs en débit et en fiabilité en comparaison aux solutions existantes.
6

End-to-end network throughput enhancement through physical-layer network coding

Maeouf, Sofean Ahmed 15 March 2012 (has links)
Physical-Layer Network Coding (PNC) is a promising technique that has great potentials for improving the achievable data rates of end-to-end flows through higher packet transmission rates, thereby increasing the overall network throughput. In this thesis, we study the performance of the PNC transmission techniques for unidirectional end-to-end flows in multi-hop wireless networks, and compare it with that of the traditional transmission techniques. We first derive the bit-error rate (BER) that the PNC transmission technique achieves. Then, using the derived BER, we evaluate and quantify the achievable network throughput under both the PNC transmission technique and the traditional technique, where the network throughput is measured as the aggregate/sum of all end-to-end flows' achievable data rates in the wireless network. Using extensive simulations, we show that PNC increases the overall achievable end-to-end flow throughput in multi-hop wireless networks, especially under medium to high signal-to-noise ratios. / Graduation date: 2012
7

Parameter Estimation and Tracking in Physical Layer Network Coding

Jain, Manish 2011 May 1900 (has links)
Recently, there has been a growing interest in improving the performance of the wireless relay networks through the use of Physical Layer Network Coding (PLNC) techniques. The physical layer network coding technique allows two terminals to transmit simultaneously to a relay node and decode the modulo-2 sum of the transmitted bits at the relay. This technique considerably improves performance over Digital Network Coding technique. In this thesis, we will present an algorithm for joint decoding of the modulo-2 sum of bits transmitted from two unsynchronized transmitters at the relay. We shall also address the problems that arise when boundaries of the signals do not align with each other and when the channel parameters are slowly varying and are unknown to the receiver at the relay node. Our approach will first jointly estimate the timing o sets and fading gains of both signals using a known pilot sequence sent by both transmitters in the beginning of the packet and then perform Maximum Likelihood detection of data using a state-based Viterbi decoding scheme that takes into account the timing o sets between the interfering signals. We shall present an algorithm for simultaneously tracking the amplitude and phase of slowly varying wireless channel that will work in conjunction our Maximum Likelihood detection algorithm. Finally, we shall provide extension of our receiver to support antenna diversity. Our results show that the proposed detection algorithm works reasonably well, even with the assumption of timing misalignment. We also demonstrate that the performance of the algorithm is not degraded by amplitude and/or phase mismatch between the users. We further show that the performance of the channel tracking algorithm is close to the ideal case i.e. when the channel estimates are perfectly known. Finally, we demonstrate the performance boost provided by the receiver antenna diversity.
8

Coding Schemes for Physical Layer Network Coding Over a Two-Way Relay Channel

Hern, Brett Michael 16 December 2013 (has links)
We consider a two-way relay channel in which two transmitters want to exchange information through a central relay. The relay observes a superposition of the trans- mitted signals from which a function of the transmitted messages is computed for broadcast. We consider the design of codebooks which permit the recovery of a function at the relay and derive information-theoretic bounds on the rates for reliable decoding at the relay. In the spirit of compute-and-forward, we present a multilevel coding scheme that permits reliable computation (or, decoding) of a class of functions at the relay. The function to be decoded is chosen at the relay depending on the channel realization. We define such a class of reliably computable functions for the proposed coding scheme and derive rates that are universally achievable over a set of channel gains when this class of functions is used at the relay. We develop our framework with general modulation formats in mind, but numerical results are presented for the case where each node transmits using 4-ary and 8-ary modulation schemes. Numerical results demonstrate that the flexibility afforded by our proposed scheme permits substantially higher rates than those achievable by always using a fixed function or considering only linear functions over higher order fields. Our numerical results indicate that it is favorable to allow the relay to attempt both compute-and-forward and decode-and-forward decoding. Indeed, either method considered separately is suboptimal for computation over general channels. However, we obtain a converse result when the transmitters are restricted to using identical binary linear codebooks generated uniformly at random. We show that it is impossible for this code ensemble to achieve any rate higher than the maximum of the rates achieved using compute-and-forward and decode-and-forward decoding. Finally, we turn our attention to the design of low density parity check (LDPC) ensembles which can practically achieve these information rates with joint-compute- and-forward message passing decoding. To this end, we construct a class of two-way erasure multiple access channels for which we can exactly characterize the performance of joint-compute-and-forward message passing decoding. We derive the processing rules and a density evolution like analysis for several classes of LDPC ensembles. Utilizing the universally optimal performance of spatially coupled LDPC ensembles with message passing decoding, we show that a single encoder and de- coder with puncturing can achieve the optimal rate region for a range of channel parameters.
9

Efficient wireless transmission supporting internet of things

Ghasemiahmadi, Mohammad 19 December 2017 (has links)
The promise of Internet of Things (IoT) and mass connectivity has brought many applications and along with them many new challenges to be solved. Recognizing sensor networks as one of the main applications of IoT, this dissertation focuses on solutions for IoT challenges in both single-hop and multi-hop communications. In single-hop communications, the new IEEE 802.11ah and its Group Synchronized Distribution Coordination Function (GS-DCF) is studied. GS-DCF categorized nodes in multiple groups to solve the channel contention issue of dense networks. An RSS-Based grouping strategy is proposed for the hidden terminal problem that can arise in infrastructure-based single hop communications. For multi-hop communications, Physical Layer Network Coding (PNC) is studied as a robust solution for multi-hop packet exchange in linear networks. Focusing on practical and implementation issues of PNC systems, different challenges have been addressed and a Software Defined Radio (SDR) PNC system based on USRP devices is proposed and implemented. Finally, extensive simulation and experimental results are presented to evaluate the performance of the proposed algorithms in comparison with currently used methods. / Graduate
10

Cross-layer design for multi-hop two-way relay network

Zhang, Haoyuan 28 June 2017 (has links)
Physical layer network coding (PNC) was proposed under the two-way relay hannel (TWRC) scenario, where two sources exchange information aided by a relay. PNC allows the two sources to transmit to the relay simultaneously, where superimposed signals at the relay can be mapped to network-coded symbols and then be broadcast to both sources instead of being treated as interference. Concurrent transmissions using PNC achieve a higher spectrum efficiency compared to time division and network coding solutions. Existing research mainly focused on the symmetric PNC designs, where the same channel coding and modulation configurations are applied by both sources. When the channel conditions of the two source-relay links are asymmetric or unequal amount of data are exchanged, heterogeneous modulation PNC designs are necessary. In additional, the design and optimization of multi-hop PNC, where multiple relays forming a multi-hop path between the two sources, remains an open issue. The above issues motivate the study of this dissertation. This dissertation investigates the design of heterogeneous modulation physical layer network coding (HePNC), the integration of channel error control coding into HePNC, the combination of HePNC with hierarchical modulation, and the design and generalization of multi-hop PNC. The contributions of this dissertation are four-fold. First, under the asymmetric TWRC scenario, where the channel conditions of the two source-relay links are asymmetric, we designed a HePNC protocol, including the optimization of the adaptive mapping functions and the bit-symbol labeling, to minimize the end-to-end BER. In addition, we developed an analytical framework to derive the BER of HePNC. HePNC can substantially enhance the throughput compared to the existing symmetric PNC under the asymmetric TWRC scenario. Second, we investigated channel coded HePNC and integrated the channel error control coding into HePNC in a link-to-link coding, where the relay tries to decode the superimposed codewords in the multi-access stage. A full-state sum-product decoding algorithm is proposed at the relay based on the repeat-accumulate codes to guarantee reliable end-to-end communication. Third, we proposed hierarchical modulation PNC (H-PNC) under asymmetric TWRC, where additional data exchange between the relay and the source with the relatively better channel condition is achieved in addition to that between the two end sources, benefiting from superimposing the additional data flow on the PNC transmission. When the relay also has the data exchange requirement with the source with a better source-relay channel, H-PNC outperforms HePNC and PNC in terms of the system sum throughput. Fourth, we designed and generalized multi-hop PNC, where multiple relays located in a linear topology are scheduled to support the data exchange between two end sources. The impact of error propagation and mutual interference among the nodes are addressed and optimized. The proposed designs outperform the existing ones in terms of end-to-end BER and end-to-end throughout. / Graduate

Page generated in 0.087 seconds