| Âê̾ | ¥ޥë¥ۥåץͥåȥ¥¯¤ˤª¤±¤ë̵ÀþÆó½ÅÄ̿®¤Υá¥ǥ£¥¢¥¢¥¯¥»¥¹¸æÊý¼°¤ˤĤ¤¤Æ |
| Ãø¼Ô | *¶ÌÃÖ ·òÂÀ (ÀŲ¬Âç³ØÂç³ر¡¾ðÊó³ظ¦µæ²Ê), Raptino H. Ari (ÀŲ¬Âç³ØÁϤ²ʳص»½ÑÂç³ر¡), ¿ù»³ ͤ²ð (ÀŲ¬Âç³ؾðÊó³ØÉô¾ðÊó²ʳزÊ), èßÂå ²í´õ (¾åÃÒÂç³ØÍý¹©³ØÉô¾ðÊóÍý¹©³زÊ), ±îÅÏ ½Ӳð (ÀŲ¬Âç³ØÂç³ر¡¾ðÊó³ظ¦µæ²Ê), ÅÏÊÕ ¾° (ÀŲ¬Âç³ØÁϤ²ʳص»½ÑÂç³ر¡) |
| Page | pp. 1766 - 1777 |
| Keyword | ̵ÀþÆó½ÅÄ̿®, ¥ޥë¥ۥåץͥåȥ¥¯, ¥á¥ǥ£¥¢¥¢¥¯¥»¥¹¸æ |
| Abstract | ¶áǯ¡¤Æó½ÅÄ̿®²Äǽ¤Ê̵ÀþÄ̿®µ¡¤¬¸¦µ泫ȯ¤µ¤ì¤Ƥ¤¤롥Æó½Å̵ÀþÄ̿®¤òÍøÍѤ¹¤뤳¤ȤÇ̵Àþ¥ã¥ͥë¤ÎÍøÍѸúΨ¤ò¸þ¾夵¤»¡¤¥ޥë¥ۥå×Ä̿®¤ˤª¤±¤륹¥롼¥ץåȤθþ¾夬²Äǽ¤Ǥ¢¤롥¤·¤«¤·¤ʤ¬¤顤½¾Íè¤Υá¥ǥ£¥¢¥¢¥¯¥»¥¹¸æ¡ÊMAC¡˥ץí¥ȥ³¥ë¤ǤÏÆó½ÅÄ̿®¤ε¡²ñ¤Ĥ±¤뤳¤ȤϤǤ¤ʤ¤¡¥¤½¤³¤ǡ¤ËܹƤǤϥޥë¥ۥåץͥåȥ¥¯¤ËÂбþ¤·¤¿Æó½ÅÄ̿®MAC¥ץí¥ȥ³¥ë MFD-MAC ¡ÊMulti-hop Full-Duplex MAC¡ˤòÄó°Ƥ¹¤롥MFD-MAC¤ϥޥë¥ۥåץͥåȥ¥¯´Ķ¤ˤª¤¤¤Ƽþ°ϤΥΡ¼¥ɤÎÄ̿®¾ò´ƻ뤹¤뤳¤Ȥǡ¤Æó½ÅÄ̿®¥ê¥¬ȯ¤¹¤ë¤褦¤˥Ρ¼¥ɤÎÁò¸椹¤ë¼êˡ¤Ǥ¢¤롥MFD-MAC¤Îͭ¸ú¤롼¥ץåȲòÀϡ¤·»µ¡¥·¥ߥå¥졼¥·¥ç¥ó¤ˤè¤꼨¤¹¡¥ |
| Âê̾ | ½žöÉä¹æ¤òÍѤ¤¤¿¥¢¥ɥۥ寥ͥåȥ¥¯MAC¥ץí¥ȥ³¥ë¤ˤĤ¤¤Æ |
| Ãø¼Ô | *ÀÄÌÚ ͦÂÀ, ±îÅÏ ½Ӳð (ÀŲ¬Âç³ؾðÊó³ظ¦µæ²Ê), èßÂå ²í´õ (¾åÃÒÂç³ØÍý¹©³ØÉô), ÅÏÊÕ ¾° (ÀŲ¬Âç³ØÁϤ²ʳص»½ÑÂç³ر¡) |
| Page | pp. 1778 - 1786 |
| Keyword | ½žöÉä¹æ, MAC, ÅÅÎϸæ, ¥¢¥ɥۥ寥ͥåȥ¥¯ |
| Abstract | ¥¢¥ɥۥ寥ͥåȥ¥¯¤ǤÏÂӰè¤θúΨŪÍøÍѤ¬½ÅÍפʲÝÂê¤Ǥ¢¤롥ÂӰè¤ò¸úΨŪ¤ËÍøÍѤ¹¤뵻½Ѥΰì¤ĤȤ·¤ƽžöÉä¹沽¤¬ÃíÌܤµ¤ì¤Ƥ¤¤롥½žöÉä¹沽¤ϰÌÁêÊÑĴ¤ò³Èĥ¤·¤¿Êý¼°¤ǡ¤°ì²ó¤ÎÁÇʣ¿ô¤ޤ¿¤ÏÆÃÄê¤ÎüËö¤˰ۤʤë¥ǡ¼¥¿¤òÁ¹¤뤳¤Ȥ¬¤Ǥ¤롥½¾Íè¤ÎÊý¼°¤ȰۤʤêÁǡ¼¥¿¤´¤ȤËÅÅÎϤò³äÅö¤Ƥ뤿¤áÁ÷¿®ÅÅÎϤθæ¤ò¹Ԥ¦ɬÍפ¬¤¢¤롥¤ޤ¿¡¤½žöÉä¹æ¤òÍøÍѤ·¤¿MAC ¤θ¦µ椬¿¤¯¤ʤµ¤ì¤Ƥ¤¤롥Ëܸ¦µæ¤Ǥϥ¢¥ɥۥ寥ͥåȥ¥¯¤˽žöÉä¹æ¤òŬÍѤ¹¤뤳¤Ȥˤè¤äơ¤¥¢¥ɥۥ寥ͥåȥ¥¯¤θúΨŪ¤ÊÂӰè¤ÎÍøÍѤò¥¤¹MAC ¥ץí¥ȥ³¥ë¤òÄó°Ƥ¹¤롥ËܹƤǤϡ¤¤ޤº¥磻¥ä¥쥹¥ͥåȥ¥¯¤δðËÜŪ¤ʥȥݥ¤ˤª¤±¤ë½žöÉä¹沽¤ÎÂÎÁü¤ò¤Ĥ«¤ߡ¤½žöÉä¹沽¤òÁÛÄꤷ¤¿̵ÀþLAN ¸þ¤±¥á¥ǥ£¥¢¥¢¥¯¥»¥¹¸æ¥ץí¥ȥ³¥ëTSPC-MAC¡ÊTraffic-aware Superposition Coding Media Access Control¡ˤòÄó°Ƥ·¡¤´ðËÜŪ¤ÊÄ̿®Êýˡ¤òÍѤ¤¤¿´ðÁÃɾ²ò¹Ԥ¦¡¥ |
| Âê̾ | »ظþ¥¢¥ó¥ƥʤòÍѤ¤¤¿Æó½Å̵ÀþMAC¥ץí¥ȥ³¥ë |
| Ãø¼Ô | *»°±º ·ò, èßÂå ²í´õ (¾åÃÒÂç³Ø) |
| Page | pp. 1787 - 1794 |
| Keyword | MAC¥ץí¥ȥ³¥ë, »ظþ¥¢¥ó¥ƥÊ, Æó½Å̵Àþ |
| Abstract | ËÜÏÀʸ¤ǤÏ,¥ޥë¥ۥåþ¤Υ¹¥롼¥ץåȸþ¾å¤Τ¿¤á,»ظþ¥¢¥ó¥ƥʤÈÆó½Å ̵ÀþÄ̿®¤Τ¿¤á¤ÎƱ´ü·¿ MAC ¥ץí¥ȥ³¥ë¤òÄó°Ƥ¹¤ë.Æó½Å̵ÀþÄ̿®¤ÏƱ°ì¥ã¥Í ¥ë¤ÇÁ÷¼òƱ»þ¤˽ÐÍè,¥ޥë¥ۥå×Ä̿®¤Ëͭ¸ú¤ȹͤ¨¤é¤ì¤뤬,ñ½ã¤˥ޥë¥ۥà ¥×Ä̿®¤ËÍѤ¤¤Ƥâ̵»ظþ¤ÇÄ̿®¤·¤Ƥ¤¤뤿¤á¾¥Ρ¼¥ɤؤδ³¾Ĥ¬Â礭¤¯,¥¹¥롼¥ץà ¥Ȥθþ¾夬´üÂԤǤ¤ʤ¤.°ìÊý¤ǻظþ¥¢¥ó¥ƥʤÏÆÃÄê¤ÎÊý¸þ¤˶¯¤¤ÅÅÇȤòȯ¤·,¤½ ¤ÎÊý¸þ°ʳ°¤Î¾¥Ρ¼¥ɤؤδ³¾Ĥ¬¸º¾¯¤¹¤ë.Äó°Ƥ¹¤ë MAC ¥ץí¥ȥ³¥ë¤ϻظþ¥¢ ¥ó¥ƥʤÈÆó½Å̵ÀþÄ̿®¤ÎξÊý¤òÍøÍѤ¹¤뤳¤ȤÇ,ľÀþ¥ȥݥ¤ˤª¤¤¤Æ¤ƤΥΡ¼ ¥ɤ¬Ʊ»þ¤ËÄ̿®²Äǽ¤Ȥʤê¥ޥë¥ۥåþ¤Υ¹¥롼¥ץåȤθþ¾夬¸«¹þ¤ޤì¤ë.Äó°Æ MAC ¥ץí¥ȥ³¥ë¤Îǽ¤ò·»µ¡¥·¥ߥå¥졼¥·¥ç¥ó¤Çɾ²·,ľÀþ¥ȥݥ¤ˤª¤¤¤Æ ¥ޥë¥ۥåþ¤Υ¨¥ó¥ɥġ¼¥¨¥ó¥ɤΥ¹¥롼¥ץåȤòºÇÂç¤Ç 114 ¥ѡ¼¥»¥ó¥Ȳþ¤Ǥ ¤뤳¤Ȥ¹. |
| Âê̾ | ¥»¥ͥåȥ¥¯Äã¾ÃÈñÅÅÎϲ½¤Τ¿¤á¤ÎS-MAC¥ץí¥ȥ³¥ëduty cycleºÇŬ²½¼êˡ |
| Ãø¼Ô | *Âç´ß ζ»Ê (Áá°ðÅÄÂç³ØÂç³ر¡ ´ð´´Íý¹©³ظ¦µæ²Ê ¾ðÊóÍý¹©³ØÀ칶), Ìø߷ , ¸ÍÀî ˾ (Áá°ðÅÄÂç³ر¡ ´ð´´Íý¹©³ظ¦µæ²Ê ¾ðÊóÍý¹©³ØÀ칶) |
| Page | pp. 1795 - 1801 |
| Keyword | ¥»¥ͥåȥ¥¯, ¥ץí¥ȥ³¥ë, duty cycle, ¾ÃÈñÅÅÎÏ, ¥¥塼 |
| Abstract | ¸½ºߡ¤¥æ¥ӥ¥¿¥¹¥ͥåȥ¥¯¤μ¸½¤ˤª¤¤¤ƥ»¥ͥåȥ¥¯¤Ϸ礫¤»¤ʤ¤µ»½Ѥΰì¤ĤǤ¢¤롥¥»¥ͥåȥ¥¯¤Ï̵Àþ¥¢¥ɥۥå¯Ä̿®¤ÎÆÃħ¤ò³褫¤·´Ķ¥â¥˥¿¥ê¥ʤɤΰÂÄêŪ¤ÊÄ̿®¤¬µá¤á¤é¤ì¤ë¾Ç¿¤¯ÍѤ¤¤é¤ì¤롥¤·¤«¤·³ƥ»¥ϥХåƥ¤Çư¤¤¤Ƥ¤¤뤿¤áÉÑÈˤ˥ХåƥÀڤ줬µ¯¤³¤ë¤ÈÄ̿®¾㳲¤θ¶°ø¤Ȥʤë¤Ȥ¤¤¦ÌäÂ꤬¤¢¤롥ËܹƤǤÏÄã¾ÃÈñÅÅÎϲ½¤òÌÜŪ¤Ȥ·¤¿S-MAC ¥ץí¥ȥ³¥ë¤Îduty cycle ºÇŬ²½¼êˡ¤¹. ¤ޤ¿Äó°Ƽêˡ¤ÎͭÍѤ¹¤¿¤áns-2¤ˤª¤±¤륷¥ߥå¥졼¥·¥ç¥óɾ²ò¹Ԥ¤¡¤¤³¤ì¤ޤǤδû¸¤μêˡ¤ȾÃÈñÅÅÎϤÎÈæ³Ӥò¹Ԥ¦¡¥ |
| Âê̾ | Lamport¡Çs Bakery Algorithm Extension for Distance-oriented TDMA Scheduling with Priority Control on Sensor Networks |
| Ãø¼Ô | *º´ƣ ¹¯Æó, ºåÅÄ »ËϺ (ÀéÍÕÂç³ØÂç³ر¡ ͻ¹ç²ʳظ¦µæ²Ê) |
| Page | pp. 1802 - 1809 |
| Keyword | ¥»¥¼¥ͥåȥ¥¯, µ÷Υ¬Äê, ¥á¥ǥ£¥¢¥¢¥¯¥»¥¹¸æ, TDMA |
| Abstract | In this paper, we illustrate an algorithm to achieve a priority control for TDMA slot allocation, taking into account of the distance measurement information between sensor nodes by extending Lamport¡Çs bakery algorithm. Lamport's bakery algorithm is one of the exclusive control algorithm used in multi-threaded processing, to prevent the multiple threads at the same time to gain access to common resources. We designed an algorithm for the sake of using it under the environment where autonomous multiple distributed nodes represented by sensor devices and these nodes can determine their behaviors by judging the inter-node distance information between nodes. The proposed algorithm aims at achieving a priority control when processing a request to connect to the network among distributed nodes, and the control of TDMA slot allocation by referring the distance information between adjacent nodes. The proposed algorithm is achieved by introducing a set of rules that determines the node behavior to Lamport¡Çs bakery algorithm, and is evaluated by computer simulation. A network resulting from applying the proposed algorithm is expected to be built in the form of closely coupling according to the inter-node distance between nodes, and highly influenced nodes are placed in a closer position. In this paper, we show the proposed algorithm is effective. |