• Àüü
  • ÀüÀÚ/Àü±â
  • Åë½Å
  • ÄÄÇ»ÅÍ
´Ý±â

»çÀÌÆ®¸Ê

Loading..

Please wait....

±¹³» ³í¹®Áö

Ȩ Ȩ > ¿¬±¸¹®Çå > ±¹³» ³í¹®Áö > Çѱ¹Á¤º¸Åë½ÅÇÐȸ ³í¹®Áö (Journal of the Korea Institute of Information and Communication Engineering)

Çѱ¹Á¤º¸Åë½ÅÇÐȸ ³í¹®Áö (Journal of the Korea Institute of Information and Communication Engineering)

Current Result Document :

ÇѱÛÁ¦¸ñ(Korean Title) ¹«¼± ¾ÖµåȤ ³×Æ®¿öÅ©¿¡¼­ ³ëµåºÐ¸® °æ·Î¹®Á¦¸¦ À§ÇÑ °­È­ÇнÀ
¿µ¹®Á¦¸ñ(English Title) Reinforcement Learning for Node-disjoint Path Problem in Wireless Ad-hoc Networks
ÀúÀÚ(Author) Àå±æ¿õ   Kil-woong Jang  
¿ø¹®¼ö·Ïó(Citation) VOL 23 NO. 08 PP. 1011 ~ 1017 (2019. 08)
Çѱ۳»¿ë
(Korean Abstract)
º» ³í¹®Àº ¹«¼± ¾ÖµåȤ ³×Æ®¿öÅ©¿¡¼­ ½Å·Ú¼ºÀÌ º¸ÀåµÇ´Â µ¥ÀÌÅÍ Àü¼ÛÀ» À§ÇØ ´ÙÁß °æ·Î¸¦ ¼³Á¤ÇÏ´Â ³ëµåºÐ¸® °æ·Î¹®Á¦¸¦ ÇØ°áÇϱâ À§ÇÑ °­È­ÇнÀÀ» Á¦¾ÈÇÑ´Ù. ³ëµåºÐ¸® °æ·Î¹®Á¦´Â ¼Ò½º¿Í ¸ñÀûÁö»çÀÌ¿¡ Áß°£ ³ëµå°¡ Áߺ¹µÇÁö ¾Ê°Ô ´Ù¼öÀÇ °æ·Î¸¦ °áÁ¤ÇÏ´Â ¹®Á¦ÀÌ´Ù. º» ³í¹®¿¡¼­´Â ±â°èÇнÀ Áß ÇϳªÀÎ °­È­ÇнÀ¿¡¼­ Q-·¯´×À» »ç¿ëÇÏ¿© ³ëµåÀÇ ¼ö°¡ ¸¹Àº ´ë±Ô¸ðÀÇ ¹«¼± ¾ÖµåȤ ³×Æ®¿öÅ©¿¡¼­ Àü¼Û°Å¸®¸¦ °í·ÁÇÑ ÃÖÀûÈ­ ¹æ¹ýÀ» Á¦¾ÈÇÑ´Ù. ƯÈ÷ ´ë±Ô¸ðÀÇ ¹«¼± ¾ÖµåȤ ³×Æ®¿öÅ©¿¡¼­ ³ëµåºÐ¸® °æ·Î ¹®Á¦¸¦ ÇØ°áÇϱâ À§Çؼ­´Â ¸¹Àº °è»ê·®ÀÌ ¿ä±¸µÇÁö¸¸ Á¦¾ÈµÈ °­È­ÇнÀÀº È¿À²ÀûÀ¸·Î °æ·Î¸¦ ÇнÀÇÔÀ¸·Î½á ÀûÀýÇÑ °á°ú¸¦ µµÃâÇÑ´Ù. Á¦¾ÈµÈ °­È­ÇнÀÀÇ ¼º´ÉÀº 2°³ÀÇ ³ëµåºÐ¸®°æ·Î¸¦ ¼³Á¤Çϱâ À§ÇÑ Àü¼Û°Å¸® °üÁ¡¿¡¼­ Æò°¡µÇ¾úÀ¸¸ç, Æò°¡ °á°ú¿¡¼­ ±âÁ¸¿¡ Á¦¾ÈµÈ ½Ã¹Ä·¹ÀÌƼµå ¾î³Î¸µ°ú ºñ±³Æò°¡ÇÏ¿© Àü¼Û°Å¸®¸é¿¡¼­ ´õ ÁÁÀº ¼º´ÉÀ» º¸¿´´Ù.
¿µ¹®³»¿ë
(English Abstract)
This paper proposes reinforcement learning to solve the node-disjoint path problem which establishes multipath for reliable data transmission in wireless ad-hoc networks. The node-disjoint path problem is a problem of determining a plurality of paths so that the intermediate nodes do not overlap between the source and the destination. In this paper, we propose an optimization method considering transmission distance in a large-scale wireless ad-hoc network using Q-learning in reinforcement learning, one of machine learning. Especially, in order to solve the node-disjoint path problem in a large-scale wireless ad-hoc network, a large amount of computation is required, but the proposed reinforcement learning efficiently obtains appropriate results by learning the path. The performance of the proposed reinforcement learning is evaluated from the viewpoint of transmission distance to establish two node-disjoint paths. From the evaluation results, it showed better performance in the transmission distance compared with the conventional simulated annealing.
Å°¿öµå(Keyword) ³ëµåºÐ¸® °æ·Î¹®Á¦   °­È­ÇнÀ   Q-·¯´×   ¹«¼± ¾ÖµåȤ ³×Æ®¿öÅ©   Node-disjoint path problem   reinforcement learning   Q-learning   wireless ad-hoc networks  
ÆÄÀÏ÷ºÎ PDF ´Ù¿î·Îµå