Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
GloMoSim: a library for parallel simulation of large-scale wireless networks
PADS '98 Proceedings of the twelfth workshop on Parallel and distributed simulation
The performance of query control schemes for the zone routing protocol
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
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
Effects of wireless physical layer modeling in mobile ad hoc networks
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
Characterizing user behavior and network performance in a public wireless LAN
SIGMETRICS '02 Proceedings of the 2002 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Message-optimal connected dominating sets in mobile ad hoc networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
SHARP: a hybrid adaptive routing protocol for mobile ad hoc networks
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
The changing usage of a mature campus-wide wireless network
Proceedings of the 10th annual international conference on Mobile computing and networking
Characterizing mobility and network usage in a corporate wireless local-area network
Proceedings of the 1st international conference on Mobile systems, applications and services
Scalable routing strategies for ad hoc wireless networks
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
The current ad-hoc routing algorithms perform poorly when dealing with spontaneous, transient communication. This traffic pattern generates route discoveries much more frequently than long-term communication and thus causes the reactive component of flat routing algorithms to flood the network. Similarly, the increased number of route discoveries also makes the backbone a bottleneck for the hierarchical algorithms.We designed a backbone routing protocol, called DCDS, that handles both short-term and long-term traffic well. This paper compares it extensively with three other algorithms, two variants of DSR and a model hierarchical algorithm. Our results show that DCDS performs substantially better than these other algorithms for the transient workloads we studied.