2015³âµµ ÀÎÅͳÝÁ¤º¸ÇÐȸ Ãá°èÇмú¹ßÇ¥´ëȸ
Current Result Document : 10 / 10
ÇѱÛÁ¦¸ñ(Korean Title) |
Æ®¸®±â¹ÝÀÇ ¹«¼±¼¾¼³×Æ®¿öÅ©¿¡¼ ¶óÀÌÇÁŸÀÓÀÇ ÃÖ´ëȸ¦ À§ÇÑ ¹éÆ®·¡Å· ½ºÀ§Äª ¾Ë°í¸®Áò |
¿µ¹®Á¦¸ñ(English Title) |
Backtracking Switching Algorithm for Maximizing Lifetime in Tree-based Wireless Sensor Networks |
ÀúÀÚ(Author) |
Kim-Tuyen Le-Thi
Dung T. Nguyen
¿°»ó±æ
±èµ¿¼ö
ÃßÇö½Â
Sanggil Yeum
Dongsoo Kim
Hyunseung Choo
|
¿ø¹®¼ö·Ïó(Citation) |
VOL 16 NO. 01 PP. 0113 ~ 0114 (2015. 05) |
Çѱ۳»¿ë (Korean Abstract) |
|
¿µ¹®³»¿ë (English Abstract) |
Data collection becomes the most popular applications in Wireless Sensor Networks. In which, maximizing lifetime is an important challenge. Among algorithms that attempt to overcome this issue, RasMaLai is a truly remarkable approach. The main idea is to switch children of the node, which depletes its energy first, to another node. However, by using the randomly choosing, the algorithm is not guarantee to obtain optimal result with a limited number of runtime. The drawback is addressed by backtracking algorithm in this paper.
|
Å°¿öµå(Keyword) |
|
ÆÄÀÏ÷ºÎ |
PDF ´Ù¿î·Îµå
|