Tree-Based Broadcasting in Multihop Radio Networks
IEEE Transactions on Computers
Multicast routing for multimedia communication
IEEE/ACM Transactions on Networking (TON)
Energy Efficient Broadcast Routing in Static Ad Hoc Wireless Networks
IEEE Transactions on Mobile Computing
Approximating Optimal Multicast Trees in Wireless Multihop Networks
ISCC '05 Proceedings of the 10th IEEE Symposium on Computers and Communications
GMP: Distributed Geographic Multicast Routing in Wireless Sensor Networks
ICDCS '06 Proceedings of the 26th IEEE International Conference on Distributed Computing Systems
NeXt generation/dynamic spectrum access/cognitive radio wireless networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
Allocating dynamic time-spectrum blocks in cognitive radio networks
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
Energy efficient multicast routing in ad hoc wireless networks
Computer Communications
Optimal multicast multichannel routing in computer networks
Computer Communications
CRAHNs: Cognitive radio ad hoc networks
Ad Hoc Networks
Relay-assisted routing in cognitive radio networks
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Multicast scheduling with cooperation and network coding in cognitive radio networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
Minimum-energy multicast tree in cognitive radio networks
Asilomar'09 Proceedings of the 43rd Asilomar conference on Signals, systems and computers
CoCast: multicast mobile ad hoc networks using cognitive radio
MILCOM'09 Proceedings of the 28th IEEE conference on Military communications
| Hi-index | 0.00 |
In this paper, we discussed the issues of QoS multicast routing in cognitive radio ad hoc networks. The problem of our concern was: given a cognitive radio ad hoc network and a QoS multicast request, how to find a multicast tree so that the total bandwidth consumption of the multicast is minimized while the QoS requirements are met. We proposed two methods to solve it. One is a two-phase method. In this method, we first employed a minimal spanning tree-based algorithm to construct a multicast tree and then proposed a slot assignment algorithm to assign timeslots to the tree links such that the bandwidth consumption of the tree is minimized. The other is an integrated method that considers the multicast routing together with the slot assignment. Extensive simulations were conducted to show the performance of our proposed methods. Copyright © 2011 John Wiley & Sons, Ltd.