Skip to main content
SpringerLink
Log in

STACRP: a secure trusted auction oriented clustering based routing protocol for MANET

  • Published:
Cluster Computing Aims and scope Submit manuscript

Abstract

In mobile ad hoc network (MANET) nodes have a tendency to drop others’ packet to conserve its own energy. If most of the nodes in a network start to behave in this way, either a portion of the network would be isolated or total network functionality would be hampered. This behavior is known as selfishness. Therefore, selfishness mitigation and enforcing cooperation between nodes is very important to increase the availability of nodes and overall throughput and to achieve the robustness of the network. Both credit and reputation based mechanisms are used to attract nodes to forward others’ packets. In light of this, we propose a game theoretic routing model, Secure Trusted Auction oriented Clustering based Routing Protocol (STACRP), to provide trusted framework for MANET. Two auction mechanisms procurement and Dutch are used to determine the forwarding cost-per-hop for intermediate nodes. Our model is lightweight in terms of computational and communication requirements, yet powerful in terms of flexibility in managing trust between nodes of heterogeneous deployments. It manages trust locally with minimal overhead in terms of extra messages. STACRP organizes the network into 1-hop disjoint clusters and elects the most qualified and trustworthy nodes as Clusterhead. The trust is quantified with carefully chosen parameters having deep impact on network functionality. The trust model is analyzed using Markov chain and is proven as continuous time Markov chain. The security analysis of the model is analyzed to guarantee that the proposed approach achieves a secure reliable routing solution for MANETs. The proposed model have been evaluated with a set of simulations that show STACRP detects selfish nodes and enforces cooperation between nodes and achieves better throughput and packet delivery ratio with lees routing overhead compare to AODV.

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
Algorithm 1
Fig. 3
Algorithm 2
Function
Function
Function
Algorithm 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8

Similar content being viewed by others

