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


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 .

Download full-text


Available from: Neeraj Mittal
  • Source
    • "S U T R W V X timeslots. For as many as Y ` 4 nodes 1 and a 4 channels [13] "
    [Show abstract] [Hide abstract]
    ABSTRACT: In a cognitive radio (CR) network, MAC-layer configuration involves determining a common set of channels to facilitate communication among participating nodes. Further, the availability of multiple channels and frequent channel switches add to the complexity of route selection. Knowledge of the global network topology can be used to solve the above-described problems. In this paper, we propose a distributed algorithm for gathering global network topology information for a CR network. We outline approaches that utilize the gathered topology information for MAC-layer configuration and efficient routing of packets. In addition, situation awareness is achieved by sharing the physical location information among the nodes in the network. The proposed algorithm determines the global network topology in O(N<sup>2 </sup>) timeslots, where N is the maximum number of nodes deployed. With 80 available channels for communication, the algorithm terminates within 0.8 second
    Full-text · Conference Paper · Nov 2005
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Except where reference is made to the work of others, the work described in this thesis is my own or was done in collaboration with my advisory committee. This thesis does not include proprietary or classified information.
    Preview · Article ·
  • [Show abstract] [Hide abstract]
    ABSTRACT: Cognitive radios (CR) have the ability to dynamically adapt to local spectrum availability. In a multi-hop wireless network comprised of CR-enabled devices, medium access control (MAC) layer scheduling for data communication involves assignment of timeslots and channels to either links or nodes in the network. The number of channels available and the channel identities vary from one node to another within the CR network. This is in contrast to the existing use of multiple channels where all the nodes have the same set of channels available (for example in IEEE 802.11 networks). In this paper, we present an integer linear programming (ILP) formulation for the MAC-layer scheduling problem and find an optimal schedule. We also propose a simple and efficient distributed heuristic for MAC-layer scheduling. Simulation results indicate that the proposed distributed heuristic provides near optimal schedule
    No preview · Conference Paper · Jan 2006
Show more