This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Mechanism Design-Based Secure Leader Election Model for Intrusion Detection in MANET
January-February 2011 (vol. 8 no. 1)
pp. 89-103
Noman Mohammed, Concordia University, Montreal
Hadi Otrok, Concordia University, Montreal
Lingyu Wang, Concordia University, Montreal
Mourad Debbabi, Concordia University, Montreal
Prabir Bhattacharya, Concordia University, Montreal
In this paper, we study leader election in the presence of selfish nodes for intrusion detection in mobile ad hoc networks (MANETs). To balance the resource consumption among all nodes and prolong the lifetime of an MANET, nodes with the most remaining resources should be elected as the leaders. However, there are two main obstacles in achieving this goal. First, without incentives for serving others, a node might behave selfishly by lying about its remaining resources and avoiding being elected. Second, electing an optimal collection of leaders to minimize the overall resource consumption may incur a prohibitive performance overhead, if such an election requires flooding the network. To address the issue of selfish nodes, we present a solution based on mechanism design theory. More specifically, the solution provides nodes with incentives in the form of reputations to encourage nodes in honestly participating in the election process. The amount of incentives is based on the Vickrey, Clarke, and Groves (VCG) model to ensure truth-telling to be the dominant strategy for any node. To address the optimal election issue, we propose a series of local election algorithms that can lead to globally optimal election results with a low cost. We address these issues in two possible application settings, namely, Cluster-Dependent Leader Election (CDLE) and Cluster-Independent Leader Election (CILE). The former assumes given clusters of nodes, whereas the latter does not require any preclustering. Finally, we justify the effectiveness of the proposed schemes through extensive experiments.

