ROSA: Distributed Joint Routing and Dynamic Spectrum Allocation in Cognitive Radio Ad Hoc Networks
Abstract
Throughput maximization is one of the main challenges in cognitive radio ad hoc networks, where local spectrum resources may change from time to time and hop-by-hop. For this reason, a cross-layer opportunistic spectrum access and dynamic routing algorithm for cognitive radio networks is proposed, called ROSA (ROuting and Spectrum Allocation algorithm). Through local control actions, ROSA aims at maximizing the network throughput by performing joint routing, dynamic spectrum allocation, scheduling, and transmit power control. Specifically, the algorithm dynamically allocates spectrum resources to maximize the capacity of links without generating harmful interference to other users while guaranteeing bounded BER for the receiver. In addition, the algorithm aims at maximizing the weighted sum of differential backlogs to stabilize the system by giving priority to higher-capacity links with high differential backlog. The proposed algorithm is distributed, computationally efficient, and with bounded BER guarantees. ROSA is shown through discrete-event packet-level simulations to outperform baseline solutions leading to a high throughput, low delay, and fair bandwidth allocation.
Document Details
- Document Type
- Technical Report
- Publication Date
- Mar 01, 2010
- Accession Number
- ADA517383
Entities
People
- Lei Ding
- Michael J. Medley
- Stella N. Batalama
- Tommaso Melodia
Organizations
- University at Buffalo