Routing Protocol For Mobile Ad Research Articles

Queue Length and Mobility aware Routing Protocol for Mobile Ad hoc Network

A mobile ad-hoc network (MANET) is different from other wireless networks in many ways. One of the key differences is that a MANET is a multihop wireless network,i.e., a routing path is composed of intermediate mobile nodes and wireless links connecting them. In this paper, heterogeneous Mobile Ad-hoc Networks (H-MANETs) are considered. H-MANETs are composed of nodes with different transmission range. We propose an improvement of AODV protocol called AMAODV (Adaptative Mobility aware AODV). This protocol is based on new metric combine more routing metrics (distance, relative velocity, queue length and hop count) between each node and one hop neighbor. Which permits to avoid losing route. Through the simulation, it is confirmed that this improvement has higher packet delivery ratio and less average end-to-end delay than basic AODV protocol.

Link Quality and MAC-Overhead aware Predictive Preemptive Multipath Routing Protocol for Mobile Ad hoc Networks

In Ad Hoc networks, route failure may occur due to less received power, mobility, congestion and node failures. Many approaches have been proposed in literature to solve this problem, where a node predicts pre-emptively the route failure that occurs with the less received power. However, these approaches encounter some difficulties, especially in scenario without mobility where route failures may arise. In this paper, we propose an improvement of AOMDV protocol called LO-PPAOMDV (Link Quality and MAC-Overhead aware Predictive Preemptive AOMDV). This protocol is based on new metric combine two routing metrics (Link Quality, MAC Overhead) between each node and one hop neighbor. Also we propose a cross-layer networking mechanism to distinguish between both situations, failures due to congestion or mobility, and consequently avoiding unnecessary route repair process. The LO-PPAOMDV was implemented using NS-2. The simulation results demonstrate the merits of our proposed LO-PPAOMDV with approximately 10-15% increase in the packet delivery ratio while average end-to-end delay is reduced by 20%, and normalized routing load is reduced about 45%, also with 7% increase in the throughput, when compared with PPAOMDV.

Distance Enhancement of Quantum Cryptography through MANET

In the modern technology world, the cryptographic techniques are plays a major role. There are so many modern cryptographic algorithms are used to secure information through message transformation. Quantum cryptography evolved from the merging of physics and cryptography to reduce the threat that encryption encounters. It is one of the emerging fields in the computer technology. The primary objective of quantum cryptography research is to develop cryptographic algorithms and protocols that are resistant to quantum computer attacks and increase the communication distance. The various quantum cryptography protocols are demonstrated, as well as how this technology has led to the establishment of secure communication between sender and the receiver through using of MANET. We will look at the properties of quantum cryptography and the benefits of MANET it can provide in the future internet. One of the best ways for increasing the distance of message transmission over the internet is to use MANET in the field of quantum cryptography. An Ad hoc on demand distance vector (AODV) is a routing protocol for Mobile Ad hoc networks

Energy Efficient Disjoint Multipath Routing Protocol Using Simulated Annealing in MANET

Existing energy efficient multi path routing protocol in Mobile Ad hoc Network (MANET) are not spatially disjoint and did not consider link availability and queuing delay. Hence an energy efficient disjoint multipath routing protocol using Simulated Annealing technique is proposed in this paper. In this protocol, routing will be performed based on the path cost and link cost metric, which in turn is dependent on the network and node characteristics like link availability, network load, battery drain rate, etc. Thus, the nodes selected for routing will be appropriate and will ensure successful data delivery at the destination. Since this technique takes into consideration all the minute network and node features, it can be assured that most of the network failure situations can be avoided, and thus guaranteeing efficient network operation.

Yates Algorithm to Analyze the Performance of MANET Routing Protocol

To test the performance of any routing protocol in Mobile Ad hoc Network (MANET), the re-searchers simulate their scenarios several times with different simulators to get either positive or negative results. This operation of the simulation can last many hours and sometimes several days depending on the performance either of the software or the hardware, and the number of factors used to analyze. In this paper, we propose a new method reckons on the Yates algorithm that are considered as a solution to evaluate the performance of any MANET routing protocols under the effect of any number of factors. This approach allows creating a simulation model in the form of mathematical formulas. To check the efficiency of our proposed method we chose Optimized Link State Routing Protocol (OLSR) as MANET routing protocol and the effect of four factors which are: The Black Hole attack, Worm Hole attack, Node Speed and the Pause Time.

The quality factor for detecting node isolation attack in mobile ad hoc networks using OLSR protocol

The Optimised Link State Routing (OLSR) protocol is a proactive routing protocol for Mobile Ad hoc Network (MANET), it is more suitable for large and dense mobile networks thanks to its new concept...

Enhanced CBL clustering performance versus GRP, OLSR and AODV in vehicular Ad Hoc networks

