Conference Paper

Time-Efficient Layer-2 Auto-Configuration for Cognitive Radios.

Conference: International Conference on Parallel and Distributed Computing Systems, PDCS 2005, November 14-16, 2005, Phoenix, AZ, USA
Source: DBLP

ABSTRACT timeslots, where is the maximum number of nodes deployed, is the maximum number of available channels for communication and is the diameter of the network. Assuming all nodes are aware of and , we present both diameter-aware and diameter-unaware versions of the algorithm. For highly sparse networks like linear chain topology where , with and , the diameter- aware conguration protocol terminates within and the diameter-unaware version terminates within .

0 Bookmarks
 · 
81 Views
  • [Show abstract] [Hide abstract]
    ABSTRACT: In multi-hop cognitive radio networks, the communication links among the cognitive nodes fail easily with the dynamic appearances of the licensed users. We propose an approach to compute the weight of the available channels intersections. The cognitive nodes compare the weights of different routing paths and update the route-table to reduce the re-routing times caused by the network changing, in order to reduce packet loss rate in cognitive radio networks. Simulation results show that in a multi-hop cognitive radio network with frequent change of the licensed users and uneven distribution of the available spectrum, our protocol provides less packet loss rate in the communication channels and proper overhead in the control channel. KeywordsCognitive Radio Network-Routing Protocol-Spectrum Assignment-Packet Loss Rate-Overhead
    12/2009: pages 190-201;
  • [Show abstract] [Hide abstract]
    ABSTRACT: In multi-hop single transceiver Cognitive Radio networks (MSCRN), routing becomes of great challenge when IEEE 802.11 DCF is used as the MAC protocol. Routing should not base on common control channel because it is not ensured that common control channel can be obtained by each node. In this paper, we propose a spectrum aware on-demand routing which doesn't base on control channel. A channel assignment algorithm aimed at improving link utilization is derived from delay-analysis. The overhead and gain by switching are balanced in this algorithm. For deafness problem caused by switching can result in significant performance degradation, constraints to avoid the appearance of deafness in channel assignment process are given. We stress that our approach can be easily implemented for the using of standard IEEE 802.11DCF. Results of simulation show that, our approach can well fit MSCRN and improve the network throughput comparing to the same network scenario without cognitive ability.
    Cognitive Radio Oriented Wireless Networks and Communications, 2008. CrownCom 2008. 3rd International Conference on; 06/2008
  • [Show abstract] [Hide abstract]
    ABSTRACT: This paper proposes a strategy for medium access control (MAC) layer to assign timeslots and available licensed channels efficiently and fairly to unlicensed users with heterogeneous types of services. First, the concept of service coefficient is built on various service models which determines the priority of timeslots assignment. Then, the optimal channel scheduling is obtained based on maximizing the total spectrum efficiency using integer linear programming (ILP) formulation. The main contribution of this paper is that the design of MAC-layer scheduling takes user-level analysis into consideration.
    Wireless Communications, Networking and Mobile Computing, 2009. WiCom '09. 5th International Conference on; 10/2009

Full-text (2 Sources)

View
20 Downloads
Available from
Jun 4, 2014