• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 42
  • 10
  • 8
  • 3
  • 3
  • 2
  • 1
  • Tagged with
  • 80
  • 80
  • 27
  • 22
  • 21
  • 19
  • 18
  • 17
  • 15
  • 15
  • 14
  • 13
  • 12
  • 11
  • 10
  • 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.
41

Sequential Detection of Misbehaving Relay in Cooperative Networks

Yi, Young-Ming 02 September 2012 (has links)
To combat channel fading, cooperative communication achieves spatial diversity for the transmission between source and destination through the help of relay. However, if the relay behaves abnormally or maliciously and the destination is not aware, the diversity gain of the cooperative system will be significantly reduced, which degrades system performance. In our thesis, we consider an one-relay decode and forward cooperative network, and we assume that the relay may misbehave with a certain probability. If the relay is malicious, it will garble transmission signal, resulting in severe damage to cooperative system. In this work, we discuss three kinds of malicious behavior detection. More specifically, we adopt sequential detection to detect the behavior of relay. If tracing symbols are inserted among the source message, the destination detects malicious after extracting the received tracing symbols. We adopt log-likelihood ratio test to examine these tracing symbols, and then determine the behavior of relay. If the source does not transmit tracing symbols, the destination detects misbehavior according to the received data signal. Furthermore, we employ sequential detection to reduce detection time for a given probabilities of false alarm and miss detection. Through simulation results, for a certain target on probability of errors, our proposed methods can effectively reduce numbers of observations. On the other works, the destination can effectively detect misbehavior of relay, and eliminating the damage causes by malicious relay without requiring large numbers of observations.
42

Resource Allocation for MIMO Relay and Scalable H.264/AVC Video Transmission over Cooperative Communication Networks

Wu, Yi-Sian 10 September 2012 (has links)
This thesis proposes resource allocation algorithms for multi-input multi-output (MIMO) relay and Scalable H.264/AVC video transmission over cooperative communication networks. For MIMO relay, we explore the reception diversity with maximal ratio combining (MRC) and transmission diversity with space-time block codes (STBC) respectively. Then, a condition is proposed to maximize the overall output signal-to-noise ratio (SNR). In this condition, the ineffective relays will be excluded in sequence from the cooperation. Simulation results indicate that the effect of bit error rate (BER) through the relay selection is similar to the scheme which applies all relays, but the amounts of used relay decreased. For Scalable H.264/AVC video, by introducing frame significance analysis, the video quality dependency between coding frame and its references is investigated for temporal layers and quality layers. The proposed algorithm allocates the relay and sub-band to each layer based on channel conditions and the priority of classified video packets. Experimental results indicate that the proposed algorithm is superior to the temporal-based allocation and quality-based allocation cooperative schemes.
43

Low-delay sensing and transmission in wireless sensor networks

Karlsson, Johannes Unknown Date (has links)
<p>With the increasing popularity and relevance of ad-hoc wireless sensor networks, cooperative transmission is more relevant than ever. In this thesis, we consider methods for optimization of cooperative transmission schemes in wireless sensor networks. We are in particular interested in communication schemes that can be used in applications that are critical to low-delays, such as networked control, and propose suitable candidates of joint source-channel coding schemes. We show that, in many cases, there are significant gains if the parts of the system are jointly optimized for the current source and channel. We especially focus on two means of cooperative transmission, namely distributed source coding and relaying.</p><p>In the distributed source coding case, we consider transmission of correlated continuous sources and propose an algorithm for designing simple and energy-efficient sensor nodes. In particular the cases of the binary symmetric channel as well as the additive white Gaussian noise channel are studied. The system works on a sample by sample basis yielding a very low encoding complexity, at an insignificant delay. Due to the source correlation, the resulting quantizers use the same indices for several separated intervals in order to reduce the quantization distortion.</p><p>For the case of relaying, we study the transmission of a continuous Gaussian source and the transmission of an uniformly distributed discrete source. In both situations, we propose design algorithms to design low-delay source-channel and relay mappings. We show that there can be significant power savings if the optimized systems are used instead of more traditional systems. By studying the structure of the optimized source-channel and relay mappings, we provide useful insights on how the optimized systems work. Interestingly, the design algorithm generally produces relay mappings with a structure that resembles Wyner-Ziv compression.</p>
44

Analysis of OSTBC in Cooperative Cognitive Radio Networks using 2-hop DF Relaying Protocol

