default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGhafour Ahani
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j6]Ghafour Ahani
, Di Yuan:
Optimal Content Caching and Recommendation With Age of Information. IEEE Trans. Mob. Comput. 23(1): 689-704 (2024)- 2022
- [j5]Ghafour Ahani, Di Yuan, Sumei Sun:
Optimal Scheduling of Age-Centric Caching: Tractability and Computation. IEEE Trans. Mob. Comput. 21(8): 2939-2954 (2022) - 2021
- [b1]Ghafour Ahani:
Optimal Scheduling for Timely Information in Communication Systems. Uppsala University, Sweden, 2021 - [j4]Ghafour Ahani, Di Yuan, Yixin Zhao:
Age-Optimal UAV Scheduling for Data Collection With Battery Recharging. IEEE Commun. Lett. 25(4): 1254-1258 (2021) - [i9]Ghafour Ahani, Di Yuan:
Optimal Content Caching and Recommendation with Age of Information. CoRR abs/2111.11608 (2021) - 2020
- [j3]Ghafour Ahani, Pawel Wiatr, Di Yuan:
Routing and scheduling of network flows with deadlines and discrete capacity allocation. Networks 76(1): 54-74 (2020) - [j2]Ghafour Ahani, Di Yuan:
Optimal Scheduling of Content Caching Subject to Deadline. IEEE Open J. Commun. Soc. 1: 293-307 (2020) - [c5]Ghafour Ahani, Di Yuan:
Accounting for Information Freshness in Scheduling of Content Caching. ICC 2020: 1-6 - [i8]Ghafour Ahani, Di Yuan:
Optimal Scheduling of Content Caching Subject to Deadline. CoRR abs/2001.00259 (2020) - [i7]Ghafour Ahani, Di Yuan, Yixin Zhao:
Age-Optimal UAV Scheduling for Data Collectionwith Battery Recharging. CoRR abs/2005.00252 (2020) - [i6]Ghafour Ahani, Di Yuan:
Optimal Scheduling of Age-centric Caching: Tractability and Computation. CoRR abs/2005.00445 (2020)
2010 – 2019
- 2019
- [c4]Ghafour Ahani, Di Yuan:
BS-Assisted Task Offloading for D2D Networks with Presence of User Mobility. VTC Spring 2019: 1-5 - [i5]Ghafour Ahani, Di Yuan:
BS-assisted Task Offloading for D2D Networks with Presence of User Mobility. CoRR abs/1901.02745 (2019) - [i4]Ghafour Ahani, Di Yuan:
On Optimal Proactive and Retention-Aware Caching with User Mobility. CoRR abs/1901.02750 (2019) - [i3]Ghafour Ahani, Pawel Wiatr, Di Yuan:
Routing and Scheduling of Network Flows with Deadlines and Discrete Capacity Allocation. CoRR abs/1905.04719 (2019) - [i2]Ghafour Ahani, Di Yuan:
Accounting for Information Freshness in Scheduling of Content Caching. CoRR abs/1910.13194 (2019) - 2018
- [j1]Tao Deng, Ghafour Ahani, Pingzhi Fan, Di Yuan:
Cost-Optimal Caching for D2D Networks With User Mobility: Modeling, Analysis, and Computational Approaches. IEEE Trans. Wirel. Commun. 17(5): 3082-3094 (2018) - [c3]Ghafour Ahani, Di Yuan:
On Optimal Proactive and Retention-Aware Caching with User Mobility. VTC Fall 2018: 1-5 - 2017
- [c2]Tao Deng, Ghafour Ahani, Pingzhi Fan, Di Yuan:
Cost-Optimal Caching for D2D Networks with Presence of User Mobility. GLOBECOM 2017: 1-6 - [i1]Tao Deng, Ghafour Ahani, Pingzhi Fan, Di Yuan:
Cost-optimal caching for D2D networks with user mobility: Modeling, analysis, and computational approaches. CoRR abs/1705.10728 (2017) - 2016
- [c1]Ghafour Ahani, Di Yuan, Wei Ding:
On SC-FDMA resource allocation with power control. CAMAD 2016: 112-116
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 2025-01-09 13:20 CET 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:
