• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 25
  • 7
  • 2
  • 2
  • 2
  • 1
  • Tagged with
  • 41
  • 41
  • 21
  • 20
  • 19
  • 13
  • 12
  • 12
  • 11
  • 11
  • 10
  • 9
  • 8
  • 7
  • 7
  • 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.
11

Outage Probability Analysis of CooperativeCognitive Radio Networks Over κ − μ Shadowed Fading Channels

Poreddy, Mahathi January 2016 (has links)
Over time, wireless technology advancements in the field of communications have been attracting every individual to turn into a wireless user. To accommodate the increasing number of users and to avoid the problem of spectrum scarcity, the concept of Cognitive Radio Network (CRN) has been developed. Cognitive Radio (CR) is an intelligent radio which efficiently detects and allocates the spectrums of primary licensed users (PUs) to the secondary unlicensed users (SUs). The SUs can utilize these spectrums as long as they do not cause harmful interfere to the PUs. Interference may occur because of the following reasons: misdetection of spectrum availability, the high transmission power of SU when both SU and PU are present in the same channel at the same time. In order to avoid interference, the radio has to have a very accurate spectrum sensing method, transmit power at SU should be constrained by the peak interference power of PU and the CR should continuously sense the presence of PUs. To increase the wireless coverage area and reliability of CRN, a new technology called Cooperative Cognitive Radio Network (CCRN), which is a combination of CRN and cooperative communications was developed. A CCRN not only increases the reliability and wireless coverage area of CR but also improves the overall performance of the system. In this context, the main objective of this research work is to evaluate the outage performance of a CCRN in an environment where fading and shadowing also come into the picture and to study the importance of relay networks in CRN. To fulfill the objectives of this research work, a two-hop decode-and-forward CCRN is considered. The recently introduced κ − µ shadowed fading channel is employed over the CCRN to generate a realistic environment.  In order to implement such system as a whole, a deep literature study is performed beforehand. Analytical expressions for the Probability Density Function (PDF) and Cumulative Distribution Function (CDF) of the Signal-to-Noise Ratio (SNR) are obtained. The analytical expressions and simulation results for Outage Probability (OP) are obtained and compared under different fading parameters. The importance of a multiple-relay system in CRN is presented. From the results obtained in this research work, we can conclude that the OP decreases with increase in allowable peak interference power at the PU. The transmit power at SU should always be constrained by the peak interference power at the PU to avoid interference. The overall system performance increases with increasing number of relays.
12

Energy Efficient and Performance Analysis of Multihop Wireless Communication Over Nakagami-m Fading Channel

Randrianantenaina, Itsikiantsoa 06 1900 (has links)
The concept of multihop communications (where the source communicates with the destination via many intermediate nodes) has been revisited and adapted to mitigate wireless channel impairments and ensure broader coverage. It has been shown in the literature that, in addition to extending coverage, overcoming shadowing and reducing the transmit power, multihop communications can increase the capacity of the network at a low additional cost. On the other hand, the problem of energy efficiency is one of the current biggest challenges towards green radio communications. Morevover, electromagnetic radiation is at its limit in many contexts, while for battery-powered devices, transmit and circuit energy consumption has to be minimized for better battery lifetime and performance. In this work, the performance of multihop communication over Nakagami-m fading is investigated for both cases without and with diversity combining. Closed form expressions of the average ergodic capacity are derived for each of these cases. Then, an expression of the outage probability is obtained using the inverse of Laplace transform and the average bit error rate is bounded using the Moment-Generating-Function approach. The energy efficiency is analyzed using the "consumption factor" as a metric, and it is derived in closed-form. And based on the obtained expressions, we propose a power allocation strategy maximizing this consumption factor.
13

Rate adaptive transmission in cooperative networks

Kalansuriya, Prasanna 11 1900 (has links)
Cooperative wireless communication uses relays to enhance the capacity and reliability of data transmission. Adaptive transmission is typically used in conventional non-cooperative communications to exploit the time-varying nature of the wireless channel. In this thesis, we combine these two techniques. We consider decode-and-forward (DF) and amplify-and-forward (AF) relays. The wireless environment is modeled by using the Nakagami-m distribution. The achievable channel capacity with rate adaptive transmission is analytically derived for DF and AF cooperative networks. The performance of a DF cooperative network is analyzed with a constant power rate adaptive scheme consisting of a discrete set of transmission modes. The effect of decoding errors on DF cooperative networks is also analyzed. To this end, a new heuristic approximation of the total received signal-to-noise ratio at the destination is developed. This approximation enables simple yet accurate performance analysis. / Communications
14

Investigation on Maximal Network Lifetime Using Optimal Power Allocation and Relay Selection Scheme in Multi-hop Wireless Networks

Liong, Jian-Wah 07 September 2011 (has links)
In the wireless sensor network environment (WSN), the system transmits signals often need to rely on the stability and reliability of the relay node of each path of cooperation with each other to achieve balance between leisure and stability. In general, relay adopted Amplify-and-Forward (AF) and Decode-and-Forward (DF) to relaying the signal to destination. Unfortunately, in reality, the relay node itself had a problem of limited energy supplies, would make the overall performance degrade before reaching the optimal performance. Therefore, we propose two novel relay selection schemes and through the multi-hop transmission with cooperation. We also derived the optimal power allocation algorithms for all relay nodes. Finally, simulation results show that our proposed scheme obtained the better lifetime and performance where compared with the traditional schemes in a fair environment.
15

Relaying Protocols for Wireless Networks

