Performance Evaluation of Virtual Segment Method Based on Actual Road Network Topology at the Time of the Great East Japan Earthquake

The message deliveries based on the store-carry-forward routing schemes, such as Epidemic Routing(ER), are one of useful methods for communication under challenged environments. However, these methods commonly have their own limitations in reach ability of messages to destinations and scalability. For example, as the distance to the destination increases, the delivery delay of a message between source and destination nodes generally becomes longer and even the reach ability decreases. To overcome these problems, the Virtual Segment(VS) method was proposed, which combines the ER method and a wired/wireless high-speed network connecting all base nodes(BN) located on the area. This can improve the reach ability and solve the scalability problem. In this paper, we evaluate the effectiveness of the VS method by simulation with the use of actual road network topology after the Great East Japan Earthquake in 2011. The results show that the VS method achieve higher successfully delivered probability and shorter delivery delay than the ER method, even if the traffic volume is much smaller than an usual one. It follows that the VS method is effective not only qualitatively but also quantitatively even in a challenged network environment such as in a disaster.

[1]  Waylon Brunette,et al.  Data MULEs: modeling a three-tier architecture for sparse sensor networks , 2003, Proceedings of the First IEEE International Workshop on Sensor Network Protocols and Applications, 2003..

[2]  Brian Gallagher,et al.  MaxProp: Routing for Vehicle-Based Disruption-Tolerant Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[3]  Cauligi S. Raghavendra,et al.  Spray and wait: an efficient routing scheme for intermittently connected mobile networks , 2005, WDTN '05.

[4]  Masato Tsuru,et al.  Virtual Segment: Store-Carry-Forward Relay-Based Support for Wide-Area Non-Real-time Data Exchange , 2009, 2009 International Conference on Intelligent Networking and Collaborative Systems.

[5]  Anders Lindgren,et al.  Probabilistic routing in intermittently connected networks , 2003, MOCO.

[6]  Zhensheng Zhang,et al.  Routing in intermittently connected mobile ad hoc networks and delay tolerant networks: overview and challenges , 2006, IEEE Communications Surveys & Tutorials.

[7]  Waylon Brunette,et al.  Data MULEs: modeling and analysis of a three-tier architecture for sparse sensor networks , 2003, Ad Hoc Networks.

[8]  Ellen W. Zegura,et al.  A message ferrying approach for data delivery in sparse mobile ad hoc networks , 2004, MobiHoc '04.

[9]  Ellen W. Zegura,et al.  Capacity Enhancement using Throwboxes in DTNs , 2006, 2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems.

[10]  Amin Vahdat,et al.  Epidemic Routing for Partially-Connected Ad Hoc Networks , 2009 .