default search action
Amjad Saeed Khan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
- [j11]Amjad Saeed Khan
, Gaojie Chen
Trusted UAV Network Coverage Using Blockchain, Machine Learning, and Auction Mechanisms. IEEE Access 8: 118219-118234 (2020) - [j10]Amjad Saeed Khan
Random linear network coding based physical layer security for relay-aided device-to-device communication. IET Commun. 14(7): 1155-1161 (2020) - [j9]Amjad Saeed Khan, Xinruo Zhang
Machine Learning Aided Blockchain Assisted Framework for Wireless Networks. IEEE Netw. 34(5): 262-268 (2020) - [j8]Tianrui Chen
Blockchain Secured Auction-Based User Offloading in Heterogeneous Wireless Networks. IEEE Wirel. Commun. Lett. 9(8): 1141-1145 (2020) - [j7]Galefang Allycan Mapunda
Indoor Visible Light Communication: A Tutorial and Survey. Wirel. Commun. Mob. Comput. 2020: 8881305:1-8881305:46 (2020)
2010 – 2019
- 2019
- [j6]Amjad Saeed Khan
Blockchain-Based Distributive Auction for Relay-Assisted Secure Communications. IEEE Access 7: 95555-95568 (2019) - [j5]Amjad Saeed Khan
Network-Coded NOMA With Antenna Selection for the Support of Two Heterogeneous Groups of Users. IEEE Trans. Wirel. Commun. 18(2): 1332-1345 (2019) - [c2]Ioannis Chatzigeorgiou
On the Decoding Failure Probability of Random Network Coded Cooperation. VTC Spring 2019: 1-5 - 2018
- [b1]Amjad Saeed Khan:
Characterisation and performance analysis of random linear network coding for reliable and secure communication. Lancaster University, UK, 2018 - [j4]Amjad Saeed Khan
Opportunistic Relaying and Random Linear Network Coding for Secure and Reliable Communication. IEEE Trans. Wirel. Commun. 17(1): 223-234 (2018) - 2017
- [j3]Amjad Saeed Khan
Non-Orthogonal Multiple Access Combined With Random Linear Network Coded Cooperation. IEEE Signal Process. Lett. 24(9): 1298-1302 (2017) - [i4]Amjad Saeed Khan, Ioannis Chatzigeorgiou:
Non-Orthogonal Multiple Access combined with Random Linear Network Coded Cooperation. CoRR abs/1706.08487 (2017) - 2016
- [j2]Amjad Saeed Khan
Improved Bounds on the Decoding Failure Probability of Network Coding Over Multi-Source Multi-Relay Networks. IEEE Commun. Lett. 20(10): 2035-2038 (2016) - [i3]Amjad Saeed Khan, Ioannis Chatzigeorgiou:
Improved bounds on the decoding failure probability of network coding over multi-source multi-relay networks. CoRR abs/1607.06143 (2016) - 2015
- [j1]Amjad Saeed Khan
Rethinking the Intercept Probability of Random Linear Network Coding. IEEE Commun. Lett. 19(10): 1762-1765 (2015) - [c1]Amjad Saeed Khan
Performance analysis of random linear network coding in two-source single-relay networks. ICC Workshops 2015: 991-996 - [i2]Amjad Saeed Khan, Ioannis Chatzigeorgiou:
Performance Analysis of Random Linear Network Coding in Two-Source Single-Relay Networks. CoRR abs/1503.05696 (2015) - [i1]Amjad Saeed Khan, Andrea Tassi, Ioannis Chatzigeorgiou:
Rethinking the Intercept Probability of Random Linear Network Coding. CoRR abs/1508.03664 (2015)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 21:02 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: