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.

Youping Zhao

dblp:67/8072 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
1since 2021 · last 2022
0000-0001-5833-5725ORCID · corroborated

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

Computer networks · 1 · 1 first-authorSecurity and privacy · 1Applied, interdisciplinary, general and emerging computing · 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
Network optimization and economics · 61% Wireless networking · 39%

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

TopicWeightPapersLastEvidence papers
Wireless networking
cognitive radio
0.112009
Performance Evaluation of Cognitive Radios: Metrics, Utility Functions, and Methodology · Proc. IEEE 2009
Network optimization and economics › game theory
game-theoretic networking
0.112009
Performance Evaluation of Cognitive Radios: Metrics, Utility Functions, and Methodology · Proc. IEEE 2009
Network optimization and economics
utility function
0.112009
Performance Evaluation of Cognitive Radios: Metrics, Utility Functions, and Methodology · Proc. IEEE 2009
Wireless networking › cognitive radio
radio environment map
0.012009
Performance Evaluation of Cognitive Radios: Metrics, Utility Functions, and Methodology · Proc. IEEE 2009

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

scenario-driven testing · 0.1game theory · 0.1
YearPublicationVenuePosition
2022 Smart Contract-based Distributed Spectrum Sensing for Blockchain-enabled Spectrum Sharing
abstract
As massive radio devices being employed in future 6G wireless networks, dynamic spectrum sharing based on cognitive radio and blockchain technologies presents an effective way to maximize spectrum utilization. However, ubiquitous, accurate and timely spectrum sensing is an important prerequisite for dynamic spectrum sharing. How to improve the accuracy and the participation enthusiasm of spectrum sensing are the key research issues. Furthermore, in the practical application of spectrum blockchain, the secure and credible guarantee mechanism of spectrum ledger and the incentive mechanism in spectrum sharing are prominent problems. In this paper, a smart contract-based distributed spectrum sensing scheme is proposed for blockchain-enabled spectrum sharing, which leverages the interaction between spectrum sensing and incentive mechanism for secondary users. In this way, secondary users under favorable channel condition are more likely being selected for spectrum sensing. The performance of mobile sensing is analyzed when performing spectrum sensing based on cycle detection algorithm. On the basis of spectrum sensing, a reputation-based incentive algorithm is employed in the smart contract, recording the spectrum sensing results and rewards so as to enhance the enthusiasm of secondary users and the security of sensing. Simulation shows that more sensing nodes can be employed with the same task budget, while the primary user detection probability can be increased by 19.6% when adopting the proposed scheme with sufficient budget. In addition, when the number of sensing nodes is the same, the proposed incentive method can ensure that the sensing nodes obtain a higher average rewards, which helps to enhance the enthusiasm of secondary users to participate in the spectrum sensing task.
Youping Zhao
VTC Fall2
2010 Utility Function Selection for Streaming Videos with a Cognitive Engine Testbed
Youping Zhao, Shiwen Mao, Jeffrey H. Reed, Yingsong Huang
Mob. Networks Appl.1
2009 Performance Evaluation of Cognitive Radios: Metrics, Utility Functions, and Methodology
abstract
Performance evaluation of cognitive radio (CR) networks is an important problem but has received relatively limited attention from the CR community. Unlike traditional radios, a cognitive radio may change its objectives as radio scenarios vary. Because of the dynamic pairing of objectives and contexts, it is imperative for cognitive radio network designers to have a firm understanding of the interrelationships among goals, performance metrics, utility functions, link/network performance, and operating environments. In this paper, we first overview various performance metrics at the node, network, and application levels. From a game-theoretic viewpoint, we then show that the performance evaluation of cognitive radio networks exhibits the interdependent nature of actions, goals, decisions, observations, and context. We discuss the interrelationships among metrics, utility functions, cognitive engine algorithms, and achieved performance, as well as various testing scenarios. We propose the radio environment map-based scenario-driven testing (REM-SDT) for thorough performance evaluation of cognitive radios. An IEEE 802.22 WRAN cognitive engine testbed is presented to provide further insights into this important problem area.
Youping Zhao, Shiwen Mao, James O. Neel, Jeffrey H. Reed
Proc. IEEE1
2007 Reversible watermarking resistant to cropping attack
abstract
A reversible digital watermarking scheme based on a blockwise difference expansion (DE) method is proposed here. The proposed scheme differs from previous ones in its robustness against cropping and collage attacks. In order to easily detect the correct cropped position for a cropped image, a locating pattern is embedded into the carrier image by a modified patchwork algorithm. Incurred overhead, payload, and authentication information are then collected and embedded into the carrier image by a blockwise DE method. Within the proposed scheme, image ID and block index also serve as parts of the inputs to the hash function. This endows the scheme with capability in resisting collage attacks. The experimental results show that the scheme can achieve a good robustness against cropping attacks as well as collage attacks.
ShaoWei Weng, Youping Zhao, Jeng-Shyang Pan 0001
IET Inf. Secur.2