论机会路由的最大性能

Llorenç Cerdà-Alabern, A. Darehshoorzadeh, V. Pla
{"title":"论机会路由的最大性能","authors":"Llorenç Cerdà-Alabern, A. Darehshoorzadeh, V. Pla","doi":"10.1109/WOWMOM.2010.5534897","DOIUrl":null,"url":null,"abstract":"In recent years there has been a growing interest in Opportunistic Routing as a way to increase the capacity of wireless networks by exploiting its broadcast nature. By contrast to traditional uni-path routing, in opportunistic routing the nodes overhearing neighbor's transmissions can become candidates to forward the packets towards the destination. In this paper we address the question: What is the maximum performance that can be obtained using opportunistic routing? To answer this question we use an analytical model that allows to compute the optimal position of the nodes, such that the progress towards the destination is maximized. We use this model to compute bounds to the minimum expected number of transmissions that can be achieved in a network using opportunistic routing.","PeriodicalId":384628,"journal":{"name":"2010 IEEE International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":"{\"title\":\"On the maximum performance in opportunistic routing\",\"authors\":\"Llorenç Cerdà-Alabern, A. Darehshoorzadeh, V. Pla\",\"doi\":\"10.1109/WOWMOM.2010.5534897\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In recent years there has been a growing interest in Opportunistic Routing as a way to increase the capacity of wireless networks by exploiting its broadcast nature. By contrast to traditional uni-path routing, in opportunistic routing the nodes overhearing neighbor's transmissions can become candidates to forward the packets towards the destination. In this paper we address the question: What is the maximum performance that can be obtained using opportunistic routing? To answer this question we use an analytical model that allows to compute the optimal position of the nodes, such that the progress towards the destination is maximized. We use this model to compute bounds to the minimum expected number of transmissions that can be achieved in a network using opportunistic routing.\",\"PeriodicalId\":384628,\"journal\":{\"name\":\"2010 IEEE International Symposium on \\\"A World of Wireless, Mobile and Multimedia Networks\\\" (WoWMoM)\",\"volume\":\"6 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-06-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"11\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 IEEE International Symposium on \\\"A World of Wireless, Mobile and Multimedia Networks\\\" (WoWMoM)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WOWMOM.2010.5534897\",\"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 IEEE International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WOWMOM.2010.5534897","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 11

摘要

近年来,机会路由作为一种利用其广播性质来增加无线网络容量的方法,受到了越来越多的关注。与传统的单路径路由相比,在机会路由中,侦听邻居传输的节点可以成为向目的地转发数据包的候选节点。在本文中,我们解决了这样一个问题:使用机会路由可以获得的最大性能是什么?为了回答这个问题,我们使用了一个分析模型,该模型允许计算节点的最佳位置,从而使到达目的地的进度最大化。我们使用该模型来计算使用机会路由在网络中可以实现的最小期望传输数的界限。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
On the maximum performance in opportunistic routing
In recent years there has been a growing interest in Opportunistic Routing as a way to increase the capacity of wireless networks by exploiting its broadcast nature. By contrast to traditional uni-path routing, in opportunistic routing the nodes overhearing neighbor's transmissions can become candidates to forward the packets towards the destination. In this paper we address the question: What is the maximum performance that can be obtained using opportunistic routing? To answer this question we use an analytical model that allows to compute the optimal position of the nodes, such that the progress towards the destination is maximized. We use this model to compute bounds to the minimum expected number of transmissions that can be achieved in a network using opportunistic routing.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信