Skip to main content
Log in

Collaborative Polling based Routing Security Scheme to Mitigate the Colluding Misbehaving Nodes in Mobile Ad Hoc Networks

  • Published:
Wireless Personal Communications Aims and scope Submit manuscript

Abstract

The recent advancements in the field of wireless communications makes the mobile devices to communicate with each other in a self organized manner without relying on stable infrastructure. It requires cooperation between the mobile devices in order to find routes between them when the nodes are not in the communication range of each other. The misbehaving node comes into existence due to scarcely available resources such as battery, bandwidth and computational power. When the nodes collude to misbehave then it further makes the routing process difficult due to frequent network partitioning and it also degrades the overall network throughput. This paper proposes a Collaborative Polling based Routing Security Scheme to detect and isolate the colluding misbehaving nodes in mobile ad hoc networks. The proposed system employs a timeout approach to detect the active neighbors in the neighborhood before monitoring the transmissions which involves it. It ensures that the false detection of a good node as a bad one has been greatly reduced which in turn decreases the send buffer drop because of the availability of alternate routes. The simulation result shows that the measured parameters such as packet drop ratio and malicious drop has been reduced due to the efficient detection and isolation of misbehaving nodes. This paper also presents an analytical and simulation results of the impact of node misbehavior.

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

Access this article

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

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Conti M., Giordano S. (2007) Multihop ad hoc networking: The Theory. Journal of IEEE Communications Magazine 45(4): 78–86

    Article  Google Scholar 

  2. Conti M., Giordano S. (2007) Multihop and hoc networking: The Reality. Journal of IEEE Communications Magazine 45: 88–95

    Article  Google Scholar 

  3. Yau, P., & Mitchell, C. J. (2003). Security vulnerabilities in ad hoc networks. In The seventh international symposium on communication theory and applications (pp. 99–104). Ambleside: HW Communications Ltd.

  4. Marti, S., Giuli, T. J., Lai, K., & Baker, M. (2000). Mitigating routing misbehavior in mobile ad hoc networks. In 6th international conference on mobile computing and networking (pp. 255–265). Boston: ACM.

  5. Gopalakrishnan, K., & Rhymend Uthariaraj, V. (2009). Scenario based evaluation of the impact of misbehaving nodes in mobile ad hoc networks. In 1st IEEE international conference on advanced computing (pp. 45–50). Chennai: IEEE Computer Society.

  6. Piro, C., Shields, C., & Levine, B. N. (2006). Detecting the sybil attack in mobile ad hoc networks. In Proceedings of securecomm and workshops (pp. 1–11). Baltimore: IEEE Digital Library.

  7. Hong, X., Gerla, M., Pei, G., & Chiang, C. (1999). A group mobility model for ad hoc wireless networks. In 2nd ACM international workshop on modeling and simulation of wireless and mobile systems (pp. 53–60). Seattle: ACM.

  8. Hong, X., Gerla, M., Pei, G., & Chiang, C. (1999). A wireless hierarchical routing protocol with group mobility. In IEEE wireless communications and networking conference (pp. 1536–1540). New Orleans: IEEE.

  9. Hubaux J.-P., Gross T., Le Boudec J.-Y., Vetterli M. (2001) Toward self-organized mobile ad hoc networks: The terminodes project. Journal of IEEE Communications Magazine 39(1): 118–124

    Article  Google Scholar 

  10. Buttyan, L., & Hubaux, J.-P. (2001). Nuglets: A virtual currency to stimulate cooperation in self-organized mobile ad hoc networks. Technical report DSC/2001/001, Swiss Federal Institution of Technology.

  11. Buttyan L., Hubaux J.-P. (2003) Stimulating cooperation in self-organizing mobile ad hoc networks. Journal of Mobile Networks and Applications 8: 579–592

    Article  Google Scholar 

  12. Anderegg, L., & Eidenbenz, S. (2003). Ad hoc-VCG: A truthful and cost-efficient routing protocol for mobile ad hoc networks with selfish agents. In Ninth annual international conference on mobile computing and networking (pp. 245–259). San Diego: ACM SIGMOBILE.

  13. Zhong, S., Chen, J., & Yang, Y. R. (2003). Sprite: A simple, cheat-proof, credit-based system for mobile ad-hoc networks. In Twenty-second annual joint conference of the IEEE computer and communications societies (pp. 1987–1997). San Franciso: IEEE Computer Society.

  14. Michiardi, P., & Molva, R. (2002). CORE: A COllaborative REputation mechanism to enforce node cooperation in mobile ad hoc networks. In 6th joint working conference on communications and multimedia Security (Vol. 228, pp. 107–121). Portoroz: Kluwer.

  15. Buchegger, S., & Le Boudec, J.-Y. (2003). A robust reputation system for mobile ad-hoc networks. EPFL IC Technical report IC/2003/50, EPFL-IC-LCA.

  16. Buchegger, S., & Le Boudec, J. Y. (2002). Performance analysis of the CONFIDANT protocol (Cooperation of Nodes: Fairness In Dynamic Ad-hoc NeTworks). In IEEE/ACM symposium on mobile ad hoc networking and computing (pp. 226–236). Lausanne: ACM.

  17. Bansal, S., & Baker, M. (2003). Observation based cooperation enforcement in ad hoc networks. Technical report, Stanford University.

  18. Zouridaki C., Mark B., Hejmo M., Thomas R. (2009) E-Hermes: A robust cooperative trust establishment scheme for mobile ad hoc networks. Journal of Elsevier Ad Hoc Networks 7(6): 1156–1168

    Article  Google Scholar 

  19. Hu, J., & Burmester, M. (2006). LARS—a locally aware reputation system for mobile ad hoc networks. In 44th annual southeast regional conference (pp. 119–123). Melbourne: ACM.

  20. Li J.-S., Lee C.-T. (2006) Improve routing trust with promiscuous listening routing security algorithm in mobile ad hoc networks. Journal of Elsevier Computer Communications 29(8): 1121–1132

    Google Scholar 

  21. Li, H., & Singal, M. (2006). A secure routing protocol for wireless ad hoc networks. In 39th Hawaii international conference on system sciences (pp. 1–10). Kauai: IEEE Computer Society.

  22. Gopalakrishnan, K., & Rhymend Uthariaraj, V. (2010). Local monitoring based reputation system with alert to mitigate the misbehaving nodes in mobile ad hoc networks. In V. V. Das & R. Vijaykumar (Eds.), ICT 2010. Part II, CCIS (Vol. 101, pp. 344–349). Heidelberg: Springer.

  23. Gopalakrishnan, K., & Rhymend Uthariaraj, V. (2011). Collaborative alert in a reputation system to alleviate colluding packet droppers in mobile ad hoc networks. In N. Meghanathan, B. K. Kaushik & D. Nagamalai (Eds.), CCSIT 2011. Part I, CCIS (Vol. 131, pp. 135–146). Heidelberg: Springer.

  24. Johnson, D.B., Maltz, D.A., & Broch, J. (1999). The dynamic source routing protocol for mobile ad hoc networks. Internet Draft, The Internet Engineering Task Force.

  25. Tseng Y. C., Ni S. Y., Chen Y. S., Sheu J. P. (2002) The broadcast storm problem in a mobile ad hoc network. Journal of Wireless Networks 8: 153–167

    Article  MATH  Google Scholar 

  26. Camp T., Boleng J., Davies V. (2002) A survey of mobility models for ad hoc network research. Journal of Wireless Communication and Mobile Computing 2: 483–502

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to K. Gopalakrishnan.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Gopalakrishnan, K., Rhymend Uthariaraj, V. Collaborative Polling based Routing Security Scheme to Mitigate the Colluding Misbehaving Nodes in Mobile Ad Hoc Networks. Wireless Pers Commun 67, 829–857 (2012). https://doi.org/10.1007/s11277-011-0413-5

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11277-011-0413-5

Keywords

Navigation