Tahseen, Muhammad Mustafa, Khan, MatiUllah, Ullah, Farhan January 2011 (has links)
To achieve cooperative diversity in cognitive radio network, Decode and Forward (DF) protocol is implemented at Cognitive Radios (CRs) using Orthogonal Space Time Block Coding (OSTBC). The 2-hop communication between source and destination is completed with the help of Cognitive Relays (CRs) using Multiple Input Multiple Output (MIMO) technology within the network. To achieve spatial diversity and good code rate Alamouti 2×2 STBC is used for transmission. CR is using the decoding (Decode and Forward (DF)) strategy and without amplifying ability before forwarding data towards destination provide better performance. The main objective of this thesis is to detect Primary User (PU) spectrum availability or non-availability for the use of Secondary Users (SU). The Alamouti STBC encoded data is broadcasted to wireless Rayleigh faded channel through transmitter having two transmitting antennas. The CRs are preferred to place close with PU to detect transmitted signal and because of having decoding capability CRs decode the collected data using Maximum Likelihood (ML) decoding technique then re-encode the decoded data for further transmission towards receiver. The energy of PU signal received at relays is calculated using energy detector used at cognitive controller having authority to make final decision about presence or absence of PU signal within the spectrum by comparing calculated energy of PU received signal with a predefined value. If the calculated signal energy is less than threshold value it is pretended as the absence of PU and in the other case spectrum is assumed as occupied by PU. Decoding PU signal at relays before forwarding towards destination provide better performance in terms of detection probability and decreasing probability of false alarming as the Signal to Noise (SNR) increases. The proposed cooperative spectrum sensing using DF protocol at cognitive relays with Alamouti STBC is implemented and results are validated by MATLAB simulation. / +46 455 38 50 00
45

Applying OSTBC in Cooperative Cognitive Radio Networks

Shahzad, Hamid, Botchu, Jaishankar January 2010 (has links)
In this report, we introduce cooperative spectrum sensing using orthogonal space time block coding (OSTBC) in order to achieve cooperative diversity in the cognitive radios (CRs) network. Transmit diversity or gain is achieved by introducing more than one antenna on the transmitter and receiver side, but in small electronic mobile devices it looks impractical. The signals received from the primary users (PUs) are amplified by the cognitive relays and further forwarded to the cognitive controller where decisions are made on the basis of the information collected from each cognitive relay. The cooperative relaying protocol used here in cognitive relays is based on an amplifying-forward (AF) scheme. Alamouti scheme in OSTBC has been proposed to achieve better detection performance in CR network. The energy detector performance is analyzed over an independent Rayleigh fading channel. In CR network the secondary user (SU) shares PU&apos;s frequency band if it fi nds PU is not in its vicinity. The SU starts using the licensed band and leaves the band as soon as it finds the PU is present or going to use the same band. The detection of the spectrum holes by CRs has to be more agile and intelligent. The main objective of the CRs network is to use the free holes without causing any interference to the PUs. The energy detection technique is simple and outperforms other sensing techniques in cooperative cognitive radio networks. The energy detector collects information from different users, compares it with a certain prede fined threshold () value and then makes a fi nal decision. Detection and false alarm probabilities are derived and manipulated using OSTBC on PU and SU through AF protocol in cooperative communication. The performance of the system is analyzed with single and multiple relays and with and without direct path between the PUs and SUs. Maximum ratio (MRC) and selection combining (SC) schemes are used in energy detector and the results are compared with and without direct link between PU and SU. The analysis is performed by placing the relay close to the PUs. Our results are processed and validated by computer simulation.
46

On Asynchronous Communication Systems: Capacity Bounds and Relaying Schemes

January 2013 (has links)
abstract: Practical communication systems are subject to errors due to imperfect time alignment among the communicating nodes. Timing errors can occur in different forms depending on the underlying communication scenario. This doctoral study considers two different classes of asynchronous systems; point-to-point (P2P) communication systems with synchronization errors, and asynchronous cooperative systems. In particular, the focus is on an information theoretic analysis for P2P systems with synchronization errors and developing new signaling solutions for several asynchronous cooperative communication systems. The first part of the dissertation presents several bounds on the capacity of the P2P systems with synchronization errors. First, binary insertion and deletion channels are considered where lower bounds on the mutual information between the input and output sequences are computed for independent uniformly distributed (i.u.d.) inputs. Then, a channel suffering from both synchronization errors and additive noise is considered as a serial concatenation of a synchronization error-only channel and an additive noise channel. It is proved that the capacity of the original channel is lower bounded in terms of the synchronization error-only channel capacity and the parameters of both channels. On a different front, to better characterize the deletion channel capacity, the capacity of three independent deletion channels with different deletion probabilities are related through an inequality resulting in the tightest upper bound on the deletion channel capacity for deletion probabilities larger than 0.65. Furthermore, the first non-trivial upper bound on the 2K-ary input deletion channel capacity is provided by relating the 2K-ary input deletion channel capacity with the binary deletion channel capacity through an inequality. The second part of the dissertation develops two new relaying schemes to alleviate asynchronism issues in cooperative communications. The first one is a single carrier (SC)-based scheme providing a spectrally efficient Alamouti code structure at the receiver under flat fading channel conditions by reducing the overhead needed to overcome the asynchronism and obtain spatial diversity. The second one is an orthogonal frequency division multiplexing (OFDM)-based approach useful for asynchronous cooperative systems experiencing excessive relative delays among the relays under frequency-selective channel conditions to achieve a delay diversity structure at the receiver and extract spatial diversity. / Dissertation/Thesis / Ph.D. Electrical Engineering 2013
47

