Ȩ > ÀڷḶ´ç > ÀÚ·á°Ë»ö > Ç¥ÁØ
ÀÚ·á °Ë»ö°á°ú
Ç¥ÁØÁ¾·ù | Á¤º¸Åë½Å´ÜüǥÁØ(TTAS) | ||||||||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Ç¥ÁعøÈ£ | TTAK.KO-11.0151 | ±¸ Ç¥ÁعøÈ£ | |||||||||||||||
Á¦°³Á¤ÀÏ | 2012-12-21 | ÃÑ ÆäÀÌÁö | 20 | ||||||||||||||
ÇÑ±Û Ç¥Áظí | ´ë±Ô¸ð »çÀ̹ö-¹°¸® ½Ã½ºÅÛ(CPS)ÀÇ ¹«¼± ¸ÖƼȩ µ¥ÀÌÅÍ Åë½Å ¿ä±¸ »çÇ× | ||||||||||||||||
¿µ¹® Ç¥Áظí | Requirements for Wireless Multi-hop Data Communication in Large-scale CPS | ||||||||||||||||
ÇÑ±Û ³»¿ë¿ä¾à | º» Ç¥ÁØÀº µ¥ÀÌÅÍ ¼öÁýÀ» À§ÇØ Æ®¸® ÇüÅ·Π±¸¼ºµÈ ´ë±Ô¸ð ¹«¼± ¸ÖƼȩ ³×Æ®¿öÅ©¿¡¼ ä³Î È¥ÀâÀ» ÇÇÇÏ°í µ¥ÀÌÅÍ Åë½ÅÀÇ ½Å·Ú¼ºÀ» È®º¸Çϱâ À§ÇÑ ¿ä±¸ »çÇ׿¡ °üÇÑ °ÍÀÌ´Ù. ÀÌ ¶§ ¹«¼± ¸ÖƼȩ ³×Æ®¿öÅ©¶õ ¼Ò¼öÀÇ ¹éº» ¶ó¿ìÅÍ(·çÆ® µð¹ÙÀ̽º ȤÀº ½ÌÅ© ³ëµå)µé·Î ³×Æ®¿öÅ©¿¡¼ ¹ß»ýÇÑ µ¥ÀÌÅͰ¡ ¼öÁýµÇ´Â Æ®¸® ÇüÅÂÀÇ ³×Æ®¿öÅ©¸¦ ¸»Çϸç, ÈçÈ÷ ¸»ÇÏ´Â ¼¾¼ ³×Æ®¿öÅ©°¡ ÀÌ¿¡ ¼ÓÇÑ´Ù. ÀÌ·¯ÇÑ ´ë±Ô¸ð ¹«¼±¸Á¿¡¼ CMSA/CA ±â¹ýÀ» »ç¿ëÇØ µð¹ÙÀ̽º °£ Åë½ÅÀ» ÇÏ´Â °æ¿ì, Àº´ÐµÈ ³ëµå ¹®Á¦(Hidden Node Problem)·Î ÀÎÇÏ¿© Åë½Å ½Å·Ú¼ºÀÌ ¸Å¿ì ³·¾ÆÁö°Ô µÈ´Ù. º» Ç¥ÁØÀº ÀÌ·¯ÇÑ ¹®Á¦Á¡À» ÇØ°áÇϰí Åë½Å ½Å·Ú¼ºÀ» ³ôÀ̱â À§ÇØ ¿ä±¸µÇ´Â »çÇ׵鿡 ´ëÇÑ °ÍÀÌ´Ù. | ||||||||||||||||
¿µ¹® ³»¿ë¿ä¾à | A sensor network which is one of typical wireless multi-hop network has a tree network topology, which consists of a lot of general devices producing data and a few back-bone routers (root devices or sink nodes) gathering data from general devices. In this network, Hidden node problem lowers the reliability of data communication seriously even if CSMA/CA algorithm is adapted because each device has many neighborhoods. This standard provides requirements to prohibit channel congestion and to acquire high-reliability for data communication in wireless multi-hop networks. | ||||||||||||||||
°ü·Ã IPR È®¾à¼ | Á¢¼öµÈ IPR È®¾à¼ ¾øÀ½ | ||||||||||||||||
°ü·ÃÆÄÀÏ |
![]() |
||||||||||||||||
Ç¥ÁØÀÌ·Â |
|
||||||||||||||||
Ç¥ÁØÀ¯Áöº¸¼öÀÌ·Â |
|