Share This Article:

Classification of Selfish and Regular Nodes Based on Reputation Values in MANET Using Adaptive Decision Boundary

Abstract Full-Text HTML Download Download as PDF (Size:170KB) PP. 185-191
DOI: 10.4236/cn.2013.53021    5,228 Downloads   8,153 Views   Citations

ABSTRACT

A MANET is a cooperative network in which each node has dual responsibilities of forwarding and routing thus node strength is a major factor because a lesser number of nodes reduces network performance. The existing reputation based methods have limitation due to their stricter punishment strategy because they isolate nodes from network participation having lesser reputation value and thus reduce the total strength of nodes in a network. In this paper we have proposed a mathematical model for the classification of nodes in MANETs using adaptive decision boundary. This model classifies nodes in two classes: selfish and regular node as well as it assigns the grade to individual nodes. The grade is computed by counting how many passes are required to classify a node and it is used to define the punishment strategy as well as enhances the reputation definition of traditional reputation based mechanisms. Our work provides the extent of noncooperation that a network can allow depending on the current strength of nodes for the given scenario and thus includes selfish nodes in network participation with warning messages. We have taken a leader node for reputation calculation and classification which saves energy of other nodes as energy is a major challenge of MANET. The leader node finally sends the warning message to low grade nodes and broadcasts the classification list in the MANET that is considered in the routing activity.

Conflicts of Interest

The authors declare no conflicts of interest.

Cite this paper

A. Akhtar and G. Sahoo, "Classification of Selfish and Regular Nodes Based on Reputation Values in MANET Using Adaptive Decision Boundary," Communications and Network, Vol. 5 No. 3, 2013, pp. 185-191. doi: 10.4236/cn.2013.53021.

References

