Evaluation of Dynamic Channel and Power Assignment for Cognitive Networks

Authors:
Juan D. Deaton;Syed A. Ahmad;Umesh Shukla;Ryan E. Irwin;Luiz A. Dasilva;Allen B. Mackenzie
Affiliations:
Virginia Polytechnic Institute and State University, Blacksburg, USA and Idaho National Laboratory, Idaho Falls, USA;Virginia Polytechnic Institute and State University, Blacksburg, USA;Virginia Polytechnic Institute and State University, Blacksburg, USA;Virginia Polytechnic Institute and State University, Blacksburg, USA;Virginia Polytechnic Institute and State University, Blacksburg, USA and CTVR, Trinity College Dublin, Dublin, Ireland;Virginia Polytechnic Institute and State University, Blacksburg, USA
Venue:
Wireless Personal Communications: An International Journal
Year:
2012

Citing 4
Cited 0

The algorithm design manual

The algorithm design manual
Joint scheduling and power control for wireless ad hoc networks

IEEE Transactions on Wireless Communications
Cognitive networks: adaptation and learning to achieve end-to-end performance objectives

IEEE Communications Magazine
Reducing call dropping in distributed dynamic channel assignment algorithms by incorporating power control in wireless ad hoc networks

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we develop a unifying optimization formulation to describe the Dynamic Channel and Power Assignment (DCPA) problem and an evaluation method for comparing DCPA algorithms. DCPA refers to the allocation of transmit power and frequency channels to links in a cognitive network so as to maximize the total number of feasible links while minimizing the aggregate transmit power. We apply our evaluation method to five representative DPCA algorithms proposed in the literature. This comparison illustrates the tradeoffs between control modes (centralized versus distributed) and channel/power assignment techniques. We estimate the complexity of each algorithm. Through simulations, we evaluate the effectiveness of the algorithms in achieving feasible link allocations in the network, and their power efficiency. Our results indicate that, when few channels are available, the effectiveness of all algorithms is comparable and thus the one with smallest complexity should be selected. The Least Interfering Channel and Iterative Power Assignment algorithm does not require cross-link gain information, has the overall lowest run time, and achieves the highest feasibility ratio of all the distributed algorithms; however, this comes at a cost of higher average power per link.