Self-stabilizing algorithms for synchronous unidirectional rings
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Self-stabilizing unidirectional network algorithms by power-supply
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Routing performance in the presence of unidirectional links in multihop wireless networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
The wake up and report problem is time-equivalent to the firing squad synchronization problem
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Information Processing Letters
Traversing Directed Eulerian Mazes
WG '00 Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science
Irredundant Algorithms for Traversing Directed Graphs: The Deterministic Case
Programming and Computing Software
Traversal of an Unknown Directed Graph by a Finite Robot
Programming and Computing Software
Backtracking Problem in the Traversal of an Unknown Directed Graph by a Finite Robot
Programming and Computing Software
Handling asymmetry in power heterogeneous ad hoc networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
On exploiting asymmetric wireless links via one-way estimation
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
Map construction of unknown graphs by multiple agents
Theoretical Computer Science
Note: Setting port numbers for fast graph exploration
Theoretical Computer Science
On link asymmetry and one-way estimation in wireless sensor networks
ACM Transactions on Sensor Networks (TOSN)
Fault-tolerant simulation of message-passing algorithms by mobile agents
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
Euler tour lock-in problem in the rotor-router model: i choose pointers and you choose port numbers
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Setting port numbers for fast graph exploration
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Improved approximation for orienting mixed graphs
SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity
Hi-index | 0.00 |
This paper addresses the question of distributively computing over a strongly connected unidirectional data communication network. In unidirectional networks the existence of a communication link from one node to another does not imply the existence of a link in the opposite direction. The strong connectivity means that from every node there is a directed path to any other node. The authors assume an arbitrary topology network in which the strong connectivity is the only restriction. Four models are considered, synchronous and asynchronous, and for each node space availability, which grows as either $O(1)$ bits or $O(\log n)$ bits per incident link, where $n$ is the total number of nodes in the network, is considered. First algorithms for two basic problems in distributed computing in data communication networks, traversal, and election, are provided. Each of these basic protocols produces two directed spanning trees rooted at a distinguished node in the network, one called in-tree, leading to the root, and the other, out-tree, leading from the root. Given these trees, the authors efficiently transform bidirectional algorithms to run on unidirectional networks, and in particular solve other problems such as the broadcast and echo [E. J. Chang}, Decentralized Algorithms in Distributed Systems, Ph. D. thesis, University of Toronto, October 1979] in a way that is more efficient ($O(n^2)$ messages) than direct transformation (which yields $O(nm)$ messages algorithm). The communication cost of the traversal and election algorithms is $O(nm+ n^2 \log n)$ bits ($O(nm)$ messages and time), where $m$ is the total number of links in the network. The traversal algorithms for unidirectional networks of finite automata achieve the same cost ($O(nm+n^2 \log n)$ bits) in the asynchronous case, while in the synchronous case the communication cost of the algorithm is $O(mn)$ bits.