Homesick Lévy Walk and Optimal Forwarding Criterion of Utility-Based Routing under Sequential Encounters

  • Akihiro FujiharaEmail author
  • Hiroyoshi Miwa
Part of the Studies in Computational Intelligence book series (SCI, volume 460)


The Internet of Things (IoT) is going to develop integrated and organised networks of all things and beings in the world enabling autonomous computing and information communication for the creation of new values in the future. For such networks by IoT that accept a certain level of communication delay, but that must realise highly-reliable message forwarding, Delay Tolerant Network (DTN) gives a possible solution. Recently, DTN has attracted attention as a future network under challenged network environments where communication delay, disruption, and disconnect frequently occurs. In this chapter, we review some routing protocols for efficient message forwarding in DTN. We also review some mobility models often used for simulating motions of mobile nodes to evaluate the performance of DTN. In this review, we propose our mobility model called Homesick Lévy Walk that mimics human mobility patterns of an universal scale-free property of the frequency of human contacts. After this, we also propose our utility-based routing protocol which maximises the expected number of selected relay nodes being likely to encounter a destination node under sequential encounters with nodes. We evaluate the performance of our routing protocol by comparing with some performance measures of some existing routing protocols under the condition that the Homesick Lévy Walk is adopted as mobility model. We show that our protocol is comparable to others in arrival rate of messages under a smaller number of message forwarding.We also find that the performance of our protocol is stable up to a few hundred mobile nodes and tends to be scalable with the number of nodes.


Mobile Node Arrival Rate Destination Node Relay Node Buffer Size 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Farrell, S., Cahill, V.: Delay- and Disruption-Tolerant Networking. Artech House (2006)Google Scholar
  2. 2.
    Vasilakos, A., Zhang, Y., Spyropoulos, T.V.: Delay Tolerant Networks: Protocols and Applications. Wireless Networks and Mobile Communications Series. CRC Press (2012)Google Scholar
  3. 3.
    Fujihara, A., Miwa, H.: Real-time Disaster Evacuation Guidance using Opportunistic Communications. In: The 2012 International Symposium on Applications and the Internet, SAINT 2012 (2012)Google Scholar
  4. 4.
    Fujihara, A., Miwa, H.: Effect of Traffic Volume in Real-time Disaster Evacuation Guidance using Opportunistic Communications. In: 2012 Third International Conference on Intelligent Networking and Collaborative Systems, INCoS 2012 (2012)Google Scholar
  5. 5.
    Vahdat, A., Becker, D.: Epidemic Routing for Partially-Connected Ad Hoc Networks. Technical report, Duke University (2000)Google Scholar
  6. 6.
    Zhang, Z.: Routing in intermittently connected mobile ad hoc networks and delay tolerant networks: overview and challenges. IEEE Communication Surveys Tutorials 8(1), 24–37 (2006)CrossRefGoogle Scholar
  7. 7.
    Fujihara, A., Miwa, H.: Bluetooth & Wi-Fi mobile wireless communication experiments and the power law of passing-by frequency distributions. IEICE Tech. Rep. 110(449), IN2010-167, 139–144 (2011)Google Scholar
  8. 8.
    Fujihara, A., Ono, S., Miwa, H.: Optimal Forwarding Criterion of Utility-based Routing under Sequential Encounters for Delay Tolerant Networks. In: Third International Conference on Intelligent Networking and Collaborative Systems (INCoS) 2011, pp. 279–286 (2011)Google Scholar
  9. 9.
    Rhee, I., et al.: On the Levy-walk Nature of Human Mobility: Do Humans Walk like Monkeys? In: Proc. IEEE INFOCOM, pp. 924–932 (2008)Google Scholar
  10. 10.
    González, M.C., et al.: Understanding individual human mobility patterns. Nature 453, 779–782 (2008)CrossRefGoogle Scholar
  11. 11.
    Spyropoulos, T., et al.: Spray and Wait: An efficient routing scheme for intermittently connected mobile networks. In: Proc. ACM SIGCOMM Workshop on Delay-tolerant Networking, pp. 252–259 (2005)Google Scholar
  12. 12.
    Lindgren, A., Doria, A., Schelén, O.: Probabilistic Routing in Intermittently Connected Networks. In: Dini, P., Lorenz, P., de Souza, J.N. (eds.) SAPIR 2004. LNCS, vol. 3126, pp. 239–254. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  13. 13.
    Burgess, J., et al.: MaxProp: Routing for vehicle-based disruption-tolerant networks. In: Proc. IEEE INFOCOM, pp. 398–408 (2006)Google Scholar
  14. 14.
    Chaintreau, A., et al.: Impact of human mobility on opportunistic forwarding algorithms. IEEE Transactions on Mobile Computing 6(6), 606–620 (2007)CrossRefGoogle Scholar
  15. 15.
    Karagiannis, T., et al.: Power law and exponential decay of intercontact times between mobile devices. IEEE Transactions on Mobile Computing 9(10), 1377–1390 (2010)CrossRefGoogle Scholar
  16. 16.
    Roy, R.R.: Handbook of Mobile Ad Hoc Networks for Mobility Models. Springer (2011)Google Scholar
  17. 17.
    Ano, K., Tamaki, M.: A secretary problem with uncertain employment and restricted chances. Working paper series, No. 9105, Center for Management Studies, Nanzan Univ. (1991)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  1. 1.Graduate School of Science and TechnologyKwansei Gakuin Univ.HyogoJapan

Personalised recommendations