A Survey of Routing Attacks and Security Measures in Mobile Ad-Hoc Networks <s> SUMMARY <s> In this paper, we propose an obligation-based model called fellowship to mitigate the flooding and packet drop attacks. We also explain how the fellowship model identifies and penalizes both the malicious and selfish nodes respectively in mobile ad hoc networks (MANET). The main advantages of our model are: it unifies the framework to defend both flooding and packet drop attacks, it identifies and expels the malicious and selfish nodes that fail to contribute their resources, and rejoins the repenting malicious and selfish nodes into the network. In addition, our technique does not rely on any centralized authority or tamper-proof hardware. <s> BIB001 </s> A Survey of Routing Attacks and Security Measures in Mobile Ad-Hoc Networks <s> SUMMARY <s> Security is paramount in mobile ad-hoc networks (MANET) as they are not conducive to centralized trusted authorities. Several solutions have been proposed for MANET in the areas of key management, secure routing, nodal cooperation, and trust management. Nevertheless, MANET lacks a unified architecture to take advantage of the deployed security models. In this paper, we propose trust enhanced security architecture for MANET (TEAM), in which a trust model is overlaid on the following security models - key management mechanism, secure routing protocol, and cooperation model. We briefly present the operation of our architecture and then we detail the system operation of our novel trust and cooperation model, which we call as secure MANET routing with trust intrigue (SMRTI) and fellowship respectively. SMRTI captures the evidence of trustworthiness for other nodes from the security models, and in return assists them to make better security decisions. Unlike related trust models, SMRTI captures recommendations in such a way that it eliminates both free-riding and honest-elicitation problems. In comparison with related cooperation models, fellowship model defends against both flooding and packet drop attacks. It can efficiently identify and isolate both malicious and selfish nodes that fail to share the communication channel or forward packets for other nodes. Furthermore, our models do not rely on any centralized authority or tamper-proof hardware. Simulation results confirm that our models enhance the performance of TEAM. <s> BIB002 </s> A Survey of Routing Attacks and Security Measures in Mobile Ad-Hoc Networks <s> SUMMARY <s> In recent years, several secure routing protocols have been proposed to secure communications among nodes in mobile ad hoc networks. However, they are not tailored to defend against denial of service (DoS) attacks such as flooding and packet drop attacks. This has led to the development of models that target cooperation among nodes. These models either fail to protect against flooding attacks or only defend against greedy nodes that drop packets to save battery resources. The main shortcoming of cooperation models is that they fail to evaluate the trustworthiness for other nodes. In this paper, we propose a Trust Integrated Cooperation Architecture which consists of an obligation-based cooperation model known as fellowship to defend against both flooding and packet drop attacks. In our architecture, fellowship enhances its security decisions through a trust model known as secure MANET routing with trust intrigue (SMRTI). In comparison with related models, SMRTI deploys a novel approach to communicate recommendations such that the deployed approach is free from well-known issues such as honest elicitation, free riding, bias of a recommender, and additional overhead. <s> BIB003 </s> A Survey of Routing Attacks and Security Measures in Mobile Ad-Hoc Networks <s> SUMMARY <s> An ad hoc network is a collection of mobile nodes that dynamically form a temporary network. It operates without the use of existing infrastructure. One of the principal routing protocols used in ad-hoc networks is AODV (ad-hoc on demand distance vector) protocol. The security of the AODV protocol is compromised by a particular type of attack called 'black hole' attack. In this attack a malicious node advertises itself as having the shortest path to the node whose packets it wants to intercept. To reduce the probability it is proposed to wait and check the replies from all the neighboring nodes to find a safe route. Computer simulation using glomosim shows that our protocol provides better performance than the conventional AODV in the presence of Black holes with minimal additional delay and Overhead. <s> BIB004
MANETs is an emerging technological field and hence is an active area of research. Because of ease of deployment and defined infrastructure less feature these networks find applications in a variety of scenarios ranging from emergency operations and disaster relief to military service and task forces. Providing security in such scenarios is critical. The primary limitation of the MANETs is the limited resource capability: bandwidth, power back up and computational capacity. Absence of infrastructure, vulnerability of channels and nodes, dynamically changing topology make the security of MANETs particularly difficult. Also no centralized authority is present to monitor the networking operations. Therefore, existing security schemes for wire networks cannot be applied directly to a MANETs, which makes them much more vulnerable to security attacks. Of these attacks, the passive attacks do not disrupt the operation of a protocol, but is only information seeking in nature whereas active attacks disrupt the normal operation of the MANET as a whole by targeting specific node(s). In this survey, we reviewed the current state of the art routing attacks and countermeasures MANETs. The advantages as well as the drawbacks of the countermeasures have been outlined. It has been observed that although active research is being carried out in this area, the proposed solutions are not complete in terms of effective and efficient routing security. There are limitations on all solutions. They may be of high computational or communication overhead (in case of cryptography and key management based solutions) which is detrimental in case of resource constrained MANETS, or of the ability to cope with only single malicious node and ineffectiveness in case of multiple colluding attackers. Some solutions may require special hardware such as a GPS or a modification to the existing protocol. Furthermore, most of the proposed solutions can work only with one or two specific attacks and are still vulnerable to unexpected attacks. A number of challenges like the Invisible Node Attack remain in the area of routing security of MANETs. Although researchers have designed efficient security routing, optimistic approaches like Fellowship-TEAM-SMRITI BIB001 BIB002 BIB003 , CREQ-CREP approach BIB004 etc., which can provide a better tradeoff between security and performance, a lot more is yet to be done. Future research efforts should be focused not only on improving the effectiveness of the security schemes but also on minimizing the cost to make them suitable for a MANET environment.