[1] T. Anantvalee and J. Wu, "A Survey on Intrusion Detection in Mobile Ad Hoc Networks," Wireless/Mobile Network Security, Springer, 2006.
[2] L. Anderegg and S. Eidenbenz, "Ad Hoc-VCG: A Truthful and Cost-Efficient Routing Protocol for Mobile Ad Hoc Networks with Selfish Agents," Proc. ACM MobiCom, 2003.
[3] F. Anjum and P. Mouchtaris, Security for Wireless Ad Hoc Networks. John Wiley and Sons, Inc., 2007.
[4] S. Basagni, "Distributed and Mobility-Adaptive Clustering for Multimedia Support in Multi-Hop Wireless Networks," Proc. IEEE Int'l Vehicular Technology Conf. (VTC), 1999.
[5] S. Basagni, "Distributed Clustering for Ad Hoc Networks," Proc. IEEE Int'l Symp. Parallel Architectures, Algorithms, and Networks (ISPAN), 1999.
[6] M. Bechler, H. Hof, D. Kraft, F. Pahlke, and L. Wolf, "A Cluster-Based Security Architecture for Ad Hoc Networks," Proc. IEEE INFOCOM, 2004.
[7] P. Brutch and C. Ko, "Challenges in Intrusion Detection for Wireless Ad-Hoc Networks," Proc. IEEE Symp. Applications and the Internet (SAINT) Workshop, 2003.
[8] S. Buchegger and J.L. Boudec, "Performance Analysis of the CONFIDANT Protocol (Cooperation of Nodes—Fairness in Dynamic Ad-Hoc Networks)," Proc. ACM MOBIHOC, 2002.
[9] K. Chen and K. Nahrstedt, "iPass: An Incentive Compatible Auction Scheme to Enable Packet Forwarding Service in MANET," Proc. Int'l Conf. Distributed Computing Systems, 2004.
[10] B. DeCleene, L. Dondeti, S. Griffin, T. Hardjono, D. Kiwior, J. Kurose, D. Towsley, S. Vasudevan, and C. Zhang, "Secure Group Communications for Wireless Networks," Proc. IEEE Military Comm. Conf. (MILCOM), 2001.
[11] J. Feigenbaum, C. Papadimitriou, R. Sami, and S. Shenker, "A BGP Based Mechanism for Lowest-Cost Routing," Proc. ACM Symp. Principles of Distributed Computing (PODC), 2002.
[12] J. Feigenbaum and S. Shenker, "Distributed Algorithmic Mechanism Design: Recent Results and Future Directions," Proc. AMM Int'l Workshop Discrete Algorithms and Methods for Mobile Computing and Comm. (DIALM), 2002.
[13] N. Gura, A. Patel, A. Wander, H. Eberle, and S.C. Shantz, "Comparing Elliptic Curve Cryptography and RSA on 8-Bit CPUs," Proc. Workshop Cryptographic Hardware and Embedded Systems (CHES), 2004.
[14] S. Gwalani, K. Srinivasan, G. Vigna, E.M. Beding-Royer, and R. Kemmerer, "An Intrusion Detection Tool for AODV-Based Ad Hoc Wireless Networks," Proc. IEEE Computer Security Applications Conf. (CSAC), 2004.
[15] Y. Hu, A. Perrig, and D.B. Johnson, "Ariadne: A Secure On-Demand Routing Protocol for Ad Hoc Networks," Proc. ACM MOBICOM, 2002.
[16] Y. Huang and W. Lee, "A Cooperative Intrusion Detection System for Ad Hoc Networks," Proc. ACM Workshop Security of Ad Hoc and Sensor Networks, 2003.
[17] L. Hurwicz and S. Reiter, Designing Economic Mechanisms, first ed. Cambridge Univ. Press, 2008.
[18] J. Green and J. Laffont, Incentives in Public Decision-Making. Springer, 1996.
[19] O. Kachirski and R. Guha, "Efficient Intrusion Detection Using Multiple Sensors in Wireless Ad Hoc Networks," Proc. IEEE Hawaii Int'l Conf. System Sciences (HICSS), 2003.
[20] P. Krishna, N.H. Vaidya, M. Chatterjee, and D.K. Pradhan, "A Cluster-Based Approach for Routing in Dynamic Networks," Proc. ACM SIGCOMM Computer Comm. Rev., 1997.
[21] A. Mas-Colell, M. Whinston, and J. Green, Microeconomic Theory. Oxford Univ. Press, 1995.
[22] P. Michiardi and R. Molva, "Analysis of Coalition Formaton and Cooperation Strategies in Mobile Adhoc Networks," J. Ad Hoc Networks, vol. 3, no. 2, pp. 193-219, 2005.
[23] A. Mishra, K. Nadkarni, and A. Patcha, "Intrusion Detection in Wireless Ad Hoc Networks," IEEE Wireless Comm., vol. 11, no. 1, pp. 48-60, Feb. 2004.
[24] N. Mohammed, H. Otrok, L. Wang, M. Debbabi, and P. Bhattacharya, "A Mechanism Design-Based Multi-Leader Election Scheme for Intrusion Detection in Manet," Proc. IEEE Wireless Comm. and Networking Conf. (WCNC), 2008.
[25] P. Morris, Introduction to Game Theory, first ed. Springer, 1994.
[26] P. Ning and K. Sun, "How to Misuse AODV: A Case Study of Insider Attacks against Mobile Ad-Hoc Routing Protocols," Proc. IEEE Information Assurance Workshop, 2003.
[27] N. Nisan and A. Ronen, "Algorithmic Mechanism Design," Games and Economic Behavior, pp. 129-140, 1999.
[28] N. Nisan, T. Roughgarden, E. Tardos, and V.V. Vazirani, Algorithmic Game Theory, first ed. Cambridge Univ. Press, 2007.
[29] H. Otrok, N. Mohammed, L. Wang, M. Debbabi, and P. Bhattacharya, "A Game-Theoretic Intrusion Detection Model for Mobile Ad-Hoc Networks," J. Computer Comm., vol. 31, no. 4, pp. 708-721, 2008.
[30] A. Perrig, R. Canetti, D. Tygar, and D. Song, "The TESLA Broadcast Authentication Protocol," RSA Cryptobytes, vol. 5, no. 2, pp. 2-13, 2002.
[31] J. Shneidman and D. Parkes, "Specification Faithfulness in Networks with Rational Nodes," Proc. ACM Symp. Principles of Distributed Computing, 2004.
[32] K. Sun, P. Peng, P. Ning, and C. Wang, "Secure Distributed Cluster Formation in Wireless Sensor Networks," Proc. IEEE Computer Security Applications Conf. (ACSAC), 2006.
[33] S. Vasudevan, B. DeCleene, N. Immerman, J. Kurose, and D. Towsley, "Leader Election Algorithms for Wireless Ad Hoc Networks," Proc. IEEE DARPA Information Survivability Conf. and Exposition (DISCEX III), 2003.
[34] S. Vasudevan, J. Kurose, and D. Towsley, "Design and Analysis of a Leader Election Algorithm for Mobile Ad Hoc Networks," Proc. IEEE Int'l Conf. Network Protocols (ICNP), 2004.
[35] Y. Zhang and W. Lee, "Intrusion Detection in Wireless Ad-Hoc Networks," Proc. ACM MobiCom, 2000.

Index Terms:
Leader election, intrusion detection systems, mechanism design and MANET security.
Citation:
Noman Mohammed, Hadi Otrok, Lingyu Wang, Mourad Debbabi, Prabir Bhattacharya, "Mechanism Design-Based Secure Leader Election Model for Intrusion Detection in MANET," IEEE Transactions on Dependable and Secure Computing, vol. 8, no. 1, pp. 89-103, Jan.-Feb. 2011, doi:10.1109/TDSC.2009.22
Usage of this product signifies your acceptance of the Terms of Use.