Minimum-energy multicast tree in cognitive radio networks

Authors:
Wei Ren;Xiangyang Xiao;Qing Zhao
Affiliations:
Department of Electrical and Computer Engineering, University of California, Davis, CA;Department of Electrical and Computer Engineering, University of California, Davis, CA;Department of Electrical and Computer Engineering, University of California, Davis, CA
Venue:
Asilomar'09 Proceedings of the 43rd Asilomar conference on Signals, systems and computers
Year:
2009

Citing 5
Cited 2

Approximation algorithms for directed Steiner problems

Journal of Algorithms
Constructing minimum-energy broadcast trees in wireless ad hoc networks

Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Multicast over wireless networks

Communications of the ACM
Approximate Minimum-Energy Multicasting in Wireless Ad Hoc Networks

IEEE Transactions on Mobile Computing
Power control in cognitive radio networks: how to cross a multi-lane highway

IEEE Journal on Selected Areas in Communications - Special issue on stochastic geometry and random graphs for the analysis and designof wireless networks

QoS multicast routing in cognitive radio ad hoc networks

International Journal of Communication Systems
Secure Minimum-Energy Multicast Tree Based on Trust Mechanism for Cognitive Radio Networks

Wireless Personal Communications: An International Journal

Quantified Score

Hi-index	0.04

Visualization

Abstract

We address the multicast problem in cognitive radio networks, where secondary users exploit channels temporarily unused by primary users (i.e., spectrum opportunities). The existence of a communication link between two secondary users depends not only on the transmission power of the secondary transmitter and the distance between these two users, but also on the occurrence of spectrum opportunities. This dependency on the occurrence of spectrum opportunities complicates the construction of an efficient multicast tree in cognitive radio networks. By taking into account this dependency, we propose a low-complexity approximation algorithm with bounded performance guarantee for constructing the minimum-energy multicast tree, which transforms the multicast problem into a directed Steiner tree problem. We also demonstrate this dependency by studying the impact of the traffic load of the primary network on the minimum-energy multicast tree.