Ant Colony Optimization for Data Cache Technique in MANET

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 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

SUMMARYA mobile ad hoc network (MANET) is an open wireless network that comprises a set of mobile, decentralized, and self‐organized nodes. Its properties render its environment susceptible to different types of attacks, which can paralyze the mobile nodes in MANET. A particularly dangerous type of attack is run primarily under flooding bogus packet mechanisms, such as hello floods, routing table overflows, exploitation of node penalizing schemes, and resource consumption attack (RCA). Flooding‐based attacks impose severe effects because they are intended to consume MANET resources, such as bandwidth, node memory, and battery power. Therefore, identifying such effects facilitates the development of countermeasures against the intrusions. In this paper, we introduce a simulation‐based study on the effects of RCA on MANET. QualNet v5.0.2 is used to examine the severity of the effects on MANET performance metrics in terms of throughput, end‐to‐end delay, energy consumption, and routing overhead. The effects of RCA are also monitored under two combinations of four factors: we first vary the number of attackers and attackers' positions, and then modify the attackers' radio range and flooding rate. We also examine the effect of flooding mechanism on the energy consumed by resource consumption attackers. Copyright © 2013 John Wiley & Sons, Ltd.

Dynamicity of the nodes and multiple routing constraints in Mobile Ad hoc Networks (MANETs) require well-crafted, constraints satisfying protocols to yield the best and the most efficient results. The Swarm Intelligence based Ant Colony Optimization (ACO) technique has successfully yielded many satisfying and efficient results when they are used for improvising the routing based requirements in Mobile Ad hoc Networks. This research work is outcome of implemented protocol which is based on the ACO technique. However, the main concern of the paper is to present a protocol which improves the energy efficiency factor in the optimization technique by a significant level, while improving other factors like Packet Delivery Ratio, Packet delivery delay i.e. End-to-End delay, simultaneously, or at the very least preserve it the same level.

Cognition capability has been seen by researchers as the way forward for the design of next generation of Mobile Ad Hoc Networks (MANETs). The reason why a cognitive paradigm would be more suited to a MANET is because MANETs are highly dynamic networks. The topology may change very frequently during the operation of a MANET. Traffic patterns in MANETs can vary from time to time depending on the need of the users. The size of a MANET and node density is also very dynamic and may change without any predictable pattern. In a MANET environment, most of these parameters may change very rapidly and keeping track of them manually would be very difficult. Previous studies have shown that the performance of a certain routing approach in MANETs is dependent on the size of the network and node density. The choice of whether to use a reactive or proactive routing approach comes down to the network size parameter. Static or offline approaches to fine tune a MANET to achieve certain performance goals is hence not very productive as a lot of these parameters keep changing during the course of operation of MANETs. Similarly, the performance of MANETs would improve greatly if the MAC layer entity could operate in a more flexible manner. In this paper we propose a cognitive MANET design that will ensure that all these dynamic parameters are automatically monitored and decisions are based on the current status of these parameters.

Mobile Ad hoc Network (MANET) is one of the most upcoming technologies in the field of wireless communication. As there is no predefined network configuration in MANET, routing, therefore, is much more difficult compared to that in a wired network. It is known that in MANET there is a continuous change in topology resulting in the change in adjacent nodes to a certain node. This subsequently may play a vital role in finding the path from source to the destination host. Meta-heuristics, like Ant Colony Optimization (ACO) are being used successfully in MANET routing. In our earlier work we made some variations of ACO techniques for routing in wired network. Here, in this paper, some modifications on those variants of ACO have been made considering the situations in MANET. Variations are related to selecting the next node to visit depending on the number of adjacent nodes to the current node and modification of the pheromone deposit formula on the basis of transmission time. In some variants a tabu list has been incorporated to enhance the performance remarkably. Using NS2 simulator the experiments have been made to compare the performance of six variants of ACO, where the various parameters have been adjusted optimally. It is observed that modified versions are better than the previous ACO variants in overall performance related to throughput and packet drop rate.

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.

Efficient routing is a crucial issue in Mobile Adhoc Networks. This paper proposes an improved algorithm for routing in mobile adhoc networks based on the Ant Colony Optimization (ACO) technique. The proposed improved ACO (I-ACO) performs routing by making use of transition probability among nodes along with available pheromone update information in ACO principle. This approach reduces the cost of ant agents. I-ACO has two phases viz route discovery and route maintenance and also utilizes the concept of backtracking when the packets reaches destination node.

A Review on Cooperative Bait Based Intrusion Detection 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.

As the advent of new technologies grows, the deployment of mobile ad hoc networks (MANET) becomes increasingly popular in many application areas. In addition, all the nodes in MANET are battery operated and the node mobility affects the path stability and creates excessive traffic leads to higher utilization of energy, data loss which degrades the performance of routing. So, in this paper we propose Levenberg–Marquardt logistic deep neural learning based energy efficient and load balanced routing (LLDNL-EELBR) which is a machine learning method to deeply analyze the mobile nodes to calculate residual load and energy and it also uses logistic activation function to select the mobile node having higher residual energy and residual load to route the data packet. Experimental evaluations of three methods (LLDNL-EELBR, multipath battery and mobility-aware routing scheme (MBMA-OLSR) and opportunistic routing with gradient forwarding for MANETs (ORGMA)) were done and the result reveals that LLDNL-EELBR method is able to increase the through put and minimizes the delay and energy consumption in MANET when compared to works under consideration.<br /><div> </div>

Mobile ad hoc network (MANET) is kind of wireless networks architecture, which is an infrastructureless, autonomous, stand-alone network. Therefore, MANET can be flexibly and simply deployed in almost any environment. But it has a limited wireless coverage and limited connectivity that is exclusive to the MANET boundary. The growth of the Internet and its services and applications and the trend in fourth generation (4G) wireless networks toward full-IP networks, lead to an increasing demand for enabling MANET nodes to connect to Internet and use its services and applications. Mobile IP and IP micro-mobility protocols enable the mobile host to access Internet and change points of attachment without losing the connection. So, with the cooperation between MANET routing protocols and IP mobility protocol, Internet connectivity to MANET nodes can be achieved. In this paper, we propose integrated network architecture to extend the cellular IP access network to multiple MANETs. We also propose an integration routing protocol for connecting MANET to cellular IP Access network and Internet. The proposed protocol supports mobile nodes mobility between different MANETs.

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.

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 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.