Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
A distributed routing algorithm for mobile wireless networks
Wireless Networks
Computer networks (3rd ed.)
Location-aided routing (LAR) in mobile ad hoc networks
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
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
Scenario-based performance analysis of routing protocols for mobile ad-hoc networks
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Caching strategies in on-demand routing protocols for wireless ad hoc networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
The effects of on-demand behavior in routing protocols for multihop wireless ad hoc networks
IEEE Journal on Selected Areas in Communications
Ariadne: a secure on-demand routing protocol for ad hoc networks
Proceedings of the 8th annual international conference on Mobile computing and networking
Using labeled paths for loop-free on-demand routing in ad hoc networks
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
Quality of service in mobile ad hoc networks
The handbook of ad hoc wireless networks
Securing quality-of-service route discovery in on-demand routing for ad hoc networks
Proceedings of the 2nd ACM workshop on Security of ad hoc and sensor networks
MANET simulation studies: the incredibles
ACM SIGMOBILE Mobile Computing and Communications Review - Special Issue on Medium Access and Call Admission Control Algorithms for Next Generation Wireless Networks.: The Digital Library version of this issue has a corrected special issue title compared to the one in the print version of the issue.
Ariadne: a secure on-demand routing protocol for ad hoc networks
Wireless Networks
System Services for Ad-Hoc Routing: Architecture, Implementation and Experiences
Proceedings of the 1st international conference on Mobile systems, applications and services
Path selection strategies for multipath ad hoc network
AsiaCSN '07 Proceedings of the Fourth IASTED Asian Conference on Communication Systems and Networks
Low-Latency routing in ad hoc wireless networks using finite horizons
ISPA'05 Proceedings of the 2005 international conference on Parallel and Distributed Processing and Applications
Validity of predicting connectivity in wireless ad hoc networks
MSN'05 Proceedings of the First international conference on Mobile Ad-hoc and Sensor Networks
Hi-index | 0.00 |
In an ad hoc network, the use of source routing has many advanctages, including simplicity, correctness, and flexibility. For example, all routing decisions for a packet are made by the sender of the packet, avoiding the need for up-to-date routing information at intermediate nodes and allowing the routes used to be trivially guaranteed loop-free. It is also possible for the sender to use different routes for different packets, without requiring coordination or explicit support by the imtermediate nodes. In addition, on-demand source routing has performed very strongly when compared against other proposed protocol designs. However, source routing has the disadvantage of increased per-packet overhead due to the source route header that must be present in every packet orginated or forwarded. In this paper, we propose and analyze the use in ad hoc networks of implicit source routing while avoiding the associated per-packet overhead in most cases. We evaluated this technique through detailed simulations of ad hoc networks based on the Dynamic Source Routing protocol (DSR), an on-demand ad hoc network routing protocol based on source routing. Although routing packet overhead increased slightly with implicit source routing, by about 12.3%, the total number of bytes of overhead decreased substantially, by between 44 and 86%. On all other metrics evaluated, the performance or DSR either did not change significantly or actually improved somewhat, due to indirect effects of of the reduced routing overhead