容忍延迟网络中的最优两跳路由

Francesco De Pellegrini, D. Miorandi, Iacopo Carreras
{"title":"容忍延迟网络中的最优两跳路由","authors":"Francesco De Pellegrini, D. Miorandi, Iacopo Carreras","doi":"10.1109/EW.2010.5483532","DOIUrl":null,"url":null,"abstract":"In this work we deal with the problem of dynamic decentralized self-optimization of forwarding protocols in delay-tolerant networks. We consider the two-hop forwarding protocol and we model the routing problem as an optimization one. We describe, under mild assumptions on the contact process among mobile nodes, the connection between the number of copies of a message and the cumulative probability distribution function of the message delay. We show that, despite the possible presence of a plurality of optimal policies, there always exists a threshold policy that is optimal. We also show that such an optimal strategy can be achieved at run-time by probing the network and with minimal message overhead. The approach is validated by implementing a self-optimizing algorithm in a network simulator; the performance of our solution is analyzed in the case of various real-world contact traces.","PeriodicalId":232165,"journal":{"name":"2010 European Wireless Conference (EW)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Optimal two-hop routing in delay-tolerant networks\",\"authors\":\"Francesco De Pellegrini, D. Miorandi, Iacopo Carreras\",\"doi\":\"10.1109/EW.2010.5483532\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this work we deal with the problem of dynamic decentralized self-optimization of forwarding protocols in delay-tolerant networks. We consider the two-hop forwarding protocol and we model the routing problem as an optimization one. We describe, under mild assumptions on the contact process among mobile nodes, the connection between the number of copies of a message and the cumulative probability distribution function of the message delay. We show that, despite the possible presence of a plurality of optimal policies, there always exists a threshold policy that is optimal. We also show that such an optimal strategy can be achieved at run-time by probing the network and with minimal message overhead. The approach is validated by implementing a self-optimizing algorithm in a network simulator; the performance of our solution is analyzed in the case of various real-world contact traces.\",\"PeriodicalId\":232165,\"journal\":{\"name\":\"2010 European Wireless Conference (EW)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-04-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 European Wireless Conference (EW)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/EW.2010.5483532\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 European Wireless Conference (EW)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/EW.2010.5483532","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

本文研究了延迟容忍网络中转发协议的动态分散自优化问题。我们考虑了两跳转发协议,并将路由问题建模为一个优化问题。在对移动节点间接触过程的温和假设下,我们描述了消息副本数与消息延迟的累积概率分布函数之间的联系。我们证明,尽管可能存在多个最优策略,但总存在一个最优的阈值策略。我们还展示了这种最佳策略可以在运行时通过探测网络和最小化消息开销来实现。通过在网络模拟器中实现自优化算法,验证了该方法的有效性;在各种实际接触轨迹的情况下,分析了我们的解决方案的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Optimal two-hop routing in delay-tolerant networks
In this work we deal with the problem of dynamic decentralized self-optimization of forwarding protocols in delay-tolerant networks. We consider the two-hop forwarding protocol and we model the routing problem as an optimization one. We describe, under mild assumptions on the contact process among mobile nodes, the connection between the number of copies of a message and the cumulative probability distribution function of the message delay. We show that, despite the possible presence of a plurality of optimal policies, there always exists a threshold policy that is optimal. We also show that such an optimal strategy can be achieved at run-time by probing the network and with minimal message overhead. The approach is validated by implementing a self-optimizing algorithm in a network simulator; the performance of our solution is analyzed in the case of various real-world contact traces.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Soft carrier phase recovery for continuous phase modulations Rate-adaptive space-time constellation design for partially coherent Rayleigh fading channels Effective scheduling of real-time traffic in HSUPA Evaluation of spectrum opportunities in the GSM band A Simple and Robust Dissemination protocol for VANETs
×
引用
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