An improved maintenance strategy in ad hoc on-demand routing protocols for mobile ad hoc networks

In high mobility and high traffic load network situations, the delay time is affected with high end-to-end delay in reactive routing protocols such as AODV. In this paper we proposed an enhanced receiver-based AODV (ERB-AODV) routing protocol by improving the maintenance phase in AODV. ERB-AODV protocol focuses on decreasing the end-to-end delay and the control overhead in high mobility and traffic load. The receiver node uses a controller agent to update the sender node of the current available path. The agent works depend on the history of receiving data packets. Using glomosim, the ERB-ADOV protocol outperforms the AODV protocol in high mobility and traffic load. Results show that, in high mobility, the delay is decreased by 81% and the control overhead is decreased by 77%. The delay is decreased by 91% in high traffic load, and decreases the control overhead by -77% compared with AODV protocol. These results show the improvement of network delay using the new maintenance strategy on on-demand routing protocols for MANETs

Enhanced AODV Routing Protocol Using Leader Election Algorithm

Failure of communication link in mobile ADHOC network is major issue. For the failure of link the performance of network is degraded. Due to mobility of mobile node brake the communication link and path of routing is failed. For the repairing of routing node used various algorithm such as leader election, distributed and selection algorithm. The failure of link decease the performance of routing protocol in mobile ad-hoc network, for the improvement of quality of service in mobile ad-hoc network various authors proposed a different model and method for prediction of link. The prediction of link decreases the failure rate of mobile node during communication. The leader election algorithm plays a major role in link failure prediction algorithm the process of link failure prediction implied in form of distributed node distribution. Proposed a new link stability prediction method based on current link-related or user-related information in shadowed environments. The modified protocol acquired the process of thresholds priority Oder on the basic of neighbor’s node. The selection of neighbor node deepens on the mode operation in three sections. According to order of state create cluster of priority of group. After creation of group calculate average threshold value and compare each group value with minimum threshold value and pass the control message for communication. Through this process mode of activation state of node is minimized the time of route establishment and maintenance. The selection of proper node in minimum time and other node in sleep mode the consumption of power is reduces. We modified SBRP protocol for selection of node during on demand request node according to sleep and activation mode of communication. Each node locally assigned priority value of node. For the evaluation of performance used network simulator NS-2.35. And simulate two protocol one is AODV-LE protocol, these protocol patch are available for the simulation purpose. And another protocol is AODV-LE-ME. AODV-LE-ME protocol is modified protocol of leader election protocol for the selection of mobile node during the communication. DOI: 10.17762/ijritcc2321-8169.15016

An Effective Approach for Mobile ad hoc Network via I-Watchdog Protocol

Mobile ad hoc network (MANET) is now days become very famous due to their fixed infrastructure-less quality and dynamic nature. They contain a large number of nodes which are connected and communicated to each other in wireless nature. Mobile ad hoc network is a wireless technology that contains high mobility of nodes and does not depend on the background administrator for central authority, because they do not contain any infrastructure. Nodes of the MANET use radio wave for communication and having limited resources and limited computational power. The Topology of this network is changing very frequently because they are distributed in nature and self-configurable. Due to its wireless nature and lack of any central authority in the background, Mobile ad hoc networks are always vulnerable to some security issues and performance issues. The security imposes a huge impact on the performance of any network. Some of the security issues are black hole attack, flooding, wormhole attack etc. In this paper, we will discuss issues regarding low performance of Watchdog protocol used in the MANET and proposed an improved Watchdog mechanism, which is called by I-Watchdog protocol that overcomes the limitations of Watchdog protocol and gives high performance in terms of throughput, delay

Improving routing performance of multipath ad hoc on-demand distance vector in mobile add hoc networks.