References

  1. Buttyan, L., Hubaux, J.P.: Nuglets: a virtual currency to stimulate cooperation in self-organized mobile ad hoc networks, 2001

  2. Zhong, S., Chen, J., Yang, Y.R.: Sprite: A simple, cheat-proof, credit-based system for mobile ad-hoc networks. In: Proceedings of IEEE INFOCOM 2003, pages, pp. 1987–1997, March–April (2003)

    Google Scholar 

  3. Yang, H., Meng, X., Lu, S.: Self-organized network-layer security in mobile ad hoc networks. In: Proceedings of ACM WiSe02, September (2002)

    Google Scholar 

  4. Perkins, C., Royer, E.B., Das, S.: Ad hoc on demand distance vector (aodv) routing. IETF RFC 3561, July 2003

  5. Anderegg, L., Eidenbenz, S.: Ad hoc-vcg: A truthful and cost efficient routing protocol for mobile ad hoc networks with selfish agents. In: Proceedings of MobiCom 2003, pp. 245–259, September (2003)

    Chapter  Google Scholar 

  6. Hu, Y.-C., Perrig, A., Johnson, D.: The dynamic source routing protocol for mobile ad hoc networks (dsr). draft-ietf-manet-dsr-10.txt, July 2004

  7. Buchegger, S., Boudec, J.-Y.L.: Performance analysis of the confidant protocol (cooperation of nodes: Fairness in dynamic ad-hoc networks). In: Proceedings of the ACM Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc), 9–11 June (2002)

    Google Scholar 

  8. Hu, J.: Lars a locally aware reputation system for mobile ad hoc networks. In: Proceedings of 44th Annual Southeast Regional Conference, pp. 119–123 (2006)

    Chapter  Google Scholar 

  9. Marti, S., Giuli, T.J., Lai, K., Baker, M.: Mitigating routing misbehavior in mobile ad hoc networks. In: Proceedings of 6th Annual International Conference on Mobile Computing and Networking, MobiCom and 2000, pp. 255–265, August (2000)

    Chapter  Google Scholar 

  10. Buchegger, S., Boudec, J.: Performance analysis of the confidant protocol cooperation of nodes fairness in dynamic ad-hoc networks. In: Proceedings of International Symposium on Mobile Ad hoc Networking and Computing MobiHoc and 2002, pp. 226–236, June (2002)

    Chapter  Google Scholar 

  11. Michiardi, P., Molva, R.: Core a collaborative reputation mechanism to enforce node cooperation in mobile ad hoc networks. In: Proceedings of Communications and Multimedia Security ConferenceCMS and 2002, September (2002)

    Google Scholar 

  12. Bansal, S., Baker, M.: Observation-based cooperation enforcement in ad-hoc networks (2003)

  13. Milan, F., Jaramillo, J.J., Srikant, R.: Achieving cooperation in multihop wireless networks of selfish nodes. In: Proceedings of Workshop on Game Theory for Networks GameNets 2006, October (2006)

    Google Scholar 

  14. Adams, W.J., Davis, N.J.: Toward a decentralized trust-based access control system for dynamic collaboration. In: Proceedings of 6th Annual IEEE SMC Information Assurance Workshop IAW’05, pp. 317–324, June (2005)

    Chapter  Google Scholar 

  15. Boukerche, A., Ren, Y.: A security management scheme using a novel computational reputation model for wireless and mobile ad hoc networks. In: Proceedings of Workshop on Modeling Analysis and Simulation of Wireless and Mobile Systems, pp. 88–95 (2008)

    Google Scholar 

  16. Li, R., et al.: An objective trust management framework for mobile ad hoc networks. In: Proceedings of IEEE 65th Vehicular Technology Conf. VTC’07, pp. 56–60, April (2007)

    Chapter  Google Scholar 

  17. Theodorakopoulos, G., Baras, J.S.: Trust evaluation in ad-hoc networks. In: Proceedings of Workshop on Wireless Security, pp. 1–10 (2004)

    Google Scholar 

  18. Jiang, T., Baras, J.S.: Ant-based adaptive trust evidence distribution in manet. In: Proceedings of 2nd Int’l Conf. on Mobile Distributed Computing Systems Workshops and MDC, pp. 588–593, March (2004)

    Google Scholar 

  19. Yan, Z., Zhang, P., Virtanen, T.: Trust evaluation based security solution in ad hoc networks. In: Proceedings of Seventh Nordic Workshop on Secure IT Systems (2003)

    Google Scholar 

  20. Pirzada, A.A., McDonald, C.: Establishing trust in pure ad-hoc networks. In: Proceedings of 27th conference on Australasian computer science CRPIT’04 and Australian Computer Society and Inc (2004)

    Google Scholar 

  21. Ghosh, T., Pissinou, N., Makki, K.: Collaborative trust-based routing in multi-hop ad hoc networks. In: Proceedings of Proc. 3rd Int’l IFIP-TC06 Networking Conf. Lecture Notes in Computer Science, pp. 1446–1451, 9–14 May (2004)

    Google Scholar 

  22. Ghosh, T., Pissinou, N., Makki, K.: Towards designing a trust routing solution in mobile ad hoc networks. Mob. Netw. Appl. 10, 985–995 (2005)

    Article  Google Scholar 

  23. Balakrishnnan, V., Varadharajan, V., Tupakula, U.K., Lucs, P.: Trust and recommendations in mobile ad hoc networks. In: Proceedings of 10th IEEE International Conference on Networking and Services, pp. 64–69, 19–25 June (2007)

    Google Scholar 

  24. Wang, X., Liu, L., Su, J.: Rlm: A general model for trust representation and aggregation. IEEE Trans. Serv. Comput. 99 (2010)

  25. Virendra, M., Jadliwala, M., Chandrasekaran, M., Upadhyaya, S.: Quantifying trust in mobile ad-hoc networks. In: Proceedings of IEEE International Conference on Integration of Knowledge Intensive Multi-Agent Systems KIMAS’05, pp. 65–71 (2005)

    Chapter  Google Scholar 

  26. Chang, B.-J., Kuo, S.-L.: Markov chain trust model for trust-value analysis and key management in distributed multicast manets. IEEE Trans. Veh. Technol. 58, 1846–1863 (2009)

    Article  Google Scholar 

  27. Cho, J., Swami, A., Chen, I.: A survey on trust management for mobile ad hoc networks. IEEE Commun. Surv. Tutor. 99, 1–22 (2010)

    Google Scholar 

  28. Chatterjee, P., Sengupta, I., Ghosh, S.: A trust based auction oriented routing model for ad hoc networks. In: Proceedings of IEEE TrustCom and 2010 (2010)

    Google Scholar 

  29. Fall, K., Varadhan, K.: ns manual. isi.edu/nsnam/ns/doc

  30. Ghosh, U., Datta, R.: Iddip: An id based secure dynamic ip configuration scheme for mobile ad hoc networks. In: Proceedings of the First International Conference on Network and Service Security, 24–26 June (2009)

    Google Scholar 

  31. Marias, G., Georgiadis, P., Flitzanis, D., Mandalas, K.: Cooperation enforcement schemes for manets: A survey. Wirel. Commun. Mob. Comput. 6, 319–332 (2006)

    Article  Google Scholar 

  32. Liu, J., Issarny, V.: Enhanced reputation mechanism for mobile ad hoc networks. In: Proceedings of 2nd International Conference on Trust Management, March (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Information Technology, Indian Institute of Technology, Kharagpur, India

    Pushpita Chatterjee & S. K. Ghosh

  2. Dept. of Computer Science & Engineering, Indian Institute of Technology, Kharagpur, India

    Indranil Sengupta

Authors
  1. Pushpita Chatterjee
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Indranil Sengupta
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. S. K. Ghosh
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Pushpita Chatterjee.

Appendix

Appendix

Table 3 Comparison of existing cooperation enforcement schemes
Full size table

A survey on existing enforcing cooperation and mitigating selfishness schemes between nodes along with our proposed STACRP scheme for MANET are given in Table 3. Description of different cooperation enforcement schemes are adapted from [31] to compare our proposal. The meaning of the field entry in Table 3 as follows:

  • Reputation/Payment: Reputation means self or recommendation evidences from trusted neighbors. Payment is rewarding scheme for good behavior.

  • General/Selfishness: General means selfishness as well as other misbehavior of any node. Selfishness is described by typical behavior of a node to save battery for its own communication and jeopardizing network functionality by not participating in routing.

  • Global/Context: Global observation means a node monitors or traces network packets as a whole and context refers if the monitoring node traces network traffic only on some specific contexts.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chatterjee, P., Sengupta, I. & Ghosh, S.K. STACRP: a secure trusted auction oriented clustering based routing protocol for MANET. Cluster Comput 15, 303–320 (2012). https://doi.org/10.1007/s10586-012-0198-7

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10586-012-0198-7

Keywords

Search

Navigation