Skip to main content
SpringerLink
Log in

Evaluation of neighbor credit value based AODV routing algorithms for selfish node behavior detection

  • Published:
Cluster Computing Aims and scope Submit manuscript

Abstract

Mobile ad hoc networks (MANETs) nodes interchange information by means of numerous intermediate nodes without the requirement of infrastructure (Toh, Ad hoc mobile wireless networks: protocols and systems, pp 34–37, 2002). Owing to the exposed arrangement and inadequate energy of the nodes, some nodes may not involve in the routing process properly (Laay et al., IEEE Commun Surv Tutor 10(4):78–93, 2008). This leads to selfish behavior of the nodes and moreover, some nodes do not have the chance to forward the packets, so they still idle in the network. Hence, these genuine idle nodes are also considered as selfish nodes and they are avoided in the routing process. To address this issue, credit-based protocols namely Neighbor credit value based and improved Neighbor credit value based Ad Hoc on demand distance vector (AODV) routing algorithms are proposed. These two protocols are evaluated against AODV for the better detection of selfish node behavior. Earlier works addressed the methods to overwhelm selfish behavior attack but fail in performance. A simple neighbor credit value based AODV (NCV-AODV) routing protocol was proposed to avoid such false detection. Some simple assumption is made on NCV-AODV that the nodes in the network are fundamentally not malicious and only some of the new nodes may be added to behave maliciously. This improved version is called improved Neighbor credit value based AODV (iNCV-AODV) protocol is proposed. The proposed two mechanisms are implemented in AODV routing protocol. An extensive analysis of the performance of the proposed detection mechanisms against the selfish behavior attack.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9

Similar content being viewed by others

References

  1. Toh, C.: Ad Hoc Mobile Wireless Networks: Protocols and Systems, pp. 34–37. Prentice-Hall, New Jersey (2002)

    Google Scholar 

  2. Loay, A., Ashfaq, K., Mohsen, G.: A survey of secure mobile ad hoc routing protocols. IEEE Commun. Surv. Tutor. 10(4), 78–93 (2008)

    Article  Google Scholar 

  3. Toh, C.K., Kim, D., Oh, S.: The Controversy of Selfish Nodes in Ad Hoc Networks. In: The 12th International Conference, South Korea, pp. 1088–1092 (2010)

  4. Das, S.K., Saha, B.J., Chatterjee, P.S.: Selfish Node Detection and Its Behaviors in WSN. In: 5th International Conference on Computing Communication and Networking, China (2014)

  5. Roy, D.B., Chaki, R.: Detection of Denial of Service Attacks Due to Selfish Node in MANET. Recent Trends Wirel. Mob. Netw. https://doi.org/10.1007/978-3-642-21937-5_ (2011)

  6. Wu, L.-W., Yu, R.-F.: A threshold—based method for selfish nodes detection in MANET. In: International Computer Symposium (ICS) (2010)

  7. Raghuvanshi, R., Giluku, M.K., Dehalwar, V.: An approach to suppress selfish behavior of nodes in MANET by hiding destination identity in routing path. In: First International Conference, ACC, Kochi, pp. 153–161 (2011)

    Chapter  Google Scholar 

  8. Kargl, F., Klenk, A., Schlott, S., Weber, M.: Advanced Detection of Selfish or malicious Nodes in Ad hoc Networks, Security in Ad-hoc and Sensor Networks. Lecture Notes in Computer Science, vol. 3313, pp. 152–165. Springer, Berlin (2004)

    Google Scholar 

  9. Josh Kumar, J.M.S.P., Karthivel, A., Kirubakaran, N., Sivaraman, P., Subramanian, M.: A Unified approach for detecting and eliminating selfish nodes in MANETs using TBUT. EURASIP J. Wirel. Commun. Netw. https://doi.org/10.1186/s13638-015-0370-x. (2015)

  10. Sundarajan, T.V.P., Shanmugam, A.: Selfish avoidance routing protocol for mobile ad hoc network. Int. J. Wirel. Mob. Netw. https://doi.org/10.5121/ijwmn.2010.2206. (2010)

    Article  Google Scholar 

  11. Eidenbenz, S., Resta, G., Santi, P.: The COMMIT protocol for truthful and cost-efficient routing in ad hoc networks with selfish nodes. IEEE Trans. Mob. Comput. 7(1), 19–33 (2008)

    Article  Google Scholar 

  12. Pakzad, F.: Intrusion detection techniques for detecting misbehaving nodes. Comput. Inf. Sci. 4(1), 26–33 (2011)

  13. Hernandez-Orallo, E., Olmos, M.D.S., Cano, J.C., Calafate, C.T., Manzoni, P.: CoCoWa: a collaborative contact-based watchdog for detecting selfish nodes. IEEE Trans. Mob. Comput. 14(6), 1162–1175 (2015)

    Article  Google Scholar 

  14. Rama Abirami, K., Sumithra, M.G.: An improved neighbor credit value based AODV routing algorithm for preventing the impact of selfish behavior under MANET. World Appl. Sci. J. 35(3), 334–343 (2017)

  15. Kurkowsky, S., Camp, T., Colagrosso, M.: MANET simulation studies: the incredible. Mob. Comput. Commun. Rev. 9(4), 50–61 (2005)

Download references

Author information

Authors and Affiliations

  1. PSNA College of Engineering and Technology, Dindigul, India

    K. Rama Abirami

  2. Bannari Amman Institute of Technology, Erode, India

    M. G. Sumithra

Authors
  1. K. Rama Abirami
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. M. G. Sumithra
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to K. Rama Abirami.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Rama Abirami, K., Sumithra, M.G. Evaluation of neighbor credit value based AODV routing algorithms for selfish node behavior detection. Cluster Comput 22 (Suppl 6), 13307–13316 (2019). https://doi.org/10.1007/s10586-018-1851-6

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10586-018-1851-6

Keywords

Search

Navigation