具有连接约束和资源约束的加固骨干网的部署

Peng Wei, Shan Chu, Xin Wang, Yu Zhou
{"title":"具有连接约束和资源约束的加固骨干网的部署","authors":"Peng Wei, Shan Chu, Xin Wang, Yu Zhou","doi":"10.1109/ICDCS.2010.94","DOIUrl":null,"url":null,"abstract":"In recent years, we have seen a surge of interest in enabling communications over meshed wireless networks. Particularly, supporting peer-to-peer communications over a multi-hop wireless network has a big potential in enabling ubiquitous computing. However, many wireless nodes have limited capabilities, for example, sensor nodes or small handheld devices. Also, the end-to-end capacity and delay degrade significantly as the path length increases with the number of network nodes. In these scenarios, the deployment of a backbone network could potentially facilitate higher performance network communications. In this paper, we study the novel Reinforcement Back-bone Network (RBN) deployment problem considering the practical limitation in the number of available backbone nodes and enforcing backbone network connectivity. We propose an iterative and adaptive (ITA) algorithm for efficient backbone network deployment. In addition, in order to provide the performance bound, we redefine and solve the problem by implementing the Generic Algorithm. Finally, we present our simulation results under various settings and compare the performance of the proposed ITA algorithm and the generic algorithm. Our study indicates that the proposed ITA algorithm is promising for deploying a connected RBN with a limited number of available backbone nodes.","PeriodicalId":199931,"journal":{"name":"2010 IEEE 30th International Conference on Distributed Computing Systems","volume":"28 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":"{\"title\":\"Deployment of a Reinforcement Backbone Network with Constraints of Connection and Resources\",\"authors\":\"Peng Wei, Shan Chu, Xin Wang, Yu Zhou\",\"doi\":\"10.1109/ICDCS.2010.94\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In recent years, we have seen a surge of interest in enabling communications over meshed wireless networks. Particularly, supporting peer-to-peer communications over a multi-hop wireless network has a big potential in enabling ubiquitous computing. However, many wireless nodes have limited capabilities, for example, sensor nodes or small handheld devices. Also, the end-to-end capacity and delay degrade significantly as the path length increases with the number of network nodes. In these scenarios, the deployment of a backbone network could potentially facilitate higher performance network communications. In this paper, we study the novel Reinforcement Back-bone Network (RBN) deployment problem considering the practical limitation in the number of available backbone nodes and enforcing backbone network connectivity. We propose an iterative and adaptive (ITA) algorithm for efficient backbone network deployment. In addition, in order to provide the performance bound, we redefine and solve the problem by implementing the Generic Algorithm. Finally, we present our simulation results under various settings and compare the performance of the proposed ITA algorithm and the generic algorithm. Our study indicates that the proposed ITA algorithm is promising for deploying a connected RBN with a limited number of available backbone nodes.\",\"PeriodicalId\":199931,\"journal\":{\"name\":\"2010 IEEE 30th International Conference on Distributed Computing Systems\",\"volume\":\"28 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-06-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"11\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 IEEE 30th International Conference on Distributed Computing Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICDCS.2010.94\",\"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 30th International Conference on Distributed Computing Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICDCS.2010.94","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 11

摘要

近年来,我们看到人们对通过网状无线网络进行通信的兴趣激增。特别是,在多跳无线网络上支持点对点通信在实现无处不在的计算方面具有很大的潜力。然而,许多无线节点的功能有限,例如,传感器节点或小型手持设备。此外,端到端容量和延迟也会随着路径长度的增加而显著降低。在这些场景中,骨干网的部署可能会促进更高性能的网络通信。考虑到骨干网可用节点数量的实际限制和骨干网的连通性,研究了一种新型的增强骨干网(RBN)部署问题。我们提出了一种迭代和自适应(ITA)算法,用于高效的骨干网部署。此外,为了提供性能边界,我们通过实现通用算法对问题进行了重新定义和解决。最后,我们给出了不同设置下的仿真结果,并比较了本文提出的ITA算法与通用算法的性能。我们的研究表明,提出的ITA算法有望部署具有有限数量可用骨干节点的连接RBN。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Deployment of a Reinforcement Backbone Network with Constraints of Connection and Resources
In recent years, we have seen a surge of interest in enabling communications over meshed wireless networks. Particularly, supporting peer-to-peer communications over a multi-hop wireless network has a big potential in enabling ubiquitous computing. However, many wireless nodes have limited capabilities, for example, sensor nodes or small handheld devices. Also, the end-to-end capacity and delay degrade significantly as the path length increases with the number of network nodes. In these scenarios, the deployment of a backbone network could potentially facilitate higher performance network communications. In this paper, we study the novel Reinforcement Back-bone Network (RBN) deployment problem considering the practical limitation in the number of available backbone nodes and enforcing backbone network connectivity. We propose an iterative and adaptive (ITA) algorithm for efficient backbone network deployment. In addition, in order to provide the performance bound, we redefine and solve the problem by implementing the Generic Algorithm. Finally, we present our simulation results under various settings and compare the performance of the proposed ITA algorithm and the generic algorithm. Our study indicates that the proposed ITA algorithm is promising for deploying a connected RBN with a limited number of available backbone nodes.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信