Preface; Acknowledgements; Contents; Acronyms; Part I Distributed Rendezvous Theory; 1 Distributed Systems; 1.1 What is Distributed System?; 1.2 Local Area Networks; 1.3 Email; 1.4 Wireless Sensor Networks; 1.5 Cognitive Radio Networks; 1.6 Telephone Networks; References; 2 Distributed Computing; 2.1 What is Distributed Computing?; 2.2 Communication Model; 2.3 Information Incompleteness; 2.4 Timing and Synchrony; References; 3 Rendezvous Theory; 3.1 What is the Rendezvous Problem?; 3.2 Rendezvous in Multichannel Wireless Networks; 3.3 Rendezvous in Cognitive Radio Networks

3.4 Rendezvous in Distributed Systems3.5 Distributed Rendezvous Algorithms; 3.5.1 Distributed Telephone Coordination Algorithms; 3.5.2 Distributed Rendezvous Algorithms for Multichannel Networks; 3.5.3 Distributed Rendezvous Algorithms for Cognitive Radio Networks; References; 4 Rendezvous Categories; 4.1 Symmetric and Asymmetric Algorithms; 4.2 Synchronous and Asynchronous; 4.3 Symmetric and Asymmetric Port Settings; 4.4 Anonymous and Non-anonymous Entities; 4.5 Oblivious and Non-oblivious Port Labeling; 4.6 Rendezvous Categories; References; Part II Blind Rendezvous in Distributed Systems

5 Blind Rendezvous Problem5.1 System Model; 5.2 Metrics; 5.3 Problem Definition; 5.4 Challenges; 5.5 Chapter Summary; References; 6 Asymmetric Blind Rendezvous Algorithms; 6.1 Synchronous and Port-Symmetric Rendezvous; 6.1.1 Smallest Port Accessing Algorithm; 6.1.2 Quorum-Based Channel Hopping; 6.2 Asynchronous and Port-Symmetric Rendezvous; 6.2.1 Asynchronous Quorum-Based Channel Hopping; 6.2.2 Sequential Accessing Algorithm; 6.3 Synchronous and Port-Asymmetric Rendezvous; 6.3.1 Modified Sequential Accessing Algorithm; 6.4 Asynchronous and Port-Asymmetric Rendezvous

6.4.1 Sequential Access and Temporary Wait for Rendezvous6.5 Chapter Summary; References; 7 Synchronous Blind Rendezvous Algorithms; 7.1 Expanded Sequential Accessing Algorithm; 7.2 Chapter Summary; 8 Asynchronous Blind Rendezvous Algorithms for Anonymous Users ; 8.1 Generated Orthogonal Sequence (GOS); 8.2 Deterministic Rendezvous Sequence (DRSEQ); 8.3 Channel Rendezvous Sequence (CRSEQ) Algorithm; 8.4 Jump Stay Algorithm; 8.5 Disjoint Relaxed Different Set (DRDS) Based Rendezvous Algorithm; 8.5.1 Global Sequence (GS); 8.5.2 Disjoint Relaxed Difference Set (DRDS)

8.5.3 Equivalence of DRDS and Good GS8.5.4 DRDS Construction; 8.5.5 DRDS Based Rendezvous Algorithm; 8.5.6 Improved DRDS Based Rendezvous Algorithm; 8.6 Lower Bound for GS Based Rendezvous Algorithms; 8.7 Chapter Summary; References; 9 Local Sequence (LS) Based Rendezvous Algorithms; 9.1 Local Sequence (LS); 9.2 Ring Walk Algorithm; 9.3 Alternate Hop-and-Wait (AHW) Algorithm; 9.4 A Simple LS Based Rendezvous Algorithm; 9.5 A Modified LS Based Rendezvous Algorithm; 9.6 Chapter Summary; References; 10 Blind Rendezvous for Multi-users Multihop System; 10.1 Algorithm Description