| Âê̾ |
Aggregation-Based Information Collection in Disaster Areas |
| Ãø¼Ô |
*Jovilyn Therese Baco Fajardo (Graduate School of Information Science, Nara Institute of Science and Technology), Keiichi Yasumoto, Naoki Shibata, Weihua Sun (Graduate School of Information Science, Nara Institute of Science and Technology/Japan Science and Technology Agency, CREST), Minoru Ito (Graduate School of Information Science, Nara Institute of Science and Technology) |
| Page |
pp. 1674 - 1685 |
| Keyword |
data aggregation, delay tolerant network, disaster area, information collection |
| Abstract |
When disasters occur, a common characteristic is the partial or complete failure of the telecommunications infrastructure so the usual means of communication are often not available. However, accurate and timely information of the disaster area is important. In this paper, a delay tolerant network (DTN)-based data collection method from an area of interest (AoI) within the disaster zone is proposed that uses the mobile phones of the people to serve as sensing nodes. Existing DTN technologies allow the propagation of information to some extent but it is difficult to achieve coverage of the AoI in a short time due to the limited data transfer capacity of a DTN. To achieve maximum AoI coverage while minimizing delay, we propose a DTN-based data aggregation method. In the proposed method, mobile phone users moving over the disaster area create messages containing disaster-related information, which can arithmetically be operated like the number of injuries. In order to reduce the overall message collection delay, we reduce message size by merging multiple messages with their respective coverage areas into a new message with the merged coverage. Simply merging messages may result in duplicative counting of the disaster-related information in the same coverage area. To prevent this, a Bloom filter is constructed for each aggregated message. In addition, to reduce further the message delivery time, the expected time of a node to reach its destination is introduced as a routing metric. Through computer simulation with a real geographical map, we confirmed that the proposed method achieved a smaller delay in message delivery than epidemic routing. |
| Âê̾ |
¥á¥å»¡¼¥¸¥ե§¥¤ˤè¤ë¸úΨŪ¤ÊDTN¥롼¥ƥ£¥ó¥°Êý¼°¤ÎÄó°ƤÈɾ²Á |
| Ãø¼Ô |
*°¤Éô Îòð (¸øΩ¤Ϥ³¤Æ̤ÍèÂç³ØÂç³ر¡ ¥·¥¹¥ƥà¾ðÊó²ʳظ¦µæ²Ê), Ãæ¼ ²Åδ, ÇòÀÐ ÍÛ, ¹ⶶ ½¤ (¸øΩ¤Ϥ³¤Æ̤ÍèÂç³Ø ¥·¥¹¥ƥà¾ðÊó²ʳØÉô) |
| Page |
pp. 1686 - 1696 |
| Keyword |
DTN, ÃßÀѱ¿ÈžÁ÷, ¥á¥å»¡¼¥¸¥ե§¥, ²óÉü¼êˡ, ¥롼¥ƥ£¥ó¥° |
| Abstract |
¶áǯ¡¤Ãdz¤¬¹⤤ÎÊÄ̿®´Ķ²¼¤ǤÍê¤ι⤤¥¨¥ó¥ɥġ¼¥¨¥ó¥ÉÄ̿®¤ò¼¸½¤¹¤ëÃٱäÂÑ¥ͥåȥ¥¯¡ÊDTN: Delay Tolerant Networking¡ˤ¬ÃíÌܤµ¤ì¤Ƥ¤¤롥DTN¥롼¥ƥ£¥ϡ¤³ƥΡ¼¥ɤ¬¥á¥å»¡¼¥¸¤òÃßÀѤ·¤ưÜư¤·¡¤Ä̿®²Äǽ¤Ȥʤä¿¥Ρ¼¥ɤËʣ¥á¥å»¡¼¥¸¤òžÁëÃßÀѱ¿ÈžÁ÷¡ÊStore-Carry-Forward¡ˤ˴ð¤Ť¤¤Ƥ¤¤롥°ìÈ̤ˡ¤DTN¥롼¥ƥ£¥Ǥϥá¥å»¡¼¥¸žÁ÷Ãٱä¤ÈÃæ·ѥΡ¼¥ɤΥХåե¡»ÈÍÑÎ̤ϥȥ졼¥ɥª¥դδط¸¤ˤ¢¤롥ËܹƤǤϡ¤ͽ¤áÀßÄꤵ¤줿·Ðϩ¾å¤ò°Üư¤¹¤ë¥á¥å»¡¼¥¸¥ե§¥¤Ȥ¤¤¦¥Ρ¼¥ɤò³èÍѤ·¡¤¤³¤Υȥ졼¥ɥª¥դò²ò¾ä¹¤ë¥롼¥ƥ£¥ó¥°Êý¼°¤òÄó°Ƥ¹¤롥¥·¥ߥå¥졼¥·¥ç¥ó¤ˤè¤ꡤÄó°ÆÊý¼°¤ȴû¸Êý¼°¤Îǽ¤òÈæ³Ӥ·¤¿¡¥¤ޤ¿¡¤¥á¥å»¡¼¥¸¥ե§¥¤ηÐϩÇÛÃ֤òÊѲ½¤µ¤»¤¿¾ì¹ç¤ÎÄó°ÆÊý¼°¤Îǽ¤ؤαƶòɾ²·¤¿¡¥ |