The rendezvous problem in graphs has been extensively studied in the literature, mainly using a randomized approach. Two mobile agents have to meet at some node of a connected graph. We study deterministic algorithms for this problem, assuming that agents have distinct identifiers and are located in nodes of an unknown anonymous connected graph. Startup times of the agents are arbitrarily decid...

Rendezvous and Multi-channel Hidden Terminal problems are the two well-known challenges in developing a multi-channel MAC protocol. In literature, the Control Period Based (CPB) approach is proposed to cope with the rendezvous problem. Each channel is partitioned into several beacon intervals and each of which consists of ATIM window and data window. All hosts are asked to stay in every ATIM wi...

The symmetric rendezvous problem on a network Q asks how two players, forced to use the same mixed strategy, can minimize their expected meeting time, starting from a known initial distribution on the nodes of Q. This minimum is called the (symmetric) ‘rendezvous value’ofQ. Traditionally, the players are assumed to receive no information while playing the game. We consider the effect on rendezv...

We consider the rendezvous problem for identical mobile agents (i.e., running the same deterministic algorithm) with tokens in a synchronous torus with a sense of direction and show that there is a striking computational difference between one and more tokens. More specifically, we show that 1) two agents with a constant number of unmovable tokens or with one movable token each cannot rendezvou...

—We present ETCH, efficient channel hopping based MAC-layer protocols for communication rendezvous in Dynamic Spectrum Access (DSA) networks. Compared to the existing solutions, ETCH fully utilizes spectrum diversity in communication rendezvous by allowing all the rendezvous channels to be utilized at the same time. We propose two protocols, SYNC-ETCH, which is a synchronous protocol assuming D...

The problem that has been faced in WSNs is the increased latency in data collection due to the speed at which the data have been collected. So in order to collect the data efficiently a rendezvous point (RP) is used. Here data are collected by the base station while visiting the rendezvous points. The rendezvous points collect the data which are being buffered from various source nodes which ag...

How can a group of distributed secondary users make rendezvous on one among a set of available channels, whose exact content is a priori unknown to the participants? Let us assume that secondary users scan the set of channels, attempting to make rendezvous with each other. Each user has several radios that are concurrently used to achieve rendezvous. We propose two rendezvous algorithms for use...

BACKGROUND Esophageal dilation by rendezvous is a useful technique for the treatment of complicated esophageal strictures. METHODS AND RESULTS We present a case of a 74-year-old man with chronic dysphagia caused by a complete cervical esophageal stricture that developed after external beam radiotherapy for treatment of papillary thyroid carcinoma. During attempted dilation using the rendezvou...

We consider the problem of how two heterogeneous robots can arrange to meet in an unknown environment from unknown starting locations: that is, the problem of arranging a robot rendezvous. We are interested, in particular, in allowing two robots to rendezvous so that they can collaboratively explore an unknown environment. Specifically, we address the problem of how a pair of exploring agents t...