default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTaek Jin Kwon
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2012
[j5]Jungwoo Ryoo, Yoohwan Kim, Yoonsuck Choe, Bongjun Ko, Taek Jin Kwon:
Preface to KOCSEA Special Issue. J. Comput. Sci. Eng. 6(4): 279-279 (2012)- [j4]Angela L. Chiu, Gagan L. Choudhury, George Clapp, Robert D. Doverspike, Mark D. Feuer, Joel W. Gannett, Janet Jackel, Gi Tae Kim, John G. Klincewicz
, Taek Jin Kwon, Guangzhi Li, Peter D. Magill, Jane M. Simmons, Ronald A. Skoog, John Strand, Ann Von Lehmen, Brian J. Wilson, Sheryl L. Woodward, Dahai Xu:
Architectures and Protocols for Capacity Efficient, Highly Dynamic and Highly Resilient Core Networks [Invited]. JOCN 4(1): 1-14 (2012) - 2011
- [j3]Wai Chen, Ratul K. Guha, Taek Jin Kwon, John Lee, Yuan-Ying Hsu:
A survey and challenges in routing and data dissemination in vehicular ad hoc networks. Wirel. Commun. Mob. Comput. 11(7): 787-795 (2011)
2000 – 2009
- 2008
- [c9]Wai Chen, Ratul K. Guha, Taek Jin Kwon, John Lee, Irene Y. Hsu:
A survey and challenges in routing and data dissemination in vehicular ad-hoc networks. ICVES 2008: 328-333 - [c8]Driss El Ghanami, Taek Jin Kwon, Abdel Hafid:
GRIDS: Geographically Repulsive Insomnious Distributed Sensors - An Efficient Node Selection Mechanism Using Passive Clustering. WiMob 2008: 241-246 - 2007
- [c7]Isil Sebüktekin, Brandon Yoon, Byungsuk Kim, Ashok Ranade, Taek Jin Kwon, Marcus Pang, William Stephens, Michael Bereschinsky, Charles Graff, Larry Muzzelo, Michael Acriche, Aristides Staikos, Ben Foresta, Dennis Chen:
DiffServ QoS and OLSR MANET Outdoor Demonstration. ISADS 2007: 394-402 - 2003
- [j2]Taek Jin Kwon, Mario Gerla, Vijay K. Varma, Melbourne Barton, T. Russell Hsing:
Efficient flooding with passive clustering-an overhead-free selective forward mechanism for ad hoc/sensor networks. Proc. IEEE 91(8): 1210-1220 (2003) - [c6]Yunjung Yi, Mario Gerla, Taek Jin Kwon:
Efficient flooding in ad hoc networks: a comparative performance study. ICC 2003: 1059-1063 - 2002
- [j1]Taek Jin Kwon, Mario Gerla:
Efficient flooding with Passive Clustering (PC) in ad hoc networks. Comput. Commun. Rev. 32(1): 44-56 (2002) - [c5]Xiaoyan Hong, Mario Gerla, Yunjung Yi, Kaixin Xu, Taek Jin Kwon:
Scalable ad hoc routing in large, dense wireless networks using clustering and landmarks. ICC 2002: 3179-3185 - [c4]Yunjung Yi, Mario Gerla, Taek Jin Kwon:
The selective intermediate nodes scheme for ad hoc on-demand routing protocols. ICC 2002: 3191-3196 - [c3]Yunjung Yi, Taek Jin Kwon, Mario Gerla:
A load aWare routing (LWR) based on local information. PIMRC 2002: G65-G69 - 2001
- [c2]Xiaoyan Hong, Taek Jin Kwon, Mario Gerla, Daniel Lihui Gu, Guangyu Pei:
A Mobility Framework for Ad Hoc Wireless Networks. Mobile Data Management 2001: 185-196 - 2000
- [c1]Mario Gerla, Taek Jin Kwon, Guangyu Pei:
On-demand routing in large ad hoc wireless networks with passive clustering. WCNC 2000: 100-105
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 23:15 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:
