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

»çÀÌÆ®¸Ê

Loading..

Please wait....

±¹³» ³í¹®Áö

Ȩ Ȩ > ¿¬±¸¹®Çå > ±¹³» ³í¹®Áö > Çѱ¹Á¤º¸°úÇÐȸ ³í¹®Áö > Á¤º¸°úÇÐȸ ³í¹®Áö I : Á¤º¸Åë½Å

Á¤º¸°úÇÐȸ ³í¹®Áö I : Á¤º¸Åë½Å

Current Result Document :

ÇѱÛÁ¦¸ñ(Korean Title) ¸ð¹ÙÀÏ ½ÌÅ©¸¦ À§ÇÑ ±Õµî Å¥À×(FQMS): ¸ð¹ÙÀÏ ½ÌÅ© ±â¹Ý ¹«¼± ¼¾¼­ ³×Æ®¿öÅ©¿¡¼­ ±ÕµîÇÑ µ¥ÀÌÅÍ ¼öÁýÀ» À§ÇÑ ½ºÄÉÁÙ¸µ ±â¹ý
¿µ¹®Á¦¸ñ(English Title) Fair Queuing for Mobile Sink (FQMS): Scheduling Scheme for Fair Data Collection in Wireless Sensor Networks with Mobile Sink
ÀúÀÚ(Author) Á¶¿µÅ   ¹ÚÃÑ¸í   ÀÌÁÂÇü   ¼­µ¿¸¸   ÀÓµ¿¼±   Á¤Àιü   YoungTae Jo   ChongMyung Park   JoaHyoung Lee   DongMahn Seo   DongSun Lim   InBum Jung  
¿ø¹®¼ö·Ïó(Citation) VOL 37 NO. 03 PP. 0204 ~ 0216 (2010. 06)
Çѱ۳»¿ë
(Korean Abstract)
°íÁ¤ ½ÌÅ©¸¦ »ç¿ëÇÑ ¼¾¼­ ³×Æ®¿öÅ©´Â ½ÌÅ© ÁÖº¯ ¼¾¼­ ³ëµå¿¡°Ô ¸¹Àº ºÎÇϸ¦ ÃÊ·¡ÇÏ°Ô µÇ°í ÀÌ·¯ÇÑ ºÎÇÏ´Â ¼¾¼­ ³ëµåÀÇ ¹èÅ͸® ¼Ò¸ð·Î À̾îÁö°Ô µÈ´Ù. ½ÌÅ© ÁÖº¯ ¼¾¼­ ³ëµåÀÇ ¹èÅ͸® ¼Ò¸ð´Â Àüü ¼¾¼­ ³×Æ®¿öÅ©ÀÇ ¼ö¸íÀ» ´ÜÃà½ÃÅ°´Â ¿øÀÎÀÌ µÈ´Ù. ÀÌ·¯ÇÑ ¹®Á¦¸¦ ÇØ°áÇϱâ À§ÇØ ¸ð¹ÙÀÏ ½ÌÅ©¸¦ »ç¿ëÇÏ¿© ½ÌÅ© ÁÖº¯ ³ëµåÀÇ ºÎÇϸ¦ ºÐ»ê½ÃÅ°´Â ¿¬±¸°¡ È°¹ßÈ÷ ÁøÇàµÇ°í ÀÖ´Ù. ¸ð¹ÙÀÏ ½ÌÅ©´Â ¿òÁ÷À̴ Ư¼ºÀ» °¡Áö°í Àֱ⠶§¹®¿¡ ¼¾¼­ ³ëµå¿Í Åë½Å °¡´ÉÇÑ ½Ã°£ÀÌ Á¦ÇѵȴÙ. ¶ÇÇÑ Åë½Å Áß¿¡µµ ¸ð¹ÙÀÏ ½ÌÅ©¿Í ¼¾¼­ ³ëµå °£ °Å¸®°¡ ¿¬¼ÓÀûÀ¸·Î º¯Çϱ⠶§¹®¿¡ Åë½Å ȯ°æ ¿ª½Ã º¯ÇÏ°Ô µÈ´Ù. ¸ð¹ÙÀÏ ½ÌÅ©¸¦ »ç¿ëÇÑ ¼¾¼­ ³×Æ®¿öÅ©´Â ÀÌ·¯ÇÑ Á¦¾à »çÇ×À» ÇØ°áÇÏ¸ç °¢ ¼¾¼­ ³ëµåµé·ÎºÎÅÍ ±ÕµîÇÑ ¾çÀÇ µ¥ÀÌÅ͸¦ ¼öÁýÇÒ ¼ö ÀÖ¾î¾ß ÇÑ´Ù. ±ÕµîÄ¡ ¸øÇÑ µ¥ÀÌÅÍ ¼öÁýÀº ½Ç½Ã°£Àû ¼¾¼­ ³×Æ®¿öÅ© ÀÀ¿ëºÐ¾ß¿¡¼­ ±ä±ÞÇÑ »ç°Ç 󸮸¦ °¡´ÉÇÏÁö ¾Ê°Ô ÇÑ´Ù. º» ³í¹®¿¡¼­´Â ¸ð¹ÙÀÏ ½ÌÅ©¸¦ ÀÌ¿ëÇÑ ¼¾¼­ ³×Æ®¿öÅ©¿¡¼­ ¼¾¼­ ³ëµåµé·ÎºÎÅÍ ±ÕµîÇÑ µ¥ÀÌÅÍ ¼öÁýÀ» À§ÇÑ ½ºÄÉÁÙ¸µ ±â¹ýÀÎ FQMS¸¦ Á¦¾ÈÇÑ´Ù. FQMS´Â ¸ð¹ÙÀÏ ½ÌÅ©¿Í ¼¾¼­ ³ëµå °£ Åë½Å ȯ°æ°ú ½Ã°£ Á¦¾àÀ» °í·ÁÇÏ¿© ±ÕµîÇÑ µ¥ÀÌÅÍ ¼öÁýÀ» º¸ÀåÇÑ´Ù. ½ÇÇèÀ» ÅëÇØ Á¦¾ÈµÈ FQMS¿Í ±âÁ¸ÀÇ ½ºÄÉÁÙ¸µ ±â¹ýµéÀÇ ¼º´ÉÀ» ºñ±³ Æò°¡ÇÑ´Ù. ½ÇÇè °á°ú¸¦ ÅëÇØ Á¦¾ÈµÈ ±â¹ýÀÌ ¹«¼± ¼¾¼­ ³ëµåµé·Î ºÎÅÍÀÇ µ¥ÀÌÅÍ ¼öÁý¿¡ À־ °¡Àå ±ÕµîÇÑ µ¥ÀÌÅÍ ¼öÁýÀ» ¼öÇàÇÔÀ» º¸ÀδÙ.
¿µ¹®³»¿ë
(English Abstract)
Since Sensor nodes around a fixed sink have huge concentrated network traffic, the battery consumption of them is increased extremely. Therefore the lifetime of sensor networks is limited because of huge battery consumption. To address this problem, a mobile sink has been studied for load distribution among sensor nodes. Since a mobile sink changes its location in sensor networks continuously, the mobile sink has time limits to communicate with each sensor node and unstable signal strength from each sensor node. Therefore, a fair and stable data collection method between a mobile sink and sensor nodes is necessary in this environment. When some sensor nodes are not able to send data to the mobile sink, a real-time application in sensor networks cannot be provided. In this paper, the new scheduling method, FQMS (Fair Queuing for Mobile Sink), is proposed for fair and stable data collection for mobile sinks in sensor networks. The FQMS guarantees balanced data collecting between sensor nodes for a mobile sink. In out experiments, the FQMS receives more packets from sensor nodes than legacy scheduling methods and provides fair data collection, because moving speed of a mobile sink, distance between a mobile sink and sensor nodes and the number of sensor nodes are considered.
Å°¿öµå(Keyword) ¸ð¹ÙÀÏ ½ÌÅ©   ¹«¼± ¼¾¼­ ³×Æ®¿öÅ©   Åë½Å ¿¡·¯À²   FQMS   mobile sink   wireless sensor network   communication error-rate  
ÆÄÀÏ÷ºÎ PDF ´Ù¿î·Îµå