Quorum systems towards an asynchronous communication in cognitive radio networks (Q355852)

From MaRDI portal
Revision as of 15:49, 6 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Quorum systems towards an asynchronous communication in cognitive radio networks
scientific article

    Statements

    Quorum systems towards an asynchronous communication in cognitive radio networks (English)
    0 references
    0 references
    0 references
    25 July 2013
    0 references
    Summary: This paper reviews quorum systems (QS) from the perspective of cognitive radio networks. Quorum systems were originally developed for and widely used in the scope of operating systems. Recently, quorum systems have been also started to be applied to wireless communications. The objective of this paper is threefold. First, the paper provides survey and guidance on the use of quorum systems. Second, it shows that QS properties provide an interesting alternative towards an asynchronous communication in cognitive radio ad hoc networks (CRANs). Due to properties of quorum systems it is possible to establish CRANs without employing a common control channel (CCC), perfect synchronization, or central controller architecture. QS properties can be efficiently utilized to handle the rendezvous (RDV) problem in CRANs. New RDV protocols must be designed in such a way that there is a guarantee that all nodes meet periodically within reasonable periods of time. Since pseudorandom solutions do not provide this guarantee, systematic approaches are needed such as QSs. Third, we also propose a novel distributed RDV protocol, MtQS-DSrdv, which is based on mirror torus QS and difference set concepts. The proposed protocol guarantees RDVs on all available channels while CR nodes have the same channel set.
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references