Open Access   Article

Integrated Poisson and Hyper-exponential Bayesian Probabilistic Factor-oriented Efficient Routing Mechanism for MANETs

V.Vijayagopal 1 , K.Prabu 2

1 PG & Research Department of Computer Science, Sudharsan College of Arts & Science, Pudukkottai, Tamilnadu, India.
2 PG & Research Department of Computer Science, Sudharsan College of Arts & Science, Pudukkottai, Tamilnadu, India.

Section:Research Paper, Product Type: Journal Paper
Volume-6 , Issue-7 , Page no. 14-21, Jul-2018

CrossRef-DOI:   https://doi.org/10.26438/ijcse/v6i7.1421

Online published on Jul 31, 2018

Copyright © V.Vijayagopal, K.Prabu . This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

View this paper at   Google Scholar | DPI Digital Library

Citation

IEEE Style Citation: V.Vijayagopal, K.Prabu, “Integrated Poisson and Hyper-exponential Bayesian Probabilistic Factor-oriented Efficient Routing Mechanism for MANETs”, International Journal of Computer Sciences and Engineering, Vol.6, Issue.7, pp.14-21, 2018.

MLA Style Citation: V.Vijayagopal, K.Prabu "Integrated Poisson and Hyper-exponential Bayesian Probabilistic Factor-oriented Efficient Routing Mechanism for MANETs." International Journal of Computer Sciences and Engineering 6.7 (2018): 14-21.

APA Style Citation: V.Vijayagopal, K.Prabu, (2018). Integrated Poisson and Hyper-exponential Bayesian Probabilistic Factor-oriented Efficient Routing Mechanism for MANETs. International Journal of Computer Sciences and Engineering, 6(7), 14-21.

VIEWS PDF XML
95 147 downloads 13 downloads
  
  
           

Abstract

Reputation is considered as the significant reliability index for measuring the degree of participation rendered by each mobile node towards co-operation. Reputation decreases drastically under the influence of byzantine nodes as they intentionally drop maximum number of packets. Byzantine nodes decrease packet delivery rate and throughput of the network in spite of consuming network resources. The existing Bayesian conditional probability based mitigation approaches fail to utilize the benefits of conditional probabilistic distributions like Poisson and Hyper-exponential distribution for detection. This paper presents an Integrated Poisson and Hyper-exponential Bayesian Probabilistic Factor-based Mitigation Mechanism (IPHBFMM) for investigating the influence of byzantine nodes and mitigate them for ensuring better routing process. IPHBFMM is potential in combining two independent variables for discriminating co-operative nodes from byzantine nodes based on past and present behaviour. Simulation results proved that the energy consumptions and communication overhead of IPHBFMM is excellently minimized by 26% and 34% compared to the existing Bayesian probability-oriented techniques considered for analysis.

Key-Words / Index Term

Byzantine nodes, Poisson Factor, Hyper-Exponential distribution, Bayesian Probability. Co-operative Packet Forwarding Factor, Packet Forwarding Normalization Factor

References

