Mesh Network Deployment to Ensure Global Reachability

S. Khaled, R. Benkoczi, Y. Chen
{"title":"Mesh Network Deployment to Ensure Global Reachability","authors":"S. Khaled, R. Benkoczi, Y. Chen","doi":"10.1109/MUSIC.2012.43","DOIUrl":null,"url":null,"abstract":"We propose and study a network design problem whose goal is to ensure Internet reach ability to mobile wireless devices. Such design of networks is a resource location allocation problem related to minimum cost unsplitable flow in a tripartite network. We present IP formulation for the problem, and produce test results with ILOG CPLEX. We also present heuristic algorithms using local search and VNS based procedures. We test the algorithms with different randomly generated network instances from size 500 - 5000 nodes. Our algorithms could obtain optimal solution for some of the input instances, beat the solutions obtained by CPLEX for some others, and obtained a worst case integrality gap of 3% for the rest.","PeriodicalId":260515,"journal":{"name":"2012 Third FTRA International Conference on Mobile, Ubiquitous, and Intelligent Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 Third FTRA International Conference on Mobile, Ubiquitous, and Intelligent Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MUSIC.2012.43","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

We propose and study a network design problem whose goal is to ensure Internet reach ability to mobile wireless devices. Such design of networks is a resource location allocation problem related to minimum cost unsplitable flow in a tripartite network. We present IP formulation for the problem, and produce test results with ILOG CPLEX. We also present heuristic algorithms using local search and VNS based procedures. We test the algorithms with different randomly generated network instances from size 500 - 5000 nodes. Our algorithms could obtain optimal solution for some of the input instances, beat the solutions obtained by CPLEX for some others, and obtained a worst case integrality gap of 3% for the rest.
网状网络部署,确保全球可达性
我们提出并研究了一个网络设计问题,其目标是确保移动无线设备的互联网到达能力。这种网络设计是一个涉及到最小成本不可分割流在三方网络中的资源位置分配问题。提出了该问题的IP公式,并利用ILOG CPLEX进行了测试。我们还提出了使用本地搜索和基于VNS的程序的启发式算法。我们用500 - 5000个节点随机生成的不同网络实例来测试算法。我们的算法可以在一些输入实例中获得最优解,在其他输入实例中优于CPLEX算法的解,并且在其余输入实例中获得了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学术官方微信