Spray and Focus: Efficient Mobility-Assisted Routing for Heterogeneous and Correlated Mobility

T. Spyropoulos, K. Psounis, C. Raghavendra
{"title":"Spray and Focus: Efficient Mobility-Assisted Routing for Heterogeneous and Correlated Mobility","authors":"T. Spyropoulos, K. Psounis, C. Raghavendra","doi":"10.1109/PERCOMW.2007.108","DOIUrl":null,"url":null,"abstract":"Intermittently connected mobile networks are wireless networks where most of the time there does not exist a complete path from the source to the destination. There are many real networks that follow this model, for example, wildlife tracking sensor networks, military networks, vehicular ad hoc networks (VANETs), etc. To deal with such networks researchers have suggested to use controlled replication or \"spraying \" methods that can reduce the overhead of flooding-based schemes by distributing a small number of copies to only a few relays. These relays then \"look\" for the destination in parallel as they move into the network. Although such schemes can perform well in scenarios with high mobility (e.g. VANETs), they struggle in situations were mobility is slow and correlated in space and/or time. To route messages efficiently in such networks, we propose a scheme that also distributes a small number of copies to few relays. However, each relay can then forward its copy further using a single-copy utility-based scheme, instead of naively waiting to deliver it to the destination itself. This scheme exploits all the advantages of controlled replication, but is also able to identify appropriate forwarding opportunities that could deliver the message faster. Simulation results for traditional mobility models, as well as for a more realistic \"community-based\" model, indicate that our scheme can reduce the delay of existing spraying techniques up to 20 times in some scenarios","PeriodicalId":352348,"journal":{"name":"Fifth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PerComW'07)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"620","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Fifth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PerComW'07)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PERCOMW.2007.108","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 620

Abstract

Intermittently connected mobile networks are wireless networks where most of the time there does not exist a complete path from the source to the destination. There are many real networks that follow this model, for example, wildlife tracking sensor networks, military networks, vehicular ad hoc networks (VANETs), etc. To deal with such networks researchers have suggested to use controlled replication or "spraying " methods that can reduce the overhead of flooding-based schemes by distributing a small number of copies to only a few relays. These relays then "look" for the destination in parallel as they move into the network. Although such schemes can perform well in scenarios with high mobility (e.g. VANETs), they struggle in situations were mobility is slow and correlated in space and/or time. To route messages efficiently in such networks, we propose a scheme that also distributes a small number of copies to few relays. However, each relay can then forward its copy further using a single-copy utility-based scheme, instead of naively waiting to deliver it to the destination itself. This scheme exploits all the advantages of controlled replication, but is also able to identify appropriate forwarding opportunities that could deliver the message faster. Simulation results for traditional mobility models, as well as for a more realistic "community-based" model, indicate that our scheme can reduce the delay of existing spraying techniques up to 20 times in some scenarios
喷雾和焦点:异构和相关移动的高效移动辅助路由
间歇连接的移动网络是无线网络,在大多数情况下,不存在从源到目的的完整路径。有许多真实的网络遵循这个模型,例如,野生动物跟踪传感器网络,军事网络,车辆自组织网络(VANETs)等。为了处理这样的网络,研究人员建议使用控制复制或“喷洒”方法,通过将少量副本分发到少数中继,可以减少基于洪水的方案的开销。然后这些中继在进入网络时并行地“寻找”目的地。尽管这些方案在高机动性的场景(例如VANETs)中表现良好,但它们在机动性缓慢且在空间和/或时间上相关的情况下表现不佳。为了在这样的网络中有效地路由消息,我们提出了一种将少量副本分发到少数中继的方案。然而,每个中继随后可以使用基于单副本实用程序的方案进一步转发其副本,而不是天真地等待将其传递到目的地本身。此方案利用了受控复制的所有优点,但也能够识别可以更快地传递消息的适当转发机会。对传统机动模型以及更为现实的“基于社区”模型的仿真结果表明,在某些场景下,我们的方案可以将现有喷涂技术的延迟减少多达20倍
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信