机会网络环境的多属性路由协议

Sadaf Yasmin, R. N. B. Rais, A. Qayyum
{"title":"机会网络环境的多属性路由协议","authors":"Sadaf Yasmin, R. N. B. Rais, A. Qayyum","doi":"10.1109/ICCCN.2014.6911876","DOIUrl":null,"url":null,"abstract":"In opportunistic networks, nodes hold packets in permanent storage and make independent routing decisions on sporadically emerging links. This helps to achieve connectivity even if an end-to-end contemporaneous path does not exist between a pair of nodes. Next-hop decision is generally dependent on future probability of encounters with a destination node while other constraints on nodes' resources are ignored. We argue, in this paper that considering multiple parameters related to destination dependent and independent characteristics of a node, while determining its next-hop fitness, can help achieve better performance in resource-stringent opportunistic network environments. Our proposed routing protocol, MARS, not only gets itself cognizant of mobility patterns present within the network but also combines these mobility patterns with other stochastic information about nodes' characteristics. With the help of simulations, we show that MARS is able to achieve high delivery rates and comparable end-to-end latency with well-known routing protocols while maintaining its overhead to a significantly low limit.","PeriodicalId":404048,"journal":{"name":"2014 23rd International Conference on Computer Communication and Networks (ICCCN)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-09-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"A multi-attribute routing protocol for opportunistic network environments\",\"authors\":\"Sadaf Yasmin, R. N. B. Rais, A. Qayyum\",\"doi\":\"10.1109/ICCCN.2014.6911876\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In opportunistic networks, nodes hold packets in permanent storage and make independent routing decisions on sporadically emerging links. This helps to achieve connectivity even if an end-to-end contemporaneous path does not exist between a pair of nodes. Next-hop decision is generally dependent on future probability of encounters with a destination node while other constraints on nodes' resources are ignored. We argue, in this paper that considering multiple parameters related to destination dependent and independent characteristics of a node, while determining its next-hop fitness, can help achieve better performance in resource-stringent opportunistic network environments. Our proposed routing protocol, MARS, not only gets itself cognizant of mobility patterns present within the network but also combines these mobility patterns with other stochastic information about nodes' characteristics. With the help of simulations, we show that MARS is able to achieve high delivery rates and comparable end-to-end latency with well-known routing protocols while maintaining its overhead to a significantly low limit.\",\"PeriodicalId\":404048,\"journal\":{\"name\":\"2014 23rd International Conference on Computer Communication and Networks (ICCCN)\",\"volume\":\"8 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-09-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 23rd International Conference on Computer Communication and Networks (ICCCN)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCCN.2014.6911876\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 23rd International Conference on Computer Communication and Networks (ICCCN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCCN.2014.6911876","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

摘要

在机会网络中,节点将数据包保存在永久存储中,并在偶尔出现的链路上做出独立的路由决定。这有助于实现连通性,即使一对节点之间不存在端到端同步路径。下一跳的决定通常取决于未来与目标节点相遇的概率,而忽略了节点资源的其他约束。在本文中,我们认为,在确定节点的下一跳适应度时,考虑与目标依赖和独立特征相关的多个参数,有助于在资源严格的机会主义网络环境中获得更好的性能。我们提出的路由协议MARS不仅可以识别网络中存在的移动模式,还可以将这些移动模式与其他关于节点特征的随机信息结合起来。在仿真的帮助下,我们展示了MARS能够实现高传输速率和与知名路由协议相当的端到端延迟,同时将其开销保持在非常低的极限。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A multi-attribute routing protocol for opportunistic network environments
In opportunistic networks, nodes hold packets in permanent storage and make independent routing decisions on sporadically emerging links. This helps to achieve connectivity even if an end-to-end contemporaneous path does not exist between a pair of nodes. Next-hop decision is generally dependent on future probability of encounters with a destination node while other constraints on nodes' resources are ignored. We argue, in this paper that considering multiple parameters related to destination dependent and independent characteristics of a node, while determining its next-hop fitness, can help achieve better performance in resource-stringent opportunistic network environments. Our proposed routing protocol, MARS, not only gets itself cognizant of mobility patterns present within the network but also combines these mobility patterns with other stochastic information about nodes' characteristics. With the help of simulations, we show that MARS is able to achieve high delivery rates and comparable end-to-end latency with well-known routing protocols while maintaining its overhead to a significantly low limit.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信