[1] Y. Hu, A. Perrig and D. Johnson, “Ariadne: A Secure On-Demand Routing Protocol for Ad Hoc Networks,” Proceedings of the 8th Annual International Conference on Mobile Computing and Networking, September 2002, pp. 12-23. doi:10.1145/570645.570648
[2] K. Sanzgiri, B. Dahill, B. Levine, C. Shields and E. Belding-Royer, “A Secure Routing Protocol for Ad Hoc Networks,” The 10th IEEE International Conference on Network Protocols (ICNP), 12-15 November 2002, pp. 78-87.
[3] K. Sanzgiri, D. LaFlamme, B. Dahill, B. N. Levine, C. Shields and E. M. BeldingRoyer, “Authenticate Routing for Ad Hoc Networks,” IEEE Journal on Selected Area in Communications, Vol. 23, 2005.
[4] Y. Hu, D. Johnson and A. Perrig, “SEAD: Secure Efficient Distance Vector Routing in Mobile Wireless Ad Hoc Networks,” The 4th IEEE Workshop on Mobile Computing Systems and Applications, June 2002, pp. 3-13.
[5] P. Papadimitratos, Z. Haas and P. Samar, “The Secure Routing Protocol (SRP) for Ad Hoc Networks,” 2002.
[6] D. Johnson, D. Maltz, and Y.-C. Hu, “The Dynamic Source Routing Protocol for Mobile Ad Hoc Networks (DSR),” IEEE Internet Draft, April 2003.
[7] C. E. Perkins and E. Royer, “Ad-Hoc On-Demand Distance Vector Routing,” Proceedings of 2nd IEEE Workshop on Mobile Computing Systems and Applications, 1999, pp. 90-100. doi:10.1109/MCSA.1999.749281
[8] S. Marti, T. J. Giuli, K. Lai and M. Baker, “Mitigating Routing Misbehavior in Mobile Ad Hoc Networks,” Proceedings of the 6th Annual International Conference on Mobile Computing and Networking (ACM MobiCom 2000), New York, 2000, pp. 255-265.
[9] S. Buchegger and J. Y. Le-Boudec, “Nodes Bearing Grudges: Towards Routing Security, Fairness, and Robustness in Mobile Ad Hoc Networks,” Proceedings of the 10th Euromicro Workshop on Parallel, Distributed and Network-Based Processing, Canary Islands, 2002, pp. 403-410.
[10] S. Buchegger and J. Y. Le-Boudec, “Performance Analysis of the CONFIDANT Protocol (Cooperation of Nodes: Fairness in Dynamic Ad-Hoc Networks,” Proceedings of MobiHOC’02, June 2002, pp. 226-236.
[11] P. Michiardi and R. Molva, “CORE: A Collaborative Reputation Mechanism to Enforce Cooperation in Mobile Ad-Hoc Networks,” In: J.-B., Borka and K. Tomaz, Eds., Advanced Communications and Multimedia Security, Kluwer Academic Publishers, 2002.
[12] S. Bansal and M. Baker, “Observation-Based Cooperation Enforcement in Ad Hoc Networks,” Technical Report, Stanford Univ., Standford, 2003.
[13] R. Akbani and T. Korkmaz, “Enhancing Role-Based Trust Management with a Reputation System for MANETs,” URASIP Journal on Wireless Communications and Networking 2011, 2011, p. 90.
[14] F. Wang. F. R. Wang, B. X. Huang and L. T. Yang, “COSR: A Reputation-Based Secure Route Protocol in MANET,” EURASIP Journal on Wireless Communications and Networking—Special Issue on Multimedia Communications over Next Generation Wireless Networks Archive, Vol. 2010, 2010, pp. 1-11.
[15] S. R. Zakhary and M. Radenkovic, “Reputation Based Security Protocol for MANETs in Highly Mobile Disconnection-Prone Environments,” International Conference on Wireless On-demand Network Systems and Services (WONS), 2010, pp. 161-167.
[16] S. Buchegger and J.-Y. L. Boudec, “Self-Policing Mobile Ad Hoc Networks by Reputation Systems,” IEEE Communications Magazine, Ser. 7, Vol. 43, 2005, pp. 101-107. doi:10.1109/MCOM.2005.1470831
[17] L. Buttyan and J. P. Hubaux, “Stimulating Cooperation in Self-Organizing Mobile Ad Hoc Networks,” Mobile Networks and Applications, Vol. 8, No. 5, 2003, pp. 579-592. doi:10.1023/A:1025146013151
[18] A. Balasubramanian, J. Ghosh and X. Wang, “A Reputation Based Scheme for Stimulating Cooperation in MANETs,” Proceedings of the 19th International Teletraffic Congress, Beijing, August 2005.
[19] T. Anusas-Amornkul, “On Detection Mechanisms and Their Performance for Packet Dropping Attack in Ad Hoc Networks,” University of Pittsburgh, Pittsburgh, 2008.
[20] M. A. K. Akhtar and G. Sahoo, “A Novel Methodology for Securing Adhoc Network by Friendly Group Model,” The 4th International Conference on Networks & Communications (NetCoM), Chennai, September 2012.
[21] A. Mitrokotsa and C. Dimitrakakis, “Intrusion Detection in MANET Using Classification Algorithms: The Effects of Cost and Model Selection,” Ad Hoc Networks, Vol. 11, No. 1, 2013, pp. 226-237. doi:10.1016/j.adhoc.2012.05.006
[22] E. Hernández-Orallo, M. D. Serrat, J.-C. Cano, C. M. T. Calafate, and P. Manzoni, “Improving Selfish Node Detection in Manets Using a Collaborative Watchdog,” IEEE Communications Letters, Vol. 16, No. 5, 2012, pp. 642-645. doi:10.1109/LCOMM.2012.030912.112482
[23] E. Hernández-Orallo, M. D. S. Olmos, J.-C. Cano, C. T. Calafate and P. Manzoni, “Evaluation of Collaborative Selfish Node Detection in MANETS and DTNs,” MSWiM’12 Proceedings of the 15th ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems, 2012, pp. 159-166.
[24] C.-T. Li, C.-C. Yang and M.-S. Hwang, “A Secure Routing Protocol with Node Selfishness Resistance in MANETs,” International Journal of Mobile Communications, Vol. 10, No. 1, 2012, pp. 103-118. doi:10.1504/IJMC.2012.044525
[25] H. Yu, Z. Q. Shen, C. Y. Miao, C. Leung and D. Niyato. “A Survey of Trust and Reputation Management Systems in Wireless Communications,” Proceedings of the IEEE, Vol. 98, No. 10, 2010, pp. 1755-1772. doi:10.1109/JPROC.2010.2059690
[26] E. Gose, R. Johnsonbaugh and S. Jost, “Pattern Recognition and Image Analysis,” Prentice Hall of India Private Ltd., New Delhi, 2006.

  
comments powered by Disqus

Copyright © 2019 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.