Fuzzy Logic Based Stable On-Demand Multipath Routing Protocol for Mobile Ad Hoc Network

Mobile ad hoc networks (MANET) are self-configured and self-maintained network without any central authority. In MANET the route discovery from source node to destination node is a critical issue due to frequent changes in network topology and mobility of nodes. The MANET consists of problems such as load balancing, scalability, stability, reliability security and robustness. It is therefore necessary to check node stability with respect to node mobility and Bandwidth during path establishment. The Scalable Multipath On-demand Routing Protocol for Mobile Ad-hoc Network (SMORT) is suitable for Scalability only. The proposed protocol is an advanced version of SMORT which includes additional stability factor. This paper presents a new multipath routing protocol, stable and scalable on-demand routing for mobile ad hoc networks which improves the lifetime of the network and improves the performance.

An ad hoc network is a collection of autonomous mobile nodes to forming an instant multihop radio infrastructure-less network in a dynamic topology. Each node in Ad hoc network, functions as host and router at the same time,where maintaining connectivity in a decentralized manner by distributing the network control among the nodes. A large number of routing protocols for mobile ad-hoc networks are presented since last decade. Topology frequently changing,transmission power and asymmetric links are the main challenge that type of protocols is facing. Therefore, both proactive and reactive routing protocols for mobile ad-hoc networks show incapability, and sometimes prove to be inefficient under these circumstances. We have previously developed and presented a new multipath hybrid routing protocol in name of Multipath Distance Vector Zone Routing Protocol and we refer to it as MDVZRP. The protocol is implemented in the well known network simulator (ns2). In MDVZRP we assume that all the routes in the routing table are active and usable at any time, unless the node received or discovered a broken link. Therefore, no need to update the routing tables periodically to reduce the periodic update messages and hence we reduce the control traffic in the entire network. The protocol guarantees loop freedom, disjoint paths,and alternative paths in case of break the active path by none frequently maintaining topological map of a zone centered on each node. In this paper, the MDVZRPpsilas performance is evaluated and compared with DSDV and AODV standard protocols delivering CBR traffic. Simulation results show that it gives better performance than DSDV in all situations, and better than AODV, when mobility is low.

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.

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.

Service discovery architectures and cluster-assisted routing protocols in mobile ad-hoc networks (MANETs) heavily use formation and maintenance of a virtual backbone (VB), where the most stable mobile nodes with higher node degree are dynamically selected as the backbone nodes. In this paper we present a novel analytic model for VB stability in MANETs. The model employs the dynamics of node movements, where link creation/failure is modeled via a random walk with probabilistic state-transition matrix. The backbone formation algorithm gives preference to the nodes with the smaller number of link changes and the higher degree. Therefore, the link arrivals and departures determine the probability (and thus the expected time) for a mobile node to leave, join, or remain in the backbone, i.e., the stability of a dynamic structure of VB.

The characteristics of node-pair paths are a primary consideration in the design of routing protocols in mobile ad-hoc networks (MANETs). Existing research studies on MANET paths focus on their dynamics in the presence of node mobility and ignore the impact of network configuration such as node density and node transmission range. In this paper, we study MANET paths using a smooth mobility model, which complies with the physical law of smooth motion and is sensitive to the change of node velocity over small timescales. Our study reveals that for paths connecting nodes with slow mobility through a small number of hops, path stability and availability are dominated by network configuration; whereas, for paths connecting nodes with moderate/fast mobility through a large number of hops, they are dominated by node mobility.

Mobile Ad-hoc Network (MANET) has emerged as the self organized wire less interconnection for the various applications in random topology. As most of the multimedia applications require strict QoS guarantee during the communication between a single source and multiple destinations. How ever, achieving reliable multicast transmission in MANET is crucial due to the dynamic network topology caused by the node mobility. This gives rise to the need for an efficient multicast routing strategy. This paper proposes a novel scheme PBMRP-BR (position-based Multicast Routing Protocol for Ad-hoc Network Using Backpressure Restoration) for efficient transmission of multimedia applications in Ad-hoc Network, which provides priorities for routing based on Distance of path, Load at the node (ie, traffic) and queue length at the node(ie, bandwidth). It also keeps the path information including bandwidth resources of each node for routing decisions. The problem of the link failure in the channel during the call in progress thus lead in the degradation of the QoS (Quality of Service).To deal this we are using a Backpressure Technique The simulation results shows that the proposed algorithm is able to find a better solution, fast convergence speed and high reliability. The simulation results shows the proposed PBMRP-BR protocol achieve the above objectives and gives the batter results than previous schemes like DSR for the maintenance of overheads and the path reliability. Our proposed scheme will improve the bandwidth utilization by reducing the congestion in the Adhoc wireless network.

