Loop-free routing using diffusing computations
IEEE/ACM Transactions on Networking (TON)
Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Computer networks (3rd ed.)
Unidirectional links prove costly in wireless ad hoc networks
DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
A simple approximation to minimum-delay routing
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Self-stabilization
Stabilization of maximal metric trees
ICDCS '99 Workshop on Self-stabilizing Systems
Self-stabilizing group communication in directed networks
SSS'03 Proceedings of the 6th international conference on Self-stabilizing systems
Probabilistic self-stabilizing vertex coloring in unidirectional anonymous networks
ICDCN'10 Proceedings of the 11th international conference on Distributed computing and networking
Self-stabilization with r-operators revisited
SSS'05 Proceedings of the 7th international conference on Self-Stabilizing Systems
| Hi-index | 0.00 |
Routing messages in a network is often based on the assumption that each link, and so each path, in the network is bidirectional. The two directions of a path are employed in routing messages as follows. One direction is used by the nodes in the path to forward messages to their destination at the end of the path, and the other direction is used by the destination to inform the nodes in the path that this path does lead to the destination. Clearly, routing messages is more difficult in directed networks where links are unidirectional. (Examples of such networks are mobile ad-hoc networks and satellite networks.) In this paper, we present the first stabilizing protocol for routing messages in directed networks. We keep our presentation manageable by dividing it into three (relatively simple) steps. In the first step, we develop an arbitrary directed network where each node broadcasts to every reachable node in the network. In the second step, we enhance the network such that each node broadcasts its shortest distance to the destination. In the third step, we enhance the network further such that each node can determine its best neighbor for reaching the destination.