Optimal cluster head in DTN routing hierarchical topology (DRHT)

17Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.

Abstract

In delay tolerant networking (DTN), nodes are autonomous and behave in an unpredictable way. Consequently, a control mechanism of topology is necessary. This mechanism should ensure the overall connectivity of the network taking into account nodes' mobility. In this paper, we study the problem of data routing with an optimal delay in the bundle layer, by exploiting: the clustering, the messages ferries and the optimal election of cluster head (CH). We first introduce the DTN routing hierarchical topology (DRHT) which incorporates these three factors into the routing metric. We propose an optimal approach to elect a CH based on four criteria: the residual energy, the intra-cluster distance, the node degree and the head count of probable CHs. We proceed then to model a Markov decision process (MDP) to decide the optimal moment for sending data in order to ensure a higher delivery rate within a reasonable delay. At the end, we present the simulation results demonstrating the effectiveness of the DRHT. Our simulation shows that while using the DRHT which is based on the optimal election of CH, the traffic control during the TTL interval (Time To Live) is balanced, which greatly increases the delivery rate of bundles and decreases the loss rate.

Cite

CITATION STYLE

APA

Alaoui, E. A. A., Agoujil, S., Hajar, M., & Qaraai, Y. (2016). Optimal cluster head in DTN routing hierarchical topology (DRHT). International Journal of Communication Networks and Information Security, 8(2), 101–111. https://doi.org/10.17762/ijcnis.v8i2.1642

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