An enhanced Multipath Strategy in Mobile Ad hoc Routing Protocols

The various routing protocols in Mobile Ad hoc Networks follow different strategies to send the information from one node to another. The nodes in the network are non static and they move randomly and are prone to link failure which makes always to find new routes to the destination. This research mainly focused on the study of the characteristics of multipath routing protocols in MANETS. Two of the multipath routing protocols were investigated and a comparative study along with simulation using NS2 was done between DSR and AODV to propose an enhanced approach to reach the destination maintaining the QoS. A possible optimization to the DSR and AODV routing protocols was proposed to make no node to be overburdened by distributing the load after finding the alternate multipath routes which were discovered in the Route discovery process. The simulation shows that the differences in the protocol highlighted major differences with the protocol performance. These differences have been analyzed with various network size, mobility, and network load. A new search table named Search of Next Node Enquiry Table (SONNET) was proposed to find the best neighbor node. Using SONNET the node selects the neighbor which can be reached in less number of hops and with less time delay and maintaining the QoS

A performance study of routing protocols for mobile grid environment

Integration of mobile wireless consumer devices into the Grid initially seems unlikely due to limitation such as CPU performance,small secondary storage, heightened battery consumption sensitivity and unreliable low-bandwidth communication. The current grid architecture and algorithm also do not take into account the mobile computing environment since mobile devices have not been seriously considered as valid computing resources or interfaces in grid communities. This paper presents the results of simulation done in identifying a suitable ad hoc routing protocol that can be used for the target grid application in mobile environment. The simulation comparing three ad hoc routing protocols named DSDV, DSR and AODV

Enhancing Route lifetime in Vehicular Ad Hoc ?Networks Based on Skellam Distribution Model

The emergence of smart cities and the need to use intelligent transportation systems has led to an increased reliance on vehicle ad hoc networks (VANET). The topology of VANET is highly dynamic, which results in a short effective routing time. This paper presents  a two-stage algorithm to select a route that can sustain communication between vehicles for as long as possible while taking into account the variables that affect the VANET topology. The first stage uses Skellam distribution model to assess the connectivity probability of paths in ?a 2d road network based on traffic-flow and the number of vehicles ?joining and leaving the ?network,  accordingly, the path with the highest connectivity is chosen. In the second stage, the control packets sent only to vehicles on the selected path to detect routes between source and destination, thus reducing the overhead of control packets and increasing network stability. ? the algorithm adopts the principle of global evaluation to ?estimate the lifetime ?of the ?detected ?routes within the chosen path. ?the route with the ?best estimated ?lifetime ?is ?chosen to be ?the active route. ?in the event of route failure, the validity of the next route in lifetime is confirmed to be adopted as the alternate route. The proposed algorithm was compared with both on-?demand distance ?vector routing protocol (AODV) protocol and the modified location-aided routing ??(LAR) ?protocol. The proposed algorithm showed greater network stability, higher performance in terms of longer lifetime route detection, less energy consumption and higher throughput

Performance evaluation of a new end-to-end traffic-aware routing in MANETs

There has been a lot of research effort on developing reactive routing algorithms for mobile ad hoc networks (MANETs) over the past few years. Most of these algorithms consider finding the shortest path from source to destination in building a route. However, this can lead to some network nodes being more overloaded than the others. In MANETs resources, such as node power and channel bandwidth are often at a premium and, therefore, it is important to optimise their use as much as possible. Consequently, a traffic-aware technique to distribute the load is very desirable in order to make good utilisation of nodes' resources. Therefore a number of end-to-end traffic aware techniques have been proposed for reactive routing protocols to deal with this challenging issue. In this paper we contribute to this research effort by proposing a new traffic aware technique that can overcome the limitations of the existing methods. Results from an extensive comparative evaluation show that the new technique has superior performance over similar existing end-to-end techniques in terms of the achieved throughput, end-to-end delay and routing overhead