Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
An efficient routing protocol for wireless networks
Mobile Networks and Applications - Special issue: routing in mobile communications networks
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
Self-stabilization
A scalable location service for geographic ad hoc routing
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Simulation-based performance evaluation of routing protocols for mobile ad hoc networks
Mobile Networks and Applications
Geometric spanner for routing in mobile networks
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
Routing with guaranteed delivery in ad hoc wireless networks
Wireless Networks
Performance of multihop wireless networks: shortest path is not enough
ACM SIGCOMM Computer Communication Review
Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Geometric ad-hoc routing: of theory and practice
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Position-based routing in ad hoc networks
IEEE Communications Magazine
A survey on position-based routing in mobile ad hoc networks
IEEE Network: The Magazine of Global Internetworking
Local solutions for global problems in wireless networks
Journal of Discrete Algorithms
| Hi-index | 0.01 |
Previous face traversal algorithms for ad-hoc routing all assume static graphs during the routing process. In this paper, we present a new face traversal algorithm that does not rely on this assumption. Specifically, we consider routing on edge dynamic graphs, which have stationary nodes and whose edges may change between being active and inactive at any time. The algorithm guarantees message delivery if there exists a sequence of connected spanning subgraphs of the routing graph, each of which is stable for a sufficiently long period of time. Moreover, the algorithm tolerates a wide array of transient faults.