2020³âµµ ÀÎÅͳÝÁ¤º¸ÇÐȸ Ãß°èÇмú¹ßÇ¥´ëȸ
ÇѱÛÁ¦¸ñ(Korean Title) |
µàƼ »çÀÌŬ WSN¿¡¼ µ¥ÀÌÅÍ Áý°è Áö¿¬¿¡ ´ëÇÑ Æ®¸® »ý¼ºÀÇ È¿°ú |
¿µ¹®Á¦¸ñ(English Title) |
Effectiveness of Trees Construction on Data Aggregation Delay in Duty-cycled WSNs |
ÀúÀÚ(Author) |
ÀåÀ±¼±
±è¹®¼º
ÃßÇö½Â
Vo Van Vi
Dung T.Nguyen
Yunseon Jang
Moonseong Kim
Hyunseung Choo
|
¿ø¹®¼ö·Ïó(Citation) |
VOL 22 NO. 01 PP. 0105 ~ 0106 (2021. 04) |
Çѱ۳»¿ë (Korean Abstract) |
|
¿µ¹®³»¿ë (English Abstract) |
Data aggregation in Wireless Sensor Networks (WSNs) is considered as an NP-hard problem. Delay efficiency for aggregating data in duty-cycled WSNs helps the network long-lasting while the sensors have limited power. In this paper, we apply a different kind of aggregation tree for aggregating data then propose a different method to schedule nodes in the constructed tree. We also analyze the advantages our proposed idea comparing with the reference schemes to show the potential improvement of our proposed idea on the aspect of time efficiency data aggregation in the wireless networks environment.
|
Å°¿öµå(Keyword) |
|
ÆÄÀÏ÷ºÎ |
PDF ´Ù¿î·Îµå
|