default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTae Young Byun
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2011
[c18]Jeong-Sam Kim, Tae Young Byun:
A Performance Evaluation of a Novel Clustering Scheme Considering Local Node Density over WSN. FGIT-FGCN (2) 2011: 320-329- 2010
- [c17]Tae Young Byun:
An Experimental Performance Measurement of Implemented Wireless Access Point for Interworking Wi-Fi and HSDPA Networks. FGIT-GDC/CA 2010: 145-154 - [c16]Tae Young Byun:
ICSW2AN : An Inter-vehicle Communication System Using Mobile Access Point over Wireless Wide Area Networks. SUComS 2010: 355-366 - [c15]Jeongho Son, Tae Young Byun:
MAMODE: A Routing Scheme Using Mixed Address Mode for Wireless Sensor Networks. SUComS 2010: 367-375
2000 – 2009
- 2007
- [c14]Wan-Jik Lee, Seok-Yeol Heo, Tae Young Byun, Young-Ho Sohn, Ki Jun Han:
A Secure Packet Filtering Mechanism for Tunneling over Internet. ICESS 2007: 641-652 - [c13]Tae Young Byun:
An Efficient Energy Consumption Scheme Considering Coverage and Connectivity Problem in Wireless Sensor Networks. SERA 2007: 68-72 - 2006
- [c12]Tae Young Byun, Min-Su Kim, Sung-Ho Hwang, Sung-Eok Jeon:
An Active Node Set Maintenance Scheme for Distributed Sensor Networks. ICCSA (3) 2006: 134-143 - [c11]Sung-Ho Hwang, Min-Su Kim, Tae Young Byun:
A Simple Scheme with Low Energy consumption for Coverage Maintenance in Wireless Sensor Networks. UCS 2006: 467-477 - 2005
- [c10]Min-Su Kim, Tae Young Byun, Jung-Pil Ryu, Sung-Ho Hwang, Ki Jun Han:
An Energy-Efficient Coverage Maintenance Scheme for Distributed Sensor Networks. ICN (1) 2005: 459-466 - 2004
- [c9]Min-Su Kim, Jung-Pil Ryu, Tae Young Byun, Ki Jun Han:
Throughput Analysis of IEEE 802.11e EDCA Protocol. HSNMC 2004: 579-588 - 2003
- [c8]Tae Young Byun, Min-Su Kim, Ki Jun Han:
Performance Evaluation of Scheme Integrating Mobile IP and NHRP over ATM Networks. APPT 2003: 435-445 - [c7]Min-Su Kim, Tae Young Byun, Ki Jun Han:
A Multiple Access Scheme Using Split and Merge Algorithm for Contention/Reservation-Based Wireless MAC Protocols. APPT 2003: 496-505 - [c6]Tae Young Byun, Moo-Ho Cho:
Integration of Mobile IP and NHRP over ATM Networks. APWeb 2003: 465-470 - 2001
- [c5]Tae Young Byun, Ki Jun Han:
A Hybrid Multiple MCS Model for Multicast over ATM Networks. ICOIN 2001: 927-932 - [c4]Tae Young Byun:
SIMMT-II: Implementation of Network Simulator for IP Multicast Using Mutiple MCSs on the ATM Networks. ICPADS 2001: 220-225 - 2000
- [c3]Tae Young Byun, Ki Jun Han:
A Multicasting Scheme using Multiple MCSs for Reducing End-to-end Path Delay in ATM Networks. HICSS 2000
1990 – 1999
- 1999
- [c2]Tae Young Byun, Ki Jun Han:
A Multicasting Scheme Using Multiple MCSs in ATM Networks. IDMS 1999: 93-106 - [c1]Min-Su Kim, Tae Young Byun, Sun-Woo Lee, Sung-Ho Hwang, Ki Jun Han, Sung-Jo Kim:
An Adaptive Parallel Grouping Algorithm for B-WLL MAC Protocol. ISPAN 1999: 376-379
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-08-08 19:17 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:
