Rendezvous Algorithms for Cognitive Radio Networks, M.Sc. Thesis Sharif University of Technology ; Pakravan, Mohammadreza (Supervisor)
Abstract
In the present thesis we will design and study some rendezvous algorithms for cognitive radio networks. In cognitive radio networks, secondary users try to access the spectrum of primary users in an opportunistic manner. Each secondary user constructs a channel list of accessible resources by channel sensing. These resources are not necessarily the same for different users; therefore, in order to make a connection in absence of a fixed control channel, different secondary users should find each other properly and quickly after entering the network. This is known as the blind rendezvous problem. We will develop and examine a new sequence based algorithm for blind rendezvous. Moreover, some...
Cataloging briefRendezvous Algorithms for Cognitive Radio Networks, M.Sc. Thesis Sharif University of Technology ; Pakravan, Mohammadreza (Supervisor)
Abstract
In the present thesis we will design and study some rendezvous algorithms for cognitive radio networks. In cognitive radio networks, secondary users try to access the spectrum of primary users in an opportunistic manner. Each secondary user constructs a channel list of accessible resources by channel sensing. These resources are not necessarily the same for different users; therefore, in order to make a connection in absence of a fixed control channel, different secondary users should find each other properly and quickly after entering the network. This is known as the blind rendezvous problem. We will develop and examine a new sequence based algorithm for blind rendezvous. Moreover, some...
Find in contentBookmark
|
|