|
Organizers |
Comparative Study of Routing Algorithm for Mobile Computing
by
Ashwani Kush
Kurukshetra Univeristy Kurukshetra
Coauthors: Dr. Phalguni Gupta (Department of Computer science and Engineering, I.I.T. Kanpur)
In this paper we have tried to analyze various routing algorithms for mobile computing . The parameters used to analyze the algorithms are based on major aspects like Algorithm efficiency, Networks size, reduced routing complexity , architecture, improve delay performance, connectivity , performance and much more . Algorithms considered here are WRP (Wireless Routing Protocol ) , DSR (Dynamic State Routing ) , DDR ( distributed Dynamic Routing ) , TORA ( Temporary Ordered routing Algorithm) ,RDMAR ( Routing Protocol for Mobile computing) , GSR ( Global State routing) , ZRP (Zone routing protocol ) , Bellman Ford algorithm (DBF ) and STAR (Source tree adaptive routing) . Mobile Ad hoc Networks community is trying to standardize the protocols and this study will provide a great help to them .
Keywords : ad hoc networks , Routing, protocols, flooding, Wireless, Link state ,MAC
Date received: December 3, 2002
Copyright © 2002 by the author(s). The author(s) of this document and the organizers of the conference have granted their consent to include this abstract in Atlas Conferences Inc. Document # cakd-49.