1,262 research outputs found

    Power Allocation Strategies for Wireless Relay Networks with Analog Network Coding: Survey

    Get PDF
    Relay aided communication with network coding can bring spectacular performance enhancements for wireless networks. The proper design of power allocated to each of the nodes involved in the communication is essential as it has impact on the performance when Analog Network coding (ANC) is used. This paper presents a survey on recent power allocation strategies, intended objectives, practical constraints that have been considered, and corresponding performances for networks with ANC protocol

    Resource allocation and optimization techniques in wireless relay networks

    Get PDF
    Relay techniques have the potential to enhance capacity and coverage of a wireless network. Due to rapidly increasing number of smart phone subscribers and high demand for data intensive multimedia applications, the useful radio spectrum is becoming a scarce resource. For this reason, two way relay network and cognitive radio technologies are required for better utilization of radio spectrum. Compared to the conventional one way relay network, both the uplink and the downlink can be served simultaneously using a two way relay network. Hence the effective bandwidth efficiency is considered to be one time slot per transmission. Cognitive networks are wireless networks that consist of different types of users, a primary user (PU, the primary license holder of a spectrum band) and secondary users (SU, cognitive radios that opportunistically access the PU spectrum). The secondary users can access the spectrum of the licensed user provided they do not harmfully affect to the primary user. In this thesis, various resource allocation and optimization techniques have been investigated for wireless relay and cognitive radio networks

    On the Design of Cognitive-Radio-Inspired Asymmetric Network Coding Transmissions in MIMO Systems

    Get PDF
    In this paper, a cognitive-radio-inspired asymmetric network coding (CR-AsNC) scheme is proposed for multiple-input-multiple-output (MIMO) cellular transmissions, where information exchange among users and base-station (BS) broadcasting can be accomplished simultaneously. The key idea is to apply the concept of cognitive radio (CR) in network coding transmissions, where the BS tries sending new information while helping users' transmissions as a relay. In particular, we design an asymmetric network coding method for information exchange between the BS and the users, although many existing works consider the design of network coding in symmetric scenarios. To approach the optimal performance, an iterative precoding design for CR-AsNC is first developed. Then, a channel-diagonalization-based precoding design with low complexity is proposed, to which power allocation can be optimized with a closed-form solution. The simulation results show that the proposed CR-AsNC scheme with precoding optimization can significantly improve system transmission performance

    Cell-Edge Multi-User Relaying with Overhearing

    Get PDF

    Cognitive Radio Systems

    Get PDF
    Cognitive radio is a hot research area for future wireless communications in the recent years. In order to increase the spectrum utilization, cognitive radio makes it possible for unlicensed users to access the spectrum unoccupied by licensed users. Cognitive radio let the equipments more intelligent to communicate with each other in a spectrum-aware manner and provide a new approach for the co-existence of multiple wireless systems. The goal of this book is to provide highlights of the current research topics in the field of cognitive radio systems. The book consists of 17 chapters, addressing various problems in cognitive radio systems

    Adaptive relay techniques for OFDM-based cooperative communication systems

    Get PDF
    Cooperative communication has been considered as a cost-effective manner to exploit the spatial diversity, improve the quality-of-service and extend transmission coverage. However, there are many challenges faced by cooperative systems which use relays to forward signals to the destination, such as the accumulation of multipath channels, complex resource allocation with the bidirectional asymmetric traffic and reduction of transmission efficiency caused by additional relay overhead. In this thesis, we aim to address the above challenges of cooperative communications, and design the efficient relay systems. Starting with the channel accumulation problem in the amplify-and-forward relay system, we proposed two adaptive schemes for single/multiple-relay networks respectively. These schemes exploit an adaptive guard interval (GI) technique to cover the accumulated delay spread and enhance the transmission efficiency by limiting the overhead. The proposed GI scheme can be implemented without any extra control signal. Extending the adaptive GI scheme to multiple-relay systems, we propose a relay selection strategy which achieves the trade-off between the transmission reliability and overhead by considering both the channel gain and the accumulated delay spread. We then consider resource allocation problem in the two-way decode-and-forward relay system with asymmetric traffic loads. Two allocation algorithms are respectively investigated for time-division and frequency-division relay systems to maximize the end-to-end capacity of the two-way system under a capacity ratio constraint. For the frequency-division systems, a balanced end-to-end capacity is defined as the objective function which combines the requirements of maximizing the end-to-end capacity and achieving the capacity ratio. A suboptimal algorithm is proposed for the frequency-division systems which separates subcarrier allocation and time/power allocation. It can achieve the similar performance with the optimal one with reduced complexity. In order to further enhance the transmission reliability and maintaining low processing delay, we propose an equalize-and-forward (EF) relay scheme. The EF relay equalizes the channel between source and relay to eliminate the channel accumulation without signal regeneration. To reduce the processing time, an efficient parallel structure is applied in the EF relay. Numerical results show that the EF relay exhibits low outage probability at the same data rate as compared to AF and DF schemes

    Achieving Global Optimality for Weighted Sum-Rate Maximization in the K-User Gaussian Interference Channel with Multiple Antennas

    Full text link
    Characterizing the global maximum of weighted sum-rate (WSR) for the K-user Gaussian interference channel (GIC), with the interference treated as Gaussian noise, is a key problem in wireless communication. However, due to the users' mutual interference, this problem is in general non-convex and thus cannot be solved directly by conventional convex optimization techniques. In this paper, by jointly utilizing the monotonic optimization and rate profile techniques, we develop a new framework to obtain the globally optimal power control and/or beamforming solutions to the WSR maximization problems for the GICs with single-antenna transmitters and single-antenna receivers (SISO), single-antenna transmitters and multi-antenna receivers (SIMO), or multi-antenna transmitters and single-antenna receivers (MISO). Different from prior work, this paper proposes to maximize the WSR in the achievable rate region of the GIC directly by exploiting the facts that the achievable rate region is a "normal" set and the users' WSR is a "strictly increasing" function over the rate region. Consequently, the WSR maximization is shown to be in the form of monotonic optimization over a normal set and thus can be solved globally optimally by the existing outer polyblock approximation algorithm. However, an essential step in the algorithm hinges on how to efficiently characterize the intersection point on the Pareto boundary of the achievable rate region with any prescribed "rate profile" vector. This paper shows that such a problem can be transformed into a sequence of signal-to-interference-plus-noise ratio (SINR) feasibility problems, which can be solved efficiently by existing techniques. Numerical results validate that the proposed algorithms can achieve the global WSR maximum for the SISO, SIMO or MISO GIC.Comment: This is the longer version of a paper to appear in IEEE Transactions on Wireless Communication

    Medida e análise de atividade espetral

    Get PDF
    Mestrado em Engenharia Electrónica e TelecomunicaçõesThe dissertation deals with measuring and analyzing spectrum occupancy of a GSM900 band, DCS1800 band and all UMTS bandwidth. A modelization for analog power and binary quantized power is given. In the case of analog power, histograms of the power distribution during one working day are presented. In the case of quantized power the two time statistics, the time period of opportunities distribution and the time between opportunities distribution are presented, described and modeled. The measurement setup is standing in line of sight with the base station. Also, in terms of maximum sensitivity the measurement setup is described and analyzed. Spectrum non occupancy in terms of total time for the GSM900 band and the DCS1800 band is given, for a working day.Nesta dissertação são feitas medidas e a análise de ocupação de espectro em uma banda de GSM900, uma banda de DCS1800 e toda a largura de banda do UMTS. É apresentada uma modelização para potência analógica e para a potência binária quantizada. No caso da potência analógica são apresentados histogramas da distribuição de potência ao longo de um dia útil. No caso da potência quantizada as duas estatísticas, distribuição do período de tempo de oportunidades e distribuição do tempo entre oportunidades, são apresentadas, descritas e modeladas. O setup de medida encontra-se em linha de vista com a estação base. O setup é descrito e analisado em termos de máxima sensibilidade. A desocupação de espectro em termos de tempo total para a banda de GSM900 e para a banda DCS1800 é fornecida, para um dia de útil

    Using hypergraph theory to model coexistence management and coordinated spectrum allocation for heterogeneous wireless networks operating in shared spectrum

    Get PDF
    Electromagnetic waves in the Radio Frequency (RF) spectrum are used to convey wireless transmissions from one radio antenna to another. Spectrum utilisation factor, which refers to how readily a given spectrum can be reused across space and time while maintaining an acceptable level of transmission errors, is used to measure how efficiently a unit of frequency spectrum can be allocated to a specified number of users. The demand for wireless applications is increasing exponentially, hence there is a need for efficient management of the RF spectrum. However, spectrum usage studies have shown that the spectrum is under-utilised in space and time. A regulatory shift from static spectrum assignment to DSA is one way of addressing this. Licence exemption policy has also been advanced in Dynamic Spectrum Access (DSA) systems to spur wireless innovation and universal access to the internet. Furthermore, there is a shift from homogeneous to heterogeneous radio access and usage of the same spectrum band. These three shifts from traditional spectrum management have led to the challenge of coexistence among heterogeneous wireless networks which access the spectrum using DSA techniques. Cognitive radios have the ability for spectrum agility based on spectrum conditions. However, in the presence of multiple heterogeneous networks and without spectrum coordination, there is a challenge related to switching between available channels to minimise interference and maximise spectrum allocation. This thesis therefore focuses on the design of a framework for coexistence management and spectrum coordination, with the objective of maximising spectrum utilisation across geographical space and across time. The amount of geographical coverage in which a frequency can be used is optimised through frequency reuse while ensuring that harmful interference is minimised. The time during which spectrum is occupied is increased through time-sharing of the same spectrum by two or more networks, while ensuring that spectrum is shared by networks that can coexist in the same spectrum and that the total channel load is not excessive to prevent spectrum starvation. Conventionally, a graph is used to model relationships between entities such as interference relationships among networks. However, the concept of an edge in a graph is not sufficient to model relationships that involve more than two entities, such as more than two networks that are able to share the same channel in the time domain, because an edge can only connect two entities. On the other hand, a hypergraph is a generalisation of an undirected graph in which a hyperedge can connect more than two entities. Therefore, this thesis investigates the use of hypergraph theory to model the RF environment and the spectrum allocation scheme. The hypergraph model was applied to an algorithm for spectrum sharing among 100 heterogeneous wireless networks, whose geo-locations were randomly and independently generated in a 50 km by 50 km area. Simulation results for spectrum utilisation performance have shown that the hypergraph-based model allocated channels, on average, to 8% more networks than the graph-based model. The results also show that, for the same RF environment, the hypergraph model requires up to 36% fewer channels to achieve, on average, 100% operational networks, than the graph model. The rate of growth of the running time of the hypergraph-based algorithm with respect to the input size is equal to the square of the input size, like the graph-based algorithm. Thus, the model achieved better performance at no additional time complexity.Electromagnetic waves in the Radio Frequency (RF) spectrum are used to convey wireless transmissions from one radio antenna to another. Spectrum utilisation factor, which refers to how readily a given spectrum can be reused across space and time while maintaining an acceptable level of transmission errors, is used to measure how efficiently a unit of frequency spectrum can be allocated to a specified number of users. The demand for wireless applications is increasing exponentially, hence there is a need for efficient management of the RF spectrum. However, spectrum usage studies have shown that the spectrum is under-utilised in space and time. A regulatory shift from static spectrum assignment to DSA is one way of addressing this. Licence exemption policy has also been advanced in Dynamic Spectrum Access (DSA) systems to spur wireless innovation and universal access to the internet. Furthermore, there is a shift from homogeneous to heterogeneous radio access and usage of the same spectrum band. These three shifts from traditional spectrum management have led to the challenge of coexistence among heterogeneous wireless networks which access the spectrum using DSA techniques. Cognitive radios have the ability for spectrum agility based on spectrum conditions. However, in the presence of multiple heterogeneous networks and without spectrum coordination, there is a challenge related to switching between available channels to minimise interference and maximise spectrum allocation. This thesis therefore focuses on the design of a framework for coexistence management and spectrum coordination, with the objective of maximising spectrum utilisation across geographical space and across time. The amount of geographical coverage in which a frequency can be used is optimised through frequency reuse while ensuring that harmful interference is minimised. The time during which spectrum is occupied is increased through time-sharing of the same spectrum by two or more networks, while ensuring that spectrum is shared by networks that can coexist in the same spectrum and that the total channel load is not excessive to prevent spectrum starvation. Conventionally, a graph is used to model relationships between entities such as interference relationships among networks. However, the concept of an edge in a graph is not sufficient to model relationships that involve more than two entities, such as more than two networks that are able to share the same channel in the time domain, because an edge can only connect two entities. On the other hand, a hypergraph is a generalisation of an undirected graph in which a hyperedge can connect more than two entities. Therefore, this thesis investigates the use of hypergraph theory to model the RF environment and the spectrum allocation scheme. The hypergraph model was applied to an algorithm for spectrum sharing among 100 heterogeneous wireless networks, whose geo-locations were randomly and independently generated in a 50 km by 50 km area. Simulation results for spectrum utilisation performance have shown that the hypergraph-based model allocated channels, on average, to 8% more networks than the graph-based model. The results also show that, for the same RF environment, the hypergraph model requires up to 36% fewer channels to achieve, on average, 100% operational networks, than the graph model. The rate of growth of the running time of the hypergraph-based algorithm with respect to the input size is equal to the square of the input size, like the graph-based algorithm. Thus, the model achieved better performance at no additional time complexity

    Research Issues, Challenges, and Opportunities of Wireless Power Transfer-Aided Full-Duplex Relay Systems

    Get PDF
    We present a comprehensive review for wireless power transfer (WPT)-aided full-duplex (FD) relay systems. Two critical challenges in implementing WPT-aided FD relay systems are presented, that is, pseudo FD realization and high power consumption. Existing time-splitting or power-splitting structure based-WPT-aided FD relay systems can only realize FD operation in one of the time slots or only forward part of the received signal to the destination, belonging to pseudo FD realization. Besides, self-interference is treated as noise and self-interference cancellation (SIC) operation incurs high power consumption at the FD relay node. To this end, a promising solution is outlined to address the two challenges, which realizes consecutive FD realization at all times and forwards all the desired signal to the destination for decoding. Also, active SIC, that is, analog/digital cancellation, is not required by the proposed solution, which effectively reduces the circuit complexity and releases high power consumption at the FD relay node. Specific classifications and performance metrics of WPT-aided FD relay systems are summarized. Some future research is also envisaged for WPT-aided FD systems
    corecore