2,074 research outputs found

    Resource Management of energy-aware Cognitive Radio Networks and cloud-based Infrastructures

    Full text link
    The field of wireless networks has been rapidly developed during the past decade due to the increasing popularity of the mobile devices. The great demand for mobility and connectivity makes wireless networking a field whose continuous technological development is very important as new challenges and issues are arising. Many scientists and researchers are currently engaged in developing new approaches and optimization methods in several topics of wireless networking. This survey paper study works from the following topics: Cognitive Radio Networks, Interactive Broadcasting, Energy Efficient Networks, Cloud Computing and Resource Management, Interactive Marketing and Optimization

    Effective Capacity in Wireless Networks: A Comprehensive Survey

    Full text link
    Low latency applications, such as multimedia communications, autonomous vehicles, and Tactile Internet are the emerging applications for next-generation wireless networks, such as 5th generation (5G) mobile networks. Existing physical-layer channel models, however, do not explicitly consider quality-of-service (QoS) aware related parameters under specific delay constraints. To investigate the performance of low-latency applications in future networks, a new mathematical framework is needed. Effective capacity (EC), which is a link-layer channel model with QoS-awareness, can be used to investigate the performance of wireless networks under certain statistical delay constraints. In this paper, we provide a comprehensive survey on existing works, that use the EC model in various wireless networks. We summarize the work related to EC for different networks such as cognitive radio networks (CRNs), cellular networks, relay networks, adhoc networks, and mesh networks. We explore five case studies encompassing EC operation with different design and architectural requirements. We survey various delay-sensitive applications such as voice and video with their EC analysis under certain delay constraints. We finally present the future research directions with open issues covering EC maximization

    Distributed Learning for Channel Allocation Over a Shared Spectrum

    Full text link
    Channel allocation is the task of assigning channels to users such that some objective (e.g., sum-rate) is maximized. In centralized networks such as cellular networks, this task is carried by the base station which gathers the channel state information (CSI) from the users and computes the optimal solution. In distributed networks such as ad-hoc and device-to-device (D2D) networks, no base station exists and conveying global CSI between users is costly or simply impractical. When the CSI is time varying and unknown to the users, the users face the challenge of both learning the channel statistics online and converge to a good channel allocation. This introduces a multi-armed bandit (MAB) scenario with multiple decision makers. If two users or more choose the same channel, a collision occurs and they all receive zero reward. We propose a distributed channel allocation algorithm that each user runs and converges to the optimal allocation while achieving an order optimal regret of O\left(\log T\right). The algorithm is based on a carrier sensing multiple access (CSMA) implementation of the distributed auction algorithm. It does not require any exchange of information between users. Users need only to observe a single channel at a time and sense if there is a transmission on that channel, without decoding the transmissions or identifying the transmitting users. We demonstrate the performance of our algorithm using simulated LTE and 5G channels

    Power Control for Sum Rate Maximization on Interference Channels Under Sum Power Constraint

    Full text link
    In this paper, we consider the problem of power control for sum rate maximization on multiple interfering links (TX-RX pairs)under sum power constraint. We consider a single frequency network, where all pairs are operating in same frequency band,thereby creating interference for each other. We study the power allocation problem for sum rate maximization with and without QoS requirements on individual links. When the objective is only sum rate maximization without QoS guarantees, we develop an analytic solution to decide optimal power allocation for two TX-RX pair problem. We also develop a low complexity iterative algorithm for three TX-RX pair problem. For a generic N>3 TX-RX pair problem, we develop two low-complexity sub-optimal power allocation algorithms. The first algorithm is based on the idea of making clusters of two or three TX-RX pairs and then leverage the power allocation results obtained for two and three TX-RX pair problems. The second algorithm is developed by using a high SINR approximation and this algorithm can also be implemented in a distributed manner by individual TXs. We then consider the same problem but with additional QoS guarantees for individual links. We again develop an analytic solution for two TX-RX pair problem, and a distributed algorithm for N>2 TX-RX pairs.Comment: 17 pages, 8 figures, IEEE Transactions on Vehicular Technolog

    Opportunistic Spectrum Sharing in Dynamic Access Networks: Deployment Challenges, Optimizations, Solutions, and Open Issues

    Full text link
    In this paper, we investigate the issue of spectrum assignment in CRNs and examine various opportunistic spectrum access approaches proposed in the literature. We provide insight into the efficiency of such approaches and their ability to attain their design objectives. We discuss the factors that impact the selection of the appropriate operating channel(s), including the important interaction between the cognitive linkquality conditions and the time-varying nature of PRNs. Protocols that consider such interaction are described. We argue that using best quality channels does not achieve the maximum possible throughput in CRNs (does not provide the best spectrum utilization). The impact of guard bands on the design of opportunistic spectrum access protocols is also investigated. Various complementary techniques and optimization methods are underlined and discussed, including the utilization of variablewidth spectrum assignment, resource virtualization, full-duplex capability, cross-layer design, beamforming and MIMO technology, cooperative communication, network coding, discontinuousOFDM technology, and software defined radios. Finally, we highlight several directions for future research in this field

    Effective Capacity Analysis of Cognitive Radio Channels for Quality of Service Provisioning

    Full text link
    In this paper, cognitive transmission under quality of service (QoS) constraints is studied. In the cognitive radio channel model, it is assumed that the secondary transmitter sends the data at two different average power levels, depending on the activity of the primary users, which is determined by channel sensing performed by the secondary users. A state-transition model is constructed for this cognitive transmission channel. Statistical limitations on the buffer lengths are imposed to take into account the QoS constraints. The maximum throughput under these statistical QoS constraints is identified by finding the effective capacity of the cognitive radio channel. This analysis is conducted for fixed-power/fixed-rate, fixed-power/variable-rate, and variable-power/variable-rate transmission schemes under different assumptions on the availability of channel side information (CSI) at the transmitter. The impact upon the effective capacity of several system parameters, including channel sensing duration, detection threshold, detection and false alarm probabilities, QoS parameters, and transmission rates, is investigated. The performances of fixed-rate and variable-rate transmission methods are compared in the presence of QoS limitations. It is shown that variable schemes outperform fixed-rate transmission techniques if the detection probabilities are high. Performance gains through adapting the power and rate are quantified and it is shown that these gains diminish as the QoS limitations become more stringent

    Joint Scheduling and Power-Control for Delay Guarantees in Heterogeneous Cognitive Radios

    Full text link
    An uplink multi secondary user (SU) cognitive radio system having average delay constraints as well as an interference constraint to the primary user (PU) is considered. If the interference channels between the SUs and the PU are statistically heterogeneous due to the different physical locations of the different SUs, the SUs will experience different delay performances. This is because SUs located closer to the PU transmit with lower power levels. Two dynamic scheduling-and-power-allocation policies that can provide the required average delay guarantees to all SUs irrespective of their locations are proposed. The first policy solves the problem when the interference constraint is an instantaneous one, while the second is for problems with long-term average interference constraints. We show that although the average interference problem is an extension to the instantaneous interference one, the solution is totally different. The two policies, derived using the Lyapunov optimization technique, are shown to be asymptotically delay optimal while satisfying the delay and interference constraints. Our findings are supported by extensive system simulations and shown to outperform existing policies as well as shown to be robust to channel estimation errors.Comment: Transactions on Wireless Communications, 2016 Keywords: Cognitive Radios, Delay Constraints, Resource allocation, Stochastic Optimization, Online Algorithm, Lyapunov Optimization, Average Interference Constraint, Priority Queues. arXiv admin note: substantial text overlap with arXiv:1601.00608, arXiv:1512.0298

    Recent Advances in Cloud Radio Access Networks: System Architectures, Key Techniques, and Open Issues

    Full text link
    As a promising paradigm to reduce both capital and operating expenditures, the cloud radio access network (C-RAN) has been shown to provide high spectral efficiency and energy efficiency. Motivated by its significant theoretical performance gains and potential advantages, C-RANs have been advocated by both the industry and research community. This paper comprehensively surveys the recent advances of C-RANs, including system architectures, key techniques, and open issues. The system architectures with different functional splits and the corresponding characteristics are comprehensively summarized and discussed. The state-of-the-art key techniques in C-RANs are classified as: the fronthaul compression, large-scale collaborative processing, and channel estimation in the physical layer; and the radio resource allocation and optimization in the upper layer. Additionally, given the extensiveness of the research area, open issues and challenges are presented to spur future investigations, in which the involvement of edge cache, big data mining, social-aware device-to-device, cognitive radio, software defined network, and physical layer security for C-RANs are discussed, and the progress of testbed development and trial test are introduced as well.Comment: 27 pages, 11 figure

    Reconfigurable Wireless Networks

    Full text link
    Driven by the advent of sophisticated and ubiquitous applications, and the ever-growing need for information, wireless networks are without a doubt steadily evolving into profoundly more complex and dynamic systems. The user demands are progressively rampant, while application requirements continue to expand in both range and diversity. Future wireless networks, therefore, must be equipped with the ability to handle numerous, albeit challenging requirements. Network reconfiguration, considered as a prominent network paradigm, is envisioned to play a key role in leveraging future network performance and considerably advancing current user experiences. This paper presents a comprehensive overview of reconfigurable wireless networks and an in-depth analysis of reconfiguration at all layers of the protocol stack. Such networks characteristically possess the ability to reconfigure and adapt their hardware and software components and architectures, thus enabling flexible delivery of broad services, as well as sustaining robust operation under highly dynamic conditions. The paper offers a unifying framework for research in reconfigurable wireless networks. This should provide the reader with a holistic view of concepts, methods, and strategies in reconfigurable wireless networks. Focus is given to reconfigurable systems in relatively new and emerging research areas such as cognitive radio networks, cross-layer reconfiguration and software-defined networks. In addition, modern networks have to be intelligent and capable of self-organization. Thus, this paper discusses the concept of network intelligence as a means to enable reconfiguration in highly complex and dynamic networks. Finally, the paper is supported with several examples and case studies showing the tremendous impact of reconfiguration on wireless networks.Comment: 28 pages, 26 figures; Submitted to the Proceedings of the IEEE (a special issue on Reconfigurable Systems

    QoS Provisioning for Multimedia Transmission in Cognitive Radio Networks

    Full text link
    In cognitive radio (CR) networks, the perceived reduction of application layer quality of service (QoS), such as multimedia distortion, by secondary users may impede the success of CR technologies. Most previous work in CR networks ignores application layer QoS. In this paper we take an integrated design approach to jointly optimize multimedia intra refreshing rate, an application layer parameter, together with access strategy, and spectrum sensing for multimedia transmission in a CR system with time varying wireless channels. Primary network usage and channel gain are modeled as a finite state Markov process. With channel sensing and channel state information errors, the system state cannot be directly observed. We formulate the QoS optimization problem as a partially observable Markov decision process (POMDP). A low complexity dynamic programming framework is presented to obtain the optimal policy. Simulation results show the effectiveness of the proposed scheme
    corecore