A split half reliability coefficient based mathematical model for mitigating selfish nodes in MANETs

The data dissemination among the wireless nodes in an ad hoc environment mainly depends on the cooperation maintained between them. This co-operation is essential for establishing both forward and reverse route as well as relaying the packets. Due to the limited availability of resources in an ad hoc scenario, some of the nodes may tend to drop the packets coming from their neighbor nodes while forwarding their own packets. This type of node's behavior is known as “selfish behavior”. In this paper, we devise and propose a mathematical model that could detect the selfish nodes based on the split half reliability co-efficient. This split half reliability is a two level consistency check mechanism, which is based on the aggregate number of packets entering and leaving a node at a time instant. The effective performance of the devised mathematical model is studied through ns-2 simulation with the help of parameters namely packet delivery ratio, control overhead, total overhead and throughput by varying the number of selfish nodes. The results of the experimental study depicts that this proposed model could detect the selfish nodes rapidly when compared to any other existing models available in the literature.

[1]  Julinda Stefa,et al.  Give2Get: Forwarding in Social Mobile Wireless Networks of Selfish Individuals , 2012, IEEE Trans. Dependable Secur. Comput..

[2]  Paolo Santi,et al.  The COMMIT Protocol for Truthful and Cost-Efficient Routing in Ad Hoc Networks with Selfish Nodes , 2008, IEEE Transactions on Mobile Computing.

[3]  Jean-Yves Le Boudec,et al.  Self-policing mobile ad hoc networks by reputation systems , 2005, IEEE Communications Magazine.

[4]  Refik Molva,et al.  Core: a collaborative reputation mechanism to enforce node cooperation in mobile ad hoc networks , 2002, Communications and Multimedia Security.

[5]  P. Dressel Some remarks on the kuder-richardson reliability coefficient , 1940 .

[6]  Haiying Shen,et al.  Game-Theoretic Analysis of Cooperation Incentive Strategies in Mobile Ad Hoc Networks , 2012, IEEE Transactions on Mobile Computing.

[7]  J. Gliem,et al.  Calculating, Interpreting, And Reporting Cronbach’s Alpha Reliability Coefficient For Likert-Type Scales , 2003 .

[8]  S. Buchegger,et al.  A Robust Reputation System for Mobile Ad-hoc Networks , 2003 .

[9]  H. Inaltekin,et al.  A one-shot random access game for wireless networks , 2005, 2005 International Conference on Wireless Networks, Communications and Mobile Computing.

[10]  Shukor Abd Razak,et al.  A Friend Mechanism for Mobile Ad Hoc Networks , 2008, 2008 The Fourth International Conference on Information Assurance and Security.

[11]  Jie Wu,et al.  Attack and Flee: Game-Theory-Based Analysis on Interactions Among Nodes in MANETs , 2010, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[12]  Chong Ho Yu,et al.  An introduction to computing and interpreting Cronbach Coefficient Alpha in SAS , 2001 .