The research letter emphasises the hardware chip design of homogeneous clustered optimised link state routing (HMC-OLSR) protocol for Mobile Ad-hoc Networks (MANET). The homogeneously distributed clustering allows for parallel processing and distributes the burden evenly among the clusters to reduce the network complexity and computational time. The chip design is evaluated based on field programmable gate array (FPGA) performance metrics for the proposed HMC-OLSR protocol, which significantly reduced hardware utilisation by 27.45%, 48.8% of slices, 28.71%, 55.82% of flip-flops, 8.35%, 13.60% of look-up tables (LUTs), and 36.4% of input/output blocks (IoBs) compared to existing OLSR and destination-Sequenced distance vector (DSDV) protocols, respectively. The recommended protocol also outperformed OLSR and DSDV routing protocols in FPGA timing constraints such as minimum time before the clock, maximum time after the clock, and minimum propagation period. The novelty of the work is in the incorporation of an FPGA-integrated scalable network design that surpasses maximum throughput, packet delivery ratio (PDR), minimum power consumption, end-to-end delay, and control overhead.

We propose a rate-adaptive multicast (RAM) routing protocol for mobile ad-hoc networks (MANETs) that is multirate-aware. During the process of path discovery, the quality of wireless links is estimated to suggest optimal transmission rates, which are then used to calculate the total transmission time incurred by the mobile nodes on a path. Among several considered paths from a source to a destination, RAM selects the path with the lowest total transmission time. Simulation results have shown that RAM outperforms single-rate multicast in terms of packet delivery ratio, packet end-to-end delay, and throughput of the multicast group. In this paper, we apply RAM to effectively support video multicast in MANETs

Multicasting is frequently proposed to efficiently support one-to-many and many-to-many communication. Consequently, many multicast routing protocols have been developed, mostly for fixed networks. This paper explores the benefits of multicast routing protocols in mobile ad-hoc networks (MANETs). Using on-demand routing protocols developed for such networks with their dynamic network topology, we compare the use of unicast, multicast, and broadcast protocols to support a variety of many-to-many communication scenarios. The results show that multicast protocols such as ADMR or ODMRP do indeed provide superior performance compared to the use of unicast protocols. However, broadcast protocols, which do not attempt to build and maintain efficient multicast distribution structures, fare equally well or better, in particular with respect to packet delivery ratio, with little to no additional network overhead.KeywordsPacket Delivery RatioMulticast TreeMulticast GroupBroadcast ProtocolMulticast RouteThese 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.

Designing mobility and power aware routing protocols have made the main focus of the early contributions to the field of Mobile Ad-hoc NETworks (MANETs). However, almost all conventional routing protocols for MANETs suffer from their lack of adaptivity leading to their performance degradation under varying network conditions. In fact, this is due to both simplistic conception hypotheses they made about the network and to the use of some prefixed parameters in protocols implementations. Currently, artificial intelligence methods like Reinforcement Learning (RL) are widely used to design adaptive routing strategies for MANETs. In this paper, we present a comprehensive survey of RL-based routing protocols for MANETs. Besides, we propose some future research directions in this area.

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.

Nowadays, with the miniaturization of communication devices, dense and highly mobile ad-hoc networks are very common. Besides, more and more devices have several radio interfaces. In such an environment, multi-path routing should be considered. Yet, only few multi-path ad-hoc routing protocols take into account the radio-interferences which might arise between two geographically close routes. Moreover, they generally only forbid the addition of interfering paths rather than looking for a different, more optimized, solution. This paper presents NICE-MRP, a novel multi-path routing protocol for mobile ad-hoc networks giving efficient solutions with respect to physical radio-interferences between paths. This protocol discovers and stores several combinations of non-interfering multi-path routes. The best multi-path route is used to transmit data, whereas alternative multi-path routes are kept to dynamically react to route breakages due to mobility and node failures. Compared to other well-known protocols, NICE-MRP presents good qualities in terms of latency, overhead and packet losses. Besides, these results end to be rather independent from the degree of mobility.

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.

Mobile ad hoc networks are formed dynamically without any infrastructure and each node is responsible for routing information among them. Rough set theory is a mathematical tool to deal with vagueness and uncertainty. In this paper a routing protocol for mobile adhoc networks that uses rough set theory is proposed. The performance of the protocol is compared with that of an existing routing protocol.