Evaluating the Joint Use of Alternate Internet Delivery Models in Deterministic Rural Networks

Esther Max-Onakpoya, Corey E. Baker
{"title":"Evaluating the Joint Use of Alternate Internet Delivery Models in Deterministic Rural Networks","authors":"Esther Max-Onakpoya, Corey E. Baker","doi":"10.1109/ICCCN58024.2023.10230107","DOIUrl":null,"url":null,"abstract":"Rural residents are often faced with the problem of expensive yet unreliable Internet connectivity. This coupled with the sparse population/business density, poses a detriment to the general development of such communities. In mitigating this disparity, some rural areas have adopted alternate Internet models to improve access to Internet services within their community. Such alternate models include communal access points, delay tolerant networks, and resource sharing networks. Thus, this work investigates the joint use of the aforementioned alternate Internet models for improving connectivity. Further, this work explores methods of routing time-dependent data in quasi-deterministic scenarios within these challenged rural environments. We formulate the routing problem as a maximum unsplittable multicommodity flow problem and propose an approximation algorithm. Using data representative of a rural Appalachian region, we evaluate our approximation algorithm and find that it performs close to optimal. We also propose a routing protocol based on our approximation algorithm. Using the same data, the results show that the proposed routing protocol performs comparably well with state-of-the-art routing protocols in delivering messages under time constraints. Additionally, the proposed routing protocol offers an overhead cost that is at least 3 times lower, on average, than other well-known routing protocols.","PeriodicalId":132030,"journal":{"name":"2023 32nd International Conference on Computer Communications and Networks (ICCCN)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2023 32nd International Conference on Computer Communications and Networks (ICCCN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCCN58024.2023.10230107","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Rural residents are often faced with the problem of expensive yet unreliable Internet connectivity. This coupled with the sparse population/business density, poses a detriment to the general development of such communities. In mitigating this disparity, some rural areas have adopted alternate Internet models to improve access to Internet services within their community. Such alternate models include communal access points, delay tolerant networks, and resource sharing networks. Thus, this work investigates the joint use of the aforementioned alternate Internet models for improving connectivity. Further, this work explores methods of routing time-dependent data in quasi-deterministic scenarios within these challenged rural environments. We formulate the routing problem as a maximum unsplittable multicommodity flow problem and propose an approximation algorithm. Using data representative of a rural Appalachian region, we evaluate our approximation algorithm and find that it performs close to optimal. We also propose a routing protocol based on our approximation algorithm. Using the same data, the results show that the proposed routing protocol performs comparably well with state-of-the-art routing protocols in delivering messages under time constraints. Additionally, the proposed routing protocol offers an overhead cost that is at least 3 times lower, on average, than other well-known routing protocols.
评估在确定性农村网络中交替互联网交付模型的联合使用
农村居民经常面临昂贵而不可靠的互联网连接问题。再加上人口/商业密度稀少,对这些社区的总体发展造成了不利影响。为了减轻这种差距,一些农村地区采用了替代互联网模式,以改善社区内互联网服务的接入。这些备选模型包括公共接入点、容忍延迟网络和资源共享网络。因此,这项工作调查了上述替代互联网模型的联合使用,以改善连通性。此外,本工作还探讨了在这些充满挑战的农村环境中,在准确定性场景中路由时间相关数据的方法。我们将路由问题表述为一个最大不可分割的多商品流问题,并提出了一个近似算法。使用代表阿巴拉契亚农村地区的数据,我们评估了我们的近似算法,发现它的性能接近最优。我们还提出了一种基于近似算法的路由协议。使用相同的数据,结果表明,在时间限制下,所提出的路由协议在传递消息方面的性能与目前最先进的路由协议相当。此外,所提出的路由协议提供的开销比其他已知路由协议平均至少低3倍。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信