低开销和可扩展的移动自组织网络代理自适应网关发现

Francisco J. Ros, P. M. Ruiz
{"title":"低开销和可扩展的移动自组织网络代理自适应网关发现","authors":"Francisco J. Ros, P. M. Ruiz","doi":"10.1109/MOBHOC.2006.278561","DOIUrl":null,"url":null,"abstract":"In the last years, many authors have addressed the problem of interconnecting mobile ad hoc networks (MANET) to the Internet, via one or more attachment points called gateways. The protocol employed to discover available gateways and set up routes to the Internet should not incur in a big overhead, due to the scarce resources of ad hoc networks. However, previous proposals do not meet this requirement either when the number of traffic sources or available gateways increases. In this paper, we develop a gateway discovery algorithm which dynamically adapts its behavior depending on the number of active traffic sources which are in the MANET. In addition, the approach employs proxies (intermediate nodes which make use of available local information) to further reduce the control overhead. A mathematical model for this algorithm and the previous approaches is provided. By means of both an analytical and a simulation-based study, our proposed scheme is shown to greatly outperform the remaining solutions in terms of overhead reduction, while it is still able to provide a high packet delivery ratio. Besides, our proposal scales well regarding the number of sources and gateways","PeriodicalId":345003,"journal":{"name":"2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems","volume":"28 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"15","resultStr":"{\"title\":\"Low Overhead and Scalable Proxied Adaptive Gateway Discovery for Mobile Ad Hoc Networks\",\"authors\":\"Francisco J. Ros, P. M. Ruiz\",\"doi\":\"10.1109/MOBHOC.2006.278561\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In the last years, many authors have addressed the problem of interconnecting mobile ad hoc networks (MANET) to the Internet, via one or more attachment points called gateways. The protocol employed to discover available gateways and set up routes to the Internet should not incur in a big overhead, due to the scarce resources of ad hoc networks. However, previous proposals do not meet this requirement either when the number of traffic sources or available gateways increases. In this paper, we develop a gateway discovery algorithm which dynamically adapts its behavior depending on the number of active traffic sources which are in the MANET. In addition, the approach employs proxies (intermediate nodes which make use of available local information) to further reduce the control overhead. A mathematical model for this algorithm and the previous approaches is provided. By means of both an analytical and a simulation-based study, our proposed scheme is shown to greatly outperform the remaining solutions in terms of overhead reduction, while it is still able to provide a high packet delivery ratio. Besides, our proposal scales well regarding the number of sources and gateways\",\"PeriodicalId\":345003,\"journal\":{\"name\":\"2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems\",\"volume\":\"28 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-10-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"15\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/MOBHOC.2006.278561\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MOBHOC.2006.278561","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 15

摘要

在过去的几年里,许多作者已经解决了通过一个或多个称为网关的附着点将移动自组织网络(MANET)连接到互联网的问题。由于自组织网络的资源稀缺,用于发现可用网关和建立到Internet的路由的协议不应该产生很大的开销。但是,当流量源数量或可用网关数量增加时,以前的建议都不能满足这一要求。在本文中,我们开发了一种网关发现算法,该算法根据MANET中活跃流量源的数量动态调整其行为。此外,该方法还使用代理(利用可用本地信息的中间节点)来进一步减少控制开销。给出了该算法和上述方法的数学模型。通过分析和仿真研究,我们提出的方案在减少开销方面大大优于其他解决方案,同时仍然能够提供高数据包传输率。此外,我们的建议在源和网关的数量方面伸缩性很好
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Low Overhead and Scalable Proxied Adaptive Gateway Discovery for Mobile Ad Hoc Networks
In the last years, many authors have addressed the problem of interconnecting mobile ad hoc networks (MANET) to the Internet, via one or more attachment points called gateways. The protocol employed to discover available gateways and set up routes to the Internet should not incur in a big overhead, due to the scarce resources of ad hoc networks. However, previous proposals do not meet this requirement either when the number of traffic sources or available gateways increases. In this paper, we develop a gateway discovery algorithm which dynamically adapts its behavior depending on the number of active traffic sources which are in the MANET. In addition, the approach employs proxies (intermediate nodes which make use of available local information) to further reduce the control overhead. A mathematical model for this algorithm and the previous approaches is provided. By means of both an analytical and a simulation-based study, our proposed scheme is shown to greatly outperform the remaining solutions in terms of overhead reduction, while it is still able to provide a high packet delivery ratio. Besides, our proposal scales well regarding the number of sources and gateways
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信