Learn More
The advice complexity of an online problem describes the additional information both necessary and sufficient for online algorithms to compute solutions of a certain quality. In this model, an oracle inspects the input before it is processed by an online algorithm. Depending on the input string, the oracle prepares an advice bit string that may be accessed(More)
This paper presents an efficient algorithm for detecting and disseminating information in a single-hop multi-channel network: <i>k</i> arbitrary nodes have information they want to share with the entire network. Neither the nodes that have information nor the number <i>k</i> of these nodes are known initially. This communication primitive lies between the(More)
In the disjoint path allocation problem, we consider a path of L + 1 vertices, representing the nodes in a communication network. Requests for an unbounded-time communication between pairs of vertices arrive in an online fashion and some central authority has to decide which of these calls to admit. The constraint is that each edge in the path can serve(More)
Wireless networks often experience a significant amount of churn, i.e. the arrival and departure of nodes, and often it is necessary to keep all nodes informed about all other nodes in the network. In this paper we propose a distributed algorithm for single-hop networks that detects churn, meaning that the nodes observe other nodes joining or leaving the(More)
This article presents an algorithm for detecting and disseminating information in a single-hop multi-channel wireless network: <i>k</i> arbitrary nodes have information they want to share with the entire network. Neither the nodes that have information nor the number <i>k</i> of these nodes are known initially. This communication primitive lies between the(More)
Wireless networks often experience a significant amount of churn, the arrival and departure of nodes. We propose a distributed algorithm that detects churn and is resilient to a worst-case adversary. The nodes of the network are notified about changes quickly, in asymptotically optimal time up to an additive logarithmic overhead.
  • 1