About | Contact Us | Register | Login
ProceedingsSeriesJournalsSearchEAI
mca 13(3): e4

Research Article

Quorum system and random based asynchronous rendezvous protocol for cognitive radio ad hoc networks

Download1685 downloads
Cite
BibTeX Plain Text
  • @ARTICLE{10.4108/mca.1.3.e4,
        author={Sylwia Romaszko and Daniel Denkovski and Valentina Pavlovska and Liljana Gavrilovska},
        title={Quorum system and random based asynchronous rendezvous protocol for cognitive radio ad hoc networks},
        journal={EAI Endorsed Transactions on Mobile Communications and Applications},
        volume={1},
        number={3},
        publisher={ICST},
        journal_a={MCA},
        year={2013},
        month={12},
        keywords={},
        doi={10.4108/mca.1.3.e4}
    }
    
  • Sylwia Romaszko
    Daniel Denkovski
    Valentina Pavlovska
    Liljana Gavrilovska
    Year: 2013
    Quorum system and random based asynchronous rendezvous protocol for cognitive radio ad hoc networks
    MCA
    ICST
    DOI: 10.4108/mca.1.3.e4
Sylwia Romaszko1,*, Daniel Denkovski2, Valentina Pavlovska2, Liljana Gavrilovska2
  • 1: Institute for Networked Systems, RWTH Aachen University, Germany
  • 2: Faculty of Electrical Engineering and Information Technologies, Ss. Cyril and Methodius University in Skopje, Macedonia
*Contact email: sar@inets.rwth-aachen.de

Abstract

This paper proposes a rendezvous protocol for cognitive radio ad hoc networks, RAC2E-gQS, which utilizes (1) the asynchronous and randomness properties of the RAC2E protocol, and (2) channel mapping protocol, based on a grid Quorum System (gQS), and taking into account channel heterogeneity and asymmetric channel views. We show that the combination of the RAC2E protocol with the grid-quorum based channel mapping can yield a powerful RAC2E-gQS rendezvous protocol for asynchronous operation in a distributed environment assuring a rapid rendezvous between the cognitive radio nodes having available both symmetric and asymmetric channel views. We also propose an enhancement of the protocol, which uses a torus QS for a slot allocation, dealing with the worst case scenario, a large number of channels with opposite ranking lists.

Received
2013-03-15
Accepted
2013-11-14
Published
2013-12-16
Publisher
ICST
http://dx.doi.org/10.4108/mca.1.3.e4

Copyright © 2013 Sylwia Romaszko et al., licensed to ICST. This is an open access article distributed under the terms of the Creative Commons Attribution license (http://creativecommons.org/licenses/by/3.0/), which permits unlimited use, distribution and reproduction in any medium so long as the original work is properly cited.

EBSCOProQuestDBLPDOAJPortico
EAI Logo

About EAI

  • Who We Are
  • Leadership
  • Research Areas
  • Partners
  • Media Center
  • Cookie Preferences

Community

  • Membership
  • Conference
  • Recognition
  • Sponsor Us

Publish with EAI

  • Publishing
  • Journals
  • Proceedings
  • Books
  • EUDL