An efficient energy-aware probabilistic routing approach for mobile opportunistic networks

1Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

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.

Cite

CITATION STYLE

APA

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 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10874 LNCS, pp. 671–682). Springer Verlag. https://doi.org/10.1007/978-3-319-94268-1_55

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free