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

Jingyi Dai

dblp:183/1697 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
0since 2021 · last 2017
—ORCID · none

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

Computer networks · 3 · 3 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
Network optimization and economics · 41% Wireless networking · 36% Optical networks · 18%

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

TopicWeightPapersLastEvidence papers
Wireless networking
cognitive radio
0.312017
Clustering-Based Spectrum Sharing Strategy for Cognitive Radio Networks · IEEE J. Sel. Areas Commun. 2017
Optical networks › submarine optical systems
power distribution
0.312017
Clustering-Based Spectrum Sharing Strategy for Cognitive Radio Networks · IEEE J. Sel. Areas Commun. 2017
Network optimization and economics
resource allocation
0.312017
Clustering-Based Spectrum Sharing Strategy for Cognitive Radio Networks · IEEE J. Sel. Areas Commun. 2017
Wireless networking › cognitive radio
spectrum sharing
0.312017
Clustering-Based Spectrum Sharing Strategy for Cognitive Radio Networks · IEEE J. Sel. Areas Commun. 2017
Network optimization and economics › resource allocation › OFDMA resource allocation
subchannel allocation
0.312017
Clustering-Based Spectrum Sharing Strategy for Cognitive Radio Networks · IEEE J. Sel. Areas Commun. 2017
Physical-layer communications › modulation › multicarrier modulation
OFDM
0.112017
Clustering-Based Spectrum Sharing Strategy for Cognitive Radio Networks · IEEE J. Sel. Areas Commun. 2017
Network optimization and economics › throughput maximization
sum capacity maximization
0.112017
Clustering-Based Spectrum Sharing Strategy for Cognitive Radio Networks · IEEE J. Sel. Areas Commun. 2017

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

mixed integer programming · 0.3clustering · 0.3
YearPublicationVenuePosition
2017 Joint performance optimization of primary networks and cognitive radio networks
abstract
In this paper, we study the resource allocation issues related to OFDM-based multiuser cognitive radio cellular networks, where both of primary network and secondary network are investigated to make an all-round evaluation of the network performance, including the Quality of Experience (QoE) of the primary users (PUs) and the minimal rate requirement of the secondary users (SUs). Since the general resource allocation optimization task we formulate leads to challenging mixed integer nonlinear programming problems, we first propose a heuristic subchannel allocation method to remove the awkward integer constraints. Then an efficient distribution algorithm, which yields nearly linear computational complexity, is developed to work out the optimal power allocation. Simulation results indicate that our proposed resource allocation scheme works better under different performance metrics as compared to others. Moreover, our proposed distribution algorithms converge stably and quickly.
Jingyi Dai, Shaowei Wang 0001
ICC1
2017 Clustering-Based Spectrum Sharing Strategy for Cognitive Radio Networks
abstract
In this paper, we propose a clustering-based resource allocation (RA) scheme for the multiuser orthogonal frequency division multiplexing (OFDM)-based cognitive radio network, where we aim to maximize the sum capacity of the secondary users (SUs) subject to practical constraints in wireless environment. Our general RA optimization task leads to a challenging mixed integer programming problem that is computationally intractable. We first introduce a simple and efficient clustering method to divide all the SUs into multiple groups based on their mutual interference degrees, where the SUs in different groups can share the same OFDM subchannels to improve spectrum utilization efficiency, while the SUs with heavy mutual interference cluster together in the same group and employ different subchannels to alleviate their mutual interference. Then we develop efficient radio RA algorithms to maximize the sum rate of the SUs in each cluster. A user-oriented subchannel assignment method is presented to remove the awkward integer constraints of the formulated RA problem, followed by a fast power distribution algorithm that can work out optimal solutions with an approximate linear complexity. Simulation results indicate that our proposed RA scheme can improve the throughput of the SUs significantly as compared with other methods. Moreover, our proposed RA algorithms converge stably and quickly.
Jingyi Dai, Shaowei Wang 0001
IEEE J. Sel. Areas Commun.1
2016 QoE-driven resource allocation method for cognitive radio networks
abstract
Since user experience plays a more and more important role in the development of today's communication systems, quality of experience (QoE) becomes a widely used metric, which reflects the subjective experience of end users for wireless services. In this paper, a QoE-driven radio resource allocation scheme is proposed for multi-user orthogonal frequency division multiplexing (OFDM) based cognitive radio (CR) networks. By introducing a QoE-based assessment model, our optimization task is formulated to maximize the overall QoE of the considered system subject to the total transmit power and interference constraints. We first propose a user-oriented subcarrier allocation algorithm. Secondly, for a given subchannel assignment, we propose a fast barrier method to tackle the optimal power allocation problem, where the key is to replace Newton step with complexity O(N3) in the barrier method by a procedure with approximate linear complexity, which is developed by exploiting the structure of the optimization problem. Simulation results validate that our method can always reach a better performance in terms of both single user QoE and the overall QoE with lower complexity.
Jingyi Dai, Shaowei Wang 0001
ICC1