Routing protocols for Mobile Ad hoc NETworks resort to broadcast in order to achieve their main functionalities such as node discovery, topology dissemination, route discovery and self-organizing. In order to reduce the impact of routing traffic and other broadcast traffic generated by the applications, clustering is one of the main approaches widely investigated. Recently, the Chain-Branch-Leaf (CBL) scheme has been proposed to exploit the spatial constraints of the road in order to achieve an efficient clustering in Vehicular Ad hoc NETworks routing protocols. In this paper, CBL is enhanced in order to improve the stability of the individual clusters and that of the resulting backbone by extending the duration of the connections between cluster nodes and their cluster head. The evaluations through simulation establish its performance in comparison with some protocols available in OPNET and that are representative of the different routing approaches in ad hoc networks, namely AODV for reactive, OLSR for proactive and GRP for geographic routing. The results show that CBL allows better performance at the Wireless LAN level, but also that it still has a potential for improvement in terms of quality of service.

A Review on Security-aware Routing Protocols for Mobile Ad hoc Network

A Review on Security-aware Routing Protocols for Mobile Ad hoc Network

Improving mobile ad hoc networks using hybrid IP-Information Centric Networking

Routing protocols for Mobile Ad hoc NETworks (MANETs) constitute a research area with numerous evolved and well-investigated solutions that typically still rely on IP. Although IP-based protocols for MANETs can effectively handle network changes, thus enhancing connectivity while offering scalability, they lack support for advanced communication paradigms, which would enable richer applications and improve network goodput. Information-Centric Networking (ICN) is an inter-networking paradigm that natively supports functions that can enhance the performance of MANETs, such as multicast, multisource communication, and on-path caching. However, ICN raises significant scalability and feasibility concerns in the presence of intense node mobility. In this paper, we propose a hybrid architecture that combines the best of both worlds: it uses IP for maintaining network topology and it relies on ICN for content lookup and dissemination. To this end, we adapt the Named-Data Networking (NDN) ICN architecture to use legacy IP MANET routing protocols, such as Babel. Using a prototype implementation of our design and the Mininet Wi-Fi network emulator, we experimentally investigate the performance of our hybrid design in several scenarios, finding that the data delivery to network traffic ratio is increased up to 250% and 300% compared to pure NDN and IP solutions, respectively.

Confidence-based Security System for Routing Protocol in Mobile Ad hoc Networks

A mobile ad-hoc network (MANET) is an infrastructure-less network of wireless nodes. The network topology may change quickly with respect to time, due to node mobility. The network is a disintegrated network, activities such as delivering messages by determining the topology essential to be implemented by the nodes themselves i.e., the routing activity will be unified into mobile nodes. Due to the lack of centralized administration in multihop routing and open environment, MANET’s are susceptible to attacks by compromised nodes; hence, to provide security also energy efficiency is a crucial issue. So as to decrease the hazards of malicious nodes and resolve energy consumption issues, a simple confidence-based protocol is built to evaluate neighbor’s behaviour using forwarding factors. The reactive Ad-hoc on-demand multipath distance vector routing protocol (AOMDV), is extended and confidence-based Ad-hoc on-demand distance vector (CBAOMDV) protocol, is implemented for MANET. This implemented protocol is able to find multiple routes in one route discovery. These routes are calculated by confidence values and hop counts. From there, the shortest path is selected which fulfills the requirements of data packets for reliability on confidence. Several experimentations have been directed to relate AOMDV and CBAOMDV protocols and the outcomes show that CBAOMDV advances throughput, packet delivery ratio, normalized routing load, and average energy consumption.

Performance Comparison of the Ad hoc On-Demand Distance Vector Routing Protocol and The Dynamic Source Routing Protocol for Mobile Ad hoc Networks

Performance Comparison of the Ad hoc On-Demand Distance Vector Routing Protocol and The Dynamic Source Routing Protocol for Mobile Ad hoc Networks

Prominent unicast routing protocols for Mobile Ad hoc Networks: Criterion, classification, and key attributes

Mobile Ad hoc Networks are decentralized networks in which participating nodes are mobile, small form-factor, equipped with the wireless interface, and have forwarding capabilities. These self-organized networks extend limited wireless range by the provision of multi-hop arrangements on the fly without any central administrator. In order to facilitate communication in a dynamic multi-hop wireless environment, routing protocols are essential to discover routes between nodes that are arbitrarily located and can move dynamically. Routing protocols are intended to discover the correct and efficient route in a timely manner so that information could be delivered to the desired destination node. Routing protocols are the backbone of the Mobile Ad hoc Networks and are challenging to design. Several works have been proposed on routing, and systematic representation of these proposals is desirable. In this paper, we provide a survey of the wide range of routing proposals in the last twenty years for the mobile ad hoc network. We device many categories and classification criteria untouched in most of the surveys. This survey paper gives a key overview of the protocols, also classifies and arranges the routing protocols for logical illustration. Protocol classification in the paper assists to systematically access a large set of protocols and highlights the research trends in the domain.

A Survey of Various Ant Colony Optimization based Routing Protocols for Mobile Ad hoc Networks

A Survey of Various Ant Colony Optimization based Routing Protocols for Mobile Ad hoc Networks

Secured Routing Protocol for Mobile Ad hoc Networks to Defend Collaborative Black-hole and Gray-hole Attacks by Malicious Nodes

