Abstract
Opportunistic networks are challenging networks characterised by frequency disconnections and partitioning. The data propagation process follows a “store-carry-and-forward” transmission manner, instead of the usual “hop-by-hop” forwarding model. In view of the impact of history information of nodes on whether messages are successfully delivered to destination, the scheme based on history meeting predictability routing(HMPR) is put forward. The scheme is primarily based on the contact duration and the meeting frequency of history information of network nodes, and predicts the utility of messages successfully delivered to the destination. Through comparing the utility value, nodes can determine messages whether to be forwarded. The simulation results show that, compared this scheme with traditional Epidemic routing and Prophet routing, the proposed routing scheme has the higher delivery ratio of packets, the lower overhead ratio and the less average buffer time.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Pelusi, L., Passarella, A., Conti, M.C.: Opportunistic Networking: Data forwarding in disconnected mobile ad hoc networks. IEEE Communications Magazine 44, 134–141 (2006)
Small, T., Haas, Z.C.: The shared wireless infestation model: A new ad hoc networking paradigm. In: Proc. ACM MobiHoc, Annapolis USA, pp. 233–244 (June 2003)
Hui, P., Chaintreau, A., Scott, J., Gass, R., Crowcroft, J., Diot, C.C.: Pocket switched networks and human mobility in conference environments. In: Proc. ACM SIGCOMM Workshop WDTN, Philadelphia, pp. 244–251 (August 2005)
Hull, B., Bychkovsky, V., Zhang, Y., Chen, K., Goraczko, M., Miu, A., Shih, E., Balakrishnan, H., Madden, S.C.: CarTe1: A distributed mobi1e sensor computing system. In: Proc. ACM SenSys, Colorado USA, pp. 125–138 (October 2006)
Pentland, A., Fletcher, R., Hasson, A.J.: DakNet: Rethinking connectivity in developing nations. IEEE Journals and Magazines, Computer 37, 78–83 (2004)
Vahdat, A., David Becker, S.: Epidemic routing for partially connected ad hoc networks. In: Technical Report CS2000, Department of Computer Science, Duke University, USA, pp. 1–14 (2000)
Musolesi, M., Hailes, S., Mascolo, C.: Adaptive routing for intermittently connected mobile ad hoc networks. In: IEEE WoWMoM, Italy, pp. 183–189 (June 2005)
Lindgren, A., Doria, A., Schelen, O.: Probabilistic Routing in Intermittently Connected Networks. In: Proc. ACM MobiHoc, vol. 7, pp. 239–254, Annapolis USA (June 2003)
Wang, C., Liu, J., Kuang, J.: Performance Analysis on Direct Transmission Scheme under RWP Mobility Model in DTMSNs. In: E Wireless Communications, Networking and Mobile Computing(WiCOM), Turkey, pp. 23–25 (September 2011)
Gao, W., Cao, G.: On Exploiting Transient Contact Patterns for Data Forwarding in Delay Tolerant Networks. In: IEEE ICNP, USA, pp. 193–202 (October 2010)
Li, F., Wu, J.: LocalCom: A Community-based Epidemic Forwarding Scheme in Disruption-tolerant Networks. In: IEEE SECON, Rome Italy, pp.1–9 (June 2009)
Masood, S.H., Raza, S.A., Coates, M.J.: Content Distribution Strategies in Opportunistic Networks. Technical Report CS 2011, Montreal, Canada, McGill University, Canada, pp. 1–65 (December 2011)
Li, Q., Zhu, S., Cao, G.: Routing in Socially Selfish Delay Tolerant Networks. In: IEEE INFOCOM, Shanghai, China, pp. 1–6 (April 2010)
Fujihara, A., Ono, S., Hiroyoshi Miwa, C.: Optimal Forwarding Criterion of Utility-based Routing under Sequential Encounters for Delay Tolerant Networks. In: IEEE INCoS, Fukuoka Japan, pp. 279–286 (December 2011)
Keranen, A., Ott, J., Karkkainen, T.: The ONE Simulator for DTN Protocol Evaluation. In: SIMUTools, Proceedings of the 2nd International Conference on Simulation Tools and Techniques, Rome, pp. 1–10 (March 2009)
Yan, X., Huang, X., Peng, W.: Simulation based performance evaluation of DTN routing protocols. Computer Technology and Development, vol 20, 1–4 (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Li, Y., Xu, M., Liu, Q., Yu, J. (2012). HMPR: Forwarding Based on History Meeting Prediction Routing in Opportunistic Networks. In: Wang, X., Zheng, R., Jing, T., Xing, K. (eds) Wireless Algorithms, Systems, and Applications. WASA 2012. Lecture Notes in Computer Science, vol 7405. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31869-6_51
Download citation
DOI: https://doi.org/10.1007/978-3-642-31869-6_51
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31868-9
Online ISBN: 978-3-642-31869-6
eBook Packages: Computer ScienceComputer Science (R0)