Brief announcement: synchronous distributed algorithms for node discovery and configuration in multi-channel cognitive radio networks

  • Authors:
  • Srinivasan Krishnamurthy;R. Chandrasekaran;Neeraj Mittal;S. Venkatesan

  • Affiliations:
  • School of Engr. and Comp. Science, The University of Texas at Dallas, Richardson, TX;School of Engr. and Comp. Science, The University of Texas at Dallas, Richardson, TX;School of Engr. and Comp. Science, The University of Texas at Dallas, Richardson, TX;School of Engr. and Comp. Science, The University of Texas at Dallas, Richardson, TX

  • Venue:
  • DISC'06 Proceedings of the 20th international conference on Distributed Computing
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

Cognitive Radios (CR) [4] enable flexible and improved radio spectrum utilization by allowing a group of CR nodes to utilize unused channels without interference with the channels' owners [1]. A CR node has a set of available (wireless) channels and this set varies with time, location and activities of the primary (licensed) users. Determining a node's neighborhood and common channels for communication is non-trivial. We propose several efficient distributed algorithms for node discovery and configuration (NDC) for various CR node models. Krishnamurthy et al. [3] proposed a solution for NDC without a control channel. In their model, each node has a single transceiver. If N is the maximum number of nodes and M is the maximum number of channels, their algorithm uses 2NM timeslots for NDC. Other works assume a common control channel, or every node is equipped with a separate radio interface for each channel or an identical frequency distribution at each node. Please see [2] for a thorough discussion of related work. Here, we extend the algorithms of [3] to other CR node models.