Message traffic control capabilities of the R-DSDV protocol in mobile ad hoc networks
MSWIM '01 Proceedings of the 4th ACM international workshop on Modeling, analysis and simulation of wireless and mobile systems
A Preemptive On-demand Distance Vector Routing Protocol for Mobile and Wireless Ad Hoc Networks
ANSS '03 Proceedings of the 36th annual symposium on Simulation
Preemptive routing in ad hoc networks
Journal of Parallel and Distributed Computing - Special issue on Routing in mobile and wireless ad hoc networks
Ad hoc QoS on-demand routing (AQOR) in mobile ad hoc networks
Journal of Parallel and Distributed Computing - Special issue on Routing in mobile and wireless ad hoc networks
Geomulticast: architectures and protocols for mobile ad hoc wireless networks
Journal of Parallel and Distributed Computing - Special issue on Routing in mobile and wireless ad hoc networks
On the current state of transport layer protocols in mobile ad hoc networks
ACM-SE 42 Proceedings of the 42nd annual Southeast regional conference
EHAC'08 Proceedings of the 7th WSEAS International Conference on Electronics, Hardware, Wireless and Optical Communications
Enhanced non-disjoint multi-path source routing protocol for wireless ad-hoc networks
ICCSA'07 Proceedings of the 2007 international conference on Computational science and its applications - Volume Part III
A heuristic and distributed QoS route discovery method for mobile ad hoc networks
WAIM'05 Proceedings of the 6th international conference on Advances in Web-Age Information Management
Hi-index | 0.00 |
Abstract: Ad hoc networks are wireless, mobile networks that can be set up anywhere and anytime without the aid of any established infrastructure or centralized administration. Because of the limited range of each host's wireless transmission, to communicate with hosts outside its transmission range, a host needs to enlist the aid of its nearby hosts in forwarding packets to the destination. However, since there is no stationary infrastructure such as base stations, each host has to act as a router for itself. A routing protocol for ad hoc networks is executed on every host and is therefore subject to the limit of the resources at each mobile host. A good routing protocol should minimize the computing load on the host as well as the traffic overhead on the network. Therefore, a number of routing protocols have been proposed for ad hoc wireless networks. In this paper, we focus upon on-demand schemes. We study and compare the performance of the following three routing Protocols AODV, CBRP and DSR. A variety of workload and scenarios, as characterized by mobility, load and size of the ad hoc network were simulated. Our results indicate that despite its improvement in reducing route request packets, CBRP has a higher overhead than DSR because of its periodic hello messages while AODV's end-to-end packet delay is the shortest when compared to DSR and CBRP.