340 research outputs found

    A survey on MAC protocols for complex self-organizing cognitive radio networks

    Get PDF
    Complex self-organizing cognitive radio (CR) networks serve as a framework for accessing the spectrum allocation dynamically where the vacant channels can be used by CR nodes opportunistically. CR devices must be capable of exploiting spectrum opportunities and exchanging control information over a control channel. Moreover, CR nodes should intelligently coordinate their access between different cognitive radios to avoid collisions on the available spectrum channels and to vacate the channel for the licensed user in timely manner. Since inception of CR technology, several MAC protocols have been designed and developed. This paper surveys the state of the art on tools, technologies and taxonomy of complex self-organizing CR networks. A detailed analysis on CR MAC protocols form part of this paper. We group existing approaches for development of CR MAC protocols and classify them into different categories and provide performance analysis and comparison of different protocols. With our categorization, an easy and concise view of underlying models for development of a CR MAC protocol is provided

    Spectrum sharing and aggregation for future wireless networks, part II

    No full text
    The papers in this special issue represent the second one in the sequel of three special issues on spectrum sharing and aggregation for future wirelessn networks

    Bootstrapping Cognitive Radio Networks

    Get PDF
    Cognitive radio networks promise more efficient spectrum utilization by leveraging degrees of freedom and distributing data collection. The actual realization of these promises is challenged by distributed control, and incomplete, uncertain and possibly conflicting knowledge bases. We consider two problems in bootstrapping, evolving, and managing cognitive radio networks. The first is Link Rendezvous, or how separate radio nodes initially find each other in a spectrum band with many degrees of freedom, and little shared knowledge. The second is how radio nodes can negotiate for spectrum access with incomplete information. To address the first problem, we present our Frequency Parallel Blind Link Rendezvous algorithm. This approach, designed for recent generations of digital front-ends, implicitly shares vague information about spectrum occupancy early in the process, speeding the progress towards a solution. Furthermore, it operates in the frequency domain, facilitating a parallel channel rendezvous. Finally, it operates without a control channel and can rendezvous anywhere in the operating band. We present simulations and analysis on the false alarm rate for both a feature detector and a cross-correlation detector. We compare our results to the conventional frequency hopping sequence rendezvous techniques. To address the second problem, we model the network as a multi-agent system and negotiate by exchanging proposals, augmented with arguments. These arguments include information about priority status and the existence of other nodes. We show in a variety of network topologies that this process leads to solutions not otherwise apparent to individual nodes, and achieves superior network throughput, request satisfaction, and total number of connections, compared to our baselines. The agents independently formulate proposals based upon communication desires, evaluate these proposals based upon capacity constraints, create ariii guments in response to proposal rejections, and re-evaluate proposals based upon received arguments. We present our negotiation rules, messages, and protocol and demonstrate how they interoperate in a simulation environment

    Cognitive Radio Network with a distributed control channel and quality-of-service solution

    Get PDF
    The proliferation of wireless access and applications to the Internet and the advent of a myriad of highly evolved portable communication devices; creates the need for an efficiently utilized radio spectrum. This is paramount in the licensed and unlicensed radio frequency bands, that spawn an exponential growth in Dynamic Spectrum Access (DSA) research, Cognitive Radio (CR) and Cognitive Radio Networks (CRN) research. DSA research has given way to the paradigm shift toward CR with its dynamic changes in transmission schemas. This paradigm shift from a fixed and centralized frequency spectrum environment has morphed into a dynamic and decentralized one. CR provides wireless nodes the capability to adapt and exploit the frequency spectrum. The spectrum information obtained is scanned and updated to determine the channel quality for viability and a utilization/availability by the licensed (primary) user. To take advantage of the CR capabilities, previous research has focused on a Common Control Channel(CCC) for the control signals to be used for spectrum control. This utilization generates channel saturation, extreme transmission overhead of control information, and a point of vulnerability. The traditional designs for wireless routing protocols do not support an ad hoc multi-hop cognitive radio network model. This research focuses on a real world implementation of a heterogeneous ad hoc multi-hop Cognitive Radio Network. An overall model, coined Emerald, has been designed to address the architecture; the Medium Access Control layer, E-MAC; and the network layer, E-NET. First, a Medium Access Control(MAC) layer protocol is provided to avoid the pitfalls of a common control channel. This new design provides CRNs with network topology and channel utilization information. Spectrum etiquette, in turn, addresses channel saturation, control overhead, and the single point of vulnerability. Secondly, a routing model is proposed that will address the efficiency of an ad hoc multi-hop CRN with a focus on the Quality-of-Service(QoS) of the point-to-point as well as end-to-end communication. This research has documented weaknesses in spectrum utilization; it has been expanded to accommodate a distributed control environment. Subsets of the model will be validated through Network Simulator-2(NS/2) and MatLab© simulations to determine point-to-point and end-to-end communications

    Fully Distributed Channel-Hopping Algorithms for Rendezvous Setup in Cognitive Multiradio Networks

    Full text link
    • …
    corecore