[1] Buttyan, L and Hubaux, J-P, (2003) ‘Stimulating Coperation in Self–organizing Mobile Ad hoc Networks’, MONET Journal of Mobile Computing and Networking, Vol. 8, No. 1, pp. 579-592.
[2] Marti, S, Gulli, T.J, Lai, K and Baker, M, (2000) ‘Mitigating routing misbehaviour in mobile ad hoc networks Mobile Computing and Networking’, in Proc., 6th ACM Annual International Conference on Mobile Computing and Network (ACM-MobiCom), Boston, USA, Vol. 1, No. 1, pp. 255-265.
[3] Pusphalatha, M, Revathy, V, Rama Rao, P, (2009), ‘Trust based Energy aware reliable reactive protocol in mobile ad hoc networks’, World Academy of Science, Engineering and Technology, vol. 3, no. 27, pp. 335-338.
[4] Rizvi, S and Elleithy, M, (2009) ‘A new scheme for minimizing malicious behavior of mobile nodes in Mobile Ad Hoc Networks’, Internation Journal of computer Science and Information Security, Vol.. 3, No. 1, pp. 25-34.
[5] Michiardi, P and Molva, R, (2002) ‘CORE: a collaborative reputation mechanism to enforce node cooperation in mobile ad hoc networks’, in Proc., 6th IFIP Conf. on Security, Communications and Multimedia, Protoroz, Solvenia, vol. 228, no. 1, pp. 107-121.
[6] S. Goswami and S. Das, (2014),”A probabilistic approach to detect selfish node in MANET," International Journal of Computer Applications, vol. 3, no. 1, pp.23-26.
[7] B. Wang, S. Soltani, J. K. Shapiro, and P. T. Tan, Local detection of selfish routing behavior in ad hoc networks," in Proceedings of International Symposium on Parallel Architectures, Algorithms and Networks, vol. 2, no. 3, pp 23-34, December 2005.
[8] Buchegger, S and Boudec, J-Y, (2002), ‘Performance Analysis of the CONFIDANT protocol: Cooperation of Nodes – Fairness in Distributed Ad-hoc Networks’, in Proc., 3rd ACM International Symposium on Mobile ad hoc Networking and Computing (MobiHoc ’02), New York, USA, Vol. 1, No. 1, pp. 226-236.
[9] Kargl, F, Klenk, A,.Schlott, S and Weber, M, (2004), ‘Advanced Detection of selfish or Malicious Nodes in Ad hoc Networks’, in Proc., First European Workshop on Security in Ad-Hoc and Sensor Network (ESAS 2004), Heidelberg, Germany, Vol. 1, No. 1, pp. 255-263.
[10] B. Kailkhura, Y. S. Han, S. Brahma and P. K. Varshney, (2015) "Asymptotic Analysis of Distributed Bayesian Detection with Byzantine Data," in IEEE Signal Processing Letters, vol. 22, no. 5, pp. 608-612.
[11] C. Hortelano, T. Calafate, J. C. Cano, M. de Leoni, P. Manzoni, and M. Mecella,(2010), “Black-hole attacks in p2p mobile networks discovered through Bayesian Filters," Proceedings of OTM Workshops, vol. 2, no. 6, pp. 543-552.
[12] B.G. Chun, K. Chaudhuri, H. Wee, M. Barreno, C. H. Papadimitriou, and J. Kubiatowicz, Sel_sh caching in distributed systems: A game-theoretic analysis," in Proceedings of the 23th Annual ACM Symposium on Principles of Distributed Computing, vol. 7, no. 4, pp. 21-30, November 2004.
[13] B. Wang, S. Soltani, J. K. Shapiro, and P. T. Tan, “Local detection of selfish routing behavior in ad hoc networks," in Proceedings of International Symposium on Parallel Architectures, Algorithms and Networks, vol. 2, no.3, pp 23-34, December 2005.
[14] Chen, T.M, Varatharajan, V, (2009), ‘Dempster-Shafer Theory for Intrusion Detection in Ad Hoc Networks’, IEEE Internet Computing, vol. 3, no. 1, pp 234-241.
[15] Sengathir, J., & Manoharan, R. (2015). Exponential Reliability Coefficient based Reputation Mechanism for isolating selfish nodes in MANETs. Egyptian Informatics Journal, 16(2), 231-241.
[16] N. M. Webb, J. Richard, Shavelson, and E. H. Haertel, (2006), “Reliability Coefficients and Generalizability Theory”, Handbook of Statistics. Elsevier press, vol. 26.
[17] Steutel, F. W, and Harn, V. K, (2004).” Infinite divisibility of probability distributions on the real line”. MarcerDekkar, 2004.
[18] Annapourna, P Patil, Rajani Kanth, Bathey Sharanya,Dinesh Kumar, M.P, Malavika, J, (2011) ‘Design of Energy Efficient Routing protocols for MANETs’, International Journal of Computer Science Issues, vol. 8, no. 1, pp. 215-220.
[19] Hernandez-Orallo, Manuel, D, Serraty, Juan-Carlos Cano, Calafate, T and Manzoni’s, (2012) ‘Improving Selfish Node Detection in MANETs Using a collaborative Watchdog’, IEEE Communication Letters, Vol. 16, No.5, pp.
[20] Sengathir, J., & Manoharan, R. (2015). A futuristic trust coefficient-based semi-Markov prediction model for mitigating selfish nodes in MANETs. EURASIP Journal on Wireless Communications and Networking, 2015(1).