• Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
The Modular Clock Algorithm for Blind Rendezvous

The Modular Clock Algorithm for Blind Rendezvous

Paperback

General Education

ISBN10: 1288302576
ISBN13: 9781288302574
Publisher: Biblioscholar
Published: Nov 15 2012
Pages: 106
Weight: 0.45
Height: 0.22 Width: 7.44 Depth: 9.69
Language: English
A new algorithm, the modular clock algorithm, is developed and analyzed as a solution for the simple rendezvous environment model, coupled with a modified version for environment models with less information. This thesis examines the rendezvous problem as it exists in a Dynamic Spectrum Access cognitive network. Specifically, it addresses the problem of rendezvous in an infrastructureless environment. The thesis includes a taxonomy of commonly used environment models, and analysis of previous efforts to solve the rendezvous problem. Mathematical models and solutions used in applied statistics are analyzed for use in cognitive networking. A symmetric rendezvous pursuit-evasion game is developed and analyzed. Analysis and simulation results show that the modular clock algorithm performs better than random under a simple rendezvous environment model, while a modified version of the modular clock algorithm performs better than random in more difficult environment models.

Also in

General Education