9 October 2007 in ETRI Journal
This paper presents an efficient semantic service discovery scheme called UbiSearch for a large-scale ubiquitous computing environment. A semantic service discovery network in the semantic vector space is proposed where services that are semantically close to each other are mapped to nearby positions so that the similar services are registered in a cluster of resolvers. Using this mapping technique, the search space for a query is efficiently confined within a minimized cluster region while maintaining high accuracy in comparison to the centralized scheme. The proposed semantic service discovery network provides a number of novel features to evenly distribute service indexes to the resolvers and reduce the number of resolvers to visit. Our simulation study shows that UbiSearch provides good semantic searchability as compared to the centralized indexing system. At the same time, it supports scalable semantic queries with low communication overhead, balanced load distribution among resolvers for service registration and query processing, and personalized semantic matching.
10 April 2006 in ETRI Journal
In a mobile ad hoc network, difficulties exist in supporting address autoconfiguration and naming resolution due to the lack of centralized servers. This letter presents a novel approach, called name-based autoconfiguration (NBA), which uses host names to determine IP addresses and provides address autoconfiguration and name resolution as a single protocol.
1 February 2007 in The 9th International Conference on Advanced Communication Technology
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.