Rendezvous Issues in AD Hoc Cognitive Radio Networks

Title
Rendezvous Issues in AD Hoc Cognitive Radio Networks
Author(s)
김성원갸넨드라조쉬남승엽
Keywords
CHANNEL-HOPPING ALGORITHM; ACCESS NETWORKS; SCHEME
Issue Date
201411
Publisher
KSII-KOR SOC INTERNET INFORMATION
Citation
KSII TRANSACTIONS ON INTERNET AND INFORMATION SYSTEMS, v.8, no.11, pp.3655 - 3673
Abstract
Rendezvous is a process of two or more cognitive radio nodes gathering on the same channel at the same time for a negotiation to establish data communications. This paper discusses rendezvous issues in cognitive radio networks. It details why rendezvous is an issue in cognitive radio networks and how rendezvous works. It classifies channel access methods, and details sequence-based channel-hopping methods. It surveys existing works on blind rendezvous and compares the proposed algorithms in terms of the maximum time to rendezvous. This paper discusses the properties that an efficient channel-hopping rendezvous algorithm should have and illustrates common issues in the existing rendezvous methods. It also explains open research issues in the rendezvous area.
URI
http://hdl.handle.net/YU.REPOSITORY/30485http://dx.doi.org/10.3837/tiis.2014.11.002
ISSN
1976-7277
Appears in Collections:
공과대학 > 모바일정보통신공학과 > Articles
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML


qrcode

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

BROWSE