Learning for robust routing based on stochastic game in cognitive radio networks
This paper studies the problem of robust spectrum-aware routing in a multi-hop, multi-channel Cognitive Radio Network (CRN) with the presence of malicious nodes in the secondary network. The proposed routing scheme models the interaction among the Secondary Users (SUs) as a stochastic game. By allow...
Saved in:
Main Authors: | , , , |
---|---|
Other Authors: | |
Format: | Article |
Language: | English |
Published: |
2020
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/141281 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
id |
sg-ntu-dr.10356-141281 |
---|---|
record_format |
dspace |
spelling |
sg-ntu-dr.10356-1412812020-06-05T08:06:07Z Learning for robust routing based on stochastic game in cognitive radio networks Wang, Wenbo Kwasinski, Andres Niyato, Dusit Han, Zhu School of Computer Science and Engineering Computer Science - Networking and Internet Architecture Computer Science - Networking and Internet Architecture Engineering::Computer science and engineering Cognitive Radio Networks Spectrum-aware Routing This paper studies the problem of robust spectrum-aware routing in a multi-hop, multi-channel Cognitive Radio Network (CRN) with the presence of malicious nodes in the secondary network. The proposed routing scheme models the interaction among the Secondary Users (SUs) as a stochastic game. By allowing the backward propagation of the path utility information from the next-hop nodes, the stochastic routing game is decomposed into a series of stage games. The best-response policies are learned through the process of smooth fictitious play, which is guaranteed to converge without flooding of the information about the local utilities and behaviors. To address the problem of mixed insider attacks with both routing-toward-primary and sink-hole attacks, the trustworthiness of the neighbor nodes is evaluated through a multi-arm bandit process for each SU. The simulation results show that the proposed routing algorithm is able to enforce the cooperation of the malicious SUs and reduce the negative impact of the attacks on the routing selection process. MOE (Min. of Education, S’pore) 2020-06-05T08:06:07Z 2020-06-05T08:06:07Z 2018 Journal Article Wang, W., Kwasinski, A., Niyato, D., & Han, Z. (2018). Learning for robust routing based on stochastic game in cognitive radio networks. IEEE Transactions on Communications, 66(6), 2588-2602. doi:10.1109/TCOMM.2018.2799616 0090-6778 https://hdl.handle.net/10356/141281 10.1109/TCOMM.2018.2799616 2-s2.0-85041423861 6 66 2588 2602 en IEEE Transactions on Communications © 2018 IEEE. All rights reserved. |
institution |
Nanyang Technological University |
building |
NTU Library |
country |
Singapore |
collection |
DR-NTU |
language |
English |
topic |
Computer Science - Networking and Internet Architecture Computer Science - Networking and Internet Architecture Engineering::Computer science and engineering Cognitive Radio Networks Spectrum-aware Routing |
spellingShingle |
Computer Science - Networking and Internet Architecture Computer Science - Networking and Internet Architecture Engineering::Computer science and engineering Cognitive Radio Networks Spectrum-aware Routing Wang, Wenbo Kwasinski, Andres Niyato, Dusit Han, Zhu Learning for robust routing based on stochastic game in cognitive radio networks |
description |
This paper studies the problem of robust spectrum-aware routing in a multi-hop, multi-channel Cognitive Radio Network (CRN) with the presence of malicious nodes in the secondary network. The proposed routing scheme models the interaction among the Secondary Users (SUs) as a stochastic game. By allowing the backward propagation of the path utility information from the next-hop nodes, the stochastic routing game is decomposed into a series of stage games. The best-response policies are learned through the process of smooth fictitious play, which is guaranteed to converge without flooding of the information about the local utilities and behaviors. To address the problem of mixed insider attacks with both routing-toward-primary and sink-hole attacks, the trustworthiness of the neighbor nodes is evaluated through a multi-arm bandit process for each SU. The simulation results show that the proposed routing algorithm is able to enforce the cooperation of the malicious SUs and reduce the negative impact of the attacks on the routing selection process. |
author2 |
School of Computer Science and Engineering |
author_facet |
School of Computer Science and Engineering Wang, Wenbo Kwasinski, Andres Niyato, Dusit Han, Zhu |
format |
Article |
author |
Wang, Wenbo Kwasinski, Andres Niyato, Dusit Han, Zhu |
author_sort |
Wang, Wenbo |
title |
Learning for robust routing based on stochastic game in cognitive radio networks |
title_short |
Learning for robust routing based on stochastic game in cognitive radio networks |
title_full |
Learning for robust routing based on stochastic game in cognitive radio networks |
title_fullStr |
Learning for robust routing based on stochastic game in cognitive radio networks |
title_full_unstemmed |
Learning for robust routing based on stochastic game in cognitive radio networks |
title_sort |
learning for robust routing based on stochastic game in cognitive radio networks |
publishDate |
2020 |
url |
https://hdl.handle.net/10356/141281 |
_version_ |
1681057138052431872 |