default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDShahab Farazi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2020
[j4]Shahab Farazi
, Andrew G. Klein, D. Richard Brown:
Average Age of Information in Update Systems With Active Sources and Packet Delivery Errors. IEEE Wirel. Commun. Lett. 9(8): 1164-1168 (2020)- 2019
- [j3]Shahab Farazi, Andrew G. Klein, D. Richard Brown III:
Fundamental bounds on the age of information in multi-hop global status update networks. J. Commun. Networks 21(3): 268-279 (2019) - 2017
- [j2]Andrew G. Klein, Shahab Farazi, Wenmin He, D. Richard Brown:
Staleness Bounds and Efficient Protocols for Dissemination of Global Channel State Information. IEEE Trans. Wirel. Commun. 16(9): 5732-5746 (2017) - 2014
- [j1]Shahab Farazi, Mohammad Hossein Kahaei:
Optimal Power Allocation for MIMO Fully Cooperative Relay Broadcast Channels. IEEE Commun. Lett. 18(1): 10-13 (2014)
Conference and Workshop Papers
- 2019
- [c11]Shahab Farazi, Andrew G. Klein, D. Richard Brown:
Average Age of Information in Multi-Source Self-Preemptive Status Update Systems with Packet Delivery Errors. ACSSC 2019: 396-400 - [c10]Shahab Farazi, Andrew G. Klein, D. Richard Brown:
Age of Information with Unreliable Transmissions in Multi-Source Multi-Hop Status Update Systems. ACSSC 2019: 2017-2021 - [c9]Shahab Farazi, Andrew G. Klein, D. Richard Brown:
Fundamental Bounds on the Age of Information in General Multi-Hop Interference Networks. INFOCOM Workshops 2019: 96-101 - 2018
- [c8]Shahab Farazi, Andrew G. Klein, D. Richard Brown:
Average age of information for status update systems with an energy harvesting server. INFOCOM Workshops 2018: 112-117 - [c7]Shahab Farazi, Andrew G. Klein, D. Richard Brown:
Age of Information in Energy Harvesting Status Update Systems: When to Preempt in Service? ISIT 2018: 2436-2440 - [c6]Shahab Farazi, Andrew G. Klein, John A. McNeill, D. Richard Brown:
On the Age of Information in Multi-Source Multi-Hop Wireless Status Update Networks. SPAWC 2018: 1-5 - 2017
- [c5]Shahab Farazi, Andrew G. Klein, D. Richard Brown:
Bounds on the Age of Information for Global Channel State Dissemination in Fully-Connected Networks. ICCCN 2017: 1-7 - 2016
- [c4]Shahab Farazi, D. Richard Brown III, Andrew G. Klein:
On global channel state estimation and dissemination in ring networks. ACSSC 2016: 1122-1127 - [c3]Shahab Farazi, Kim Chinkidjakarn, D. Richard Brown:
Simultaneous distributed beamforming and nullforming with adaptive positioning. GlobalSIP 2016: 129-132 - [c2]Shahab Farazi, Andrew G. Klein, D. Richard Brown:
On the average staleness of global channel state information in wireless networks with random transmit node selection. ICASSP 2016: 3621-3625 - 2015
- [c1]Shahab Farazi, D. Richard Brown III, Andrew G. Klein:
Power allocation for three-phase two-way relay networks with simultaneous wireless information and power transfer. ACSSC 2015: 812-816
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-04-24 22:48 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:
