An engineering approach to computer networking: ATM networks, the Internet, and the telephone network
Query localization techniques for on-demand routing protocols in ad hoc networks
MobiCom '99 Proceedings of the 5th 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
Scenario-based comparison of source-tracing and dynamic source routing protocols for ad hoc networks
ACM SIGCOMM Computer Communication Review - Special issue on wireless extensions to the internet
Ad Hoc Networking
A graph-based approach to compute multiple paths in mobile ad hoc networks
HSI'03 Proceedings of the 2nd international conference on Human.society@internet
PATM: priority-based adaptive topology management for efficient routing in ad hoc networks
ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part II
| Hi-index | 0.00 |
Dynamic source routing (DSR) is a robust protocol commonly applied to multi-hop wireless mobile ad hoc networks (MANETs). In this paper, an algorithm is proposed for modifying the basic DSR protocol to enhance its performance by reducing the number of redundant route reply packets (RREPs). In the modified DSR (MDSR), for a source destination pair, the destination responds to the first received route request packet (RREQ) with an RREP, and the subsequently received RREQs, bearing the same request ID, are responded to only if the hop count is less than that of all the previously received RREQs. The performance of MDSR has been compared with that of the basic DSR for different network densities and for different mobility of nodes. Simulation results show that MDSR gives fewer control packets, less latency and a higher packet delivery ratio than DSR.