Modeling Security and Resource Allocation for Mobile Multi-hop Wireless Neworks Using Game Theory

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.

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

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.

A Review on Cooperative Bait Based Intrusion Detection in MANET

Multi hop links are used to communicate between nodes in a Mobile Ad Hoc Network (MANET). Data packets are routed through intermediate nodes in the network to the destination node since each node functions as a router. Dynamic routing protocols are being developed for network communication efficiency. Routing protocols in MANETS face problems such as versatility, scalability, and restricted bandwidth. A fuzzy logic approach is suggested as part of the study. In this work, a fuzzy logic methodology is planned to choose the best routes in order to better QoS End-to-end delay (Ae), when a node leaves the network (Nl), A fuzzy rule-based scheme NR includes the number of packets dropped (ND) and the number of path error RRER caused parameters. Simulations are carried out in this study using the proposed fuzzy approach process Simulations are carried out in this study using the future process fuzzy approach. The measurement criteria are throughput and the number of packets dropped. The tentative results obtained show that the proposed fuzzy approach improves the QoS better than existing regular Ad hoc On-demand Distance Vector ( AODV) routing protocol. In the final stage of investigation, the use of a hybrid optimization approach to choose the best route is suggested. The proposed hybrid optimization is based on the Genetic Algorithm (GA) and the Hill Climbing algorithm. The hybrid optimization aids in the resolution of the local minimum problem Hill-climbing begins with an infeasible solution and continues until a viable solution is found, at which point the viable solution is returned to GA. The simulation results show that the throughput is high. When compared to the AODV protocol, the proposed Fuzzy-Hybrid GA method yields about 29.56 percent more and 6.33 percent more when compared to the Fuzzy-GA solution.

Inderscience is a global company, a dynamic leading independent journal publisher disseminates the latest research across the broad fields of science, engineering and technology; management, public and business administration; environment, ecological economics and sustainable development; computing, ICT and internet/web services, and related areas.

The main aim of the paper is a generic framework for prediction algorithm of the direction and speed of future movement of nodes based on the information of current net-work status. Since the nodes move continually with only a limited amount of energy, it is necessary to focus on the energy efficiency of the communication process during designing new methods and functions. Recently, the combination of the directional antennas within mobile devices has been studied in many areas. The main contribution of this paper is improvement the mobility prediction mobile nodes which is provided with directional antennas.

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.

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.

A self-contained connection of wireless links that functions without any infrastructure is known as Mobile Ad Hoc Network (MANET). A MANET’s nodes could engage actively and dynamically with one another. However, MANETs, from the other side, are exposed to severe potential threats that are difficult to counter with present security methods. As a result, several safe communication protocols designed to enhance the secure interaction among MANET nodes. In this research, we offer a reputed optimal routing value among network nodes, secure computations, and misbehavior detection predicated on node’s trust levels with a Hybrid Trust based Reputation Mechanism (HTRM). In addition, the study designs a robust Public Key Infrastructure (PKI) system using the suggested trust evaluation method in terms of “key” generation, which is a crucial component of a PKI cryptosystem. We also concentrate on the solid node authenticating process that relies on pre-authentication. To ensure edge-to-edge security, we assess safe, trustworthy routes to secure computations and authenticate mobile nodes, incorporating uncertainty into the trust management solution. When compared to other protocols, our recommended approach performs better. Finally, we use simulations data and performance evaluation metrics to verify our suggested approach’s validity Our approach outperformed the competing systems in terms of overall end-to-end delay, packet delivery ratio, performance, power consumption, and key-computing time by 3.47%, 3.152%, 2.169%, and 3.527%, 3.762%, significantly.

A mobile ad hoc network (MANET) consists of a group of mobile nodes (MNs) that communicate with each other without the presence of infrastructure. The wireless mobile hosts communicate in a multihop fashion. In multi-hop wireless ad-hoc networks, designing energy-efficient routing protocols is critical since nodes have very limited energy, computing power and communication capabilities. For such protocols to scale to larger ad-hoc networks, localized algorithms need to be proposed that completely depend on local information. Hence, here introduce a protocol to handle multihop situations known as Energy Efficient Location Based Routing Protocol for MANETs (EELBR) that is based on Location Aided Routing. EELBR makes significant reduction in the energy consumption of the mobile nodes batteries by limiting the area of discovering a new route to a smaller zone. Thus, control packets overhead are significantly reduced. Developing a method to adaptively use one of the forwarding methods of the position-based routing protocol based on the surrounding environments, and dividing the network into a number of areas that varies dynamically based on the node mobility pattern. Then, show through analysis and implementation that it outperforms most of other protocols currently used in practice under various networks.

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.

Worldwide Interoperability for Microwave Access (Wimax) is power station through which mobile network, commonly known as A Mobile Ad-hoc Network (MANET) is used by the people. A MANET can be described as an infrastructure-less and self-configure network with autonomous nodes. Participated nodes in MANETs move through the network constantly causing frequent topology changes. Designing suitable routing protocols to handle the dynamic topology changes in MANETs can enhance the performance of the network. In this regard, this paper proposes four algorithms for the routing problem in MANETs. First, we propose a new method called Classical Logic-based Routing Algorithm for the routing problem in MANETs. Second is a routing algorithm named Fuzzy Logic-based Routing Algorithm (FLRA). Third, a Reinforcement Learning-based Routing Algorithm is proposed to construct optimal paths in MANETs. Finally, a fuzzy logic-based method is accompanied with reinforcement learning to mitigate existing problems in FLRA. This algorithm is called Reinforcement Learning and Fuzzy Logic-based (RLFLRA) Routing Algorithm. Our proposed approaches can be deployed in dynamic environments and take four important fuzzy variables such as available bandwidth, residual energy, mobility speed, and hop-count into consideration. Simulation results depict that learning process has a great impact on network performance and RLFLRA outperforms other proposed algorithms in terms of throughput, route discovery time, packet delivery ratio, network access delay, and hop-count.

Mobile adhoc networks (MANET) is an interesting concept, as all mobile nodes work like router. They can receive and transmit data packet any time in hostile environment even when the source and the destination mobile nodes are not directly connected to each other. In this circumstance, data packets are forwarded to the destination mobile node by relaying the transmission through intermediary mobile nodes. Due to selfish behavior, packets are intentionally dropped by intermediate nodes, also intermediate nodes continuously forward or broadcast control packets in network that consumes energy of node and lowers performance. This makes discovery of secure routing path and detection of selfish nodes and their activities as important challenges in MANET. This paper proposes a weight-based secure approach for identifying selfish behavior in MANET (WSISB). The proposed WSISB identifies the above-discussed activities and it will also discover a trusted path for secure data transmission. Experimental results show that WSISB performs much better than existing techniques and show significant improvement in terms of performance.

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.