Minimal time broadcasting in cognitive radio networks

Authors:
Chanaka J. Liyana Arachchige;S. Venkatesan;R. Chandrasekaran;Neeraj Mittal
Affiliations:
Erik Jonsson School of Engineering and Computer Science, The University of Texas at Dallas, Richardson, TX;Erik Jonsson School of Engineering and Computer Science, The University of Texas at Dallas, Richardson, TX;Erik Jonsson School of Engineering and Computer Science, The University of Texas at Dallas, Richardson, TX;Erik Jonsson School of Engineering and Computer Science, The University of Texas at Dallas, Richardson, TX
Venue:
ICDCN'11 Proceedings of the 12th international conference on Distributed computing and networking
Year:
2011

Citing 4
Cited 1

Time-efficient distributed layer-2 auto-configuration for cognitive radio networks

Computer Networks: The International Journal of Computer and Telecommunications Networking
Optimal deterministic broadcasting in known topology radio networks

Distributed Computing
Time-efficient broadcasting in radio networks: a review

ICDCIT'07 Proceedings of the 4th international conference on Distributed computing and internet technology
Efficient broadcasting in multi-radio multi-channel and multi-hop wireless networks based on self-pruning

HPCC'07 Proceedings of the Third international conference on High Performance Computing and Communications

An efficient broadcasting scheme for cognitive radio ad hoc networks

Proceedings of the 4th International Conference on Cognitive Radio and Advanced Spectrum Management

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper addresses time-efficient broadcast scheduling problem in Cognitive Radio (CR) Networks. Cognitive Radio is a promising technology that enables the use of unused spectrum in an opportunistic manner. Because of the unique characteristics of CR technology, the broadcast scheduling problem in CR networks needs unique solutions. Even for single channel wireless networks, finding a minimum-length broadcast schedule is an NP-hard problem. In addition, the multi-channel nature of the CR networks, especially the non-uniform channel availability, makes it a more complex problem to solve. In this paper, we first present an Integer Linear Programming formulation (ILP) to determine the minimum broadcast schedule length for a CR network. We then present two heuristics to construct minimal length broadcast schedules. Comparison of optimal results (found by solving the ILP formulation) with the result of the heuristics through simulation shows that both heuristics produce schedules of either optimal or very closer to optimal lengths.