Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDQian Huang 0003
Person information
- affiliation: University of Melbourne, Department of Electrical & Electronic Engineering, Australia
- affiliation (former): City University of Hong Kong, Department of Electronic Engineering
Other persons with the same name
- Qian Huang — disambiguation page
- Qian Huang 0001
![[0000-0001-8325-1910]](https://dblp.dagstuhl.de/img/orcid-mark.12x12.png "0000-0001-8325-1910")
— University of Science and Technology of China, School of Management, Anhui, China - Qian Huang 0002 — Arizona State University, Department of Computer Science and Engineering, Tempe, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2011
[j7]Qian Huang, King-Tim Ko, Villy Bæk Iversen:
A new convolution algorithm for loss probability analysis in multiservice networks. Perform. Evaluation 68(1): 76-87 (2011)- [j6]Qian Huang, Yue-Cai Huang, King-Tim Ko, Villy Bæk Iversen:
Loss Performance Modeling for Hierarchical Heterogeneous Wireless Networks With Speed-Sensitive Call Admission Control. IEEE Trans. Veh. Technol. 60(5): 2209-2223 (2011) - [c6]Yue-Cai Huang, King-Tim Ko, Qian Huang, Villy Bæk Iversen, Moshe Zukerman:
An Efficient Method for Performance Evaluation of Femto-Macro Overlay Systems. ICC 2011: 1-6
2000 – 2009
- 2009
- [c5]Qian Huang, King-Tim Ko, Villy Bæk Iversen:
Performance Modeling for Heterogeneous Wireless Networks with Multiservice Overflow Traffic. GLOBECOM 2009: 1-7 - 2008
- [j5]Qian Huang, King-Tim Ko, Villy Bæk Iversen:
Approximation of loss calculation for hierarchical networks with multiservice overflows. IEEE Trans. Commun. 56(3): 466-473 (2008) - [c4]Qian Huang, King-Tim Ko, Sammy Chan, Villy Bæk Iversen:
Loss performance evaluation in heterogeneous hierarchical networks. Mobility Conference 2008: 16 - 2007
- [j4]Qian Huang, Sammy Chan, Li Ping, King-Tim Ko:
Performance of Hybrid ARQ Using Trellis-Coded Modulation Over Rayleigh Fading Channel. IEEE Trans. Veh. Technol. 56(5): 2784-2790 (2007) - [j3]Qian Huang, Sammy Chan, Li Ping, Moshe Zukerman:
Improving Wireless TCP Throughput by a Novel TCM-Based Hybrid ARQ. IEEE Trans. Wirel. Commun. 6(7): 2476-2485 (2007) - [c3]Qian Huang, Sammy Chan, King-Tim Ko, Li Ping, Peng Wang:
A QoS Architecture for IDMA-Based Multi-Service Wireless Networks. ICC 2007: 5070-5075 - [c2]Qian Huang, King-Tim Ko, Villy Bæk Iversen:
An Approximation Method for Multiservice Loss Performance in Hierarchical Networks. ITC 2007: 901-912 - 2005
- [j2]Qian Huang, Sammy Chan, Li Ping, King-Tim Ko, Moshe Zukerman:
A hybrid ARQ scheme based on CT-TCM codes. IEEE Commun. Lett. 9(7): 664-666 (2005) - 2004
- [j1]Qian Huang, Sammy Chan, King-Tim Ko, Moshe Zukerman:
An enhanced handoff control scheme for multimedia traffic in cellular networks. IEEE Commun. Lett. 8(3): 195-197 (2004) - 2002
- [c1]Qian Huang, Hui-Min Chen, King-Tim Ko, Sammy Chan, King Sun Chan:
Call Admission Control for 3G CDMA Networks with Differentiated QoS. NETWORKING 2002: 636-647
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-07-12 20:13 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:
