Á¤º¸Ã³¸®ÇÐȸ ³í¹®Áö ÄÄÇ»ÅÍ ¹× Åë½Å½Ã½ºÅÛ
ÇѱÛÁ¦¸ñ(Korean Title) |
´ÜÀÏÈ© ¹«¼± ¾ÖµåȤ ³×Æ®¿öÅ©¿¡¼ ´Ü¼ø TDMA ½Ã½ºÅÛÀ» À§ÇÑ DESYNC ¾Ë°í¸®Áò °³¼± ¹æ¾È |
¿µ¹®Á¦¸ñ(English Title) |
An Enhanced DESYNC Scheme for Simple TDMA Systems in Single-Hop Wireless Ad-Hoc Networks |
ÀúÀÚ(Author) |
Çö»óÇö
ÀÌÁ¦À²
¾çµ¿¹Î
Sanghyun Hyun
Jeyul Lee
Dongmin Yang
|
¿ø¹®¼ö·Ïó(Citation) |
VOL 03 NO. 09 PP. 0293 ~ 0300 (2014. 09) |
Çѱ۳»¿ë (Korean Abstract) |
TDMA(Time Division Multiple Access)´Â ¹«¼± ³×Æ®¿öÅ©¿¡¼ ÇÑÁ¤µÈ ÁÖÆļö ´ë¿ªÀ» ÀÏÁ¤ÇÑ Å©±âÀÇ ½Ã°£ ´ÜÀ§ÀÎ ½½·ÔÀ¸·Î ºÐÇÒÇÏ°í »ç¿ëÀÚ°¡ ÇÒ´çµÈ ½½·ÔÀ» ÀÌ¿ëÇÏ¿© Åë½ÅÇÒ ¼ö Àִ ä³Î Á¢¼Ó ±â¼úÀÌ´Ù. TDMA¿¡ »ç¿ëµÇ´Â ±â¼ú¿¡ µû¶ó µ¿±â¿Í ºñµ¿±â ¹æ½ÄÀ¸·Î ³ª´ ¼ö ÀÖ´Ù. TDMAÀÇ µ¿±âÈ °úÁ¤Àº º¹ÀâÇÏ°í, Ãß°¡ Àåºñ°¡ ÇÊ¿äÇÒ ¼ö Àֱ⠶§¹®¿¡ ¼Ò±Ô¸ð ³×Æ®¿öÅ©¿¡ ÀûÇÕÇÏÁö ¾Ê´Ù. ¹Ý¸é, ºñµ¿±â ¹æ½ÄÀÇ DESYNC¿¡¼´Â Àü¿ª Ŭ·Ï(global clock)À̳ª ±â¹Ý ½Ã¼³ µµ¿ò ¾øÀÌ µ¿±âȸ¦ ÀÌ·ê ¼ö ÀÖ´Ù. ÇÏÁö¸¸ DESYNC´Â µ¿±âÈ ¿Ï·áÇÏ´Â µ¥ Á¦¹ý ½Ã°£ÀÌ °É¸®°í, ¼Ò¿äµÇ´Â ÃÖ´ë Áö¿¬ ½Ã°£ÀÌ ¾ó¸¶ÀÎÁö º¸ÀåÇÏÁö ¸øÇÑ´Ù. ±×·¡¼ º» ³í¹®¿¡¼´Â ¼Ò±Ô¸ð ³×Æ®¿öÅ©¿¡ ÀûÇÕÇÑ °æ·® µ¿±âÈ ±â¹ýÀÎ C-DESYNC¸¦ Á¦¾ÈÇÑ´Ù. C-DESYNC´Â Âü°¡ ÇÏ´Â ³ëµåÀÇ Áֱ⠽ÃÀÛ Á¤º¸¸¦ °¡Áö°í Àִ ɧɰ (Global Packet) ½ÅÈ£¿Í ³ëµåµéÀÇ firing °³¼ö¸¦ ÀÌ¿ëÇÏ¿© ³ëµåÀÇ °³¼ö¸¦ ÆľÇÇÏ°í, ÀÌ Á¤º¸¸¦ ÀÌ¿ëÇÏ¿© µ¿±âȸ¦ ÀÌ·é´Ù. Á¦½ÃÇÏ´Â ¾Ë°í¸®ÁòÀº ±âÁ¸ÀÇ µ¿±âÈ ¹æ½ÄÀÇ TDMA ±â¹ý¿¡ ºñÇØ °£´ÜÇÏ¿© ºñ¿ë Ãø¸é¿¡¼µµ È¿À²ÀûÀ̸ç, µ¿±âÈ ¿Ï·á½Ã±îÁö °É¸®´Â ÃÖ´ë Áö¿¬½Ã°£À» º¸ÀåÇÑ´Ù. ½Ã¹Ä·¹ÀÌ¼Ç °á°ú¸¦ ÅëÇؼ C-DESYNC´Â Âü°¡ ³ëµå °³¼ö¿¡ °ü°è¾øÀÌ ¿ÀÁ÷ 3 Áֱ⠳»¿¡ µ¿±âÈ ¿Ï·á¸¦ º¸ÀåÇÏ´Â °ÍÀ» º¸¿©ÁØ´Ù.
|
¿µ¹®³»¿ë (English Abstract) |
TDMA(Time Division Multiple Access) is a channel access scheme for shared medium networks. The shared frequency is divided into multiple time slots, some of which are assigned to a user for communication. Techniques for TDMA can be categorized into two classes: synchronous and asynchronous. Synchronization is not suitable for small scale networks because it is complicated and requires additional equipments. In contrast, in DESYNC, a biologically-inspired algorithm, the synchronization can be easily achieved without a global clock or other infrastructure overhead. However, DESYNC spends a great deal of time to complete synchronization and does not guarantee the maximum time to synch completion. In this paper, we propose a lightweight synchronization scheme, C-DESYNC, which counts the number of participating nodes with ɧɰ (Global Packet) signal including the information about the starting time of a period. The proposed algorithm is mush simpler than the existing synchronization TDMA techniques in terms of cost-effective method and guarantees the maximum time to synch completion. Our simulation results show that C-DESYNC guarantees the completion of the synchronization process within only 3 periods regardless of the number of nodes.
|
Å°¿öµå(Keyword) |
DESYNC
TDMA
¾ÖµåȤ³×Æ®¿öÅ©
¼¾¼³×Æ®¿öÅ©
DESYNC
TDMA
Ad-Hoc Network
Sensor Network
|
ÆÄÀÏ÷ºÎ |
PDF ´Ù¿î·Îµå
|