Enhanced Routing Algorithm for Opportunistic Networking - On the Improvement of the Basic Opportunistic Networking Routing Algorithm by the Application of Machine Learning

Ladislava Smítková Janků, Kateřina Hyniová

2014

Abstract

The opportunistic communication networks are special communication networks where no assumption is made on the existence of a complete path between two nodes wishing to communicate; the source and destination nodes needn't be connected to the same network at the same time. This assumption makes the routing in these networks extremely difficult. We proposed the novel opportunistic networking routing algorithm, which improves the basic opportunistic networking routing algorithm by application of machine learning. The HMM Autonomous Robot Mobility Models and Node Reachability Model are constructed from the observed data and used in a proposed routing scheme in order to compute the combined probabilities of message delivery to the destination node. In the proposed routing scheme, the messages are coppied between two nodes only if the combined probability of the message delivery to the destination node is higher than the preliminary defined limit value. The routing scheme was developed for the networks of autonomous mobile robots. The improvement about 70% in a network load is reported.

References

  1. Pelusi, L., Passarella, A., Conti, M., 2006.. Opportunistic networking: data forwarding in disconnected mobile ad hoc networks. In IEEE Communications Magazine, Vol. 44, No. 11, pp. 134-141. IEEE.
  2. Ravikiran, G.; Singh, S., 2004. Influence of mobility models on the performance of routing protocols in adhoc wireless networks. In Vehicular Technology Conference, 2004. VTC 2004, vol. 4, p. 2185-2189. IEEE.
  3. Helbing, D., 2001. Traffic and Related Self-driven Manyparticles Systems. In Rev. Modern Physics, Vol. 73, 2001, pp. 1067-1141.
  4. Qiang, Z. et al. 2009. Formal taxonomy research on opportunistic networks. In Proceedings of 2nd IEEE International Conference on Broadband Network & Multimedia Technology 2009, pp. 854-857.
  5. Ariyakhajorn, J. et al. 2006. A Comparative Study of Random Waypoint and Gauss-Markov Mobility Models in the Performance Evaluation of MANET. In Proceedings of the International Symposium on Communications and Information Technologies 2006, pp. 894-899.
  6. Timo, R., Blackmore, K., Hanlen, L., 2007. Strong Stochastic Stability for MANET Mobility Models. In Proceedings of the 15th IEEE International Conference on Networks 2007, pp. 13-18. IEEE.
  7. Harri, J., Filali, F., Bonnet, C., 2009. Mobility models for vehicular ad hoc networks: a survey and taxonomy. In IEEE Communications Surveys & Tutorials. Vol. 11, No. 4, pp. 19-41. IEEE.
  8. Rabiner, L. R., 1989. A tutorial on hidden Markov models and selected applications in speech recognition, In Proceedings of the IEEE, Vol. 77, No. 2, 1989, pp. 257-286. IEEE.
  9. Hyunuk Kim, Ha Yoon Song, 2012 Formulating Human Mobility Model in a Form of Continuous Time Markov Chain, Procedia CS, Vol. 10, 2012.
Download


Paper Citation


in Harvard Style

Smítková Janků L. and Hyniová K. (2014). Enhanced Routing Algorithm for Opportunistic Networking - On the Improvement of the Basic Opportunistic Networking Routing Algorithm by the Application of Machine Learning . In Proceedings of the 3rd International Conference on Pattern Recognition Applications and Methods - Volume 1: ICPRAM, ISBN 978-989-758-018-5, pages 771-776. DOI: 10.5220/0004923507710776


in Bibtex Style

@conference{icpram14,
author={Ladislava Smítková Janků and Kateřina Hyniová},
title={Enhanced Routing Algorithm for Opportunistic Networking - On the Improvement of the Basic Opportunistic Networking Routing Algorithm by the Application of Machine Learning},
booktitle={Proceedings of the 3rd International Conference on Pattern Recognition Applications and Methods - Volume 1: ICPRAM,},
year={2014},
pages={771-776},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0004923507710776},
isbn={978-989-758-018-5},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 3rd International Conference on Pattern Recognition Applications and Methods - Volume 1: ICPRAM,
TI - Enhanced Routing Algorithm for Opportunistic Networking - On the Improvement of the Basic Opportunistic Networking Routing Algorithm by the Application of Machine Learning
SN - 978-989-758-018-5
AU - Smítková Janků L.
AU - Hyniová K.
PY - 2014
SP - 771
EP - 776
DO - 10.5220/0004923507710776