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

»çÀÌÆ®¸Ê

Loading..

Please wait....

±¹³» ³í¹®Áö

Ȩ Ȩ > ¿¬±¸¹®Çå > ±¹³» ³í¹®Áö > Çѱ¹Á¤º¸Ã³¸®ÇÐȸ ³í¹®Áö > Á¤º¸Ã³¸®ÇÐȸ ³í¹®Áö ÄÄÇ»ÅÍ ¹× Åë½Å½Ã½ºÅÛ

Á¤º¸Ã³¸®ÇÐȸ ³í¹®Áö ÄÄÇ»ÅÍ ¹× Åë½Å½Ã½ºÅÛ

Current Result Document :

ÇѱÛÁ¦¸ñ(Korean Title) Áö¿¬ °¨³» ³×Æ®¿öÅ©¿¡¼­ »çȸ°ü°è±â¹Ý ±âȸÀû ¶ó¿ìÆà ±â¹ý
¿µ¹®Á¦¸ñ(English Title) An Opportunistic Routing Scheme Based on Social Relations in Delay-Tolerant Networks
ÀúÀÚ(Author) ±èÂù¸í   °­Àμ®   ¿À¿µÁØ   ÇÑ¿¬Èñ   Chan-Myung Kim   In-Seok Kang   Young-Jun Oh   Youn-Hee Han  
¿ø¹®¼ö·Ïó(Citation) VOL 03 NO. 01 PP. 0015 ~ 0022 (2014. 01)
Çѱ۳»¿ë
(Korean Abstract)
Áö¿¬ °¨³» ³×Æ®¿öÅ©´Â Áö¼ÓÀûÀÎ ¿¬°áÀÌ º¸ÀåµÇÁö ¾Ê°í ÀúÀå(Store), ¿î¹Ý(Carry), Àü´Þ(Forward) ¹æ½ÄÀÇ ¸Þ½ÃÁö Àü´ÞÀ» »ç¿ë ÇÏ´Â ³×Æ®¿öÅ©ÀÌ´Ù. ÀÌ·¯ÇÑ Áö¿¬ °¨³» ³×Æ®¿öÅ©¿¡¼­ ¸Þ½ÃÁö Àü´ÞÀº Áß¿äÇÑ ¿¬±¸ À̽´À̸ç, ÃÖ±Ù ¸¹Àº ¶ó¿ìÆà ±â¹ýµéÀÌ Á¦¾ÈµÇ¾ú´Ù. º» ³í¹®¿¡¼­´Â ³ëµåµéÀÇ »çȸ°ü°è¿Í È®Àå ¸Å°³ Á߽ɵµ¸¦ ÀÌ¿ëÇÏ¿© È¿À²ÀûÀÎ Áö¿¬ °¨³» ³×Æ®¿öÅ©¿¡¼­ ¶ó¿ìÆà ±â¹ýÀ» Á¦¾ÈÇÑ´Ù. ½Ã¹Ä·¹ÀÌ¼Ç °á°ú¸¦ ÅëÇØ Epidemic routing, Friendship routing¿¡ ºñÇØ ÀûÀº ¸Þ½ÃÁö Àü´Þ ¼º°ø·üÂ÷À̸¦ À¯ÁöÇϸç, ¸Þ½ÃÁö Àü´Þ ºñ¿ë¿¡´Â È¿À²ÀûÀÓÀ» º¸ÀδÙ.
¿µ¹®³»¿ë
(English Abstract)
Delay-Tolerant Network employs message forwarding based on a Store, Carry and Forward method to conquer no guarantee of continue connectivity. For this reason, a lot of DTN routing scheme have been proposed recently. message forwarding is an important research issue in delay-tolerant network and In this paper, we propose a ef¤¤ficiency DTN routing scheme using node¡¯s social relation and expanded Ego-network betweenness centrality. Our simulation results show that it is more efficient to message delivery cost than Epidemic routing, Friendship routing while it has a little performance degradation of message delivery ratio.
Å°¿öµå(Keyword) Áö¿¬ °¨³» ³×Æ®¿öÅ©   »çȸ°ü°è¸Á   È®Àå ÀÚ¾Æ ³×Æ®¿öÅ©   Delay Tolerant Network   Social Network   Expanded Ego-Network  
ÆÄÀÏ÷ºÎ PDF ´Ù¿î·Îµå