Intrusion Detection in wireless ad-hoc Networks Over the last decade, intrusion detection has presumed paramount significance within the broad network security, and specifically in wireless ad hoc networks. Mishra et al., (2004) define ad hoc networks as systems that do not possess an underlying infrastructure; that is, its network topology is continually changing. Given that these networks dynamically change their topologies, intrusion detection in ad hoc networks becomes a daunting task (Moosavi & Bui, 2014). Ping et al. (2008) add that ad hoc networks lack concentration points where aggregated traffic can be analyzed. Besides, they employ infrastructure protocols that are vulnerable to manipulation, while at the same time relying on noisy and discontinuous wireless communications. As evident, security remains a major problem for the ad hoc networks as a result of their features of lack in clear lines of defense, absence of centralized monitoring points, reliance on cooperative algorithms, and open medium (Zhang & Lee, 2014). As such, there is a need to complement traditional ad hoc security mechanisms, such as authentication and use of passwords, with efficient modern intrusion detection and response mechanisms. To achieve this objective, one of the approaches that has been proposed by Santosh et al. (2008) include the use of localized node or cluster detection to detect attacks. This research proposal seeks to explore whether the clustering of the network nodes make intrusion detection system robust and message communication efficient? The research proposes to investigate and determine the optimum number of clusters that can maximize the performance of the wireless system. To achieve this, the paper will first examine the vulnerabilities of a wireless ad-hoc network, the reasons why an intrusion detection system is needed, and the failures of the current intrusion detection approaches. Subsequent research will then describe alternative intrusion detection and response mechanisms that utilize localized nodes or clusters, for wireless ad-hoc networks. As a result, the outcome of the study will lead to a better understanding of the important and challenging issues in intrusion detection for ad-hoc routing protocols. References Mishra, A., Nadkarni, K., & Patcha, A. (2004). Intrusion detection in wireless ad hoc networks . Wireless Communications, IEEE , 11(1), 48-60 . Moosavi, H., & Bui, F. (2014). A discounted stochastic game approach to intrusion detection in wireless ad hoc networks. Communications and Electronics (ICCE), 2014 IEEE , 8(2), 536 541 . Ping, Y., Xinghao, J., Yue, W., & Ning, L. (2008). Distributed intrusion detection for mobile ad hoc networks. Journal of Systems Engineering and Electronics, 19(4), 851 859 . Santosh, N., Saranyan, R., Senthil, K., & Vetriselvi, V. (2008). Cluster Based Co-operative Game Theory Approach for Intrusion Detection in Mobile Ad-Hoc Grid . Advanced Computing and Communications, 273 278 . Zhang, Y., & Lee, W. (2014). Intrusion Detection in Wireless Ad Hoc Networks; 6th Internatioal Conference Mobile Computers and Network security. Wireless Communications, IEEE, 7(3), 275 -283.