Abstract
Opportunistic routing schemes usually infer future contact time to select next hop relays. But the effect of relay selected in this way is uncertain. In order to get further understanding of the intrinsic uncertainty characteristic of relay efficiency, this paper makes an empirical investigation on opportunistic forwarding relay selection schemes using contact records. Based on the underlying opportunistic vehicular network extracted from large-scale realistic vehicle traces, we evaluated the efficiency of relay selection and got some intrinsic sight of opportunistic forwarding. The questions we investigated are: What is the probability that a selected relay can make the end-to-end delay reduced? How much the latency can be saved by a properly selected relay? Such an empirical study is meaningful for the protocol design and applications deployment in future opportunistic networks.
Chapter PDF
Similar content being viewed by others
References
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)
Nelson, S.C., Bakht, M., Kravets, R.: Encounter-Based Routing in DTNs. In: Proceedings of INFOCOM 2009, pp. 846–854. IEEE Press, New York (2009)
Balasubramanian, A., Levine, B.N., Venkataramani, A.: DTN routing as a resource allocation problem. In: Proceedings of SIGCOMM 2007, pp. 373–384. ACM Press, New York (2007)
Jain, S., Fall, K., Patra, R.: Routing in a delay-tolerant network. In: Proceedings of SIGCOMM 2004, pp. 145–158. ACM Press, New York (2004)
Jones, E.P.C., Li, L., Ward, P.A.S.: Practical routing in delay-tolerant networks. In: Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking, pp. 1–7. ACM Press, New York (2005)
Chen, H., Lou, W.: On Using Contact Expectation for Routing in Delay Tolerant Networks. In: Proceedings of 2011 International Conference on Parallel Processing (ICPP), pp. 683–692. IEEE Press, New York (2011)
Piorkowski, M., Djukic, N.S., Grossglauser, M.: A Parsimonious Model of Mobile Partitioned Networks with Clustering. In: Proceedings of 1st International Conference on COMmunication Systems and NETworkS (COMSNETS), pp. 258–267. IEEE Press, New York (2009)
CRAWDAW, http://www.crawdad.cs.dartmouth.edu/
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 IFIP International Federation for Information Processing
About this paper
Cite this paper
Jianbin, J., Yingwen, C., Ming, X. (2012). An Empirical View on Opportunistic Forwarding Relay Selection Using Contact Records. In: Park, J.J., Zomaya, A., Yeo, SS., Sahni, S. (eds) Network and Parallel Computing. NPC 2012. Lecture Notes in Computer Science, vol 7513. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-35606-3_30
Download citation
DOI: https://doi.org/10.1007/978-3-642-35606-3_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-35605-6
Online ISBN: 978-3-642-35606-3
eBook Packages: Computer ScienceComputer Science (R0)