skip to main content
Visitante
Meu Espaço
Minha Conta
Sair
Identificação
This feature requires javascript
Tags
Revistas Eletrônicas (eJournals)
Livros Eletrônicos (eBooks)
Bases de Dados
Bibliotecas USP
Ajuda
Ajuda
Idioma:
Inglês
Espanhol
Português
This feature required javascript
This feature requires javascript
Primo Search
Busca Geral
Busca Geral
Acervo Físico
Acervo Físico
Produção Intelectual da USP
Produção USP
Search For:
Clear Search Box
Search in:
Busca Geral
Or select another collection:
Search in:
Busca Geral
Busca Avançada
Busca por Índices
This feature requires javascript
This feature requires javascript
Multicast Rendezvous in Fast-Varying DSA Networks
Abdel-Rahman, Mohammad J. ; Rahbari, Hanif ; Krunz, Marwan
IEEE transactions on mobile computing, 2015-07, Vol.14 (7), p.1449-1462
[Periódico revisado por pares]
IEEE
Texto completo disponível
Citações
Citado por
Exibir Online
Detalhes
Resenhas & Tags
Mais Opções
Nº de Citações
This feature requires javascript
Enviar para
Adicionar ao Meu Espaço
Remover do Meu Espaço
E-mail (máximo 30 registros por vez)
Imprimir
Link permanente
Referência
EasyBib
EndNote
RefWorks
del.icio.us
Exportar RIS
Exportar BibTeX
This feature requires javascript
Título:
Multicast Rendezvous in Fast-Varying DSA Networks
Autor:
Abdel-Rahman, Mohammad J.
;
Rahbari, Hanif
;
Krunz, Marwan
Assuntos:
Algorithm design and analysis
;
Availability
;
Channel sorting
;
dynamic frequency hopping
;
dynamic spectrum access
;
Frequency modulation
;
Heuristic algorithms
;
multicast rendezvous
;
quorum systems
;
Security
;
Unicast
;
Zinc
É parte de:
IEEE transactions on mobile computing, 2015-07, Vol.14 (7), p.1449-1462
Descrição:
Establishing communications between devices in a dynamic spectrum access (DSA) system requires the communicating parties to "rendezvous" before transmitting data packets. Frequency hopping (FH) is an effective rendezvous method that does not rely on a predetermined control channel. Previous FH-based rendezvous designs mainly target unicast rendezvous, and do not intrinsically support multicast rendezvous, where a group of nodes need to rendezvous simultaneously. Furthermore, these designs do not account for fast-primary user (PU) dynamics, leading to long time-to-rendezvous (TTR). In this paper, we exploit the uniform k-arbiter and Chinese Remainder Theorem quorum systems to develop three FH-based multicast rendezvous algorithms, which provide different tradeoffs between rendezvous efficiency (e.g., low TTR) and security (e.g., robustness to node compromise). Our rendezvous algorithms are tailored for asynchronous and spectrum-heterogeneous DSA systems. To account for fast PU dynamics, we develop an algorithm for adapting the proposed FH designs on the fly. This adaptation is done through efficient mechanisms for channel ordering and quorum selection. Our simulations validate the effectiveness of the proposed rendezvous algorithms, their PU detection accuracy, and their robustness to insider attacks.
Editor:
IEEE
Idioma:
Inglês
This feature requires javascript
This feature requires javascript
Voltar para lista de resultados
This feature requires javascript
This feature requires javascript
Buscando em bases de dados remotas. Favor aguardar.
Buscando por
em
scope:(ASSIN_USP),scope:(USP),scope:(PRUSP),scope:(EBOOKS),scope:(PRODUCAO),scope:(EREVISTAS),scope:(DEDALUS),scope:(CR-USP),scope:(PRODINTEL),scope:(BDPI),primo_central_multiple_fe
Mostrar o que foi encontrado até o momento
This feature requires javascript
This feature requires javascript