Performance Evaluation of Reactive Routing in Mobile Grid Environment

2011 ◽  
Vol 3 (3) ◽  
pp. 45-53 ◽  
Author(s):  
L. Shrivastava ◽  
G. S. Tomar ◽  
S. S. Bhadauria
Keyword(s):  
Grid Computing ◽  
Resource Sharing ◽  
Ad Hoc ◽  
Multicast Routing ◽  
Delivery Ratio ◽  
Grid Environment ◽  
On Demand ◽  
Reactive Routing ◽  
Grid Topology ◽  
Mathematical Problems

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.

Performance Evaluation of Reactive Routing in Mobile Grid Environment

2013 ◽  
pp. 159-167
Author(s):  
L. Shrivastava ◽  
G. S. Tomar ◽  
S. S. Bhadauria
Keyword(s):  
Grid Computing ◽  
Resource Sharing ◽  
Ad Hoc ◽  
Multicast Routing ◽  
Delivery Ratio ◽  
Grid Environment ◽  
On Demand ◽  
Reactive Routing ◽  
Grid Topology ◽  
Mathematical Problems

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.

scholarly journals On Demand Multicasting Routing Protocol compared with AODV and FSR in Mobile Ad hoc Network

2013 ◽  
Vol 6 (1) ◽  
pp. 705-710
Author(s):  
Kavita Kundlik Bondre ◽  
Prof. Ajitsinh.N. Jadhav
Keyword(s):  
Routing Protocol ◽  
Ad Hoc Network ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Multicast Routing ◽  
Mesh Networks ◽  
On Demand ◽  
Multicast Routing Protocol ◽  
Mobile Ad Hoc ◽  
Acquisition Delay

Mobile ad hoc network is a collection of wireless nodes that dynamically organize themselves to form a network without the need for any fixed infrastructure or centralized administration. The network topology dynamically changes frequently in an unpredictable manner since nodes are free to move. Support for multicasting is essential in such environment as it is considered to be an efficient way to deliver information from source nodes to many client nodes. On-Demand Multicast Routing Protocol is a protocol for routing multicast and unicast traffic throughout adhoc wireless mesh networks. ODMRP creates routes on demand so they suffer from a route acquisition delay,although it helps reduce network traffic in general. In future this  results will be compared with AODV and FSR protocol and ODMRP performs better as compared with AODV and FSR protocol.

Understanding the communication complexity of the robotic Darwinian PSO

Robotica ◽  
2014 ◽  
Vol 33 (1) ◽  
pp. 157-180 ◽  
Author(s):  
Micael S. Couceiro ◽  
Amadeu Fernandes ◽  
Rui P. Rocha ◽  
Nuno M. F. Ferreira
Keyword(s):  
Particle Swarm Optimization ◽  
Routing Protocol ◽  
Information Exchange ◽  
Communication Complexity ◽  
Ad Hoc ◽  
Communication Overhead ◽  
Swarm Optimization ◽  
On Demand ◽  
Reactive Routing ◽  
Distance Vector

SUMMARYAn extension of the well-knownParticle Swarm Optimization(PSO) to multi-robot applications has been recently proposed and denoted asRobotic Darwinian PSO(RDPSO), benefited from the dynamical partitioning of the whole population of robots. Although such strategy allows decreasing the amount of required information exchange among robots, a further analysis on the communication complexity of the RDPSO needs to be carried out so as to evaluate the scalability of the algorithm. Moreover, a further study on the most adequate multi-hop routing protocol should be conducted. Therefore, this paper starts by analyzing the architecture and characteristics of the RDPSO communication system, thus describing the dynamics of the communication data packet structure shared between teammates. Such procedure will be the first step to achieving a more scalable implementation of RDPSO by optimizing the communication procedure between robots. Second, an ad hoc on-demand distance vector reactive routing protocol is extended based on the RDPSO concepts, so as to reduce the communication overhead within swarms of robots. Experimental results with teams of 15 real robots and 60 simulated robots show that the proposed methodology significantly reduces the communication overhead, thus improving the scalability and applicability of the RDPSO algorithm.

scholarly journals Confidence-based Security System for Routing Protocol in Mobile Ad-hoc Networks

2019 ◽  
Vol 9 (2) ◽  
pp. 2212-2218
Keyword(s):  
Energy Consumption ◽  
Routing Protocol ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Average Energy ◽  
Delivery Ratio ◽  
Node Mobility ◽  
On Demand ◽  
Distance Vector ◽  
Mobile Ad Hoc

A mobile ad-hoc network (MANET) is an infrastructure-less network of wireless nodes. The network topology may change quickly with respect to time, due to node mobility. The network is a disintegrated network, activities such as delivering messages by determining the topology essential to be implemented by the nodes themselves i.e., the routing activity will be unified into mobile nodes. Due to the lack of centralized administration in multihop routing and open environment, MANET’s are susceptible to attacks by compromised nodes; hence, to provide security also energy efficiency is a crucial issue. So as to decrease the hazards of malicious nodes and resolve energy consumption issues, a simple confidence-based protocol is built to evaluate neighbor’s behaviour using forwarding factors. The reactive Ad-hoc on-demand multipath distance vector routing protocol (AOMDV), is extended and confidence-based Ad-hoc on-demand distance vector (CBAOMDV) protocol, is implemented for MANET. This implemented protocol is able to find multiple routes in one route discovery. These routes are calculated by confidence values and hop counts. From there, the shortest path is selected which fulfills the requirements of data packets for reliability on confidence. Several experimentations have been directed to relate AOMDV and CBAOMDV protocols and the outcomes show that CBAOMDV advances throughput, packet delivery ratio, normalized routing load, and average energy consumption.

Sign in / Sign up

Export Citation Format

Share Document