The aim of this research is to improve routing fault tolerance in Mobile Ad hoc Networks (MANETs) by optimising mUltipath routing in a well-studied reactive and single path routing protocol known as Ad hoc On-demand Distance Vector (AODV). The research also aims to prove the effect of varying waiting time of Route Reply (RREP) procedure and utilising the concept of efficient routes on the performance of multipath extensions to AODV. Two novel multipath routing approaches are developed in this thesis as new extensions to AODV to optimise routing overhead by improving Route Discovery Process (RDP) and Route Maintenance Process (RMP) of multipath AODV. The first approach is a Iinkdisjoint multipath extension called 'Thresho)d efficient Routes in multipath AODV' (TRAODV) that optimises routing packets ~verhead by improving the RDP of AODV which is achieved by detecting the waiting time required for RREP procedure to receive a threshold number of efficient routes. The second approach is also a link-disjoint mUltipath extension called 'On-demand Route maintenance in Multipath AoDv' (ORMAD) which is an extension to TRAODV that optimises routing packets and delay overhead by improving the RMP of TRAODV. ORMAD applies the concepts of threshold waiting time and efficient routes to both phases RDP and RMP. It also applies RMP only to efficient routes which are selected in the RDP and when a route fails, it invokes a local repair procedure between upstream and downstream nodes of the broken link. This mechanism produces a set of alternative subroutes with less number of hops which enhances route efficiency and consequently minimises the routing overhead. TRAODV and ORMAD are implemented and evaluated against two existing multipath extensions to,AODV protocol and two traditional multipath protocols. The existing extensions to AODV used in the evaluation are a well-known protocol called Ad hoc On-demand Multipath Distance Vector (AOMDV) and a recent extension called Multiple Route AODV (MRAODV) protocol which is extended in this thesis to the new approach TRAODV while the traditional multipath protocols used in the evaluation are Dynamic Source Routing (DSR) and Temporally Ordered Routing Algorithm (TORA). Protocols are implemented using NS2 and evaluated under the same simulation environment in terms of four performance metrics; packet delivery fraction, average end-to-end delay, routing packets overhead, and throughput. Simulation results of TRAODV evaluation show that the average number of routes stored in a routing table of MRAODV protocol is always larger than the average number of routes in TRAODV. Simulation results show that TRAODV reduces the overall routing packets overhead compared to both extensions AOMDV and MRAODV, especially for large network size and high mobility. A vital drawback of TRAODV is that its performance is reduced compared to AOMDV and MRAODV in terms of average end-to-end delay. Additionally, TORA still outperforms TRAODV and the other extensions to AODV in terms of routing packets overhead. In order to overcome the drawbacks of TRAODV, ORMAD is developed by improving the RDP of TRAODV. The performance of ORMAD is evaluated against RREP waiting time using the idea of utilising the efficient routes in both phases RDP and RMP. Simulation results of ORMAD show that the performance is affected by varying the two RREP waiting times of both RDP and RMP in different scenarios. As shown by the simulation results, applying the short and long waiting times in both phases tends to less performance in terms of routing packets overhead while applying the moderate waiting times tends to better performance. ORMAD enhances routing packets overhead and the average end-to-end delay compared to TRAODV, especially in high mobility scenarios. ORMAD has the closest performance to TORA protocol in terms of routing packets overhead compared to ~M~a~M~OW . Relevant concepts are formalised for ORMAD approach and conducted as an analytical model in this thesis involving the\vhole process of multipath routing in AODV extensions. ORMAD analytical model describes how the two phases RDP and RMP interact with each other with regard to two performance metrics; total number of detected routes and Route Efficiency.EThOS - Electronic Theses Online ServiceGBUnited Kingdo

Meta-Routing: Synergistic Merging of Message Routing and Link Maintenance

