{"title":"A peer-to-peer overlay for context information search","authors":"T. Gu, H. Pung, Daqing Zhang","doi":"10.1109/ICCCN.2005.1523895","DOIUrl":null,"url":null,"abstract":"The widespread use of context information necessitates an efficient wide-area lookup service in pervasive computing. In this paper, we present semantic context space (SCS), a semantic overlay network that facilitates efficient search for context information in distributed environments. Peers in SCS are grouped based on the semantics of their local data and self-organized into a one-dimensional ring space. Context search requests are only routed to the appropriate semantic clusters, reducing unnecessary search cost on peers that have irrelevant context data, and increasing the chances that the context data will be found quickly. By exploring parallelism in a semantic cluster, search request can be found quickly. Our simulation studies demonstrate the effectiveness of SCS.","PeriodicalId":379037,"journal":{"name":"Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005.","volume":"9 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"15","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCCN.2005.1523895","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 15
Abstract
The widespread use of context information necessitates an efficient wide-area lookup service in pervasive computing. In this paper, we present semantic context space (SCS), a semantic overlay network that facilitates efficient search for context information in distributed environments. Peers in SCS are grouped based on the semantics of their local data and self-organized into a one-dimensional ring space. Context search requests are only routed to the appropriate semantic clusters, reducing unnecessary search cost on peers that have irrelevant context data, and increasing the chances that the context data will be found quickly. By exploring parallelism in a semantic cluster, search request can be found quickly. Our simulation studies demonstrate the effectiveness of SCS.