An Improved Hybrid Location-Based Routing Protocol for Ad Hoc Networks

In this paper, we propose an intelligent routing protocol for wide-area Ad Hoc network. This protocol was designed based on both the on-demand routing protocol and table-driven routing protocol. In our routing protocol, QoS guarantee mechanism was taken into consideration, and business was divided into three types and each type enjoys different service priorities. So it's an intelligent routing protocol supporting distinguishing service. It builds its routing information through the way of cross-layer and protocols exchange, etc. After analyzing the routing information, it builds a knowledge database and this database can update itself. Its decisions of routing strategy and mode choice, in the early construct routing strategy, were made based on the specific need of messages and the business in the database. According to the strategy result, it's able to finish the path's self-establishment, self-configuration and self-maintenance. It balances the need of users QoS and the whole network QoS.

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.

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.

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.

This paper focuses on the routing protocol issue in two important environments for Vehicular Ad Hoc Networks (VANET): Manhattan and the Freeway. A novel protocol called Two-level Trajectory Based Routing (TTBR) protocol is proposed. Deterministic vehicles movement permits advantage to be taken of the map info to build a specific local trajectory to reach the destination node. However, in order to offer network scalability also a high level cell-based trajectory is applied to have a coarse knowledge of the cell where the destination node is moving. Our proposal needs Peer Servers and Grid subdivision of the space. Simulation results were assessed to show the improvements and scalability offered by TTBR in comparison with other Ad Hoc networks protocols such as AODV and GPSR. Performance Evaluation was evaluated in terms of Normalized Control Overhead and Data Packet Delivery Ratio. TTBR is more performing than AODV for a high speed and high density scenario for both the Manhattan and Freeway scenarios. © 2009 Academy Publisher.

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.

Routing protocols play an important role for communications in MANET. Most of the protocols, however, use a single route and do not utilize multiple alternate paths. Thus a dynamic multi-path source routing (DMSR) protocol is proposed to improve existing on-demand routing protocols. It consists of three major phases, namely routing discovery, multi-path routing selecting and routing maintenance. In multi-path routing selecting phase, the ideal number of multi-path routing is achieved to compromise between load balancing and network overhead. Simulation results show that such protocol remarkably increases the packet delivery ratio with lower routing overhead. It will provide an effective solution for wireless communication.

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.

This paper has discussed about enhancing the performance of various parameters i.e. throughput, end-to-end delay drop packets and packet delivery ratio in existing AODV routing protocols in ad-hoc wireless networks. But there are some limitations of existing Ad hoc On-demand Distance Vector Routing Protocol (AODV) routing protocol in terms of performance on above mentioned parameters due to high mobility, Scalability, overhead etc. Hence, as the number of nodes (up to 100 nodes) increases, ImprovedAd hoc On-demand Distance Vector Routing Protocol (AODV+) is suggested to make better performance on above mentioned parameters due to low mobility, scalability, low overhead etc.

The routing protocol design for ad hoc networks is studied in this paper. First, we propose an end-to-end congestion relief routing protocol (ECRR) for ad hoc networks. Through sensing the hop count and congestion information of available paths, ECRR can select an appropriate route for data transmission. Based on ECRR and combining the advantages of single-path and multi-path routing strategies, we further develop a mixed-path end-to-end congestion relief routing protocol (M-ECRR). According to the current network state information, M-ECRR decides whether or not to execute the multi-path scheme. When the path length is small and network load is light, M-ECRR operates the single path strategy; otherwise it operates the multi-path strategy. Finally, we conduct extensive OPNET simulations to validate the performance of proposed routing protocols. The results indicate that compared with AODV, ECRR and M-ECRR can improve the network throughput, reduce the hop count and energy consumption, while ensuring the delay performance and control overhead.

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.

Routing is an important issue in cognitive radio ad hoc networks (CRAHNs) owing to the stochastic activity of primary users (PUs). In particular, route stability remains an important issue in the CRAHN protocols. In this paper, the authors propose a stability-weighted cumulative expected transmission time (SWCETT) routing protocol. The SWCETT routing protocol aims towards providing the most optimal route based on both quality of service (QoS) metrics, such as delay and throughput, and stability of the route in the CRAHN. The performance of the SWCETT routing protocol is determined through simulations and compared with other routing protocols. The proposed routing protocol is capable of providing better delay and throughput than other routing protocols. The results prove the importance of the route stability metric in raising the performance of CRAHNs.

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.

Routing protocols design is an important and essential issue for Vehicular Ad Hoc Networks. In this paper, a more realistic simulation environment is developed based on VanetMobiSim and OPNET, and the performance of several classical routing protocols such as Optimized Link State Routing (OLSR), Geographic Routing Protocol (GRP), Ad hoc On Demand Distance Vector Routing (AODV) and Dynamic Source Routing (DSR) in various network conditions is evaluated and compared. Network delay and network packet loss are simulated with different nodes' density. The simulation results show that DSR is not suitable for dense VANETs, while AODV and OLSR have better network adaptability in dense VANETs. The performance of GRP is inferior to AODV and OLSR.