33,733 research outputs found

    Spectrum handoff management in cognitive hetnet systems overlaid with femtocells

    Get PDF
    Cognitive radio networks can facilitate seamless mobility to users considering their effective use of the dynamic spectrum access. This is performed by proactive/reactive adaptation of transmission operations in response to the wireless environment changes. One of these operations includes handoff between various wireless domains. The handoff here is not just a registration with a new base station, but it is also a negotiation to get access to the available channels locally in coexistence with the primary users. This dynamic adaptation between channels, known as spectrum handoff (SH), significantly impacts the time of handoff reconnection, which raises many questions about the functioning of the cognitive radio solution in the next generation of network systems. Therefore, it is necessary to develop a new method for roaming mobile users, particularly networks that employ small cells such as femtocells in order to reduce the unnecessary channel adaptations. This paper proposes a new entity, namely, channel assigning agent for managing SH, operator database, and channel access authentication. The goal of this mechanism is to retain the same channel used by a mobile user whenever possible to improve network performance by reducing the unnecessary SHs. The modeling and efficiency of the proposed scheme are validated through simulation results. The proposed solution improves the accessibility of resources and stability ofmobile radio connections that benefits mobile users as well as operators

    A Taxonomy for Congestion Control Algorithms in Vehicular Ad Hoc Networks

    Full text link
    One of the main criteria in Vehicular Ad hoc Networks (VANETs) that has attracted the researchers' consideration is congestion control. Accordingly, many algorithms have been proposed to alleviate the congestion problem, although it is hard to find an appropriate algorithm for applications and safety messages among them. Safety messages encompass beacons and event-driven messages. Delay and reliability are essential requirements for event-driven messages. In crowded networks where beacon messages are broadcasted at a high number of frequencies by many vehicles, the Control Channel (CCH), which used for beacons sending, will be easily congested. On the other hand, to guarantee the reliability and timely delivery of event-driven messages, having a congestion free control channel is a necessity. Thus, consideration of this study is given to find a solution for the congestion problem in VANETs by taking a comprehensive look at the existent congestion control algorithms. In addition, the taxonomy for congestion control algorithms in VANETs is presented based on three classes, namely, proactive, reactive and hybrid. Finally, we have found the criteria in which fulfill prerequisite of a good congestion control algorithm

    Adaptive Frequency Hopping Algorithms for Multicast Rendezvous in DSA Networks

    Get PDF
    Abstract-Establishing communications in a dynamic spectrum access (DSA) network requires communicating nodes to "rendezvous" before transmitting their data packets. Frequency hopping (FH) provides an effective method for rendezvousing without relying on a predetermined control channel. FH rendezvous protocols have mainly targeted pairwise rendezvous, using fixed (non-adaptive) FH sequences and assuming a homogeneous spectrum environment, i.e., all nodes perceive the same spectrum opportunities. In this paper, we address these limitations by developing three multicast rendezvous algorithms: AMQFH, CMQFH, and nested-CMQFH. The three algorithms are intended for asynchronous spectrum-heterogeneous DSA networks. They provide different tradeoffs between speed and robustness to node compromise. We use the uniform k-arbiter and the Chinese remainder theorem (CRT) quorum systems to design our multicast rendezvous algorithms. We also design two "optimal" channel ordering mechanisms for channel sensing and assignment, one for AMQFH and the other for CMQFH and nested-CMQFH. Finally, we develop a proactive out-of-band sensing based dynamic FH (DFH) algorithm for online adaptation of the FH sequences used in the proposed rendezvous algorithms. Extensive simulations are used to evaluate our algorithms

    Spectrum sharing security and attacks in CRNs: a review

    Get PDF
    Cognitive Radio plays a major part in communication technology by resolving the shortage of the spectrum through usage of dynamic spectrum access and artificial intelligence characteristics. The element of spectrum sharing in cognitive radio is a fundament al approach in utilising free channels. Cooperatively communicating cognitive radio devices use the common control channel of the cognitive radio medium access control to achieve spectrum sharing. Thus, the common control channel and consequently spectrum sharing security are vital to ensuring security in the subsequent data communication among cognitive radio nodes. In addition to well known security problems in wireless networks, cognitive radio networks introduce new classes of security threats and challenges, such as licensed user emulation attacks in spectrum sensing and misbehaviours in the common control channel transactions, which degrade the overall network operation and performance. This review paper briefly presents the known threats and attacks in wireless networks before it looks into the concept of cognitive radio and its main functionality. The paper then mainly focuses on spectrum sharing security and its related challenges. Since spectrum sharing is enabled through usage of the common control channel, more attention is paid to the security of the common control channel by looking into its security threats as well as protection and detection mechanisms. Finally, the pros and cons as well as the comparisons of different CR - specific security mechanisms are presented with some open research issues and challenges
    corecore