多跳无线网络中路由和呼叫调度的瓶颈分析

Cristiana Gomes, S. Pérennes, H. Rivano
{"title":"多跳无线网络中路由和呼叫调度的瓶颈分析","authors":"Cristiana Gomes, S. Pérennes, H. Rivano","doi":"10.1109/GLOCOMW.2008.ECP.78","DOIUrl":null,"url":null,"abstract":"In this paper, we address the routing and call scheduling problem in which one has to find a minimum-length schedule of selected links in a TDMA (time division multiple access) based wireless network. As we deal with multi-hop networks, these selected links represent a routing solution (paths) providing enough capacity to achieve the routers requirements of bandwidth. We present a cross-layer formulation of the problem that computes joint routing and scheduling. We use a branch-and-price algorithm to solve optimally the problem. A column generation algorithm is used to cope with the exponential set of rounds. The branch-and-bound algorithm provides mono-routing. We run experiments on networks from the literature, with different number of gateways. Experimental results as well as theoretical insights let us conjecture that the bottleneck region analysis is enough to find the optimal solution. The Integer Round-Up Property (IRUP) seems to hold for our problem.","PeriodicalId":410930,"journal":{"name":"2008 IEEE Globecom Workshops","volume":"39 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"16","resultStr":"{\"title\":\"Bottleneck Analysis for Routing and Call Scheduling in Multi-Hop Wireless Networks\",\"authors\":\"Cristiana Gomes, S. Pérennes, H. Rivano\",\"doi\":\"10.1109/GLOCOMW.2008.ECP.78\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we address the routing and call scheduling problem in which one has to find a minimum-length schedule of selected links in a TDMA (time division multiple access) based wireless network. As we deal with multi-hop networks, these selected links represent a routing solution (paths) providing enough capacity to achieve the routers requirements of bandwidth. We present a cross-layer formulation of the problem that computes joint routing and scheduling. We use a branch-and-price algorithm to solve optimally the problem. A column generation algorithm is used to cope with the exponential set of rounds. The branch-and-bound algorithm provides mono-routing. We run experiments on networks from the literature, with different number of gateways. Experimental results as well as theoretical insights let us conjecture that the bottleneck region analysis is enough to find the optimal solution. The Integer Round-Up Property (IRUP) seems to hold for our problem.\",\"PeriodicalId\":410930,\"journal\":{\"name\":\"2008 IEEE Globecom Workshops\",\"volume\":\"39 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-12-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"16\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 IEEE Globecom Workshops\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/GLOCOMW.2008.ECP.78\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 IEEE Globecom Workshops","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GLOCOMW.2008.ECP.78","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 16

摘要

在本文中,我们解决路由和呼叫调度问题,其中一个必须找到一个最小长度调度的选择链路在TDMA(时分多址)为基础的无线网络。当我们处理多跳网络时,这些选择的链路代表一个路由解决方案(路径),提供足够的容量来满足路由器对带宽的要求。我们提出了一种计算联合路由和调度问题的跨层公式。我们使用分支-价格算法来最优地解决这个问题。使用列生成算法来处理指数轮集。分支定界算法提供单路由。我们根据文献对网络进行实验,使用不同数量的网关。实验结果和理论见解让我们推测,瓶颈区域分析足以找到最优解。整数四舍五入属性(IRUP)似乎适用于我们的问题。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Bottleneck Analysis for Routing and Call Scheduling in Multi-Hop Wireless Networks
In this paper, we address the routing and call scheduling problem in which one has to find a minimum-length schedule of selected links in a TDMA (time division multiple access) based wireless network. As we deal with multi-hop networks, these selected links represent a routing solution (paths) providing enough capacity to achieve the routers requirements of bandwidth. We present a cross-layer formulation of the problem that computes joint routing and scheduling. We use a branch-and-price algorithm to solve optimally the problem. A column generation algorithm is used to cope with the exponential set of rounds. The branch-and-bound algorithm provides mono-routing. We run experiments on networks from the literature, with different number of gateways. Experimental results as well as theoretical insights let us conjecture that the bottleneck region analysis is enough to find the optimal solution. The Integer Round-Up Property (IRUP) seems to hold for our problem.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信