ROP: Near-optimal rendezvous for dynamic spectrum access networks

Chunsheng Xin, Min Song, Liangping Ma, Chien Chung Shen

Research output: Contribution to journalArticlepeer-review

15 Scopus citations

Abstract

This paper presents a rendezvous scheme termed rendezvous with near-optimal performance (ROP) for dynamic spectrum access (DSA) networks. ROP distributes nodes in pairs onto different rendezvous channels without using a control channel and achieves near-optimal throughput, minimum expected time to rendezvous (ETTR), and channel load when the network is fully loaded. For large networks, we further propose an efficient variant of ROP, which is termed fast ROP (FROP), to significantly reduce the convergence time while still maintaining near-optimal performance. Moreover, the simulation results have shown that the convergence time of FROP is not only short but independent of the network size as well; hence, FROP has good scalability. We have developed mathematical models to analyze the performance of ROP and FROP. Both the analytical and the simulation results validate the near-optimal performance of ROP and FROP.

Original languageEnglish
Article number6490080
Pages (from-to)3383-3391
Number of pages9
JournalIEEE Transactions on Vehicular Technology
Volume62
Issue number7
DOIs
StatePublished - 2013

Keywords

  • Cognitive radio networks
  • dynamic spectrum access networks
  • medium-access-control (MAC)
  • rendezvous

Fingerprint

Dive into the research topics of 'ROP: Near-optimal rendezvous for dynamic spectrum access networks'. Together they form a unique fingerprint.

Cite this