The landmark hierarchy: a new hierarchy for routing in very large networks
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
A fast algorithm for generalized network location problems
SAC '93 Proceedings of the 1993 ACM/SIGAPP symposium on Applied computing: states of the art and practice
GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Making link-state routing scale for ad hoc networks
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
Collision Avoidance in Multi-Hop Ad Hoc Networks
MASCOTS '02 Proceedings of the 10th IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
PERCOMW '05 Proceedings of the Third IEEE International Conference on Pervasive Computing and Communications Workshops
Service Discovery in Mobile Ad Hoc Networks: Better at the Network Layer?
ICPPW '05 Proceedings of the 2005 International Conference on Parallel Processing Workshops
Information Processing Letters
Beacon vector routing: scalable point-to-point routing in wireless sensornets
NSDI'05 Proceedings of the 2nd conference on Symposium on Networked Systems Design & Implementation - Volume 2
Hop ID: A Virtual Coordinate-Based Routing for Sparse Mobile Ad Hoc Networks
IEEE Transactions on Mobile Computing
Scalable routing on flat names
Proceedings of the 6th International COnference
S4: small state and small stretch routing protocol for large wireless sensor networks
NSDI'07 Proceedings of the 4th USENIX conference on Networked systems design & implementation
Service discovery for mobile Ad Hoc networks: a survey of issues and techniques
IEEE Communications Surveys & Tutorials
Opportunistic routing using prefix ordering and self-reported social groups
ICNC '13 Proceedings of the 2013 International Conference on Computing, Networking and Communications (ICNC)
| Hi-index | 0.00 |
The Adaptive Publish-subscribe Distance Vector (APDV) protocol is introduced as an example of a new approach to allowing distance-vector routing to scale by integrating it with adaptive publish-subscribe mechanisms. APDV combines establishing routes to well-known controllers using distance-vector signaling with publish-subscribe mechanisms. The latter allow destinations to publish their presence with subsets of controllers, and sources to obtain routes to intended destinations from those same controllers. Controllers are selected dynamically using a fault-tolerant distributed election algorithm to ensure that each non-controller node is covered by at least a given number of controllers within a few hops. Extensive simulation experiments are used to compare APDV with AODV and OLSR, which are representative protocols for on-demand and proactive routing. The results show that APDV achieves significantly better data delivery, attains comparable delays for delivered packets, and incurs orders of magnitude less control overhead than AODV and OLSR, even under heavy data loads.