Nasiri Khormuji, Majid January 2008 (has links)
<p>Motivated by current applications in multihop transmission and ad hoc networks, the classical three-node relay channel consisting of a source-destination pair and a relay has received significant attention. One of the crucial aspects of the relay channel is the design of proper relaying protocols, i.e., how the relay should take part into transmission. The thesis addresses this problem and provides a partial answer to that.</p><p>In this thesis, we propose and study two novel relaying protocols. The first one is based on constellation rearrangement (CR) and is suitable for higher-order modulation schemes. With CR, the relay uses a bit-symbol mapping that is different from the one used by the source. We find the optimal bit-symbol mappings for both the source and the relay and the associated optimal detectors, and show that the improvement over conventional relaying with Gray mapping at the source and the relay can amount to a power gain of several dB. This performance improvement comes at no additional power or bandwidth expense, and at virtually no increase in complexity. The second one is a half-duplex decode-and-forward (DF) relaying scheme based on partial repetition (PR) coding at the relay. With PR, if the relay decodes the received message successfully, it re-encodes the message using the same channel code as the one used at the source, but retransmits only a fraction of the codeword. We analyze the proposed scheme and optimize the cooperation level (i.e., the fraction of the message that the relay should transmit). We compare our scheme with conventional repetition in which the relay retransmits the entire decoded message, and with parallel coding, and additionally with dynamic DF. The finite SNR analysis reveals that the proposed partial repetition can provide a gain of several dB over conventional repetition. Surprisingly, the proposed scheme is able to achieve the same performance as that of parallel coding for some relay network configurations, but at a much lower complexity.</p><p>Additionally, the thesis treats the problem of resource allocation for collaborative transmit diversity using DF protocols with different type of CSI feedback at the source. One interesting observation that emerges is that the joint powerbandwidth allocation only provides marginal gain over the relaying protocols with optimal bandwidth allocation. </p>
16

Simple Distributed Multihop Diversity Relaying Based on Repetition for Low-Power-Low-Rate Application

Li, Yanwen Unknown Date
No description available.
17

Rate adaptive transmission in cooperative networks

Kalansuriya, Prasanna Unknown Date
No description available.
18

Capacity Results for Wireless Cooperative Communications with Relay Conferencing

Huang, Chuan 2012 August 1900 (has links)
In this dissertation we consider cooperative communication systems with relay conferencing, where the relays own the capabilities to talk to their counterparts via either wired or wireless out-of-band links. In particular, we focus on the design of conferencing protocols incorporating the half-duplex relaying operations, and study the corresponding capacity upper and lower bounds for some typical channels and networks models, including the diamond relay channels (one source-destination pairs and two relays), large relay networks (one source-destination pairs and N relays), and interference relay channels (two source-destination pairs and two relays). First, for the diamond relay channels, we consider two different relaying schemes, i.e., simultaneous relaying (for which the two relays transmit and receive in the same time slot) and alternative relaying (for which the two relays exchange their transmit and receive modes alternatively over time), for which we obtain the respective achievable rates by using the decode-and-forward (DF), compress-and-forward (CF), and amplify-and-forward (AF) relaying schemes with DF and AF adopted the conferencing schemes. Moreover, we prove some capacity results under some special conditions. Second, we consider the large relay networks, and propose a "p-portion" conferencing scheme, where each relay can talk to the other "p-portion" of the relays. We obtain the DF and AF achievable rates by using the AF conferencing scheme. It is proved that relay conferencing increases the throughput scaling order of the DF relaying scheme from O(log(log(N ))) for the case without conferencing to O(log(N )); for the AF relaying scheme, it achieves the capacity upper bound under some conditions. Finally, we consider the two-hop interference relay channels, and obtain the AF achievable rates by adopting the AF conferencing scheme and two different decoding schemes at the destination, i.e., single-user decoding and joint decoding. For the derived joint source power allocation and relay combining problem, we develop some efficient iterative algorithms to compute the AF achievable rate regions. Moreover, we compare the achievable degree-of-freedom (DoF) performance of these two decoding schemes, and show that single-user decoding with interference cancellation at the relays is optimal.
19

Secrecy Capacity of Cooperative Transmission with Opportunistic Relaying Scheme

Pasumarthi, Dhathri Pravallika January 2022 (has links)
The usage of wireless communication has increased over the past few years. Most wired communications are replaced by wireless communication for ease of use. Wireless communication transfers confidential information like personal information and credentials between two entities. We can't probably say that it is safe to send this information via wireless communication. As more data is sent, more attacks happen to steal the data. Hence, it is necessary to implement secure methods to transfer the data between source and receiver. In this communication channel, we use secrecy capacity as a parameter to measure how data is sent securely between source and destination. Generally, to achieve high system performance, the information is sent with low power, but this reduces the signal efficiency at the receiver. So, in this thesis, we have implemented cooperative transmission to increase the efficiency of low power signals by adding the relays between source and destination. This thesis consists of two relays. The relay that obtains the maximum signal-to-noise ratio is selected for the primary communication link. The other relay sends the signal to the eavesdropper to confuse the eavesdropper. In this thesis, we have derived the mathematical expression for SNR at receiver eavesdropper, and also we have derived a word for outage probability and secrecy capacity. Then, we simulated the Matlab code to obtain results on how the secrecy capacity affects by changing the various parameters like path loss exponent and fading severity parameter and suggests which environment is better to maintain high secrecy capacity. We also analysed the system performance and secrecy capacity in the presence of eavesdropper as well.
20

Experimental Study of Cooperative Communication using Software Defined Radios

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

Page generated in 0.0528 seconds