default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKa-Lok Hung
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2014
[j4]Ka-Lok Hung, Brahim Bensaou:
Throughput optimization in wireless local networks with inter-AP interference via a joint-association control, rate control, and contention resolution. Ad Hoc Networks 12: 115-129 (2014)- 2011
- [j3]Ka-Lok Hung, Brahim Bensaou:
Throughput analysis and bandwidth allocation for IEEE 802.11 WLAN with hidden terminals. J. Parallel Distributed Comput. 71(9): 1201-1214 (2011) - [j2]Ka-Lok Hung, Brahim Bensaou:
TCP performance optimization in multi-cell WLANs. Perform. Evaluation 68(9): 806-824 (2011) - 2010
- [c14]Kin Wah Edward Lin, Brahim Bensaou, Ka-Lok Hung:
Modeling Aggregate MAC Flow Throughput and Fairness in Non-Saturated IEEE 802.11 Based Wireless Mesh Networks. ICC 2010: 1-5 - [c13]Ka-Lok Hung, Brahim Bensaou:
Distributed rate control and contention resolution in multi-cell IEEE 802.11 wlans with hidden terminals. MobiHoc 2010: 51-60 - [c12]Ka-Lok Hung, Brahim Bensaou, Rui Li:
Cross layer association control for throughput optimization in wireless LANs with inter-AP interference. MSWiM 2010: 210-217
2000 – 2009
- 2009
- [c11]Shan Chen, Brahim Bensaou, Ka-Lok Hung:
Performance of Different TCP Variants in IEEE 802.11 WLAN and the TCP-WOW Algorithm. GLOBECOM 2009: 1-6 - [c10]Ka-Lok Hung, Brahim Bensaou:
Bandwidth Allocation for Bi-Directional End-to-End Paths in a Last-Mile Wireless Mesh Network. GLOBECOM 2009: 1-6 - [c9]Shan Chen, Brahim Bensaou, Ka-Lok Hung:
Promoting self-imposed end-to-end congestion control via a Sword of Damocles approach. ISCC 2009: 600-605 - [c8]Ka-Lok Hung, Brahim Bensaou:
Bandwidth allocation in IEEE 802.11 WLANs in presence of inter-BSSs hidden terminals. ISCC 2009: 667-672 - [c7]Ka-Lok Hung, Brahim Bensaou:
TCP performance optimization in multi-cell wireless local area networks. MSWiM 2009: 338-345 - 2008
- [j1]Junhua Zhu, Ka-Lok Hung, Brahim Bensaou, Farid Naït-Abdesselam:
Rate-lifetime tradeoff for reliable communication in wireless sensor networks. Comput. Networks 52(1): 25-43 (2008) - [c6]Ka-Lok Hung, Brahim Bensaou:
Throughput analysis and rate control for IEEE 802.11 Wireless LAN with hidden terminals. MSWiM 2008: 140-147 - 2007
- [c5]Farid Naït-Abdesselam, Brahim Bensaou, Thomas Soëte, Ka-Lok Hung:
O-MAC: An Organized Energy-Aware MAC Protocol for Wireless Sensor Networks. ICC 2007: 3648-3653 - [c4]Junhua Zhu, Shan Chen, Brahim Bensaou, Ka-Lok Hung:
Tradeoff Between Lifetime and Rate Allocation in Wireless Sensor Networks: A Cross Layer Approach. INFOCOM 2007: 267-275 - 2006
- [c3]Ka-Lok Hung, Brahim Bensaou, Junhua Zhu, Farid Naït-Abdesselam:
Energy-Aware Fair Routing in Wireless Sensor Networks with Maximum Data Collection. ICC 2006: 3438-3443 - [c2]Ka-Lok Hung, Brahim Bensaou, Junhua Zhu, Farid Naït-Abdesselam:
Maximum Data Collection Least-Cost Routing in Energy Constrained Wireless Sensor Networks. LCN 2006: 177-184 - [c1]Junhua Zhu, Ka-Lok Hung, Brahim Bensaou:
Tradeoff between network lifetime and fair rate allocation in wireless sensor networks with multi-path routing. MSWiM 2006: 301-308
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-25 05:38 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:
