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

Alexander Hamilton

dblp:278/6526 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2021
—ORCID · none

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

Computer networks · 1 · 1 since 2021

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
Physical-layer communications · 100%

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

TopicWeightPapersLastEvidence papers
Physical-layer communications › physical layer security
covert communication
0.512021
Covert Communications With a Full-Duplex Receiver in Non-Coherent Rayleigh Fading · IEEE Trans. Commun. 2021
Physical-layer communications › physical layer security › covert communication
covert rate
0.512021
Covert Communications With a Full-Duplex Receiver in Non-Coherent Rayleigh Fading · IEEE Trans. Commun. 2021
Physical-layer communications
fading channels
0.512021
Covert Communications With a Full-Duplex Receiver in Non-Coherent Rayleigh Fading · IEEE Trans. Commun. 2021
Physical-layer communications › fading channels
rayleigh fading
0.512021
Covert Communications With a Full-Duplex Receiver in Non-Coherent Rayleigh Fading · IEEE Trans. Commun. 2021
Physical-layer communications
full-duplex communication
0.112021
Covert Communications With a Full-Duplex Receiver in Non-Coherent Rayleigh Fading · IEEE Trans. Commun. 2021

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

artificial noise design · 0.5achievable rate analysis · 0.5
YearPublicationVenuePosition
2021 Covert Communications With a Full-Duplex Receiver in Non-Coherent Rayleigh Fading
abstract
In a majority of research on covert communications, knowledge about channel state information (CSI) of main channel and/or warden channel is assumed to be known or partially known. However, a covert user may not afford to perform channel estimation in practice, and acquiring the warden's CSI is even impossible. In this paper, we investigate covert communications over non-coherent Rayleigh fading channels, in both i.i.d. fast fading and slow fading cases. We observe that the purpose of covert communication in many scenarios is to hide the existence of the sender, not the receiver. Therefore, we allow the receiver to work in full-duplex mode such that it can emit artificial noise (AN) while receiving signals simultaneously. We analyse the achievable covert rates with fixed and varying AN power and show that in both fast and slow fading cases, it is possible to achieve a positive covert rate. For the slow fading case, we further extend the proposed strategy to a multi-user scenario, in which multiple other users share the same spectral resource and cause interference at the warden. Extensive simulations are performed to verify the correctness of our analysis, which provide new insights on the AN design problem in non-coherent channels.
Mengfan Zheng, Alexander Hamilton, Cong Ling 0001
IEEE Trans. Commun.2