Abstract
In this paper we reduce the communication and computation overhead involved in Leader Election for running Intrusion Detection System (IDS) for a cluster of nodes in mobile ad hoc networks using Mobile Agents. To reduce the performance overhead of IDS, a leader node is elected to handle intrusion detection service for the whole cluster. If the cluster head selection is random, it might be possible that resource consumption of the leader is higher and it might just lose all its power. Thus overall lifetime of cluster reduces to lesser than useful lifetime. It is clear that such methods have no guarantee to work. The solution requires balancing the resource consumption among all the nodes and thus increase the overall lifetime of a cluster by electing the most cost- efficient node. We will call it leader-IDS. Our contribution to the election scheme is to design an algorithm which uses mobile agents to gather resource information from all the cluster nodes and use it to elect leader in optimum and secure manner.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Murthy, C.S.R., Manoj, B.S.: Ad Hoc Wireless Networks. Pearson Education (2008)
Zhang, Y., Lee, W.: Intrusion Detection in Wireless Ad-Hoc Networks. In: Proc. MOBICOM 2000, pp. 275–283. ACM Press, Boston (2000)
Huang, Y.-A., Lee, W.: A Cooperative Intrusion Detection System for Ad Hoc Networks. In: Proceedings of the 1st ACM Workshop on Security of Ad Hoc and Sensor Networks, SASN 2003, pp. 135–147. ACM, NY (2003)
Kachirski, O., Guha, R.: Efficient Intrusion Detection Using Multiple Sensors in Wireless Ad Hoc Networks. In: Proc. IEEE Hawaii Int’l Conf. System Sciences, HICSS (2003)
Otrok, H., Mohammed, N., Wang, L., Debbabi, M., Bhattacharya, P.: A game-theoretic intrusion detection model for mobile ad hoc networks. Comput. Commun. 31(4), 708–721 (2008)
Mohammed, N., Otrok, H., Wang, L., Debbabi, M., Bhattacharya, P.: Mechanism Design-Based Secure Leader Election Model for Intrusion Detection in MANET. IEEE Transactions on Dependable and Secure Computing 8(1) (2011)
Zeng, Chen, Z.: A Cluster Header Election Scheme Based on Auction Mechanism for Intrusion Detection in MANET. In: International Conference on Network Computing and Information Security (2011)
Anderegg, L., Eidenbenz, S.: Ad Hoc-VCG: A Truthful and Cost-Efficient Routing Protocol for Mobile Ad Hoc Networks with Selfish Agents. In: Proc. ACM MobiCom (2003)
Albers, P., Camp, O., Percher, J.-M., Jouga, B., Ludovic, M., Puttini, R.: Security in ad hoc networks: a general intrusion detection architecture enhancing trust based approaches. In: Proc. of the First International Workshop on Wireless Information Systems, WIS 2002, pp. 1–12 (2002)
Tripathi, A.R.: A Security Architecture for Mobile Agents in Ajanta. In: Proceedings of the 20th International Conference on Distributed Computing Systems, ICDCS 2000, pp. 402–409. IEEE Computer Society, Washington, DC (2000)
Krishna, P., Vaidya, N.H., Chatterjee, M., Pradhan, D.K.: A Cluster-Based Approach for Routing in Dynamic Networks. Proc. ACM SIGCOMM Computer Comm. Rev. (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Darji, M., Trivedi, B. (2012). Secure Leader Election Algorithm Optimized for Power Saving Using Mobile Agents for Intrusion Detection in MANET. In: Thampi, S.M., Zomaya, A.Y., Strufe, T., Alcaraz Calero, J.M., Thomas, T. (eds) Recent Trends in Computer Networks and Distributed Systems Security. SNDS 2012. Communications in Computer and Information Science, vol 335. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34135-9_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-34135-9_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-34134-2
Online ISBN: 978-3-642-34135-9
eBook Packages: Computer ScienceComputer Science (R0)