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

Xiaonan Yue

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

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

Systems, architecture and hardware · 1 · 1 first-author

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
1 paper
Wireless networking · 75% Cellular and mobile networks · 25%

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

TopicWeightPapersLastEvidence papers
Wireless networking
channel assignment
0.112011
CACAO: Distributed Client-Assisted Channel Assignment Optimization for Uncoordinated WLANs · IEEE Trans. Parallel Distributed Syst. 2011
Wireless networking › channel assignment
distributed channel allocation
0.112011
CACAO: Distributed Client-Assisted Channel Assignment Optimization for Uncoordinated WLANs · IEEE Trans. Parallel Distributed Syst. 2011
Cellular and mobile networks › interference management › interference mitigation
interference minimization
0.112011
CACAO: Distributed Client-Assisted Channel Assignment Optimization for Uncoordinated WLANs · IEEE Trans. Parallel Distributed Syst. 2011
Wireless networking
WLAN
0.112011
CACAO: Distributed Client-Assisted Channel Assignment Optimization for Uncoordinated WLANs · IEEE Trans. Parallel Distributed Syst. 2011

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

simulation · 0.1distributed optimization · 0.1
YearPublicationVenuePosition
2011 CACAO: Distributed Client-Assisted Channel Assignment Optimization for Uncoordinated WLANs
abstract
IEEE 802.11 WLANs are becoming more and more popular in homes and urban areas. As compared to traditional WLAN setups (such as in campuses) where knowledgeable network administrators can make centralized decisions on channel selection, access points (APs) in these networks are often deployed by network nonspecialists in an uncoordinated manner, leading to unplanned topologies, interference, and therefore unsatisfactory throughput performance. We consider in this paper a distributed channel assignment algorithm for uncoordinated WLANs, where APs can self-configure their operating channels to minimize interference with adjacent APs. We first formulate the optimization problem on channel assignment which overcomes some of the weaknesses encountered by uncoordinated WLANs. We show that the problem is NP-hard, and propose an efficient, simple, and distributed algorithm termed CACAO (Client-Assisted Channel Assignment Optimization). In CACAO, the clients feed back traffic information to their APs. This leads to better network condition knowledge and better channel assignment decisions at the APs. We conduct extensive simulation study and comparisons using Network Simulator 2 (NS2). Our results show that CACAO outperforms other traditional and recent schemes in terms of TCP and UDP throughputs with a similar level of fairness. Furthermore, it converges quite fast and reduces cochannel interference significantly.
Xiaonan Yue, Chi-Fai Wong, Shueng-Han Gary Chan
IEEE Trans. Parallel Distributed Syst.1
2010 A Distributed Channel Assignment Algorithm for Uncoordinated WLANs
abstract
IEEE 802.11 WLANs are becoming more and more popular in homes and urban areas. As opposed to traditional WLANs, the access points (APs) in these networks are often deployed by network non-specialists in an uncoordinated manner, leading to unplanned topology, interference and unsatisfactory throughput performance. We consider in this paper a distributed channel assignment algorithm for uncoordinated WLANs, where APs can selfconfigure their operating channels to minimize interference. We propose an efficient, simple and distributed algorithm termed CACAO (client-assisted channel assignment optimization). In CACAO, an AP makes use of the traffic information fed back by its clients to make channel assignment decision. This leads to better knowledge on network environment and better channel assignment decision at the APs. We conduct extensive simulation study and comparisons using network simulator 2 (NS2). Our results show that CACAO out-performs other traditional and recent schemes in terms of throughput with similar level of fairness. Furthermore, it converges quite fast to reduce interference to a low level.
Xiaonan Yue, Chi-Fai Wong, Shueng-Han Gary Chan
CCNC1