Routing Protocol for Mobile Ad HOC Networks Using Mobility Prediction

Mobile Ad hoc Networks are characterized by multi-hop wireless links, without any infrastructure, and frequent host mobility. A plethora of routing protocols has been proposed. A class of routing protocols called on-demand protocols has recently gained attention because of their efficiency and low routing overhead. As the mobile nodes in the network work on low power batteries, the need to take into account their power consumption arises. This paper focuses on a particular on-demand routing protocol, called Dynamic Source Routing, and shows how an efficient heuristic based Multipath technique can improve the mean time to node failure and maintain the variance in the power of all the nodes as low as possible. In the Multipath Power Sensitive Routing Protocol (MPSR) every node in the network is treated equally and the overall network is stable for a long time. An interesting feature of using this protocol is that the end-to-end packet delay does not increase significantly. The results of extensive simulation show that the performance of MPSR protocol is on an increasing trend as mobility increases when compared to the Dynamic Source Routing.KeywordsPacket Delivery RatioMobile HostRoute DiscoveryDynamic Source RoutePause TimeThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Mobile devices are able to build their own networks, which are referred to as mobile ad hoc networks. These networks do not require any kind of permanent wiring or other infrastructure (MANETs). The success of MANETs and their adaptability to a variety of tasks is, to a considerable extent, based on the routing protocols that they use. Using metrics such as routing overhead, end-to-end delay, and packet delivery ratio, we compare and contrast the various routing protocols that can be employed in MANETs, including proactive, reactive, and hybrid protocols. This comparison and contrast is carried out in this study. In addition to this, we discuss the simulation tools that are utilized to evaluate the efficacy of MANET routing algorithms and define the several performance indicators that may be utilizedin the course of this endeavor. This paper makes a contribution to an ongoing body of research into the analysis of routing protocols in MANETs by offering guidance to network engineers and researchers on how to select the most appropriate routing protocol and simulation tool for a particular MANET scenario. In doing so, the paper maximizes the potential for effective and efficient communication between mobile nodes, which is one of the main goals of the research.

Mobility management is a key aspect of designing and evaluating protocols for Mobile Ad Hoc Networks (MANETs). The high mobility of nodes in a MANET constantly causes the network topology to change. Mobility patterns of nodes have a direct effect on fundamental network characteristics, such as path length, neighborhood size, and link stability. Consequently, the network performance is strongly affected by the nature of mobility patterns. While evaluating protocols for a specific MANET application, it becomes imperative to use a mobility model that is able to capture the movement of nodes in an accurate manner. The objective of this work is to produce mobility models that are able to describe tactical mobility in military applications of MANETs. We provide models of four tactical scenarios, show that these models are accurate compared to synthetic traces, and that when used to evaluate network protocols, they provide different conclusions than when using generic mobility models.

Wireless Sensor Networks (WSN) utilizes more nodes to forward messages and information from source node to destination node and these nodes are battery-powered devices. Thus, Energy saving is always vital role of Routing Protocols which need to maximize the lifetime of WSN. Mobile ad hoc networks (MANET) are self-starting and self-constructing multichip wireless networks in which, the assembly of the system deviates vigorously. This is mainly due to the mobility of the nodes. The nodes in the network not only act as hosts but also as routers that route data from other nodes in network. MANETs require an efficient routing protocol that achieves the quality of service (QoS) mechanism. They are not considering the mobility as one constraint for those problems. Because, mobility of nodes causes frequent link failures and high error rates, so it makes difficult to maintain the desired QoS in the network. To overcome those problems, we propose mobility aware routing protocol for MANET using hybrid optimization (MARP-HO) algorithm, which maximizes the QoS in data transmission. The proposed routing protocol comprises of two phases. The clustering process consists of cluster formation and cluster head (CH) selection. First, the energy efficient clustering is done by improved animal migration optimization (IAMO) algorithm. Then, we gather multiple constraints are energy consumption, received signal strength, mobility and cooperative rate from each cluster member. The gathered constraints used to compute the node cost of each cluster member, here the highest cost node act as CH of cluster. Second, we compute routing path between source–destination using improved ant colony optimization (IACO) algorithm. The proposed MARP-HO routing protocol is compared with existing state-of-art routing protocols in terms of energy consumption, delivery ratio, loss ratio, link stability, delay, network lifetime, number of dead nodes and throughput.

A mobile ad hoc network (MANET) is a network that consists of mobile wireless terminals without the aid of the base station. It is expected that MANETs are utilized for various purpose such as traffic jam information announce for vehicles and safety confirmation system in the disaster. Each MANET uses a routing protocol adaptive for the purpose of use. Therefore, utilizing the common routing protocol for multiple MANETs is difficult, and each MANET uses a different routing protocol. In this paper, we propose an Autonomous Clustering based Inter-Domain Routing protocol to communicate between different MANETs. Because of the autonomous clustering, the proposed inter-domain routing scheme can adaptively change the network gateways between MANETs according to the network topology change.

Mobile Ad hoc networks (MANETs) can perform the difficult tasks of multi-hop communication in an environment with mobile nodes and changing network topology. As one of the most fundamental problems, routing protocols have been accumulated for MANETs, and which can mainly be divided into two categories: proactive and reactive ones. In this paper, we analyze and compare typical proactive ( <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">i.e.</i> DSDV) and reactive ( <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">i.e.</i> AODV and DSR) routing protocols by using NS2 simulations and give detailed performance evaluations with different performance metrics.

Mobile Adhoc Networks (MANETs) is a wireless infrastructure-less network, where nodes are free to move independently in any direction. The nodes have limited battery power; hence we require energy efficient routing protocols to optimize network performance. This paper aims to develop a new routing algorithm based on the energy status of the node. In this paper, it has been proposed a new Protocol for Mobile Adhoc Networks which is expected to achieve energy efficiency and reliability. The gossiping probability of a node is determined by the throughput. Differently from other proposals no external location service support, e.g., via GPS, is not required. Rather, the throughput is estimated from the “inside” of the network using feedback factor through the node propagation to the destination and the value of gossiping probability is adaptively adjusted. This results in less energy consumption and more reliability in the network.

Internet protocol (IP) auto-configuration in mobile ad hoc networks (MANETs) has attracted much attention. Efficient duplicate address detection (DAD) schemes should be devised to provide each node with its unique address in the network. Generally, DAD schemes can be categorized into two classes: 1) active DAD and 2) passive DAD (PDAD). In this paper, we focus on PDAD schemes over on-demand ad hoc routing protocols. Specifically, we have three goals: 1) improving the accuracy of detecting address conflicts; 2) improving the successful detection success ratio; and 3) reducing the time taken to detect these conflicts. Unlike current approaches, we propose several schemes that exploit additional information, such as sequence number, location, and neighbor knowledge. Simulation results show that our approaches achieve better accuracy and shorter time to detect conflict addresses when compared with existing schemes.

Routing Optimization in mobile ad hoc networks along with secured transmission is an ever-demanding task. Mobile ad hoc networks are highly dynamic topology natured and hence several routing protocols meet the challenge of link quality, delay and energy conscious routing. This paper proposes a secured link quality, delay and energy conscious routing approach based on ant colony optimization. Based on the estimated link quality, delay and residual energy of the nearby nodes, Adaptive node stability (ANS) mechanism is mathematically modeled to make the routing strategy. SLQDEARP selects the efficient node based on the ANS mechanism and sends the data packets through that node. Ad-hoc security algorithms incorporated for making the transmission more secured. Simulation results show that SLQDEARP increases delay, energy consumption and packet delivery ratio than AODV and DECRP protocol due to security mechanism incorporated.

Mobile Ad hoc Network (MANET) is a collection of wireless mobile nodes that dynamically form a network temporarily without any support of central administration. Moreover, Every node in MANET moves arbitrarily making the multi-hop network topology to change randomly at unpredictable times. There are several familiar routing protocols like DSDV, AODV, DSR, etc...which have been proposed for providing communication among all the nodes in the network. This paper presents a performance comparison of proactive and reactive protocols DSDV, AODV and DSR based on metrics such as throughput, packet delivery ratio and average end-to-end delay by using the NS-2 simulator.

