Gray and Black Hole Attack Identification Using Control Packets in MANETs

A Review on Cooperative Bait Based Intrusion Detection in MANET

Mobile Ad Hoc Networks (MANETs) are infrastructure-less networks that are mainly used for establishing communication during the situation where wired network fails. Security related information collection is a fundamental part of the identification of attacks in Mobile Ad Hoc Networks (MANETs). A node should find accessible routes to remaining nodes for information assortment and gather security related information during route discovery for choosing secured routes. During data communication, malicious nodes enter the network and cause disturbances during data transmission and reduce the performance of the system. In this manuscript, a Time Interval Based Blockchain Model (TIBBM) for security related information assortment that identifies malicious nodes in the MANET is proposed. The proposed model builds the Blockchain information structure which is utilized to distinguish malicious nodes at specified time intervals. To perform a malicious node identification process, a Network Block Monitoring Node (NBMN) is selected after route selection and this node will monitor the blocks created by the nodes in the routing table. At long last, NBMN node understands the location of malicious nodes by utilizing the Blocks created. The proposed model is compared with the traditional malicious node identification model and the results show that the proposed model exhibits better performance in malicious node detection.

The Mobile Ad Hoc Network (MANET) depending on dynamic distributed topology presents several challenges such as decentralized infrastructure. In MANET, each node act as a host as well as a router to exchange packet. From Source to destination, the MANET nodes offer the ability of transmission to send, receive, and route traffic. Moreover, the presence of selfish nodes or malicious nodes in MANETs significantly degrades network performance. Identifying and isolating such nodes poses a formidable challenge. Consequently, this research introduces a security model founded on the principles of an Artificial Immune System (AIS) to detect and defend against Selfish Node (SN) attacks. This research work employs the principles of AIS to categorize a node's behavioral state based on the Mature Context Immune Antigen Rate (MCIAR). Subsequently, a hybrid protocol named Reliable History‐dependent Resource Conscious Clustered and Defensive AODV (RRCC‐DAODV) is introduced to detect Selfish Nodes (SNs) and counteract their attacks. Within the RRCC algorithm, the identification of selfish nodes relies on both Trust Value (TV) and Residual Energy (RE). Additionally, the proposed DAODV protocol incorporates the V‐detector algorithm to enhance defense mechanisms against potential attacks. The simulation of the proposed model is carried out in NS3. The proposed mechanism achieves a detection ratio of 94.05%. The simulation outcomes demonstrate the excellence of the implemented system. This superiority is observed when compared to other standard protocols, as indicated by the parameters of throughput, residual energy, packet delivery ratio, and delay.

Intrusion detection system (IDS) design for mobile adhoc networks (MANET) is a crucial component for maintaining the integrity of the network. The need for rapid deployment of IDS capability with minimal data availability for training and testing is an important requirement of such systems, especially for MANETs deployed in highly dynamic scenarios, such as battlefields. This work proposes a two-level detection scheme for detecting malicious nodes in MANETs. The first level deploys dedicated sniffers working in promiscuous mode. Each sniffer utilizes a decision-tree-based classifier that generates quantities which we refer to as correctly classified instances (CCIs) every reporting time. In the second level, the CCIs are sent to an algorithmically run supernode that calculates quantities, which we refer to as the accumulated measure of fluctuation (AMoF) of the received CCIs for each node under test (NUT). A key concept that is used in this work is that the variability of the smaller size population which represents the number of malicious nodes in the network is greater than the variance of the larger size population which represents the number of normal nodes in the network. A linear regression process is then performed in parallel with the calculation of the AMoF for fitting purposes and to set a proper threshold based on the slope of the fitted lines. As a result, the malicious nodes are efficiently and effectively separated from the normal nodes. The proposed scheme is tested for various node velocities and power levels and shows promising detection performance even at low-power levels. The results presented also apply to wireless sensor networks (WSN) and represent a novel IDS scheme for such networks.

