Rendezvous search that asks two persons to find each other among a set of possible locations has regained tremendous research interest lately in the research community of cognitive radio networks (CRNs). In a CRN, there are two types of users: primary spectrum users (PUs) and secondary spectrum users (SUs). SUs are only allowed to share spectrum with PUs provided that they do not cause any seve...

Historically, MPI implementations have had to choose between eager messaging protocols that require buffering and rendezvous protocols that sacrifice overlap and strong independent progress in some scenarios. The typical choice is to use an eager protocol for short messages and switch to a rendezvous protocol for long messages. If overlap and progress are desired, some implementations offer the...

Rendezvous in cognitive radio networks is the process that cognitive users meet and establish a communication link on a commonly available channel, so that consequent information exchange and data communications can be accomplished on the channel. In this study, we propose two ring-walk (RW) rendezvous algorithms to solve the problem of blind rendezvous, i.e., rendezvous without the help of any...

Short description of tthe project motivation, its importance and results. Introduction Introduction and overview of the thesis, explains the the two main themes in the thesis and their relation to each other. With further introduce the models used for mobility and commucation, the related work and my personal contribution to the field. Location aware rendezvous Introduction to the rendezvous pr...

Current multicast routing protocols can be classiied into three types according to how the multicast tree is established: broadcast and prune (e. protocols associate with each logical multicast group address, a physical unicast address, referred to as thècore' or`rendezvous point' (RP). Members rst join a multicast tree rooted at this rendezvous point in order to receive data packets sent to th...

Rendezvous with detection differs from the usual rendezvous problem in that two mobile agents not only accomplish rendezvous whenever this is possible, but can also detect the impossibility of rendezvous (e.g., due to symmetrical initial positions of the agents) in which case they are able to halt. We study the problem of rendezvous with and without detection of two anonymous mobile agents in a...

Rendezvous is a fundamental process in the operation of a Cognitive Radio Network (CRN), through which a secondary user can establish a link to communicate with neighbors on the same frequency band (channel). The licensed spectrum is supposed to be divided into N non-overlapping channels and most previous works assume all users have the same label for the same channel. However, this might be im...

We study the size of memory of mobile agents that permits to solve deterministically the rendezvous problem, i.e., the task of meeting at some node, for two identical agents moving from node to node along the edges of an unknown anonymous connected graph. The rendezvous problem is unsolvable in the class of arbitrary connected graphs, as witnessed by the example of the cycle. Hence we restrict ...

The objective of the rendezvous problem is to construct a method that enables a population of agents to agree on a spatial (and possibly temporal) meeting location. We introduce the buffered gossip algorithm as a general solution to the rendezvous problem in a discrete domain with direct communication between decentralized agents. We compare the performance of the buffered gossip algorithm agai...

We reexamine the modular clock algorithm for distributed blind rendezvous in cognitive radio networks. It proceeds in rounds. Each round consists of scanning twice a block of generated channels. The modular clock algorithm inspired the creation of the jump-stay rendezvous algorithm. It augments the modular clock with a stay-on-onechannel pattern. This enhancement guarantees rendezvous in one ro...