A Mobile Ad-Hoc Network (MANET) is a collection of wireless mobile nodes forming a temporary network without using any centralized access point, infrastructure, or centralized administration of the mobile networks .Data transmission between two nodes requires multiple hops as nodes transmission range is limited in Mobile Ad hoc networks (MANET's). Mobility of the networks nodes to makes the situation even more complicated in wireless networks. Multiple routing protocols find optimized routes from a source to some destination. This articles presents performance analysis of three different routing protocols AODV, DSR and ZRP. This article mainly focuses on comparing the performance analysis of three routing protocols for Mobile Ad-Hoc networks (MANET's). We have used QualNet Simulator 5.0.3 from Scalable Networks to perform the simulations. Performance analysis of AODV, DSR and ZRP is evaluated based on Average end to end delay(s), TTL based hop count and Average Jitters(s), throughput (bits/s) in Mobile ad hoc networks.

Routing protocol is the primary strategy to design any wireless network. In Mobile AdHoc Network many routing protocols are present for sending packets from source to destination. Routing protocols in Mobile AdHoc Networks (MANETs) are reactive routing protocols, proactive routing protocols, hybrid routing protocols. Performance analysis of different routing protocols is the major step before selecting the routing protocol. Routing protocols perform different under different traffic conditions in different environments. In this paper, the TCP and UDP based performance analysis is carried out in reactive routing protocols and proactive routing protocols with different packet size using NS2 simulator under different traffic conditions. The delay, throughput and packet delivery ratio are common measures parameters used for the comparison of performance of reactive protocols and proactive protocols.

Design and development of routing protocols for Mobile Ad Hoc Networks (MANETs) is an active area of research. The standard practice among researchers working in this emerging domain is to evaluate the performance of their routing protocols in a network simulator. It is now a well known fact that the simulation studies are scenario specific and hence their results can not be generalized. In this paper, we present mathematical models of two key performance metrics, routing overhead and route optimality, of BeeAdHocMANET routing protocol. One of the key components of our BeeAdHocmodel is the collision model at Medium Access Control (MAC) layer. The mathematical expressions of the performance metrics provide valuable insight about the behavior of BeeAdHocin particular, and a typical ad hoc routing protocol in general, without resorting to scenario specific time consuming simulations.

Mobile ad hoc networks (MANETs) will play a vital role in civilian and military applications where users move around and share information with each other. The movement of users varies depending on the environment, e.g. people may move randomly in different directions (Random Waypoint and Gauss Markov mobility models); or walk, run and drive in two directions in the street (Manhattan Mobility Model); or move as a group (Reference Point Group Mobility model). The interaction between mobility patterns and routing protocols contributes significantly to vary the overall network performance. We build an analytical framework that shows an analysis structure for the overall network performance test. In this framework, we first compare the properties of the mobility models that are designated for MANETs. Second, we measure single path (proactive and reactive) and multipath (proactive and reactive) routing protocols across the mobility models by tuning into TCP and CBR traffic individually. Finally, we examine the performance of each routing protocol across mobility models and discuss the possibility of interaction between them. Most of the previous findings only evaluate the impact of mobility models and single path routing protocols with CBR traffic, whereas a significant finding of this study is that how the interaction between mobility models and single path and multipath routing protocols varies depending on the usage of traffic (TCP and CBR).

A mobile ad hoc network (MANET) consists of a set of mobile hosts that can communicate with each other without the assistance of base stations. In MANETs, the high mobility of mobile nodes is a major reason for link failures. In this paper, we propose a stable weight-based on-demand routing protocol (SWORP) for MANETs. The proposed scheme uses the weight-based route strategy to select a stable route in order to enhance system performance. The weight of a route is decided by three factors: the route expiration time, the error count, and the hop count. Route discovery usually find multiple routes from the source node to the destination node. Then we select the path with the largest weight value for routing. Experimental results show that the proposed SWORP outperforms DSR and AODV especially in the high mobility environment.