A performance comparison of multi-hop wireless ad hoc network routing protocols
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
IEEE 802.11 Ad Hoc Networks: Performance Measurements
ICDCSW '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Ad Hoc Wireless Networks: Architectures and Protocols
Ad Hoc Wireless Networks: Architectures and Protocols
Performance Comparison of Trust-Based Reactive Routing Protocols
IEEE Transactions on Mobile Computing
| Hi-index | 0.00 |
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.