The maintenance of network connectivity is essential for effective and efficient mobile team operations. Achieving robust mobile ad hoc networks (MANETs) connectivity requires a capable link maintenance mechanism especially if the network experiences expected intermittent connectivity due to a hostile environment. One applicable example of such network scenarios is multi-robot exploration for urban search and rescue (USAR). With the proliferation of these robotic networks, communication problems such as the link maintenance problem are subject to be raised quickly. Although various routing protocols for wireless ad hoc networks have been proposed, they solve the problems of message routing and link maintenance separately, resulting in additional overhead costs and long latency in network communication. Traditional routing protocols discover existing links, connect these links, find the best path and minimize the path cost. The limitation of previous routing protocols motivates us to develop a new concept of routing mechanism for a robotic network. This routing mechanism is named Meta-Routing. Meta-Routing expands current routing protocols to include not only the normal routing of packets, but also the maintenance of links in mobile agent scenarios. Thus, Meta-Routing minimizes the communication path cost and the overhead cost, the latter of which results from discovering a route, repairing a link or establishing a new communication path between nodes. This dissertation presents a method to achieve Meta-Routing by controlling robot motion based on the radio frequency (RF) environment recognition method and gradient descent method. Mobile robot controlled motion can effectively improve network performance by driving robots to favorable locations with strong links. Moreover, the gradient descent method is used in driving the robots into the direction of favorable positions for maximizing broken or failing links and maintaining network connectivity. The main accomplished goals of this thesis are summarized as follows: firstly, the Meta-Routing protocol, which integrates link maintenance into the normal message routing protocol cost function; secondly, the dissertation examines the unification of the syntax of message routing protocol and the link maintenance process through physical configuration of mobile network nodes by controlling their movement in the field; finally, the dissertation demonstrates that the utilization of the RF environment recognition and classification method improves route repair estimation for achieving link maintenance in the presented Meta-Routing protocol. The numerical experimental results demonstrate promising RF environment recognition and node controlled motion results, as well as confirm their abilities in robot movement control for link maintenance and reduction of the total path cost

An energy-aware and QOS assured wireless multi-hop transmission protocol

A thesis submitted in fulfillment of the requirements for the degree of Master of Science by researchThe Ad-hoc network is set up with multiple wireless devices without any pre-existing infrastructure. It usually supports best-effort traffic and occasionally some kinds of Quality of Service (QoS). However, there are some applications with real-time traffic requirements where deadlines must be met. To meet deadlines, the communication network has to support the timely delivery of inter-task messages. Furthermore, energy efficiency is a critical issue for battery-powered mobile devices in ad-hoc networks. Thus, A QoS guaranteed and energy-aware transmission scheme is one hot of research topics in the research area. The MSc research work is based on the idea of Real-Time Wireless Multi-hop Protocol (RT-WMP). RT-WMP is a well known protocol originally used in the robots control area. It allows wireless real-time traffic in relatively small mobile ad-hoc networks using the low-cost commercial IEEE 802.11 technology. The proposed scheme is based on a token-passing approach and message exchange is priority based. The idea of energy-aware routing mechanism is based on the AODV protocol. This energy-saving mechanism is analysed and simulated in our study as an extension of the RT-WMP. From the simulation results and analysis, it has been shown that adding energy-aware mechanism to RT-WMP is meaningful to optimise the performance of traffic on the network

An Effective Approach for Mobile ad hoc Network via I-Watchdog Protocol

Mobile ad hoc network (MANET) is now days become very famous due to their fixed infrastructure-less quality and dynamic nature. They contain a large number of nodes which are connected and communicated to each other in wireless nature. Mobile ad hoc network is a wireless technology that contains high mobility of nodes and does not depend on the background administrator for central authority, because they do not contain any infrastructure. Nodes of the MANET use radio wave for communication and having limited resources and limited computational power. The Topology of this network is changing very frequently because they are distributed in nature and self-configurable. Due to its wireless nature and lack of any central authority in the background, Mobile ad hoc networks are always vulnerable to some security issues and performance issues. The security imposes a huge impact on the performance of any network. Some of the security issues are black hole attack, flooding, wormhole attack etc. In this paper, we will discuss issues regarding low performance of Watchdog protocol used in the MANET and proposed an improved Watchdog mechanism, which is called by I-Watchdog protocol that overcomes the limitations of Watchdog protocol and gives high performance in terms of throughput, delay

Routing Protocols Evaluation Review in Simple and Cloud Environment

In the field of information technology there are many computer jargons like cloud computing Ad-hoc, Software Define Network (SDN), network function virtualization (NFV) , and virtual machine (VM), etc. This review paper is basically a blend of brief study and review of many routing protocols used for Mobile ad hoc Networks (MANET) in the cloud as well as in simple network environment i.e. without cloud computing. This paper would also suggest the different challenges that are facing in cloud computing. The description of the different network simulators used in networking like NS2 tool, Opnet and Cisco packet tracer. The different metrics that are used in the networking are briefly explained. MANET is a group of wireless nodes that do not need centralized controlling entity as it rapidly moveschanges and forms networks to the nearest networking nodes