Journal of King Saud University: Computer and Information Sciences (Jul 2016)

Erlang coefficient based conditional probabilistic model for reliable data dissemination in MANETs

  • R. Manoharan,
  • J. Sengathir

DOI
https://doi.org/10.1016/j.jksuci.2014.10.008
Journal volume & issue
Vol. 28, no. 3
pp. 289 – 302

Abstract

Read online

In MANETs, reputation plays a significant role in reliable dissemination of data for establishing maximum degree of cooperation among the mobile nodes in the network. But, the presence of selfish nodes drastically reduces the level of cooperation between the nodes and further reduces the life time of the network. Moreover, when the number of selfish nodes increases in the network, the packet delivery ratio and throughput decreases which in turn increases the number of retransmissions. Hence, an effective mechanism for isolating selfish nodes in order to increase the packet delivery rate and the throughput for reliable dissemination of data becomes vital. This paper proposes an Erlang coefficient based conditional probabilistic model (ECCPM) which makes the decision of isolating selfish nodes through the manipulation of Conditional Probabilistic Coefficient (CPC) factor. This Conditional Probabilistic Coefficient acts as the reputation factor for estimating the level of negative impact produced by selfish nodes toward the resilience of the network. The proposed work is simulated in ns-2 and from the results, it is obvious that ECCPM showed better performance in terms of packet delivery ratio, throughput, control overhead and total overhead than existing mitigation mechanisms like RCSBMM, RFBMM, SHRCM and PCMA proposed for selfish nodes.

Keywords