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

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 o...

Full description

Bibliographic Details
Main Authors: R. Manoharan, J. Sengathir
Format: Article
Language:English
Published: Elsevier 2016-07-01
Series:Journal of King Saud University: Computer and Information Sciences
Subjects:
Online Access:http://www.sciencedirect.com/science/article/pii/S1319157815000932
_version_ 1819299049553002496
author R. Manoharan
J. Sengathir
author_facet R. Manoharan
J. Sengathir
author_sort R. Manoharan
collection DOAJ
description 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.
first_indexed 2024-12-24T05:39:37Z
format Article
id doaj.art-3da40c2cb9214cdabdf55a2089f5e289
institution Directory Open Access Journal
issn 1319-1578
language English
last_indexed 2024-12-24T05:39:37Z
publishDate 2016-07-01
publisher Elsevier
record_format Article
series Journal of King Saud University: Computer and Information Sciences
spelling doaj.art-3da40c2cb9214cdabdf55a2089f5e2892022-12-21T17:12:51ZengElsevierJournal of King Saud University: Computer and Information Sciences1319-15782016-07-0128328930210.1016/j.jksuci.2014.10.008Erlang coefficient based conditional probabilistic model for reliable data dissemination in MANETsR. ManoharanJ. SengathirIn 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.http://www.sciencedirect.com/science/article/pii/S1319157815000932Selfish nodesReputationGenuineness factorConditional Probabilistic CoefficientErlang coefficientNetwork resilience
spellingShingle R. Manoharan
J. Sengathir
Erlang coefficient based conditional probabilistic model for reliable data dissemination in MANETs
Journal of King Saud University: Computer and Information Sciences
Selfish nodes
Reputation
Genuineness factor
Conditional Probabilistic Coefficient
Erlang coefficient
Network resilience
title Erlang coefficient based conditional probabilistic model for reliable data dissemination in MANETs
title_full Erlang coefficient based conditional probabilistic model for reliable data dissemination in MANETs
title_fullStr Erlang coefficient based conditional probabilistic model for reliable data dissemination in MANETs
title_full_unstemmed Erlang coefficient based conditional probabilistic model for reliable data dissemination in MANETs
title_short Erlang coefficient based conditional probabilistic model for reliable data dissemination in MANETs
title_sort erlang coefficient based conditional probabilistic model for reliable data dissemination in manets
topic Selfish nodes
Reputation
Genuineness factor
Conditional Probabilistic Coefficient
Erlang coefficient
Network resilience
url http://www.sciencedirect.com/science/article/pii/S1319157815000932
work_keys_str_mv AT rmanoharan erlangcoefficientbasedconditionalprobabilisticmodelforreliabledatadisseminationinmanets
AT jsengathir erlangcoefficientbasedconditionalprobabilisticmodelforreliabledatadisseminationinmanets