Abstract
The opportunistic network is a kind of self-organizing network which makes use of the meeting opportunities created by moving nodes to realize short-distance wireless communication, in which the dynamic characteristics of the network topology often result in low communication efficiency. To improve the efficiency of messages transmission, firstly we combine the Markov model to establish a node location prediction model and a distance prediction and calculation model between nodes respectively in order to accurately predict the location of the nodes at the next moment and calculate the distance between nodes; secondly based on the significance and timelessness of messages, a priority based buffer management strategy is proposed to realize the efficient use of buffer. Finally in this paper we propose an efficient opportunistic network routing algorithm, named LIBR, based on the prediction of node meeting location to forward the messages. Compared with the well-known routing algorithms, the simulation results show that our proposed algorithm can significantly improve the delivery ratio, reduce the overhead ratio and average delay of messages.
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
Similar content being viewed by others
References
Xiao, M., Wu, J., Huang, L.: Community-aware opportunistic routing in mobile social networks. IEEE Trans. Comput. 63(7), 1682–1695 (2014)
Kimura, T., Matsuda, T., Takine, T.: Location-aware store-carry-forward routing based on node density estimation. IEICE Trans. Commun. 98(1), 99–106 (2015)
Azam, K.N., Chowdhury, M.Z.: Opportunistic system approach for capacity enhancement and congestion mitigation in advanced wireless networks. In: International Conference on Electrical Information and Communication Technology, pp. 341–346. IEEE (2016)
Koulali, S., Sabir, E., Taleb, T., et al.: A green strategic activity scheduling for UAV networks: a sub-modular game perspective. IEEE Commun. Mag. 54(5), 58–64 (2016)
Conti, M., Giordano, S.: Mobile ad hoc networking: milestones, challenges, and new research directions. IEEE Commun. Mag. 52(1), 85–96 (2014)
MartíN-Campillo, A., Crowcroft, J., Yoneki, E., et al.: Evaluating opportunistic networks in disaster scenarios. J. Netw. Comput. Appl. 36(2), 870–880 (2013)
Pirozmand, P., Wu, G., Jedari, B., et al.: Human mobility in opportunistic networks: characteristics, models and prediction methods. J. Netw. Comput. Appl. 42, 45–58 (2014)
Wang, N., Yoneki, E.: Impact of social structure on forwarding algorithms in opportunistic networks. In: Mobile and Wireless Networking, pp. 82–88. IEEE (2011)
Luo, J., Hu, J., Wu, D., et al.: Opportunistic routing algorithm for relay node selection in wireless sensor networks. IEEE Trans. Ind. Informat. 11(1), 112–121 (2015)
Ciobanu, R.I., Dobre, C., Cristea, V.: Reducing congestion for routing algorithms in opportunistic networks with socially-aware node behavior prediction. In: International Conference on Advanced Information Networking and Applications, pp. 554–561. IEEE Computer Society (2013)
Shen, H., Zhao, L.: ALERT: an anonymous location-based efficient routing protocol in MANETs. IEEE Trans. Mob. Comput. 12(6), 1079–1093 (2013)
Kumar, N., Chilamkurti, N., Rodrigues, J.J.P.C.: Learning automata-based opportunistic data aggregation and forwarding scheme for alert generation in vehicular ad hoc networks. Comput. Comun. 39, 22–32 (2014)
Wang, X., Chen, M., Kwon, T., et al.: Mobile traffic offloading by exploiting social network services and leveraging opportunistic device-to-device sharing. IEEE Wirel. Commun. 21(3), 28–36 (2014)
Becchetti, L., Clementi, A., Pasquale, F., et al.: Flooding time in opportunistic networks under power law and exponential intercontact times. IEEE Trans. Parall. Distr. 25(9), 2297–2306 (2014)
Li, F., Shi, P., Wu, L., et al.: Quantized control design for cognitive radio networks modeled as nonlinear semi-Markovian jump systems. IEEE Trans. Ind. Electron. 62(4), 2330–2340 (2015)
Dhurandher, S.K., Borah, S., Woungang, I., et al.: EDR: an encounter and distance based routing protocol for opportunistic networks. In: International Conference on Advanced Information Networking and Applications, pp. 297–302. IEEE (2016)
Acknowledgments
This work is supported by the National Natural Science Foundation of China (Grant Nos. 61373083, 61402273); the Program of Shaanxi Science and Technology Innovation Team of China (Grant No. 2014KTC-18); the 111 Programme of Introducing Talents of Discipline to Universities (Grant No. B16031).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Wang, X., Wang, X., Zhang, L., Lin, Y., Zhao, R. (2018). A Routing Algorithm Based on the Prediction of Node Meeting Location in Opportunistic Networks. In: Li, J., et al. Wireless Sensor Networks. CWSN 2017. Communications in Computer and Information Science, vol 812. Springer, Singapore. https://doi.org/10.1007/978-981-10-8123-1_25
Download citation
DOI: https://doi.org/10.1007/978-981-10-8123-1_25
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-10-8122-4
Online ISBN: 978-981-10-8123-1
eBook Packages: Computer ScienceComputer Science (R0)