Mobile Ad hoc Networks (MANET) comprises of self-organizing autonomous mobile nodes. MANETs are open and decentralized. Therefore they are vulnerable to malicious entities. MANETs are multi-hop wireless network where all nodes supportively maintain network connectivity without a centralized infrastructure. Since MANETs are infrastructure less and independent, the secure communication is the main issue. Therefore they are vulnerable to malicious entities. Here the location identity and traffic can be traced out by an outside observer. Anonymity means secure communications by hiding node identities and preventing traffic analysis attacks by outside observers. This paper proposes Position based Anonymous Routing Scheme in MANETs (PARS).Here the routing is based on Greedy Perimeter Stateless Routing Protocol. The objective is an anonymous routing protocol for the network. The proposed one is a zone based anonymous GPSR based protocol that can provide source, destination and route anonymity. Performance of the proposed system is compared with that of GPSR and AODV using Network Simulator. Index Terms: Anonymous routing, position-based routing, random forwarder, zone partition. I. Introduction Mobile Ad hoc Networks are collection of independent mobile nodes that can communicate by radio waves. It is an infrastructure less self-organizing network. The nodes that are in radio range can communicate by single hop or by multi hop with the help of intermediate nodes. The network is open and decentralized and fully distributed. So they are perfect choice for communication and information sharing. MANETs are susceptible to malicious entities that aim to alter and analyzed the traffic analysis by communication eaves dropping or attacking routing protocols. MANETs are characterized by their distributed operation, multi hop routing, dynamic topology and shared physical medium. Nodes in a MANET are independently free to move in any direction. Due to the lack of a centralized coordinator security is the major concern here. Wireless communication can endure interferences or malicious interceptions; whereas multi-hop communication assumes that each node will perform properly its functions to support network services. Further, self-organization increases the complexity of security management operations as access control, node authentication, secure routing and cryptographic key distribution. There is no fixed infrastructure and the topology is frequently changing due to node mobility or environmental changes. Therefore, it is very hard to maintain a stable and efficient end-to-end route in an ad-hoc network. Each node in MANET is energy constrained. There is verylimited physical security in MANET. The type of attacks can be Active attacks or Passive attacks. The common security issues are Passive attacks which include eaves dropping and information disclosure. Active attacks include Do Sand Data modification. There are other more specific problems with mobile ad hoc network such as vulnerability of channels and nodes, Byzantine black hole and Byzantine wormhole attack. The security issue also includes attacks that may inject erroneous routing information and diverting network traffic thus making routing inefficient. There are many methods to reduce the impact of these attacks, which include a secure routing using public and private key s to get a certification authority and use of digital signatures and prior it rust relationships. Routing is the process of communication from one node to the other host in a network. Routing is the process off or warding packet towards its destination using most efficient path. Routing efficiency is measured in terms of Number of hops, traffic, security, etc. Routing protocols in MANETs are divided as reactive proactive and hybrid. Reactive Protocol maintains the routes in on demand manner. In route discovery phase it floods the route request (RREQ) packets throughout the network. Dynamic source Routing (DSR), ad hoc on- demand distance vector routing (AODV) are some of the examples of reactive protocols. In proactive approach every node in the MANET continuously maintains the complete routing information of the entire network. This is accomplished by flooding network periodically with network status information. Global State Routing (GSR), Hierarchical State Routing (HSR) and Destination Sequenced Distance Vector Routing (DSDV) are some of the examples of proactive

Now a day's use of wireless communication is very common and growing faster. There are different types of wireless networks which are designed as per the requirement of data rate and coverage. In this paper scope is limited to widely study and used network called Mobile Ad hoc Network (MANET). MANET is collection of wireless devices which communicate among each other without need of any physical infrastructure as well as centralize administrations. Each mobile node in MANET acts as peer node. The communication is MANET is based on routing methods and hence since from last 2 decade there are number of routing methods designed with objective of improving the Quality of Service (QoS) performance of MANET. As the mobile nodes in MANET are moving randomly with varying mobility speed, this can leads the challenging tasks to achieve the guaranteed QoS performance. Therefore it is required to have efficient routing protocol with load balancing and dynamic behaviour of mobile nodes handling in MANET. In this paper, our goal first is to present the study on different QoS aware routing methods and non-routing methods designed by various research groups for MANET. Second objective is to design novel QoS Aware routing protocol for improving the QoS performance in MANET. Additionally, we are presenting the current research gap based on analysis of all recent methods of QoS improvement. The outcome of this paper is the current research problems and efficient QAODV routing method.

