Abstract
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.
| Original language | English |
|---|---|
| Pages (from-to) | 30-46 |
| Journal | International Journal of Communication Systems |
| Volume | 25 |
| Issue number | 1 |
| DOIs | |
| Publication status | Published - Jan 2012 |
Research Keywords
- cognitive radio networks
- multicast routing
- QoS
- slot assignment