Cross-layer optimization of cooperative and coordinative schemes for next generation cellular networks / Optimisation inter-couches de schémas de coordination et de coopération pour les futurs réseaux cellulaires

Khreis, Alaa 06 November 2018 (has links)
Les demandes de haut débit, faible latence et grande fiabilité augmentent dans les nouvelles générations de systèmes de radiocommunications. Par conséquent, on propose de combiner la transmission non orthogonale avec les retransmissions HARQ afin de combattre les fluctuations de canal de transmission à haut débit. Dans la première partie de la thèse, on propose des protocoles de retransmissions HARQ avec l'aide d'un relai afin d'améliorer le débit et la fiabilité du système. Une version renforcée du protocole HARQ qui prend en compte le délai de retour est proposée dans la seconde partie de la thèse. / HARQ has become an important research field in the wireless digital communications area during the last years. In this thesis, we improve the HARQ mechanisms in terms of throughput and/or latency which are the bottleneck of next generation wireless communication systems. More precisely, we improve the time-slotted HARQ systems by mimicking NOMA, which means using superposed packets in a single-user context. In the first part of the thesis, we propose HARQ protocols using the help of a relay to improve the transmission rate and reliability. An enhanced HARQ protocol adapted to delayed feedback is proposed in the second part. In this new multi-layer HARQ protocol, additional redundant packets are sent preemptively before receiving the acknowledgement, and in superposition to other HARQ processes.
48

Experimental Study of Cooperative Communication using Software Defined Radios

Marunganti, Murali Krishna January 2010 (has links)
No description available.
49

Low-delay sensing and transmission in wireless sensor networks

Karlsson, Johannes January 2008 (has links)
With the increasing popularity and relevance of ad-hoc wireless sensor networks, cooperative transmission is more relevant than ever. In this thesis, we consider methods for optimization of cooperative transmission schemes in wireless sensor networks. We are in particular interested in communication schemes that can be used in applications that are critical to low-delays, such as networked control, and propose suitable candidates of joint source-channel coding schemes. We show that, in many cases, there are significant gains if the parts of the system are jointly optimized for the current source and channel. We especially focus on two means of cooperative transmission, namely distributed source coding and relaying. In the distributed source coding case, we consider transmission of correlated continuous sources and propose an algorithm for designing simple and energy-efficient sensor nodes. In particular the cases of the binary symmetric channel as well as the additive white Gaussian noise channel are studied. The system works on a sample by sample basis yielding a very low encoding complexity, at an insignificant delay. Due to the source correlation, the resulting quantizers use the same indices for several separated intervals in order to reduce the quantization distortion. For the case of relaying, we study the transmission of a continuous Gaussian source and the transmission of an uniformly distributed discrete source. In both situations, we propose design algorithms to design low-delay source-channel and relay mappings. We show that there can be significant power savings if the optimized systems are used instead of more traditional systems. By studying the structure of the optimized source-channel and relay mappings, we provide useful insights on how the optimized systems work. Interestingly, the design algorithm generally produces relay mappings with a structure that resembles Wyner-Ziv compression.
50

Spectrum Sensing Techniques for 2-hop Cooperative Cognitive Radio Networks : Comparative Analysis

Rehman, Atti Ur, Asif, Muhammad January 2012 (has links)
Spectrum sensing is an important aspect of cognitive radio systems. In order to efficiently utilize the spectrum, the role of spectrum sensing is essential in cognitive radio networks. The transmitter detection based techniques: energy detection, cyclostationary feature detection, and matched filter detection, is most commonly used for the spectrum sensing. The Energy detection technique is implemented in the 2-hop cooperative cognitive radio network in which Orthogonal Space Time Block Coding (OSTBC) is applied with the Decode and Forward (DF) protocol at the cognitive relays. The Energy detection technique is simplest and gives good results at the higher Signal to Noise Ratio (SNR) values. However, at the low SNR values its performance degrades. Moreover, each transmitter detection technique has a SNR threshold, below which it fails to work robustly. This thesis aims to find the most reliable and accurate spectrum sensing technique in the 2-hop cooperative cognitive radio network. Using Matlab simulations, a comparative analysis of three transmitter detection techniques has been made in terms of higher probability of detection. In order to remove the shortcomings faced by all the three techniques, the Fuzzy-combined logic sensing approach is also implemented and compared with transmitter detection techniques. / Atti Ur Rehman (atti.rehmman@gmail.com) ph: +358-440458080

Page generated in 0.1594 seconds