Secured Routing Protocol for Mobile Ad hoc Networks to Defend Collaborative Black-hole and Gray-hole Attacks by Malicious Nodes

Exploiting Selfishness, Altruism and Common Welfare to Enhance Performance of Routing Protocols for Mobile Ad hoc Networks

Mobile Ad hoc Networks are sensitive to selfish behavior that may occur due to restricted power or other resources. Several approaches have been investigated so far to address this problem. In many of them, upon detection, a selfish node is punished with isolation from network services access and in most cases with no possibility for redemption. In this paper, we show that selfish behavior can be exploited to improve network performance. We modify an existing routing protocol by introducing an altruism coefficient to model the overall satisfaction of every node from the network services. When the altruism coefficient is increased, the selfish behavior is decreased. We extend our approach by introducing a common welfare factor, which actually enforces the nodes to cooperate when the network connectivity is critical. A network simulator is utilized to show the impact of our schemes on the performance of the routing protocol when selfish nodes are present in the network.

Security Mandated Analytics based Route Processing with Digital Signature [SMARPDS] - Pseudonymous Mobile Ad Hoc Routing Protocol

There are a lot of speculations going on about the interests for privacy in mobile network. Many research works have been proposed in the aspect and these works concentrate more on the anonymity part and there are quite a few implementations of these research works on some applications. Ad hoc routing protocols must have provision for both anonymity providing nature and restriction of information collection from unauthorized nodes. Till recent times, there are a number of ad hoc routing protocols that have been introduced. But, they have lack security features or authentication features or in some cases both. The lack of proper security features leads to a state of vulnerability which at any given point, will act as a threat element. In this paper, we propose Security Mandated Analytics based Route Processing with Digital Signature protocol [SMARPDS]. It is an anonymous and authentication providing routing protocol in Mobile Ad hoc network. In addition, routes are discovered based on analytics done on the node and its present location in the network. SMARPDS provides authentication during the route discovery and transmission process by employing digital signatures on node front and also on packets front.

Treatment of Reactive Routing Protocols Using Second Chance Based on Malicious behavior of Nodes in MANETS

<p>Mobile nodes of various routing protocols in Mobile Ad hoc Networks follow different strategies in transmission and receiving of data. Security, packet delivery and routing overhead are important concerns for any protocol during designing them. The presence and absence of malicious nodes in the network affect a lot on the performance of the protocol. This research focused on the study of the threats, attacks and reasons for malicious behavior of nodes in the network for reactive routing protocols in MANETS. DSR and AODV are the two reactive routing protocols that considered the study to propose a second chance strategy to given to the nodes considering the reason for malicious behavior to improve the packet delivery ratio and reduce the routing overhead in the network. A simulative study has conducted using Ad hoc Simulator (ASIM) considering the DSR and AODV routing protocols in the presence of malicious nodes and in the absence of malicious nodes that showed, that the packet delivery ratio is low and routing overhead is high in the absence of malicious nodes. The second chance strategy proposed considers the reasons for malicious behavior and helps the node to be reintegrate in the network to improve the packet delivery ratio and reduce the routing overhead.</p>

Ideal Node Enquiry Search Algorithm (INESH) in MANETS

The different routing protocols in Mobile Ad hoc Networks take after various methodologies to send the data starting from one node then onto the next. The nodes in the system are non-static and they move arbitrarily and are inclined to interface disappointment which makes dependably to discover new routes to the destination. During the forwarding of packets to the destination, various intermediate nodes take part in routing, where such node should be an ideal node. An algorithm is proposed here to know the ideal node after studying the features of the reactive routing protocols. The malicious node can be eliminated from the networking function and the overhead on the protocol can be reduced. The node chooses the neighbor which can be found in less number of bounces and with less time delay and keeping up the QoS.

Fuzzy Logic Based Reliable and Real-Time Routing Protocol for Mobile Ad hoc Networks

MANET (mobile ad-hoc network) includes a set of wireless mobile nodes which communicate with one another without any central controls or infrastructures and they can be quickly implemented in the operational environment. One of the most significant issues in MANETs is concerned with finding a secure, safe and short route so that data can be transmitted through it. Although several routing protocols have been introduced for the network, the majority of them just consider the shortest path with the fewest number of hops. Hop criterion is considered for simple implementation and it is reliable in dynamic environments; however, queuing delay and connection delay in the intermediate nodes are not taken into consideration for selecting route in this criterion. In this paper, a fuzzy logic-based reliable routing protocol (FRRP) is proposed for MANETs which selects stable routes using fuzzy logic. It is able to optimize system efficiency. The score allocated to routes are based on four criteria: accessible bandwidth, the amount of energy of battery, the number of hops and the degree of dynamicity of nodes. The simulation results obtained from OPNET simulator version 10.5 indicate that the proposed protocol, in comparison with ad hoc on-demand distance vector (AODV) and fuzzy-based on-demand routing protocol (FBORP), was able to better improve packet delivery rate, average end-to-end delay and throughput.

Load Balanced and Link Break Prediction Routing Protocol for Mobile Ad hoc Networks

Load Balanced and Link Break Prediction Routing Protocol for Mobile Ad hoc Networks