Open Access Open Access  Restricted Access Subscription or Fee Access

Cornbach Alpha Coefficient based Trust Model for Routing in MANET

S. Pariselvam, Dr. R.M.S. Parvathi

Abstract


Co-operation is considered as one of the important factor that has a vital influence in the reliable data dissemination of packets between the wireless nodes present in an ad hoc scenario. This co-operation is also essential for maintaining both the forward and reverse routes between the source and the sink nodes. Due to the stringent availability of resources in MANETs, Some of the participating nodes present in the ad hoc environment may exhibit a malicious behavior of intentionally dropping the data packets rather than forwarding to their neighbor nodes. This maliciousness of the nodes may result in the degradation in the network performance. In this paper. We formulate and propose a Cornbach alpha coefficient based trust model, which manipulates the trust of each and every node present in the topology based on Cornbach alpha coefficient. The experimental analysis of the proposed trust model is studied through the ns-2 simulation with the aid of evaluation parameters namely packet delivery ratio, control overhead, total overhead and throughput by varying the number of malicious nodes. This proposed scheme performs well when compared to the model present in the literature like split half reliability model.


Keywords


Cornbach Alpha Coefficient; Malicious Node, MAODV, Trust Model.

Full Text:

PDF

References


Sonja Buchegger Jean – Y ves Le Boudec, “A Robust Repudiation system for mobile ad-hoc networks,” EPFL IC Technical Report IC/2003/05.

P.Michiardi and R.Molva, “CORE: A collborative repudiation

mechanism to enforce node coperating in mobile ad hoc networks,” Proceeding of the 6th Joint working conference on communications and multimedia security, ,pp 107-121, September 2002.

Alessandro Mei , Julinda Stefa, “Give 2Get: Forwarding in Social Mobile wireless networks of selfish Individual,” IEEE Trasactions on dependable and secure computing, vol.9 No.4 pp 569 – 581, July/August 2012.

S.Eidenbenz ,G.Resta, and P.Santi, “The Commit Protocol for truthful and cost – efficient Routing in Ad hoc networks with selfish nodes,” IEEE Transaction on Mobile Computing, Vol 7, No. 1 pp. 19 - 32 January 2010.

M.Tamer Refari, Vivek Srivatsava , Luiz DaSilva, Mohamed

Eltoweissy,“A Repudiation - based Mechanism for isolating selfish nodes in Ad hoc Networks,” Proceeding of Mobiquaitous ’05, IEEE 2005.

Ze Li, Haiying Shen, “Game – Theoretic analysis of cooperation EquiIncentive strategies in Mobile Ad hoc networks,” IEEE Transl.on Mobile computing vol. 11, No 8 pp. 1287–1303, August 2012.

Feng Li , Jie Wu , “Attack and Flee: Game –Theory – Based Analysis on Interactions Among Nodes in MANETs,”IEEE Transaction on System, Man and Cybernetics Vol 40, No 3 pp 612 – 622 June 2010.

Shukor Abd Razak ,Normalia Samia, Mohd Aizia Maarof , “A Friend Mechanism for mobile ad hoc networks,” The fouth International conference Information Assurance and Security, IEEE 2008.

Hazer Inaltekin, Stephen B. Wicker , “The analysis of Nash Equilibria of one shot Random – Access Game for wireless Networks and the behavior of selfish Nodes,” IEEE Transactions on Networking ,Vol 16, NO.5 pp.1094-1170 ,October 2008.

Sengathir J, Manoharan.R,” A Split Half Reliability Coefficient Based Mathematical Model for Mitigating Selfish Nodes in Manets,”IACC, Ghaziabad, India, IEEE 2013

Joseph A.Gliem, Rosemary R. Gliem, “Calculating, Integrating , and Reporting Cronbach’s Alpha Reliability coeeficient for Likert –Type Scales,” In proceedings of MRPC, Vol 4, pp 82- 882003

Paul Dressal,”Some remarks on kuder-richardson reliability coefficient,” phychometrica, Springer, Vol 8(4),pp 223-245,December 1999.

Lawrence M.Healey, “Logistic Regrssion : An Overview,” In Proceeding of COT 07 11,Vol.2, pp 30-37, March 2006.

Chong Ho Yu, “An introduction to computing and interpreting Cronbach coefficient alpha in SAS,” IEEE 2005


Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.