In cognitive radio networks, rendezvous is a fundamental operation by which two cognitive users establish a communication link on a commonly-available channel for communications. Some existing rendezvous algorithms can guarantee that rendezvous can be completed within finite time and they generate channel-hopping (CH) sequences based on the whole channel set. However, some channels may not be a...

In this paper we present a dynamical systems framework for analyzing multi-agent rendezvous problems and characterize the dynamical behavior of the collective system. Recently, the problem of rendezvous has been addressed considerably in the graph theoretic framework, which is strongly based on the communication aspects of the problem. The proposed approach is based on set invariance theory and...

In this paper we propose and analyze a randomized algorithm to get rendezvous between neighbours in an anonymous graph. We examine in particular the probability to obtain at least one rendezvous and the expected number of rendezvous. We study the rendezvous number distribution in the cases of chain graphs, rings, and complete graphs. The last part is devoted to the efficiency of the proposed al...

Blind rendezvous paradigm recently expedites the approach to the control channel establishment problem in cognitive radio networks. As a result, many novel asynchronous channel hopping (CH) rendezvous schemes are proposed for realizing blind rendezvous in these years. However, how to integrate these asynchronous CH rendezvous schemes with CSMA/CA MAC has not been researched so far. In this pape...

This paper reports a field evaluation of the mobile phone as a ‘package’ of device and services. The evaluation compares 44 university students’ usage and user experience of communication before and during rendezvous. During a rendezvous, students rated many aspects of the experience of phone use less favourably than before a rendezvous. This impairment of experience is attributed to the cumula...

A rendezvous is a temporal and spatial vicinity of two sensors. In this paper, we investigate rendezvous in the context of mobile sensing systems. We use an air quality dataset obtained with the OpenSense monitoring network to explore rendezvous properties for carbon monoxide, ozone, temperature, and humidity processes. Temporal and spatial locality of a physical process impacts the number of r...

In the rendezvous problem, the goal for two mobile agents is to meet whenever this is possible. In the rendezvous with detection problem, an additional goal for the agents is to detect the impossibility of a rendezvous (e.g., due to symmetrical initial positions of the agents) and stop. We consider the rendezvous problem with and without detection for identical anonymous mobile agents (i.e., ru...

Establishing communications in a dynamic spectrum access (DSA) network requires communicating nodes to “rendezvous” before transmitting their data packets. Frequency hopping (FH) provides an effective method for rendezvousing without relying on a predetermined control channel. Current FH rendezvous designs have two main limitations. First, they do not account for fast primary user (PU) dynamics...

Current multicast routing protocols can be classi ed into three types according to how the multicast tree is established broadcast and prune e g DVMRP PIM DM membership ad vertisement e g MOSPF and rendezvous based e g CBT PIM SM Rendezvous based protocols associate with each logical multicast group address a physical unicast address re ferred to as the core or rendezvous point RP Members rst j...