Performance Evaluation of Reactive Routing in Mobile Grid Environment

Abstract

Grid computing came into existence as a manner of sharing heavy computational loads among multiple computers to be able to compute highly complex mathematical problems. The grid topology is highly flexible and easily scalable, allowing users to join and leave the grid without the hassle of time and resource-hungry identification procedures, having to adjust their devices or install additional software. The goal of grid computing is described as “to provide flexible, secure and coordinated resource sharing among dynamic collections of individuals, institutions and resources”. AODV is an on-demand (reactive) algorithm capable of both unicast and multicast routing. In this paper, AODV has been modified by varying some of the configuration parameters used in this algorithm to improve its performance. This modified protocol i.e. A-AODV (advanced ad hoc on demand distance vector) has been compared with AODV in grid environment. The simulations have shown that A-AODV is able to achieve high throughput and packet delivery ratio and average end-to-end delay is reduced.

Hybrid Routing Approach and WIMAX Network for Minimization Routing Overhead and Increasing Radio Range in MANET

“…We also minimize the routing overhead through LAR routing because LAR cerate expected zone of the destination and send's to the source node so if communication break than only route packet send only request zone that time route overhead nearly 75% decreases. All that point motivates to work in the field of MANET with hybrid mechanism [18].…”

“…The simulation described in this project was tested using the ns-2 test-bed that allows users to create arbitrary network topologies [18]. By changing the logical topology of the network, ns-2 users can conduct tests in an ad hoc network without having to physically move the nodes.…”

An Advanced Congestion Adaptive Routing Mechanism

“…AllThe Optimized Link State Routing (OLSR) protocol is an optimization of the classical link state algorithm, adapted to the requirements of a MANET [11]. Because of their quick convergence, link state algorithms are somewhat less prone to routing loops than distance vector algorithms, but they require more CPU power and memory.…”

Design and Implementation of the Image Wireless Transmission Based on the ZigBee Network

“…Wireless image sensor node is still in the primary research stage. Existing image sensor node cost is higher, the rate is not high, not real-time is not strong, and these are the factors restricting its application [1,5]. Take into account some of the problems of the existing wireless image sensor node, Here to build a hardware platform for ZigBee network image transmission network research.…”