{"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.