{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T04:24:15Z","timestamp":1760243055991,"version":"build-2065373602"},"reference-count":19,"publisher":"MDPI AG","issue":"2","license":[{"start":{"date-parts":[[2015,5,27]],"date-time":"2015-05-27T00:00:00Z","timestamp":1432684800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Future Internet"],"abstract":"<jats:p>When a disaster hits a wide area, communication services for public use will be rendered unavailable. This will make it difficult to confirm the safety of people in the disaster area. A solution to this problem is to form delay\/disruption tolerant networks (DTN) using mobile terminals of victims, those of rescuers, who serve as information carriers, and terminals (servers) in shelters. In this paper, we propose using a receiver-triggered handshake protocol for communication between these terminals. We have developed the bundle layer protocol for this handshake method. The proposed method has been implemented on a network simulator to build an evaluation environment. The disaster area has been modeled on an area around Shinjuku Station in Tokyo. Victims are randomly distributed in the area. We have compared the proposed method with Epidemic Routing and Spray and Wait in terms of the delivery rate at which messages reach their destinations, and the length of time taken for messages to reach their destinations. We have found that the delivery rate of the three methods are, more or less, the same, but that the proposed method is superior to the other two methods in terms of storage usage and battery consumption of terminals, and the number of bundles generated in the network.<\/jats:p>","DOI":"10.3390\/fi7020152","type":"journal-article","created":{"date-parts":[[2015,5,27]],"date-time":"2015-05-27T10:33:55Z","timestamp":1432722835000},"page":"152-169","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Receiver-Triggered Handshake Protocol for DTN in  Disaster Area"],"prefix":"10.3390","volume":"7","author":[{"given":"Ryoma","family":"Yamashita","sequence":"first","affiliation":[{"name":"Graduate School of Engineering, Information Systems Science, Soka University,  1-236 Tangi-cho, Hachioji-shi, Tokyo 192-8577, Japan"}]},{"given":"Kazumasa","family":"Takami","sequence":"additional","affiliation":[{"name":"Graduate School of Engineering, Information Systems Science, Soka University,  1-236 Tangi-cho, Hachioji-shi, Tokyo 192-8577, Japan"}]}],"member":"1968","published-online":{"date-parts":[[2015,5,27]]},"reference":[{"unstructured":"White Paper 2011 Information & Communications in Japan, Part 1, Section 1. Available online: http:\/\/www.soumu.go.jp\/johotsusintokei\/whitepaper\/eng\/WP2011\/2011-index.html.","key":"ref_1"},{"unstructured":"White Paper 2011 Information & Communications in Japan, Part 1, Chapter 3. Available online: http:\/\/www.soumu.go.jp\/johotsusintokei\/whitepaper\/eng\/WP2012\/2012-index.html.","key":"ref_2"},{"unstructured":"Warthman, F. Delay Tolerant Networks (DTNs)\u2014A Tutorial Version 2.0. Warthman Associates, Based on Technology Developed by the Interplanetary Internet Special Interest Group. Available online: http:\/\/ipnsig.org\/wp-content\/uploads\/2012\/07\/DTN_Tutorial_v2.04.pdf.","key":"ref_3"},{"unstructured":"Vahdat, A., and Becker, D. (2000). Epidemic Routing for Partially-Connected Ad Hoc Networks, Department of Computer Science Duke University. Duke Technical Report, CS-2000-6.","key":"ref_4"},{"doi-asserted-by":"crossref","unstructured":"Spyropoulos, T., Psounis, K., and Raghavendra, C.S. (2005, January 22\u201326). Spray and Wait: An Efficient Routing Scheme for Intermittently Connected Mobile Networks. Proceedings of the SIGCOMM\u201905 Workshops, Philadelphia, PA, USA.","key":"ref_5","DOI":"10.1145\/1080139.1080143"},{"unstructured":"Akiyama, Y., and Kobayashi, A. (2012, January 4\u20136). A Protocol and the Prototype to communicate with a communication blackout region based on DTN architecture. Proceedings of the Forum on Information Technology (FIT) 2012, Koganei-shi, Tokyo, Japan.","key":"ref_6"},{"unstructured":"Takemoto, H., Zamora, F.L.J., Kashihara, S., Taenaka, Y., Mineo, T., Kanada, S., and Yamaguchi, S. (2013). Evaluation of information-Sharing Method among Disaster Victims in A Collapsed Communication Service Area, The Institute of Electronics, Information and Communication Engineering (IEICE). IEICE Tech. Rep., MoNA2013-43.","key":"ref_7"},{"unstructured":"Sawamura, Y., Teranishi, Y., Takeuchi, S., Harumoto, K., and Nishio, S. (2011, January 6\u20138). An Efficient Broadcast Method Based on Estimation and Preservation of Stable Links in Delay Tolerant Networks. Proceedings of the IPSJ, Multimedia, Distributed, Cooperative, and Mobile Symposium 2011 (DICOMO2011), Miyazu-shi, Kyoto, Japan.","key":"ref_8"},{"unstructured":"Sun, W., Kitani, T., Shimata, N., and Yasumoto, K. (2009). A Data Gathering and Sharing Proposal for Disaster Relief based on DTN, IPSJ. Information Processing Society of Japan (IPSJ) SIG Technical Report.","key":"ref_9"},{"unstructured":"Koyama, Y., Mizumoto, T., Imazu, S., and Yasumoto, K. (2012). Safety Confirmation System with DTN-based Message Routing in 3G Disabled Areas Caused by Large-Scale Disaster, The Institute of Electronics, Information and Communication Engineering (IEICE). IEICE Tech. Rep., MoMuC 122(44).","key":"ref_10"},{"doi-asserted-by":"crossref","unstructured":"Chuah, C.M., and Ma, W. (2006, January 23\u201325). Integrated Buffer and Route Management in a DTN with Message Ferry. Proceedings of the IEEE Military Communications Conference (MILCOM) 2006, Washington, DC, USA.","key":"ref_11","DOI":"10.1109\/MILCOM.2006.302288"},{"unstructured":"Abe, R., Nakamura, Y., Shiraishi, Y., and Takahashi, O. (2012, January 4\u20136). An Effective DTN Routing Scheme using Message Ferries. Proceedings of the IPSJ, Multimedia, Distributed, Cooperative, and Mobile Symposium 2012 (DICOMO2012), Kaga-shi, Ishikawa, Japan.","key":"ref_12"},{"unstructured":"Tariq, B.M.M., Ammar, M., and Zegura, E. (2006, January 22\u201325). Message Ferry Route Design for Sparse Ad hoc Networks with Mobile Nodes. Proceedings of the MobiHoc\u201906, Florence, Italy.","key":"ref_13"},{"unstructured":"Wentui, Z., and Ammar, H.M. (2003, January 28\u201330). Message Ferrying: Proactive Routing in Highly-partitioned Wireless Ad Hoc. Proceedings of the Ninth IEEE Workshop on Future Trends of Distributed Computing Systems (FTDCS\u201903), San Juan, Puerto Rico.","key":"ref_14"},{"unstructured":"Seino, W., Yoshihisa, T., Hara, T., and Nishio, S. (2011, January 6\u20138). A Communication Traffic Reduction Method by Delivering Predicted Values on Sensor Data Collection with a Mobile Sink. Proceedings of the IPSJ, Multimedia, Distributed, Cooperative, and Mobile Symposium 2011 (DICOMO2011), Miyazu-shi, Kyoto, Japan.","key":"ref_15"},{"key":"ref_16","first-page":"13","article-title":"Communication Methods for Sensor Database Construction by Rounding Sink Considering Amount of Data Collection","volume":"8","author":"Yoshihisa","year":"2010","journal-title":"DBSJ J."},{"key":"ref_17","first-page":"1262","article-title":"Route Planning Method for Multi Mobile Sensor Nodes","volume":"50","author":"Nakamiya","year":"2009","journal-title":"Inf. Process. Soc. Jpn. (IPSJ) J."},{"unstructured":"Scenargie. Space-Time Engineering. Available online: https:\/\/www.spacetime-eng.com\/en\/index.html.","key":"ref_18"},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1023\/A:1011474616255","article-title":"An Energy-Consumption Model for Performance Analysis of Routing Protocols for Mobile Ad Hoc Networks","volume":"6","author":"Feeney","year":"2001","journal-title":"ACM\/Kluwer Mob. Netw. Appl. (MONET)"}],"container-title":["Future Internet"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-5903\/7\/2\/152\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T20:47:03Z","timestamp":1760215623000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-5903\/7\/2\/152"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,5,27]]},"references-count":19,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2015,6]]}},"alternative-id":["fi7020152"],"URL":"https:\/\/doi.org\/10.3390\/fi7020152","relation":{},"ISSN":["1999-5903"],"issn-type":[{"type":"electronic","value":"1999-5903"}],"subject":[],"published":{"date-parts":[[2015,5,27]]}}}