Saehoon Kang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Saehoon Kang has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
- Ben Lee
School of Electrical Engineering and Computer Science, Oregon State University, Corvallis, USA
2 shared publications - Dongman Lee
Department of Engineering, Information and Communications University
2 shared publications - Younghee Lee
Information and Communications University
2 shared publications Daewoong Kim
1 shared publication- Daewoong Kim
Department of Engineering, Information and Communications University
1 shared publication - Kim Jeong Seon
Network Infra Laboratory, Korea Telecommunication
1 shared publication
Latest Publications
- Open Access
- 9 October 2007
- Published by Wiley in ETRI Journal
- Vol. 29 (5) , 545-558
A Semantic Service Discovery Network for Large-Scale Ubiquitous Computing Environments
- 9 October 2007
- Published by Wiley in ETRI Journal
- Vol. 29 (5) , 545-558
Open AccessA Semantic Service Discovery Network for Large-Scale Ubiquitous Computing Environments
- 1 February 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE) in The 9th International Conference on Advanced Communication Technology
- Vol. 1 (17389445) , 489-494
A Semantic Fragrance Trail based Scalable Service Discovery in MANET
The scale of MANET is expanding with the proliferation of mobile devices, and the number of services in MANET also increases. It raises the importance of scalability and semantic searching capability. However, existing service discovery protocols targeting MANET have been focused on either only scalability or only semantic matching. Some recent researches are concerning the scalable semantic service discovery, but they take into account only one semantic, which is not sufficient to find relevant services in case there are many different service instances in the same service type. In this paper, we propose a new scalable semantic service discovery utilizing rich semantic information based on a scheme, so called semantic fragrance trail (SFT). For advertising services, Service BBF (SBBF) is propagated in a scalable way. For discovery, query messages are routed following the most relevant semantic fragrance (SF) by comparing SSFs from neighbor nodes to the queries using our proposed equation comparing SF similarity. We prove that the proposed equation can compare SSF and semantic fragrance of a query (QSF) to find the most relevant service through evaluation.
- 1 February 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE) in The 9th International Conference on Advanced Communication Technology
- Vol. 1 (17389445) , 489-494
A Semantic Fragrance Trail based Scalable Service Discovery in MANET
The scale of MANET is expanding with the proliferation of mobile devices, and the number of services in MANET also increases. It raises the importance of scalability and semantic searching capability. However, existing service discovery protocols targeting MANET have been focused on either only scalability or only semantic matching. Some recent researches are concerning the scalable semantic service discovery, but they take into account only one semantic, which is not sufficient to find relevant services in case there are many different service instances in the same service type. In this paper, we propose a new scalable semantic service discovery utilizing rich semantic information based on a scheme, so called semantic fragrance trail (SFT). For advertising services, Service BBF (SBBF) is propagated in a scalable way. For discovery, query messages are routed following the most relevant semantic fragrance (SF) by comparing SSFs from neighbor nodes to the queries using our proposed equation comparing SF similarity. We prove that the proposed equation can compare SSF and semantic fragrance of a query (QSF) to find the most relevant service through evaluation.
- Open Access
- 10 April 2006
- Published by Wiley in ETRI Journal
- Vol. 28 (2) , 243-246
Name-Based Autoconfiguration for Mobile Ad hoc Networks
- 10 April 2006
- Published by Wiley in ETRI Journal
- Vol. 28 (2) , 243-246
Open AccessName-Based Autoconfiguration for Mobile Ad hoc Networks