Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Hsiao-Yun Wu

dblp:133/3877 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2014
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 2

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
2 papers
Wireless networking · 100%

Topics — the 7 heaviest of 7, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Wireless networking › cognitive radio
channel hopping
0.422014
A Fast Blind Rendezvous Method byAlternate Hop-and-Wait Channel Hoppingin Cognitive Radio Networks · IEEE Trans. Mob. Comput. 2014
Alternate hop-and-wait channel rendezvous method for cognitive radio networks · INFOCOM 2013
Wireless networking
cognitive radio
0.422014
A Fast Blind Rendezvous Method byAlternate Hop-and-Wait Channel Hoppingin Cognitive Radio Networks · IEEE Trans. Mob. Comput. 2014
Alternate hop-and-wait channel rendezvous method for cognitive radio networks · INFOCOM 2013
Wireless networking › cognitive radio › rendezvous
blind rendezvous
0.222014
A Fast Blind Rendezvous Method byAlternate Hop-and-Wait Channel Hoppingin Cognitive Radio Networks · IEEE Trans. Mob. Comput. 2014
Alternate hop-and-wait channel rendezvous method for cognitive radio networks · INFOCOM 2013
Wireless networking › cognitive radio › rendezvous
channel rendezvous
0.212013
Alternate hop-and-wait channel rendezvous method for cognitive radio networks · INFOCOM 2013
Wireless networking
control channel
0.112014
A Fast Blind Rendezvous Method byAlternate Hop-and-Wait Channel Hoppingin Cognitive Radio Networks · IEEE Trans. Mob. Comput. 2014
Wireless networking
medium access control
0.112014
A Fast Blind Rendezvous Method byAlternate Hop-and-Wait Channel Hoppingin Cognitive Radio Networks · IEEE Trans. Mob. Comput. 2014
Wireless networking › cognitive radio
spectrum access
0.012013
Alternate hop-and-wait channel rendezvous method for cognitive radio networks · INFOCOM 2013

Methods — techniques the papers use, named apart from their topics

simulation · 0.4theoretical analysis · 0.2
YearPublicationVenuePosition
2014 A Fast Blind Rendezvous Method byAlternate Hop-and-Wait Channel Hoppingin Cognitive Radio Networks
abstract
Rendezvous is an essential operation for secondary users communicating in a cognitive radio network (CRN). Because it is infeasible to employ a common control channel in a licensed spectrum, blind rendezvous is an expected solution and generally estimated by the criteria of asynchronous rendezvous support, guaranteed rendezvous, asymmetric model support, heterogeneity of roles, and short time-to-rendezvous (TTR). Most existing blind rendezvous methods fail to fully satisfy these criteria or have considerable TTR significantly increased with the number of channels. This paper presents a new alternate hop-and-wait channel hopping method, called E-AHW, which can support fast blind rendezvous. By assigning each secondary user a unique alternate channel hopping sequence composed of HOP/WAIT-mode subsequences, all blind rendezvous criteria can be satisfied with shorter TTR. According to simulation results, the performance of E-AHW is better than existing methods. Moreover, using E-AHW, the average value and standard deviation of time intervals between two rendezvous are also less than other methods. Thus, E-AHW can provide an efficient and stable communication environment.
I-Hsun Chuang, Hsiao-Yun Wu, Yau-Hwang Kuo
IEEE Trans. Mob. Comput.2
2013 Alternate hop-and-wait channel rendezvous method for cognitive radio networks
abstract
Cognitive Radio (CR) is an emerging technology developed to improve the utilization of licensed spectra, and a promising solution to alleviate the spectrum shortage problem. In cognitive radio networks (CRNs), if users want to establish communication links with neighbors, they need to rendezvous on an available channel. However, it is infeasible to employ a common control channel (CCC) in a licensed spectrum, because the CCC will be congested by primary users and degrade the performance of CRNs by the single point of failure problem. Therefore, the channel hopping (CH) based methods without CCC support are usually adopted to establish rendezvous in CRNs. This kind of rendezvous is called blind rendezvous and generally estimated by the following criteria: 1) asynchronous rendezvous support, 2) guaranteed rendezvous, 3) asymmetric model support, 4) multi-user/multi-hop scenario support, and 5) short time-to-rendezvous (TTR). Most existing blind rendezvous methods fail to fully satisfy these criteria or have considerable TTR which is significantly increased with the number of available channels. In this paper, the alternate hop-and-wait CH method is proposed to solve these problems. Furthermore, each user has a unique alternating sequence of HOP and WAIT modes. The theoretical analysis results have confirmed that the proposed method satisfies all evaluation criteria mentioned above and provides shorter TTR. According to simulation results, the performance of the proposed method even is two times better than Jump-Stay algorithm (JS), which is the most efficient blind rendezvous method as we know, under the asymmetric model which is much critical for CRNs.
I-Hsun Chuang, Hsiao-Yun Wu, Kuan-Rong Lee, Yau-Hwang Kuo
INFOCOM2