IJMTES – INVENTED TECHNIQUE TO REMOVE MISBEHAVIOR NODES IN WIRELESS NETWORKS

Journal Title : International Journal of Modern Trends in Engineering and Science

Author’s Name : K.Srinivasan, K.Gowri

Volume 01 Issue o4 April 2014  

ISSN no:  2348-3121 

Page no: 14-17

Abstract— In  a  wireless  networks  all  the  nodes  will  co-operative  to  share  the  information  from  one  node  to  other. In  a  network  some  node  does  not  perform  the  operation  of  transmission. This  proposed  project  will  identify  and  remove  the  misbehavior  nodes  by  various  techniques. Techniques are analyzed  and find  which  technique  is  better. A  new  technique  is  implemented  to  increase  the  performance  of  entire  network. operations  are  performed  using  routing  protocols. simulation  results  are  provided  with  NS2. To  minimize  the  total  distances  traveled  by  nodes  so  as  to  reduce  the  transmission  delay  and  provide  better  performance  than  other  existing  systems.

Keywords— Cooperative; Malicious; Wireless; Technique; Reputation; Ns2; Consensus; CoopMAC; Confidant.

Reference

[1] Stefano Tomasin, “Consensus-Based Detection of Malicious Nodes in Cooperative Wireless Network, “IEEE COMMUNICATIONS LETTERS, VOL. 15, No. 4, April (2011).
[2] S. Dehnie and S. Tomasin, “Detection of selfish nodes in networks using CoopMAC protocol with ARQ,” IEEE Trans Wireless Commun., Vol. 9, No. 7, pp. 2328–2337, July (2010).
[3] S. Buchegger and J.-Y. Le Boudec, “Performance analysis of the confidant protocol: cooperation of nodes-fairness in distributed ad hoc networks,” in Proc. 3rd ACM Int. Symp. on Mobile Ad hoc Netw. And Computing, (2002), pp. 226-236.
[4] F. K. Hussain, E. Chang, and O. K. Hussain, “State of the art review of the existing Bayesian-network based approaches to trust and reputation computation,” in Proc. 2nd Int. Conf. on Internet Monitoring and Protection, July(2007).
[5] N. Shastry and R. S. Adve, “Stimulating cooperative diversity in wireless ad hoc networks through pricing,” in Proc. IEEE Int. Conf. Commun.(ICC), Vol. 8, June (2006), pp. 3747–3752.
[6] S. D. Kamvar, M. T. Schlosser, and H. Garcia-Molina, “The Eigen trust algorithm for reputation management in p2p netowkrs,” in ACM International Conference on World Wide Web, (2003), pp. 640–651.
[7] D. Djenouri and N. Badache, “Struggling aganist selfishness and black hole attacks in MANETs,” Wireless Commun. and Mobile Computing, no. 8, pp. 689-704, (2008)
[8] M. Kim, R. Kotter, M. Medard, and J.Barros, “An algebraic watchdog for wireless network coding,” in Symp. Info. Theory, pp. 1159–1163, June (2009).
[9] J. M. Robson, “Algorithms for maximum independent sets,” J. Algorithms, Vol. 7, No. 3, pp. 425–440, (1986).
[10] D. Djenouri and N. Badache, “A novel approach for selfish nodes detection in manets: Proposal and petri nets based modeling,” in The 8th IEEE International Conference on Telecommunications (ConTel’05), Zagreb, Croatia, June (2005), pp. 569–574.
[11] D. Djenouri and N. Badache, “New power for mobile ad hoc networks,” The International Journal of Ad Hoc and Ubiquitous Computing (Inderscience Publisher), Vol 1, No. 3, pp. 126–136, (2006).
[12] Audun Jøsang and Roslan Ismail, “The Beta Reputation System”, Proceedings of the 15th Bled Conference on Electronic Commerce, Bled, Slovenia, 17-19 June (2002).unpublished.

Full Pdf Paper-Click Here