社会贪婪:一种基于社会的贪婪路由算法,适用于延迟容忍网络

Kazem Jahanbakhsh, G. Shoja, Valerie King
{"title":"社会贪婪:一种基于社会的贪婪路由算法,适用于延迟容忍网络","authors":"Kazem Jahanbakhsh, G. Shoja, Valerie King","doi":"10.1145/1755743.1755773","DOIUrl":null,"url":null,"abstract":"Efficient routing in mobile opportunistic networks and Delay Tolerant Networks (DTNs) in particular, is a challenging task because human mobility patterns are hard to predict. Several recent work have shown the importance of communities in efficient routing of messages in DTNs. However, real time community detection in DTNs is a complex and time consuming process. In this paper, we propose a simple and cost effective method for bootstrapping wireless devices by employing available social profiles. Moreover, we propose a simple greedy routing algorithm called Social-Greedy which uses a social distance derived from people's social profiles to route messages in DTNs.","PeriodicalId":198518,"journal":{"name":"International Workshop on Mobile Opportunistic Networks","volume":"69 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-02-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"42","resultStr":"{\"title\":\"Social-Greedy: a socially-based greedy routing algorithm for delay tolerant networks\",\"authors\":\"Kazem Jahanbakhsh, G. Shoja, Valerie King\",\"doi\":\"10.1145/1755743.1755773\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Efficient routing in mobile opportunistic networks and Delay Tolerant Networks (DTNs) in particular, is a challenging task because human mobility patterns are hard to predict. Several recent work have shown the importance of communities in efficient routing of messages in DTNs. However, real time community detection in DTNs is a complex and time consuming process. In this paper, we propose a simple and cost effective method for bootstrapping wireless devices by employing available social profiles. Moreover, we propose a simple greedy routing algorithm called Social-Greedy which uses a social distance derived from people's social profiles to route messages in DTNs.\",\"PeriodicalId\":198518,\"journal\":{\"name\":\"International Workshop on Mobile Opportunistic Networks\",\"volume\":\"69 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-02-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"42\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Workshop on Mobile Opportunistic Networks\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/1755743.1755773\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Workshop on Mobile Opportunistic Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1755743.1755773","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 42

摘要

由于人类的移动模式难以预测,因此在移动机会网络和容忍延迟网络(dtn)中高效路由是一项具有挑战性的任务。最近的几项工作显示了社区在ddn中有效路由消息中的重要性。然而,实时社区检测是一个复杂而耗时的过程。在本文中,我们提出了一种简单而经济有效的方法,通过利用可用的社会概况来引导无线设备。此外,我们提出了一种简单的贪婪路由算法,称为social - greedy,它使用从人们的社会概况中获得的社会距离来路由dtn中的消息。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Social-Greedy: a socially-based greedy routing algorithm for delay tolerant networks
Efficient routing in mobile opportunistic networks and Delay Tolerant Networks (DTNs) in particular, is a challenging task because human mobility patterns are hard to predict. Several recent work have shown the importance of communities in efficient routing of messages in DTNs. However, real time community detection in DTNs is a complex and time consuming process. In this paper, we propose a simple and cost effective method for bootstrapping wireless devices by employing available social profiles. Moreover, we propose a simple greedy routing algorithm called Social-Greedy which uses a social distance derived from people's social profiles to route messages in DTNs.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信