绿地部署中基于小基站覆盖的新回程方法

Btissam Er Rahmadi, A. Ksentini, Djamal-Eddine Meddour
{"title":"绿地部署中基于小基站覆盖的新回程方法","authors":"Btissam Er Rahmadi, A. Ksentini, Djamal-Eddine Meddour","doi":"10.1109/GIIS.2014.6934266","DOIUrl":null,"url":null,"abstract":"In this paper, we address the problematic choice of linking and aggregating Small Cells (SCs) access nodes with a dedicated and cost-efficient backhaul designated to offer a new coverage service for infrastructureless area. We formulate this issue as an optimization problem, and solve it by providing an Integer Linear Program (ILP). For high instances, three heuristic algorithms are investigated. Implementation of those different approaches, for three use case topologies, leads to compare linking generated cost for considered topologies as a function of own traffic of each SC node. Obtained results yield to make first step to light up the problem of backhauling a full SCs access network conceived to cover a green field area.","PeriodicalId":392180,"journal":{"name":"2014 Global Information Infrastructure and Networking Symposium (GIIS)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"New backhaul approach for small cells based coverage in green-field deployments\",\"authors\":\"Btissam Er Rahmadi, A. Ksentini, Djamal-Eddine Meddour\",\"doi\":\"10.1109/GIIS.2014.6934266\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we address the problematic choice of linking and aggregating Small Cells (SCs) access nodes with a dedicated and cost-efficient backhaul designated to offer a new coverage service for infrastructureless area. We formulate this issue as an optimization problem, and solve it by providing an Integer Linear Program (ILP). For high instances, three heuristic algorithms are investigated. Implementation of those different approaches, for three use case topologies, leads to compare linking generated cost for considered topologies as a function of own traffic of each SC node. Obtained results yield to make first step to light up the problem of backhauling a full SCs access network conceived to cover a green field area.\",\"PeriodicalId\":392180,\"journal\":{\"name\":\"2014 Global Information Infrastructure and Networking Symposium (GIIS)\",\"volume\":\"40 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-10-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 Global Information Infrastructure and Networking Symposium (GIIS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/GIIS.2014.6934266\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 Global Information Infrastructure and Networking Symposium (GIIS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GIIS.2014.6934266","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

在本文中,我们解决了连接和聚合小蜂窝(SCs)接入节点的选择问题,该节点具有专用且经济高效的回程,旨在为无基础设施的地区提供新的覆盖服务。我们将这个问题表述为一个优化问题,并通过提供一个整数线性规划(ILP)来解决它。对于高实例,研究了三种启发式算法。对于三种用例拓扑,这些不同方法的实现可以将所考虑的拓扑的链接生成成本作为每个SC节点自身流量的函数进行比较。所得结果为解决全SCs接入网覆盖绿地的回撤问题迈出了第一步。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
New backhaul approach for small cells based coverage in green-field deployments
In this paper, we address the problematic choice of linking and aggregating Small Cells (SCs) access nodes with a dedicated and cost-efficient backhaul designated to offer a new coverage service for infrastructureless area. We formulate this issue as an optimization problem, and solve it by providing an Integer Linear Program (ILP). For high instances, three heuristic algorithms are investigated. Implementation of those different approaches, for three use case topologies, leads to compare linking generated cost for considered topologies as a function of own traffic of each SC node. Obtained results yield to make first step to light up the problem of backhauling a full SCs access network conceived to cover a green field area.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信