Peer-to-peer searching mechanisms for location-aware contents with time-dependent importance

Kentaro Takahashi, K. Harumoto, S. Nishio
{"title":"Peer-to-peer searching mechanisms for location-aware contents with time-dependent importance","authors":"Kentaro Takahashi, K. Harumoto, S. Nishio","doi":"10.1109/ICDIM.2008.4746733","DOIUrl":null,"url":null,"abstract":"Recently, peer-to-peer (P2P) networking has become popular, and is being expected as a content sharing platform for ubiquitous networking. In ubiquitous networking, the notions of location and time are essential. Although some location-based P2P networks have been proposed, they only consider locations, and the notion of time has not been considered. In this paper, we propose P2P searching mechanisms for location-aware contents with time-dependent importance, which enables us to retrieve contents with high importance in time period specified in a query. The proposed mechanisms are based on a location-based P2P network, and each peer establishes additional links to peers within n-hops. Each peer also manages a link table, which records location and time-dependent importance of contents that its linked peers hold. Using the link table, a time-specified query is forwarded selectively to neighboring peers. Simulation results show that the proposed mechanisms enable us to search contents with high relevance while keeping network traffic low.","PeriodicalId":415013,"journal":{"name":"2008 Third International Conference on Digital Information Management","volume":"63 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 Third International Conference on Digital Information Management","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICDIM.2008.4746733","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Recently, peer-to-peer (P2P) networking has become popular, and is being expected as a content sharing platform for ubiquitous networking. In ubiquitous networking, the notions of location and time are essential. Although some location-based P2P networks have been proposed, they only consider locations, and the notion of time has not been considered. In this paper, we propose P2P searching mechanisms for location-aware contents with time-dependent importance, which enables us to retrieve contents with high importance in time period specified in a query. The proposed mechanisms are based on a location-based P2P network, and each peer establishes additional links to peers within n-hops. Each peer also manages a link table, which records location and time-dependent importance of contents that its linked peers hold. Using the link table, a time-specified query is forwarded selectively to neighboring peers. Simulation results show that the proposed mechanisms enable us to search contents with high relevance while keeping network traffic low.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
具有时间相关性的位置感知内容的点对点搜索机制
最近,点对点(P2P)网络开始流行起来,并被期望作为无处不在的网络的内容共享平台。在无处不在的网络中,位置和时间的概念是必不可少的。虽然已经提出了一些基于位置的P2P网络,但它们只考虑位置,而没有考虑时间的概念。在本文中,我们提出了具有时间依赖性重要性的位置感知内容的P2P搜索机制,使我们能够在查询中指定的时间段内检索到高重要性的内容。所提出的机制基于基于位置的P2P网络,每个对等点在n跳内建立到对等点的额外链接。每个对等点还管理一个链接表,该表记录其链接对等点持有的内容的位置和与时间相关的重要性。通过链路表,可以有选择地将指定时间的查询转发给相邻的对等体。仿真结果表明,所提出的机制使我们能够在保持低网络流量的情况下搜索高相关性的内容。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Grid-based Semantic Integration and dissemination of medical information A hierarchical model-based system for discovering atypical behavior Geo-information quality assurance in disaster management Remote controlled flying robot platform Ubiquitous computing and android
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1