Parallel Link Rendezvous in Ad Hoc Cognitive Radio Networks

Altamimi, Majid; Naik, Kshirasagar; Shen, Xuemin

doi:10.1109/glocom.2010.5683741

Cited by 22 publications

(17 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…• non-quorum, sequence-based algorithms ( [1,4,28]), and quorum based protocols for CRNs ( [3,11,23,21]). …”

Section: Related Workmentioning

confidence: 99%

“…The largest slot always has a size equal to 100 time units. The slot sizes are expressed as slot size = 100 − ssv * ch priority (1) where ch priority ranges from 0 to r − 1, with 0 being the highest priority and r being the number of channels. The Figure 1: Channel usage of a RDV protocol with and without asynchronous rendezvous extension slot size variation (ssv) is a parameter that allows to adjust the amount of influence the extension has on the channel priority.…”

Section: Key Ideamentioning

confidence: 99%

See 1 more Smart Citation

Benefiting from an induced asynchronism in neighborhood discovery in opportunistic cognitive wireless networks

Romaszko

Torfs

Mähönen

et al. 2013

Proceedings of the 11th ACM International Symposium on Mobility Management and Wireless Access

View full text Add to dashboard Cite

In opportunistic Cognitive Radio Networks (CRNs), which are characterized by changing network topology, the time and location varying spectrum availability, there is a need of on-demand searching for a control traffic channel by cognitive radio (CR) users in order to be able to initiate a communication. Therefore, the neighborhood discovery phase, also referred to as a rendezvous (RDV) phase, is challenging due to the dynamics of such networks. Lately, there has been a proliferation of different rendezvous protocols. However, mostly the proposed protocols have had a narrow focus, which is usually a RDV guarantee in a single cycle. At times there is support for a RDV guarantee on every unoccupied channel in a single cycle, however, very rarely asynchronism is exploited as a main factor, or considering channel heterogeneity in terms of quality.In this study we show how to add and benefit from asynchronism in neighborhood discovery protocols that already guarantee a RDV on each free channel. Thanks to induced asynchronism, the ranking of channels is introduced, allowing nodes to stay longer on better quality channels. We analyze the behavior of three different rendezvous protocols in terms of efficiency and time-to-rendezvous with the measured error margins for different asynchronous offsets. We show that an asynchronism significantly improves the efficiency of all the studied protocols. The goal of this paper Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from permissions@acm.org. MobiWacis not to proof that one particular protocol is better than another, we aim only to show that the added asynchronism and induced ranking of channels can improve significantly the performance of different rendezvous protocols.

show abstract

“…• non-quorum, sequence-based algorithms ( [1,4,28]), and quorum based protocols for CRNs ( [3,11,23,21]). …”

Section: Related Workmentioning

confidence: 99%

Section: Key Ideamentioning

confidence: 99%

Benefiting from an induced asynchronism in neighborhood discovery in opportunistic cognitive wireless networks

Romaszko

Torfs

Mähönen

et al. 2013

Proceedings of the 11th ACM International Symposium on Mobility Management and Wireless Access

View full text Add to dashboard Cite

show abstract

“…Através dos planejamentos combinatórios (queé o estudo da organização dos elementos de um conjunto finito em padrões, geralmente subconjuntos ou blocos, de acordo com regras pré-definidas.) podemos modelar o tempo de operação de um rádio em um conjunto de slots com dois subconjuntos distintos de dados e controle como em [4] e em [5] e com a garantia que, saltando em frequência segundo estes planejamentos, sempre ocorrerá o rendezvous. Ainda, se dividirmos o tempo em ciclos, de acordo com um planejamento predefinido, fazendo finalmente com que cada novo ciclo seja uma repetição do anterior, teremos então infinitos ciclos que se repetem periodicamente, contendo slots cujas posições no ciclo obedecem a um escalonamento preestabelecido por um desses planejamentos.…”

Section: A Escalonamentos E Suas Rotaçõesunclassified

Sobre o Desempenho de Escalonadores para Encontros Multicanais em Redes Cognitivas

Sousa¹,

Passos²,

Carrano³

et al. 2019

Anais De XXXVII Simpósio Brasileiro De Telecomunicações E Processamento De Sinais

View full text Add to dashboard Cite

Resumo-O rápido crescimento das tecnologias de rede sem fio e o surgimento de vários novos dispositivos que oferecem ou precisam de interconexão de Internet aumenta o problema do esgotamento do espectro de frequência nos serviços de telecomunicações. Um uso mais eficiente do espectro passa por algumas soluções, incluindo implantações e melhorias das redes de rádios com capacidade cognitiva que poderiam se encontrar em suasáreas ociosas. O encontro em apenas um canal tornaria este canal um pontoúnico de falha. Neste artigo mostramos que nosso mecanismo supera outros trabalhos recentes sobre encontros multicanais, em termos de tempo médio até o encontro e tempo máximo até o encontro com mínima sobrecarga tráfego de controle, para encontro contínuo multicanais em redes cognitivas. Palavras-Chave-Rendezvous, reúso espectral, escassez espectral.

show abstract

“…• QS-based protocols proposed for a multi-channel Medium Access Control (MAC) ( [11], [12] -based on cyclic QS), or sequence-based, but non-QS algorithms for CRNs ( [13], [14], [15]). …”

Section: Related Workmentioning

confidence: 99%

An analysis of asynchronism of a neighborhood discovery protocol for cognitive radio networks

Romaszko

Torfs

Mähönen

et al. 2013

2013 IEEE 24th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)

View full text Add to dashboard Cite

Due to the changing network topology and the time and location varying spectrum availability in Cognitive Radio Networks (CRNs), there is a need of on-demand searching for a control traffic channel by CR users in order to be able to initiate a communication. This neighborhood discovery phase, also referred to as a rendezvous (RDV) phase, is challenging due to the dynamics of CRNs. There are a number of different proposed solutions (pseudo-random or systematic approaches such as quorum systems) to tackle this issue, however, not so many elaborate on the asynchronous character of CRNs, and even less taking into account channel heterogeneity in terms of quality. In this study, on the one hand, we propose a novel quorum system -based neighborhood discovery protocol, which operates on channels having different priorities, on the other hand, we perform an analysis of the effect of asynchronism on the proposed protocol. We analyze the behavior of the protocol in terms of rendezvous opportunities, time-to-rendezvous, and the measured error margins for both, for different asynchronous offsets. We show that an asynchronism can bring noticeable profits over the slot synchronized case.

show abstract

Parallel Link Rendezvous in Ad Hoc Cognitive Radio Networks

Cited by 22 publications

References 17 publications

Benefiting from an induced asynchronism in neighborhood discovery in opportunistic cognitive wireless networks

Benefiting from an induced asynchronism in neighborhood discovery in opportunistic cognitive wireless networks

Sobre o Desempenho de Escalonadores para Encontros Multicanais em Redes Cognitivas

An analysis of asynchronism of a neighborhood discovery protocol for cognitive radio networks

Contact Info

Product

Resources

About