Performance analysis of typical routing protocols in Ad-Hoc networks

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.

We introduce WRP-Lite, which is a table-driven routing protocol that uses non-optimal routes, and compare its performance with the performance of the dynamic source routing (DSR) protocol, which is an on-demand routing protocol for wireless ad-hoc networks. We evaluate the performance of WRP-Lite and DSR for varying degree of mobility and traffic in a 20-node network. The performance parameters are end-to-end delay, control overhead, percentage of packets delivered, and hop distribution. We show that WRP-Lite has much better delay and hop performance while having comparable overhead to DSR.

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.

An adhoc network is a collection of mobile nodes connected by a wireless link, where each node acts as a router. In order to facilitate the communication within the network, a routing protocol is needed. Due to bandwidth constraint and dynamic topology of the mobile adhoc Networks supporting Quality of Service (QoS) is challenging task. The aim of this work is to present QoS enabled routing protocol in adhoc networks and compare it with normal routing protocol. The Optimized Link State Routing (OLSR) protocol is an optimization of the classical link state protocol, which is used for implement the QoS. Such protocol is adopted for the reason that it reduces the size of control messages and minimizes the overhead from the flooding of control traffic. The performance of both routing and QoS routing protocols are evaluated using Network simulator Ns-2.QoS enabled routing protocol shows a significant improvement in protocol performance metrics applied in our measurements, such as packet delivery ratio, packet loss and delay.

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.

In this paper we propose a new routing protocol for large scale Mobile Adhoc Networks, named HRAN. The protocol supports large networks, requires few resources from devices and lowers the control message overhead associated with discovering new routes. It works by simulating the paradigm of heat trails in a physical environment through the use of bloom filters. In our protocol each node emits a certain quantity of heat and as the node moves a heat trail is formed. After a node leaves a location the heat from surrounding nodes slowly dissipates. This heat information is then used to guide routing queries from the source to the destination.

The field that is the key issue of wire, wireless environment is security and many routing protocols are studied also at the ad-hoc network. In the mobile ad-hoc network which has no fixed base structure, the weakest point is security. This paper analyzed AODV protocol, which is a routing protocol, the important routing protocol in ad-hoc network, so that it can overcome the problem in security threats. It used the lightest and fastest message authentication code, so was able to design rather safer AODV routing protocol.

Ad hoc network is sub-domain of network communication in which user communicates with each other by temporarily network without any centralized network administration. Each node acts as node as well as router to forward data packets on the basis of routing protocols. Wireless communication is the most research oriented era now days; most importantly in the field of vehicular ad hoc network. VANET is the sub-ordinate of the Mobile ad hoc Network (MANET). Efficient routing protocols play vital role in ad hoc networks in terms of network reliability and network performance. Routing in VANET is the most important and challenging research issue. Mostly MANET routing protocols used in the VANET, but usually MANET routing protocols are not compatible within VANET's scenario due to its mobility differences. In this research we validate a VANET routing protocol GeoWave for better information dissemination to overcome the traffic blockage and which will reduce the Carbon Dioxide (CO) of the Vehicles in the large congested urban area scenario. We use well-known network simulator Omnet++ and SUMO traffic generator to simulate the network environment.

Routing in cognitive radio ad-hoc network is one of the important aspects in wireless communication. There are different routing protocols in cognitive ad-hoc network (CRAHN), and a comparative analysis of such protocols is required to find out the best possible routing protocol. In this paper, two data-driven routing protocols, namely ad-hoc on-demand distance vector (AODV) and weighted cumulative expected transmission time (WCETT), are evaluated and compared. For end-to-end routing, data processing is done using NS-2 simulator. CRCN patch analysis has been provided to validate the theoretical claims. The performance of WCETT and AODV is evaluated in terms of throughput, routing overhead, packet delivery ratio (PDR) and normalized routing overhead (NRL). The simulation result is found better in favor of WCETT as compared to AODV because of its better route selection strategy in CRAHN.KeywordsRouting protocolCognitive radio ad-hoc network (CRAHN)Performance assessmentAODVWCETTNS-2

Wireless ad-hoc networks are collections of wireless nodes having no predefined infrastructure. Most of the existing routing protocols for wireless ad-hoc networks use the shortest path or minimum distance path to the destination. However, the shortest path routing does not provide a good balance of the traffic load among all nodes. When many users utilize the shortest paths, some nodes become highly congested and become what is known as hotspots. These hotspots degrade the performance of wireless ad-hoc networks by creating long queuing and contention delays. This paper investigates the effects of shortest path routing on the network by varying different network parameters. A load distributed path routing is also proposed to enhance the performance of shortest path routing. Matlab simulations show that the load distributive routing provides 35% and 44% less contentions in a 20-node and 30-node network respectively, when compared to shortest path routing.

In general, existing routing protocols in adhoc networks can be classified as proactive, reactive or hybrid. Proactive protocols are table driven. Proactive protocols maintain entire topology of network. So whenever there is routing request connection is established quickly. Reactive protocols are also known as On-demand protocols. On demand protocols based on fact that there is no point in maintaining network topology since it is always changing. Hybrid protocols combines approach of both reactive and proactive. Cluster based routing protocol (CBRP) is hybrid routing protocol designed for MANET. By clustering nodes into groups, the protocol efficiently minimizes flooding, traffic during route discovery. However we have realized mobility of the nodes is not considered in route reply process of the protocol. There is no mechanism defined for mobility of cluster head in route reply process. In this paper we have studied existing routing strategies in MANET and proposed a solution to the drawback we found in CBRP. Performance of CBRP will enhanced using our proposed solution.

Ad hoc mobile networks are composed of mobile nodes communicating through wireless medium, without any fixed backbone infrastructure. In these networks, Congestion occurs in any intermediate nodes when data packets travel from source to destination and they incur high packet loss and long delay, which cause the performance degradations of a network. This paper presents the early detection congestion and control routing protocol for wireless Ad-hoc networks called as EDAODV. EDAODV detects congestion at a node level by calculating queue_status value and finding congestion status. Based on a congestion status, EDAODV utilizes the non-congested predecessor and successor nodes of a congested node and initiates route finding process bi-directionally to find alternate non-congested path between them for transmitting data. The process finds more non-congested alternate paths and chooses a best single path for transmitting data.

An ad-hoc network is the cooperative engagement of a collection of Mobile Hosts without the required intervention of any centralized Access Point.A Mobile Ad hoc NETwork called MANET is a kind of wireless ad-hoc network that is a self configuring network of mobile routers.These mobile routers are connected by wireless links.In MANET there are various routing protocols available.DSR, AODV and DSDV are most popular.Our proposed works are related to examine routing protocol for mobile ad hoc networks -the Destination Sequenced Distance Vector (DSDV) and On Demand protocol that evaluates both protocols based on the packet delivery fraction and average delay while varying number of sources and pause time.In this Improved -DSDV approach we can overcome the problem of state routes, as well as improve the performance of regular DSDV.We compare the performance of our work with DSDV.In our improved DSDV routing protocol, nodes can cooperate together to obtain an objective opinion about another nodes trustworthiness.

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.

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.