A Comparative Study of Gossip based Multicast Routing Protocols for Wireless Ad Hoc Network

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.

Owing to the absence of any static support structure, ad-hoc networks are prone to link failures. The 'shortest path seeking' routing protocols may not lead to stable routes. The consequent route failures that ensue, lead to the degradation of system throughput. This paper suggests a routing protocol wherein the route selection is done on the basis of an intelligent residual lifetime assessment of the candidate routes. Schemes for performance enhancement with TCP and non-TCP traffic in ad-hoc networks are proposed. The protocol is backed by simulations in ns that show excellent adaptation to increasing network mobility. We have also introduced new route cache management and power aware data transmission schemes.

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.

Ad-hoc networking allows users to form temporary wireless networks without existing infrastructure. Each node acts both as host and router and must therefore be willing to forward packets for other nodes. This is done using a mobile ad-hoc network (MANET) routing protocol. Frequent topology changes make such routing challenging. Existing protocols include dynamic source routing (DSR), the cluster-based routing protocol (CBRP), and the ad hoc on-demand distance vector (AODV) protocol, among others. Using existing protocols, however, some nodes may be unduly loaded and end-to-end delay may be high. Further, existing protocols are hard to upgrade once they are in use. To address these problems, a new routing protocol, MARP, using mobile agents is presented. Mobile agents are software entities that can move between network nodes and execute programs they carry with them wherever they are running. Our agent-based algorithm implements a demand-based protocol that provides efficient routing at the application layer. A proof of concept implementation has been developed using Aglets and simulated to evaluate its performance. The details of the protocol and its performance are reported in this paper.

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.

Performance of the beacon-less routing protocol in realistic scenarios

In this paper, a new cross layer design of MAC and Routing protocol for OFDMA-based Multi-hop Ad-hoc Networks is proposed. In wireless network, when a route is established, the radio resource allocation problems at MAC layer may decrease the end to end performance proportionally with the length of each route. The contention at MAC layer may causes routing protocol to respond by finding new routes and routing table updates. The cross layer design allows layers to exchange state information in order to solve the problem and obtain higher performance. The proposed cross layer design of MAC and Routing protocol based the dynamic Sub-channel Assignment Algorithm in [4] to ensure the performance of ad-hoc and multi-hop networks is significantly improved.

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.

Recent development has a tremendous growth in the ad-hoc wireless networks. Ad-hoc wireless networks are dynamic topology networks organized by a collection of mobile nodes that utilize multi-hop radio relaying and are capable of operating without the support of any fixed infrastructure. Ad-hoc wireless networks are very useful in emergency operations, collaborative and distributed computing and military applications. Multicasting plays an important role in the ad-hoc wireless networks, where nodes form groups to carry out certain tasks that require point-to-multipoint and multipoint-to-multipoint voice and data communication. The biggest challenge in the ad-hoc wireless networks is to find an optimized path between the two nodes. In this paper, we present an ant colony based metaheuristic multicast routing protocol for ad-hoc wireless networks, in that we analyzed the performance of dynamic core based multicast routing protocol (DCMP). This approach maps the solution capability of swarm intelligence to mathematical and engineering problems. The DCMP is highly adaptive, efficient and scalable. The performance of these protocols has been examined under realistic scenarios using NS 2, the network simulator tool. Performance has been analyzed for the metrics packet delivery ratio and control overheads with the multicast routing protocol. The proposed ant colony based routing protocol reduce the overheads in routing.

Wireless Ad-hoc networks have lack of mass deployment. An Ad hoc wireless network has a dynamic nature that leads to constant changes in its network topology. There is an infrastructure less and decentralized network which need a robust dynamic routing protocol. This article presents performance comparison of wireless Ad-hoc network on different routing protocols. Network simulator QualNet 5.0.2 has been used to evaluate the performance of wireless networks with various routing protocols.

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.

Power and line saving in ad hoc mobile networks are important (MANET). Not only the transmission ratio but also network life is affected by these two factors. In this paper, we provided an efficient and easy routings agreement to extend the service life and dispense as fairly as possible the traffic of the networks. In addition, a service capacity concept is implemented to reverse the congestion move around a point. The mentioned routings protocols are thus able to prevent associate congestion and reach a higher packets transmission rate. A routings design is the main factorsand should be carefully addressed to achieve efficient and solid communication between UAVs. This subject has drown attention many scholars and different routings protocol have been put advance for improving data transmission efficiency in FANETs due to its significance and usefulness. In this paper we are therefore conducting a report on the astate of the art routings protocol in the last few year ago. Firstly, a detailed analysis of the FANETs routing has recently been carried out by differentiating them completely according to their routing process. Then we analyze the characteristics and the service quality metrics of each protocol against each other. Finally, we suggest a few unresolved problems and possible FANET routing research directions

Routing is in fact a simple task, yet the implementation of routing protocols requires specific operating system related knowledge. The developer has to deal with particular kernel internals that might have severe side effects. Furthermore, novel routing protocols require features that are not provided by current operating systems. Thus, routing protocols for mobile ad-hoc networks and wireless mesh networks are often studied in simulation environments. However, simulations have limitations that can result in conclusions that do not hold in real networks. A framework for the implementation of routing protocols in operating systems is required to enable real world oriented research. We introduce the DES Simple and Extensible Routing-Framework for Testbeds (DES-SERT). It supports the implementation, experimentation, and evaluation of routing protocols in a testbed environment. A structured protocol implementation is advocated by transmitting data in extensions attached to packets and by its pipeline based architecture. Several steps are elaborated how to derive an implementation from a routing protocol specification. A gossip implementation is presented as a simple example.

Networks are being used in various areas and the demand of users nowadays has motivated the emergence of the Mobile Ad Hoc Network (MANET). MANET is a dynamic network without fixed infrastructure due to their wireless nature and can be deployed as multi-hop packet networks. It is a wireless network and has dynamic topology due to its node mobility. There are two types of MANET, homogeneous and heterogeneous MANET. An architecture has been designed in previous work to model these two types of MANET. Three scenarios have been defined from this architecture: scenario I (communication entirely within MANET, homogeneous MANET), scenario II (communication between MANET and wireless LAN, heterogeneous MANET) and scenario III (communication between MANET with wireless LAN and wired LAN, heterogeneous MANET). MANET has its own routing protocols which can compromised with frequent route exchange, dynamic topology, bandwidth constraint and multi-hop routing. Ad hoc On Demand Distance Vector (AODV) is one of the routing protocols in MANET. The aim of this research is to assess the effects of different packet size with the implementation of AODV routing protocols in homogeneous and heterogeneous MANET through the simulation method. The three scenarios above have been developed in the OMNeT++ network simulator. The results achieved from the test have been evaluated using the metrics assigned, throughput and packet delivery ratio (PDR). The tests show that the increase of throughput and PDR performance was parallel with the increase of packet size. From the test also, we can conclude that the performance due to the packet size effect in homogeneous MANET is better than in heterogeneous MANET.