default search action
Lih-feng Tsaur
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
- [c8]Zonglin Guo, Ian G. Harris, Yutong Jiang, Lih-feng Tsaur:
An efficient approach to prevent Battery Exhaustion Attack on BLE-based mesh networks. ICNC 2017: 1-5 - 2016
- [c7]Zonglin Guo, Ian G. Harris, Christopher B. Harris, Yutong Jiang, Lih-feng Tsaur:
A residual battery-aware routing algorithm based on DSR for BLE sensor networks. WTS 2016: 1-6 - 2015
- [c6]Zonglin Guo, Ian G. Harris, Lih-feng Tsaur, Xianbo Chen:
An on-demand scatternet formation and multi-hop routing protocol for BLE-based wireless sensor networks. WCNC 2015: 1590-1595 - 2013
- [c5]Xianbo Chen, Lih-feng Tsaur, Hazem H. Refai, Xiaomin Ma:
Fighting against access collision and hidden node problem in broadcast scheme of wireless ad hoc networks. GLOBECOM Workshops 2013: 258-262
2000 – 2009
- 2009
- [j7]Daniel Chonghwan Lee, Lih-feng Tsaur, Muhammad Naeem:
Symbol-by-symbol CDMA spreading gain adaptation and detection using OVSF sequences. IEEE Trans. Wirel. Commun. 8(9): 4529-4539 (2009) - 2007
- [j6]Daniel Chonghwan Lee, Lih-feng Tsaur:
Gains achieved by symbol-by-symbol rate adaptation on error-constrained data throughput over fading channels. J. Commun. Networks 9(3): 213-218 (2007) - 2006
- [j5]Lih-feng Tsaur, Daniel Chonghwan Lee:
Closed-loop architecture and protocols for rapid dynamic spreading gain adaptation in CDMA networks. IEEE/ACM Trans. Netw. 14(4): 821-834 (2006) - [j4]Daniel Chonghwan Lee, Lih-feng Tsaur:
CCS-FOSSIL and dual-channel system that increases channel capacity per dynamic power range. IEEE Trans. Wirel. Commun. 5(4): 858-868 (2006) - 2004
- [j3]Daniel Chonghwan Lee, Lih-feng Tsaur:
A proof that uncorrelated branch SNRs yield the lowest error rate for MRC receivers operating over Nakagami-m-fading channels. IEEE Trans. Wirel. Commun. 3(5): 1474-1476 (2004) - [c4]Lih-feng Tsaur, Daniel Chonghwan Lee:
Closed-loop architecture and protocols for rapid dynamic spreading gain adaptation in CDMA networks. INFOCOM 2004 - 2003
- [c3]Lih-feng Tsaur, Daniel Chonghwan Lee:
CCS-FOSSIL and Dual-Channel System Increasing Channel Capacity Per Dynamic Power Range: MPSK Case. International Conference on Wireless Networks 2003: 10-17 - 2002
- [j2]Lih-feng Tsaur, Daniel Chonghwan Lee:
Comments on "MRC performance for M-ary modulation in arbitrarily correlated Nakagami fading channels". IEEE Commun. Lett. 6(11): 490 (2002) - 2001
- [j1]Lih-feng Tsaur, Daniel Chonghwan Lee:
Simplifying performance expressions for noncoherent and differentially coherent modulations over generalized fading multiple channels. IEEE Trans. Commun. 49(4): 583-584 (2001) - [c2]Lih-feng Tsaur, Daniel Chonghwan Lee:
Symbol rate adaptation and blind rate detection using FOSSIL (forest for OVSF-sequence-set-inducing lineages). ICC 2001: 1754-1759 - 2000
- [c1]Lih-feng Tsaur, Daniel Chonghwan Lee:
Performance analysis of general coherent MRC receivers in Nakagami-m fading channels. WCNC 2000: 404-408
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 12:49 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint