Minimum-energy multicast tree in cognitive radio networks

Ren, Wei; Xiao, Xiangyang; Zhao, Qing

doi:10.1109/acssc.2009.5470092

Cited by 14 publications

(5 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The multicast routing scheme is clubbed with the allocated channel of multi-hop multicast CRN as presented in [20]. Multicast tree is employed for constructing minimum energy direct Steiner tree with the help of low-complexity approximation algorithm for CRN and the impact of primary network traffic load is evaluated to determine spectrum presence opportunities [21].…”

Section: Related Workmentioning

confidence: 99%

Performance analysis of multilayer multicast MANET CRN based on steiner minimal tree algorithm

Nadhim

Mahmood

2020

TELKOMNIKA

View full text Add to dashboard Cite

In this study, the multicast mobile ad hoc (MANET) CRN has been developed, which involves multi-hop and multilayer consideration and Steiner minimal tree (SMT) algorithm is employed as the router protocol. To enhance the network performance with regards to throughput and packet delivery rate (PDR), as channel assignment scheme, the probability of success (POS) is employed that accounts for the channel availability and the time needed for transmission when selecting the best channel from the numerous available channels for data transmission from the source to all destinations nodes effectively. Within Rayleigh fading channels under various network parameters, a comparison is done for the performance of SMT multicast (MANET) CRN with POS scheme versus maximum data rate (MDR), maximum average spectrum availability (MASA) and random channel assignment schemes. Based on the simulation results, the SMT multicast (MANET) CRN with POS scheme was seen to demonstrate the best performance versus other schemes. Also, the results proved that the throughput and PDR performance are improved as the number the primary channels and the channel's bandwidth increased while dropped as the value of packet size D increased. The network's performance grew with rise in the value of idle probability (𝑃 𝐼 ) since the primary user's (PU) traffic load is low when the value of 𝑃 𝐼 is high.

show abstract

Section: Related Workmentioning

confidence: 99%

Performance analysis of multilayer multicast MANET CRN based on steiner minimal tree algorithm

Nadhim

Mahmood

2020

TELKOMNIKA

View full text Add to dashboard Cite

show abstract

“…The results show that a significant amount of gain is achieved in reducing the overall multicast time, hence increasing the throughput. In [20], problem of minimum energy multicast tree construction is studied. The multicast problem is transformed into a directed Steiner tree problem and an approximation algorithm is proposed for this problem.…”

Section: B Multicast Routing Protocols In Crnsmentioning

confidence: 99%

Learning automata based multipath multicasting in cognitive radio networks

2015

View full text Add to dashboard Cite

Cognitive radio networks (CRNs) have emerged as a promising solution to the problem of spectrum under utilization and artificial radio spectrum scarcity. The paradigm of dynamic spectrum access allows a secondary network comprising of secondary users (SUs) to coexist with a primary network comprising of licensed primary users (PUs) subject to the condition that SUs do not cause any interference to the primary network. Since it is necessary for SUs to avoid any interference to the primary network, PU activity precludes attempts of SUs to access the licensed spectrum and forces frequent channel switching for SUs. This dynamic nature of CRNs, coupled with the possibility that an SU may not share a common channel with all its neighbors, makes the task of multicast routing especially challenging. In this work, we have proposed a novel multipath on-demand multicast routing protocol for CRNs. The approach of multipath routing, although commonly used in unicast routing, has not been explored for multicasting earlier. Motivated by the fact that CRNs have highly dynamic conditions, whose parameters are often unknown, the multicast routing problem is modeled in the reinforcement learning based framework of learning automata. Simulation results demonstrate that the approach of multipath multicasting is feasible, with our proposed protocol showing a superior performance to a baseline stateof-the-art CRN multicasting protocol.

show abstract

“…Multicast for CR networks has been an active topic recently . In , the authors investigated the problem of video multicast in CR networks and aimed to achieve fairness and good video quality.…”

Section: Related Workmentioning

confidence: 99%

“…In , the authors proposed a multicast scheduling protocol for CR networks by using the techniques of power control, cooperative communication, and network coding. In , the problem of energy consumption of multicast in CR networks was discussed. The authors considered the energy used for both channel sensing and data transmission and proposed an approximation algorithm to find a minimum energy multicast tree.…”

Section: Related Workmentioning

confidence: 99%

QoS multicast routing in cognitive radio ad hoc networks

Xie

Jia

Zhou

2011

Int J Communication

View full text Add to dashboard Cite

SUMMARYIn 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.

show abstract

Minimum-energy multicast tree in cognitive radio networks

Cited by 14 publications

References 12 publications

Performance analysis of multilayer multicast MANET CRN based on steiner minimal tree algorithm

Performance analysis of multilayer multicast MANET CRN based on steiner minimal tree algorithm

Learning automata based multipath multicasting in cognitive radio networks

QoS multicast routing in cognitive radio ad hoc networks

Contact Info

Product

Resources

About