The Rendezvous process is an essential process for establishing a communication link between two nodes in cognitive radio networks. A number of rendezvous protocols have been developed in the last few years. However, many protocols ignore one of the basic constraints of cognitive radio networks which is the impact of the primary users (PUs) on the performance of the rendezvous process. In this ...

We consider the problem of rendezvous between two robots exploring an unknown environment. That is, how can two autonomous exploring a ents that cannot communicate with one another over long distances meet if they start exploring at different locations inan unknown environment. The intended application s collaborative map exploration. Ours is the first work to formalize th characteristics of th...

We consider the problem of rendezvous between two robots collaborating in learning the layout of an unknown environment. That is, how can two autonomous exploring agents that cannot communicate with one another over long distances meet if they start exploring at di erent locations in an unknown environment. The intended application is collaborative map exploration. Ours is the rst work to forma...

We study rendezvous of two anonymous agents, where each agent knows its own initial position in the environment. Their task is to meet each other as quickly as possible. The time of the rendezvous is measured by the number of synchronous rounds that agents need to use in the worst case in order to meet. In each round, an agent may make a simple move or it may stay motionless. We consider two ty...

A Comprehensive Study of Power-Efficient Rendezvous Schemes for Wireless Sensor Networks by En-Yi Lin Doctor of Philosophy in Department of Electrical Engineering and Computer Sciences University of California, Berkeley Professor Jan Rabaey, Chair Recently, advances in integrated circuit technology enabled the realization of wireless sensor networks. Wireless sensor nodes are characterized by t...

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’of Q: Traditionally, the players are assumed to receive no information during the play of the game. We consider the e¤ect on re...

The rendezvous technique typically involves combined efforts of interventional radiology, endoscopy, and surgery. It can be done solely percutaneously, whereby the interventionalist gains desired access to one point in the body by approaching it from two different access sites. We present the case of a woman who underwent cholecystectomy complicated by a bile duct injury. A percutaneous rendezv...

Publish/Subscribe is often regarded as a promising paradigm for Future Internet architectures. Its information oriented nature and its particular security features have stimulated current research efforts which aim at applying publish/subscribe principles to a clean-slate Internet architecture. One of the core components of publish/subscribe architectures is the rendezvous network. Any security...

We consider the task of rendezvous in networks modeled as undirected graphs. Two mobile agents with different labels, starting at different nodes of an anonymous graph, have to meet. This task has been considered in the literature under two alternative scenarios: weak and strong. Under the weak scenario, agents may meet either at a node or inside an edge. Under the strong scenario, they have to...

In the context of MRTA, I studied how to attain an optimum balance between coverage and sensing. I obtained optimal solutions under various cost schemes [1,2,5] that rely only on local information. Unlike previous results in the area, I consider both tasks that are of effectively different nature, and different realizations of the same task simultaneously. By looking at coordination problems, I...