Mobile Ad hoc Network (MANET) is set up with a group of mobile wireless nodes and is devoid of any dedicated routers or base stations. The wireless nodes move around freely and mutually cooperate with each other in routing and forwarding packets without the support of any fixed infrastructure or centralized administration. The topology is highly dynamic, making the routing procedure more difficult and insecure. The wireless nodes of MANET are thus susceptible to compromise and are particularly vulnerable to denial of service (DoS) attacks launched by malicious nodes or intruders. Flooding attack is one such type of DoS attack, in which a compromised node floods the entire network by sending a large number of fake RREQs to nonexistent nodes in the network, thus resulting in network congestion. In this paper, the security of MANET AODV routing protocol is investigated by identifying the impact of flooding attack on it. A simulation study of the effects of flooding attack on the performance of the AODV routing protocol is presented. The simulation environment is implemented by using the NS-3 network simulator. It is observed that due to the presence of such malicious nodes, average percentage of packet loss in the network, average routing overhead and average bandwidth requirement — all increases, thus degrading the performance of MANET significantly.

In Mobile Ad-hoc Networks (MANETs), each node is free to move and connect with one another over a wireless connection, without the requirement for a centralized controller or base station. These features make MANET useful and functional in a variety of areas, including tactical situations, sensor networks, rescue operations, and students on campus. However, this type of network also has a range of issues such as security, Quality of Service, dynamic topology, scalability, the absence of central management, and energy consumption. Since MANET nodes have little battery life, the power usage is among the most important design considerations in wireless ad-hoc networks. Each node is responsible for forwarding the packets to its neighboring nodes. Since the MANET does not contain a hierarchy, some nodes may not participate in forwarding the packets and prefer to keep their remaining energy for themselves; these nodes are called selfish nodes. The presence of selfish nodes in the MANET greatly affects the efficiency and activity of the network. The process of detecting and isolating the selfish node does not constitute an easy task. It still requires further investigation and study. Therefore, this survey is intended to determine, study and analyze some new detection mechanisms used in detecting selfish nodes in MANETs. It also classifies them into three categories which are credit-based, reputation-based, and acknowledgment-based techniques. In addition, it highlights some critical issues in MANET according to selfish behavior, and points out the necessary requirements for better improvement as well as fields for future research.

This dissertation presents novel approaches to modeling and analyzing security and resource allocation in mobile ad hoc networks (MANETs). The research involves the design, implementation and simulation of different models resulting in resource sharing and security’s strengthening of the network among mobile devices. Because of the mobility, the network topology may change quickly and unpredictably over time. Moreover, data-information sent from a source to a designated destination node, which is not nearby, has to route its information with the need of intermediary mobile nodes. However, not all intermediary nodes in the network are willing to participate in data-packet transfer of other nodes. The unwillingness to participate in data forwarding is because a node is built on limited resources such as energy-power and data. Due to their limited resource, nodes may not want to participate in the overall network objectives by forwarding data-packets of others in fear of depleting their energy power. To enforce cooperation among autonomous nodes, we design, implement and simulate new incentive mechanisms that used game theoretic concepts to analyze and model the strategic interactions among rationale nodes with conflicting interests. Since there is no central authority and the network is decentralized, to address the concerns of mobility of selfish nodes in MANETs, a model of security and trust relationship was designed and implemented to improve the impact of investment into trust mechanisms. A series of simulations was carried out that showed the strengthening of security in a network with selfish and malicious nodes. Our research involves bargaining for resources in a highly dynamic ad-hoc network. The design of a new arbitration mechanism for MANETs utilizes the Dirichlet distribution for fairness in allocating resources. Then, we investigated the problem of collusion nodes in mobile ad-hoc networks with an arbitrator. We model the collusion by having a group of nodes disrupting the bargaining process by not cooperating with the arbitrator. Finally, we investigated the resource allocation for a system between agility and recovery using the concept of Markov decision process. Simulation results showed that the proposed solutions may be helpful to decision-makers when allocating resources between separated teams.

Mobile Ad hoc network (MANET) is a short range network which enables various mobile nodes to communicate with each other. The range of mobile node for communication is limited in the MANET so two nodes of different network which are placed in long distance are unable to communicate between them. Utility of MANET can be enhanced by providing Internet connectivity to the mobile nodes. MANET is infrastructureless and Internet is infrastructure type network so they require an interface to connect with each other. So in this situation, Gateway, a device which acts as an interface and a router, provides the MANET nodes connectivity to fixed networks. A mobile node in MANET has to find a route to a gateway first to communicate with the Internet host. It requires an efficient gateway discovery mechanism for improve the overall performance of network. For this process various approaches have been proposed in the past. The popular approaches are reactive, proactive and hybrid gateway discovery mechanisms. This paper focuses on various issues for MANET-Internet integration and their proposed technical solutions by various proposals for different Internet gateway discovery mechanisms to improve the performance.

