http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
The Life Cycle of the Rendezvous Problem of Cognitive Radio Ad Hoc Networks: A Survey
Htike, Zaw,Hong, Choong Seon,Lee, Sungwon Korean Institute of Information Scientists and Eng 2013 Journal of Computing Science and Engineering Vol.7 No.2
In cognitive radio or dynamic spectrum access networks, a rendezvous represents meeting two or more users on a common channel, and negotiating to establish data communication. The rendezvous problem is one of the most challenging tasks in cognitive radio ad hoc networks. Generally, this problem is simplified by using two well-known mechanisms: the first uses a predefined common control channel, while the second employs a channel hopping procedure. Yet, these two mechanisms form a life cycle, when they simplify the rendezvous problem in cognitive radio networks. The main purpose of this paper is to point out how and why this cycle forms.
Cognitive Radio Based Jamming Resilient Multi-channel MAC Protocol for Wireless Network
( Zaw Htike ),( Choong Seon Hong ) 한국정보처리학회 2009 한국정보처리학회 학술대회논문집 Vol.16 No.2
Radio jamming attack is the most effective and easiest Denial-of -Service (DOS) attack in wireless network. In this paper, we proposed a multi-channel MAC protocol to mitigate the jamming attacks by using cognitive radio. The Cognitive Radio (CR) technology supports real-time spectrum sensing and fast channel switching. By using CR technologies, the legitimate nodes can perform periodic spectrum sensing to identify jamming free channels and when the jamming attack is detected, it can switch to un-jammed channel with minimum channel switching delay. In our proposed protocol, these two CR technologies are exploited for thwarting the jamming attacks.
The Life Cycle of the Rendezvous Problem of Cognitive Radio Ad Hoc Networks
Zaw Htike,Choong Seon Hong,Sungwon Lee 한국정보과학회 2013 Journal of Computing Science and Engineering Vol.7 No.2
In cognitive radio or dynamic spectrum access networks, a rendezvous represents meeting two or more users on a common channel, and negotiating to establish data communication. The rendezvous problem is one of the most challenging tasks in cognitive radio ad hoc networks. Generally, this problem is simplified by using two well-known mechanisms: the first uses a predefined common control channel, while the second employs a channel hopping procedure. Yet, these two mechanisms form a life cycle, when they simplify the rendezvous problem in cognitive radio networks. The main purpose of this paper is to point out how and why this cycle forms.
Rendezvous in Cognitive Radio Networks without Common Control Channel
Zaw Htike,Choong Seon Hong 한국정보과학회 2011 한국정보과학회 학술발표논문집 Vol.38 No.1D
In this paper, we propose a rendezvous mechanism for cognitive radio networks. In this mechanism, no prior knowledge of wireless nodes is required and it is totally distributed. Node can simply choose one of two strategies to rendezvous with its neighbors. The main benefit of this mechanism is eliminating the use of common control channel and centralized controller.