Abstract
Routing is a concerning and challenging research hotspot in Mobile Opportunistic Networks (MONs) due to nodes’ mobility, connection intermittency, limited nodes’ energy and the dynamic changing quality of the wireless channel. However, only one or several of the above factors are considered in most current routing approaches. In this paper, we propose an efficient energy-aware probabilistic routing approach for MONs. Firstly, we explore and exploit the regularity of nodes’ mobility and the encounter probability among nodes to decide the time when to forward messages to other nodes. Secondly, by controlling the energy fairness among nodes, we try to prolong the network lifetime. Thirdly, by fully taking the dynamic changing quality of the wireless channel into consideration, we effectively reduce the retransmission number of messages. Additionally, we adopt a forwarding authority transfer policy for each message, which can effectively control the number of replicas for each message. Simulation results show that the proposed approach outperforms the existing routing algorithms in terms of the delivery ratio and the overhead ratio.
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
Chen, Q., Gao, H., Cheng, S., Fang, X., Cai, Z., Li, J.: Centralized and distributed delay-bounded scheduling algorithms for multicast in duty-cycled wireless sensor networks. IEEE/ACM Trans. Netw. 25(6), 3573–3586 (2017)
Cheng, S., Cai, Z., Li, J., Fang, X.: Drawing dominant dataset from big sensory data in wireless sensor networks. In: Proceedings of INFOCOM 2015, Hong Kong, China, pp. 531–539, 26 April–01 May 2015
Cheng, S., Cai, Z., Li, J., Gao, H.: Extracting kernel dataset from big sensory data in wireless sensor networks. IEEE Trans. Knowl. Data Eng. 29(4), 813–827 (2017)
Han, M., Yan, M., Cai, Z., Li, Y.: An exploration of broader influence maximization in timeliness networks with opportunistic selection. J. Netw. Comput. Appl. 63, 39–49 (2016)
He, Z., Cai, Z., Cheng, S., Wang, X.: Approximate aggregation for tracking quantiles and range countings in wireless sensor networks. Theor. Comput. Sci. 607(3), 381–390 (2015)
Li, J., Cheng, S., Cai, Z., Yu, J., Wang, C., Li, Y.: Approximate holistic aggregation in wireless sensor networks. ACM Trans. Sens. Netw. 13(2), 11.1–11.24 (2017)
Lin, Y., Wang, X., Hao, F., Wang, L., Zhang, L., Zhao, R.: An on-demand coverage based self-deployment algorithm for big data perception in mobile sensing networks. Future Gener. Comput. Syst. 82, 220–234 (2018)
Pu, L., Chen, X., Xu, J.: Crowd foraging: a QoS-oriented self-organized mobile crowdsourcing framework over opportunistic networks. IEEE J. Sel. Areas Commun. 35(4), 848–862 (2017)
Saha, B.K., Misra, S., Pal, S.: SeeR: simulated annealing-based routing in opportunistic mobile networks. IEEE Trans. Mob. Comput. 16(10), 2876–2888 (2017)
Wang, E., Yang, Y., Wu, J.: Energy efficient beaconing control strategy based on time-continuous markov model in DTNs. IEEE Trans. Veh. Technol. 66(8), 7411–7421 (2017)
Zhang, F., Wang, X., Li, P., Zhang, L.: Energy-aware congestion control scheme in opportunistic networks. IEEJ Trans. Electr. Electron. Eng. 12, 412–419 (2017)
Zhang, L., Cai, Z., Lu, J., Wang, X.: Mobility-aware routing in delay tolerant networks. Pers. Ubiquit. Comput. 19(7), 1111–1123 (2015)
Zhang, L., Wang, X., Lu, J., Ren, M., Duan, Z., Cai, Z.: A novel contact prediction-based routing scheme for DTNs. Trans. Emerg. Telecommun. Technol. 28(1), e2889.1–e2889.12 (2017)
Zhao, R., Wang, X., Zhang, L., Lin, Y.: A social-aware probabilistic routing approach for mobile opportunistic social networks. Trans. Emerg. Telecommun. Technol. 28(12), e3230.1–e3230.19 (2017)
Acknowledgment
This work is partly supported by the National Natural Science Foundation of China (No. 61702317), the Natural Science Basis Research Plan in Shaanxi Province of China (Nos. 2017JM6060, 2017JM6103), and the Fundamental Research Funds for the Central Universities of China (Nos. GK201801004, GK201603115, GK201703059 and 2018CSLZ008).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG, part of Springer Nature
About this paper
Cite this paper
Zhao, R., Zhang, L., Wang, X., Ai, C., Hao, F., Lin, Y. (2018). An Efficient Energy-Aware Probabilistic Routing Approach for Mobile Opportunistic Networks. In: Chellappan, S., Cheng, W., Li, W. (eds) Wireless Algorithms, Systems, and Applications. WASA 2018. Lecture Notes in Computer Science(), vol 10874. Springer, Cham. https://doi.org/10.1007/978-3-319-94268-1_55
Download citation
DOI: https://doi.org/10.1007/978-3-319-94268-1_55
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-94267-4
Online ISBN: 978-3-319-94268-1
eBook Packages: Computer ScienceComputer Science (R0)