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

Mohammed Adil Abbas

dblp:204/3075 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 2019
0000-0002-6204-9016ORCID · reported

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

Security and privacy · 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
Physical-layer communications · 54% Cellular and mobile networks · 23% Wireless networking · 23%

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

TopicWeightPapersLastEvidence papers
Cellular and mobile networks
multiuser scheduling
0.412019
Opportunistic Scheduling for Average Secrecy Rate Enhancement in Fading Downlink Channel With Potential Eavesdroppers · IEEE Trans. Inf. Forensics Secur. 2019
Wireless networking
opportunistic scheduling
0.412019
Opportunistic Scheduling for Average Secrecy Rate Enhancement in Fading Downlink Channel With Potential Eavesdroppers · IEEE Trans. Inf. Forensics Secur. 2019
Physical-layer communications
physical layer security
0.412019
Opportunistic Scheduling for Average Secrecy Rate Enhancement in Fading Downlink Channel With Potential Eavesdroppers · IEEE Trans. Inf. Forensics Secur. 2019
Physical-layer communications › physical layer security
secrecy rate maximization
0.412019
Opportunistic Scheduling for Average Secrecy Rate Enhancement in Fading Downlink Channel With Potential Eavesdroppers · IEEE Trans. Inf. Forensics Secur. 2019
Physical-layer communications › physical layer security
artificial noise
0.112019
Opportunistic Scheduling for Average Secrecy Rate Enhancement in Fading Downlink Channel With Potential Eavesdroppers · IEEE Trans. Inf. Forensics Secur. 2019

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

precoding · 0.4power allocation · 0.4asymptotic analysis · 0.4
YearPublicationVenuePosition
2019 Opportunistic Scheduling for Average Secrecy Rate Enhancement in Fading Downlink Channel With Potential Eavesdroppers
abstract
In this paper, we consider user scheduling and power allocation techniques for downlinks where transmitted message must be kept confidential from all other unintended users and the number of users is larger than that of access point (AP) antennas. In order to maximize network secrecy rate with a limited number of antennas, the AP schedules a user who can achieve the largest secrecy rate and exploits multiple antennas for transmitting artificial noise to the unintended users. We derive the closed-form expressions of the optimal power allocation for the artificial noise and the average network secrecy rate through asymptotic analysis. The analysis results provide the insightful information on the behaviors of the user scheduling and the effect of system parameters on the network secrecy rate performance. It is shown that opportunistic scheduling with artificial noise transmission technique is more effective than the conventional precoding techniques for multiple confidential message transmissions in terms of network secrecy rate. Furthermore, we have also discussed a transmission strategy for the worst case scenarios where all unintended users are treated as colluding eavesdroppers. The simulations confirm the validity of the analysis results and provide additional information on the network performance in general cases.
Mohammed Adil Abbas, Hojin Song, Jun-Pyo Hong
IEEE Trans. Inf. Forensics Secur.1