Relay Nodes Selection Using Reinforcement Learning

Haesik Kim, T. Fujii, K. Umebayashi
{"title":"Relay Nodes Selection Using Reinforcement Learning","authors":"Haesik Kim, T. Fujii, K. Umebayashi","doi":"10.1109/ICAIIC51459.2021.9415208","DOIUrl":null,"url":null,"abstract":"In IoT networks, the nodes work cooperatively. They receive data packets and re-transmit to the sink node (or fusion node) via multiple relay nodes. In order to reduce the loss of packets as well as power consumption, it is important to transmit data packet successfully and find an optimal path from source node to sink node. Relay node selection is one of key research challenges in IoT networks. The reinforcement learning (RL) deals with sequential decision making problem under uncertainty. The goal of sequential decision making problem is to select actions to maximize long term rewards. The RL has emerged as a powerful method for many different areas. In this paper, relay node selection problem in IoT networks with channel measurement data is formulated as a Markov decision process (MDP) problem. The relay node selection problem is solved using Q learning when a local channel measurement map is given. We find an optimal relay node selection path.","PeriodicalId":432977,"journal":{"name":"2021 International Conference on Artificial Intelligence in Information and Communication (ICAIIC)","volume":"89 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 International Conference on Artificial Intelligence in Information and Communication (ICAIIC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICAIIC51459.2021.9415208","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

In IoT networks, the nodes work cooperatively. They receive data packets and re-transmit to the sink node (or fusion node) via multiple relay nodes. In order to reduce the loss of packets as well as power consumption, it is important to transmit data packet successfully and find an optimal path from source node to sink node. Relay node selection is one of key research challenges in IoT networks. The reinforcement learning (RL) deals with sequential decision making problem under uncertainty. The goal of sequential decision making problem is to select actions to maximize long term rewards. The RL has emerged as a powerful method for many different areas. In this paper, relay node selection problem in IoT networks with channel measurement data is formulated as a Markov decision process (MDP) problem. The relay node selection problem is solved using Q learning when a local channel measurement map is given. We find an optimal relay node selection path.
使用强化学习的中继节点选择
在物联网网络中,节点协同工作。它们接收数据包并通过多个中继节点重新传输到汇聚节点(或融合节点)。为了减少数据包的丢失和功耗,成功传输数据包并找到从源节点到汇聚节点的最优路径是非常重要的。中继节点选择是物联网网络研究的关键挑战之一。强化学习(RL)研究的是不确定条件下的顺序决策问题。顺序决策问题的目标是选择行动以最大化长期回报。RL已成为许多不同领域的强大方法。本文将具有信道测量数据的物联网网络中继节点选择问题表述为马尔可夫决策过程(MDP)问题。在给定局部信道测量图的情况下,利用Q学习解决中继节点选择问题。找到了最优中继节点选择路径。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信