3,138 research outputs found

    Cooperative subcarrier sensing using antenna diversity based weighted virtual sub clustering

    Get PDF
    The idea of cooperation and the clustering amongst cognitive radios (CRs) has recently been focus of attention of research community, owing to its potential to improve performance of spectrum sensing (SS) schemes. This focus has led to the paradigm of cluster based cooperative spectrum sensing (CBCSS). In perspective of high date rate 4th generation wireless systems, which are characterized by orthogonal frequency division multiplexing (OFDM) and spatial diversity, there is a need to devise effective SS strategies. A novel CBCSS scheme is proposed for OFDM subcarrier detection in order to enable the non-contiguous OFDM (NC-OFDM) at the physical layer of CRs for efficient utilization of spectrum holes. Proposed scheme is based on the energy detection in MIMO CR network, using equal gain combiner as diversity combining technique, hard combining (AND, OR and Majority) rule as data fusion technique and antenna diversity based weighted clustering as virtual sub clustering algorithm. Results of proposed CBCSS are compared with conventional CBCSS scheme for AND, OR and Majority data fusion rules. Moreover the effects of antenna diversity, cooperation and cooperating clusters are also discussed

    Cooperative sensing of spectrum opportunities

    Get PDF
    Reliability and availability of sensing information gathered from local spectrum sensing (LSS) by a single Cognitive Radio is strongly affected by the propagation conditions, period of sensing, and geographical position of the device. For this reason, cooperative spectrum sensing (CSS) was largely proposed in order to improve LSS performance by using cooperation between Secondary Users (SUs). The goal of this chapter is to provide a general analysis on CSS for cognitive radio networks (CRNs). Firstly, the theoretical system model for centralized CSS is introduced, together with a preliminary discussion on several fusion rules and operative modes. Moreover, three main aspects of CSS that substantially differentiate the theoretical model from realistic application scenarios are analyzed: (i) the presence of spatiotemporal correlation between decisions by different SUs; (ii) the possible mobility of SUs; and (iii) the nonideality of the control channel between the SUs and the Fusion Center (FC). For each aspect, a possible practical solution for network organization is presented, showing that, in particular for the first two aspects, cluster-based CSS, in which sensing SUs are properly chosen, could mitigate the impact of such realistic assumptions

    Un nuevo esquema de agrupación para redes sensoras inalámbricas de radio cognitivas heterogéneas

    Get PDF
    Introduction: This article is the product of the research “Learning-based Spectrum Analysis and Prediction in Cognitive Radio Sensor Networks”, developed at Sejong University in the year 2019. Problem: Most of the clustering schemes for distributed cognitive radio-enabled wireless sensor networks consider homogeneous cognitive radio-enabled wireless sensors. Many clustering schemes for such homogeneouscognitive radio-enabled wireless sensor networks waste resources and suffer from energy inefficiency because of the unnecessary overheads. Objective: The objective of the research is to propose a node clustering scheme that conserves energy and prolongs network lifetime. Methodology: A heterogeneous cognitive radio-enabled wireless sensor network in which only a few nodes have a cognitive radio module and the other nodes are normal sensor nodes. Along with the hardware cost, theproposed scheme is efficient in energy consumption. Results: We simulated the proposed scheme and compared it with the homogeneous cognitive radio-enabled wireless sensor networks. The results show that the proposed scheme is efficient in terms of energyconsumption. Conclusion: The proposed node clustering scheme performs better in terms of network energy conservation and network partition. Originality: There are heterogeneous node clustering schemes in the literature for cooperative spectrum sensing and energy efficiency, but to the best of our knowledge, there is no study that proposes a non-cognitiveradio-enabled sensor clustering for energy conservation along with cognitive radio-enabled wireless sensors. Limitations: The deployment of the proposed special device for cognitive radio-enabled wireless sensors is complicated and requires special hardware with better battery powered cognitive sensor nodes

    Thirty Years of Machine Learning: The Road to Pareto-Optimal Wireless Networks

    Full text link
    Future wireless networks have a substantial potential in terms of supporting a broad range of complex compelling applications both in military and civilian fields, where the users are able to enjoy high-rate, low-latency, low-cost and reliable information services. Achieving this ambitious goal requires new radio techniques for adaptive learning and intelligent decision making because of the complex heterogeneous nature of the network structures and wireless services. Machine learning (ML) algorithms have great success in supporting big data analytics, efficient parameter estimation and interactive decision making. Hence, in this article, we review the thirty-year history of ML by elaborating on supervised learning, unsupervised learning, reinforcement learning and deep learning. Furthermore, we investigate their employment in the compelling applications of wireless networks, including heterogeneous networks (HetNets), cognitive radios (CR), Internet of things (IoT), machine to machine networks (M2M), and so on. This article aims for assisting the readers in clarifying the motivation and methodology of the various ML algorithms, so as to invoke them for hitherto unexplored services as well as scenarios of future wireless networks.Comment: 46 pages, 22 fig

    An energy-efficient spectrum-aware reinforcement learning-based clustering algorithm for cognitive radio sensor networks

    Get PDF
    It is well-known that clustering partitions network into logical groups of nodes in order to achieve energy efficiency and to enhance dynamic channel access in cognitive radio through cooperative sensing. While the topic of energy efficiency has been well investigated in conventional wireless sensor networks, the latter has not been extensively explored. In this paper, we propose a reinforcement learning-based spectrum-aware clustering algorithm that allows a member node to learn the energy and cooperative sensing costs for neighboring clusters to achieve an optimal solution. Each member node selects an optimal cluster that satisfies pairwise constraints, minimizes network energy consumption and enhances channel sensing performance through an exploration technique. We first model the network energy consumption and then determine the optimal number of clusters for the network. The problem of selecting an optimal cluster is formulated as a Markov Decision Process (MDP) in the algorithm and the obtained simulation results show convergence, learning and adaptability of the algorithm to dynamic environment towards achieving an optimal solution. Performance comparisons of our algorithm with the Groupwise Spectrum Aware (GWSA)-based algorithm in terms of Sum of Square Error (SSE), complexity, network energy consumption and probability of detection indicate improved performance from the proposed approach. The results further reveal that an energy savings of 9% and a significant Primary User (PU) detection improvement can be achieved with the proposed approach

    Data Transmission with Reduced Delay for Distributed Acoustic Sensors

    Full text link
    This paper proposes a channel access control scheme fit to dense acoustic sensor nodes in a sensor network. In the considered scenario, multiple acoustic sensor nodes within communication range of a cluster head are grouped into clusters. Acoustic sensor nodes in a cluster detect acoustic signals and convert them into electric signals (packets). Detection by acoustic sensors can be executed periodically or randomly and random detection by acoustic sensors is event driven. As a result, each acoustic sensor generates their packets (50bytes each) periodically or randomly over short time intervals (400ms~4seconds) and transmits directly to a cluster head (coordinator node). Our approach proposes to use a slotted carrier sense multiple access. All acoustic sensor nodes in a cluster are allocated to time slots and the number of allocated sensor nodes to each time slot is uniform. All sensor nodes allocated to a time slot listen for packet transmission from the beginning of the time slot for a duration proportional to their priority. The first node that detect the channel to be free for its whole window is allowed to transmit. The order of packet transmissions with the acoustic sensor nodes in the time slot is autonomously adjusted according to the history of packet transmissions in the time slot. In simulations, performances of the proposed scheme are demonstrated by the comparisons with other low rate wireless channel access schemes.Comment: Accepted to IJDSN, final preprinted versio

    Cluster-based cooperative subcarrier sensing using antenna diversity-based weighted data fusion

    Get PDF
    Cooperative spectrum sensing (CSS) is used in cognitive radio (CR) networks to improve the spectrum sensing performance in shadow fading environments. Moreover, clustering in CR networks is used to reduce reporting time and bandwidth overhead during CSS. Thus, cluster-based cooperative spectrum sensing (CBCSS) has manifested satisfactory spectrum sensing results in harsh environments under processing constraints. On the other hand, the antenna diversity of multiple input multiple output CR systems can be exploited to further improve the spectrum sensing performance. This paper presents the CBCSS performance in a CR network which is comprised of single- as well as multiple-antenna CR systems. We give theoretical analysis of CBCSS for orthogonal frequency division multiplexing signal sensing and propose a novel fusion scheme at the fusion center which takes into account the receiver antenna diversity of the CRs present in the network. We introduce the concept of weighted data fusion in which the sensing results of different CRs are weighted proportional to the number of receiving antennas they are equipped with. Thus, the receiver diversity is used to the advantage of improving spectrum sensing performance in a CR cluster. Simulation results show that the proposed scheme outperforms the conventional CBCSS scheme
    corecore