Limits...
Reinforcement learning for routing in cognitive radio ad hoc networks.

Al-Rawi HA, Yau KL, Mohamad H, Ramli N, Hashim W - ScientificWorldJournal (2014)

Bottom Line: This paper applies RL in routing and investigates the effects of various features of RL (i.e., reward function, exploitation, and exploration, as well as learning rate) through simulation.New approaches and recommendations are proposed to enhance the features in order to improve the network performance brought about by RL to routing.Simulation results show that the RL parameters of the reward function, exploitation, and exploration, as well as learning rate, must be well regulated, and the new approaches proposed in this paper improves SUs' network performance without significantly jeopardizing PUs' network performance, specifically SUs' interference to PUs.

View Article: PubMed Central - PubMed

Affiliation: Department of Computer Science and Networked Systems, Sunway University, No. 5 Jalan Universiti, Bandar Sunway, 46150 Petaling Jaya, Selangor, Malaysia.

ABSTRACT
Cognitive radio (CR) enables unlicensed users (or secondary users, SUs) to sense for and exploit underutilized licensed spectrum owned by the licensed users (or primary users, PUs). Reinforcement learning (RL) is an artificial intelligence approach that enables a node to observe, learn, and make appropriate decisions on action selection in order to maximize network performance. Routing enables a source node to search for a least-cost route to its destination node. While there have been increasing efforts to enhance the traditional RL approach for routing in wireless networks, this research area remains largely unexplored in the domain of routing in CR networks. This paper applies RL in routing and investigates the effects of various features of RL (i.e., reward function, exploitation, and exploration, as well as learning rate) through simulation. New approaches and recommendations are proposed to enhance the features in order to improve the network performance brought about by RL to routing. Simulation results show that the RL parameters of the reward function, exploitation, and exploration, as well as learning rate, must be well regulated, and the new approaches proposed in this paper improves SUs' network performance without significantly jeopardizing PUs' network performance, specifically SUs' interference to PUs.

Show MeSH
SU packet loss for varying weight factor ω.
© Copyright Policy - open-access
Related In: Results  -  Collection


getmorefigures.php?uid=PMC4128325&req=5

fig8: SU packet loss for varying weight factor ω.

Mentions: Figure 8 shows that the SU packet loss increases with the weight factor ω of WCRQ-routing. The explanations leading to this circumstance are similar to those found in the investigation of SU end-to-end delay (see Section 4.3.2). Interestingly, Figure 8 shows that when weight factor is ω≅0.5, WCRQ-routing achieves the lowest packet loss. At ω = 0.5, a SU node i gives equal consideration to both link quality rti,j, which aims to avoid routes with higher PUs' activities in order to reduce SUs' backoff delays, and SU j's queue length qtj, both of which reduce the overflow of SUs' queues and SUs' packet loss.


Reinforcement learning for routing in cognitive radio ad hoc networks.

Al-Rawi HA, Yau KL, Mohamad H, Ramli N, Hashim W - ScientificWorldJournal (2014)

SU packet loss for varying weight factor ω.
© Copyright Policy - open-access
Related In: Results  -  Collection

Show All Figures
getmorefigures.php?uid=PMC4128325&req=5

fig8: SU packet loss for varying weight factor ω.
Mentions: Figure 8 shows that the SU packet loss increases with the weight factor ω of WCRQ-routing. The explanations leading to this circumstance are similar to those found in the investigation of SU end-to-end delay (see Section 4.3.2). Interestingly, Figure 8 shows that when weight factor is ω≅0.5, WCRQ-routing achieves the lowest packet loss. At ω = 0.5, a SU node i gives equal consideration to both link quality rti,j, which aims to avoid routes with higher PUs' activities in order to reduce SUs' backoff delays, and SU j's queue length qtj, both of which reduce the overflow of SUs' queues and SUs' packet loss.

Bottom Line: This paper applies RL in routing and investigates the effects of various features of RL (i.e., reward function, exploitation, and exploration, as well as learning rate) through simulation.New approaches and recommendations are proposed to enhance the features in order to improve the network performance brought about by RL to routing.Simulation results show that the RL parameters of the reward function, exploitation, and exploration, as well as learning rate, must be well regulated, and the new approaches proposed in this paper improves SUs' network performance without significantly jeopardizing PUs' network performance, specifically SUs' interference to PUs.

View Article: PubMed Central - PubMed

Affiliation: Department of Computer Science and Networked Systems, Sunway University, No. 5 Jalan Universiti, Bandar Sunway, 46150 Petaling Jaya, Selangor, Malaysia.

ABSTRACT
Cognitive radio (CR) enables unlicensed users (or secondary users, SUs) to sense for and exploit underutilized licensed spectrum owned by the licensed users (or primary users, PUs). Reinforcement learning (RL) is an artificial intelligence approach that enables a node to observe, learn, and make appropriate decisions on action selection in order to maximize network performance. Routing enables a source node to search for a least-cost route to its destination node. While there have been increasing efforts to enhance the traditional RL approach for routing in wireless networks, this research area remains largely unexplored in the domain of routing in CR networks. This paper applies RL in routing and investigates the effects of various features of RL (i.e., reward function, exploitation, and exploration, as well as learning rate) through simulation. New approaches and recommendations are proposed to enhance the features in order to improve the network performance brought about by RL to routing. Simulation results show that the RL parameters of the reward function, exploitation, and exploration, as well as learning rate, must be well regulated, and the new approaches proposed in this paper improves SUs' network performance without significantly jeopardizing PUs' network performance, specifically SUs' interference to PUs.

Show MeSH