A network connecting mobile nodes wirelessly is known as mobile ad-hoc network (MANET). In MANET the communication takes place with the help of mobile nodes. Every node in a MANET forwards data so that it can reach to its destination. It is assumed that all the nodes in the network behave properly while forwarding the data packets. Selfish nodes are those nodes who do not participate in data forwarding. The presence of such selfish nodes degrade the performance of MANET. In this paper, we survey the various mechanisms to detect selfish node in MANET.

Mobile Ad Hoc Network (MANET) is collection of self configuring, wireless, multi hop mobile nodes. This network lacks centralized routing capability as well as a fixed network infrastructure and topology. In order to communicate with each other these multi hop nodes themselves act as routers. As the nodes are mobile and due to lack of central server, the routing may become erroneous. Also due to dynamic nature of nodes the routing becomes a highly tedious task. In the literature several routing protocols have been proposed for mobile ad hoc networks and most prominent among them are DSR, AODV and TORA. But almost all of these protocols assume that the nodes in the MANET are always cooperative. However, these protocols protect MANET from all the possible attacks except non cooperative behavior. ARAN (Authenticated Routing for Adhoc Networks) is a solution proposed which provides security against all possible vulnerabilities but an authenticated selfish node can manipulate these protocols and can disturb the network by dropping packets or delaying the packet. These noncooperative nodes may in turn partition the network. In this paper we propose a credit based system that can be applied to routing protocol to detect selfish node and improve the network performance.

A mobile ad hoc network (MANET) is a group of nodes constituting a network of mobile nodes without predefined and pre-established architecture where mobile nodes can communicate without any dedicated access points or base stations. In MANETs, a node may act as a host as well as a router. Nodes in the network can send and receive packets through intermediate nodes. However, the existence of malicious and selfish nodes in MANETs severely degrades network performance. The identification of such nodes in the network and their isolation from the network is a challenging problem. Therefore, in this paper, a simple reputation-based scheme is proposed which uses the consumption and contribution information for selfish node detection and cooperation enforcement. Nodes failing to cooperate are detached from the network to save resources of other nodes with good reputation. The simulation results show that our proposed scheme outperforms the benchmark scheme in terms of NRL (normalized routing load), PDF (packet delivery fraction), and packet drop in the presence of malicious and selfish attacks. Furthermore, our scheme identifies the selfish nodes quickly and accurately as compared to the benchmark scheme.

In an IP-based network, automated dynamic assignment of IP addresses is preferable. In most wired networks, a node relies on a centralized server by using dynamic host configuration protocol (DHCP) to obtain a dynamic IP address. However, the DHCP-based approach cannot be employed in a mobile ad hoc network (MANET) due to the uncertainty of any centralized DHCP server. That is, a MANET may become partitioned due to host mobility. Therefore, there is no guarantee to access a DHCP server. A general approach to address this issue is to allow a mobile host to pick a tentative address randomly, and then use duplicate address resolution (DAR) protocol to resolve any duplicate addresses. In this paper, an innovative distributed dynamic host configuration protocol designed to configure nodes in MANET is presented. The proposed protocol not only can detect the duplicate address, but also can resolve the problem caused by duplicate address. It shows that the proposed protocol works correctly and is more universal than earlier approaches. An enhanced version of DAR scheme is also proposed in this paper to solve the situation of duplicate MAC address. The new and innovative approach proposed in this paper can make the nodes in MANET provide services to other networks and avoid packets from being delivered to incorrect destinations.

Mobile ad hoc networks (MANETs) are consists of mobile devices connected wirelessly. Mobile nodes in MANET are applicable of routing functionality, where messages are forwarded in a multi-hop fashion. In such a communication scheme a routing protocol play an important role in the network performances. The wireless connectivity and node mobility in MANET networks contributes in rapid topological changes, which brings the need for a channel aware routing protocol. To overcome this problem, many channel aware routing metrics are proposed in the literature, however these routing metrics are either utilizing the shared bandwidth to measure the link quality, or they implies less awareness to the link quality. This paper proposed a SNR-based routing metric for Dynamic Sequence Distance Vector (DSDV) routing protocol. This paper starts by investigate and compare the performance among common routing protocols in MANET. Secondly a cross layer approach is proposed for the new routing metric. Simulation scenarios are used for the work of the paper. The new metrics is implemented in one of the MANET common routing protocols DSDV module in MONET++. The results show that SNR-based DSVD improves the performance of the MANET in terms of throughput and delay.