首页 > 最新文献

2017 15th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)最新文献

英文 中文
Keynote speaker 主讲人
K. Johansson
The rapid growth in the density of wireless access devices, accompanied by increasing heterogeneity in wireless technologies, requires adaptive allocation and reallocation of spectrum. The traditional allocation of spectrum does not allow for its flexible utilisation. These shortcomings call for new ways to access spectrum, for example through opportunistic spectrum usage and spectrum trading. As technologies emerge on ever-faster time-scales spectrum trading on shorter and shorter time-scales will eventually create the basis for a real-time and liquid market in spectrum. This process will be accompanied by rapidly developing means to dynamically price the use of spectrum and provide the basis for transparency in pricing. In these liquid markets users can acquire the spectrum that best suits their needs and they will pay for it an economic price determined collectively by the market. We will discuss scenarios where spectrum trading will happen through brokers who continuously monitor the utilisation of different frequency bands and negotiate between those who need to buy or sell spectrum. The brokers may also have the role of a market maker and as such may be required to continuously quote the price of spectrum bands on the basis of their supply and demand situation. We will discuss scenarios where spectrum could become an asset class not only traded for hedging purposes but perhaps for speculation as well. Major investment funds may want to include spectrum in their investment portfolios for enhanced diversification and risk management.
{"title":"Keynote speaker","authors":"K. Johansson","doi":"10.1109/WIOPT.2008.4586164","DOIUrl":"https://doi.org/10.1109/WIOPT.2008.4586164","url":null,"abstract":"The rapid growth in the density of wireless access devices, accompanied by increasing heterogeneity in wireless technologies, requires adaptive allocation and reallocation of spectrum. The traditional allocation of spectrum does not allow for its flexible utilisation. These shortcomings call for new ways to access spectrum, for example through opportunistic spectrum usage and spectrum trading. As technologies emerge on ever-faster time-scales spectrum trading on shorter and shorter time-scales will eventually create the basis for a real-time and liquid market in spectrum. This process will be accompanied by rapidly developing means to dynamically price the use of spectrum and provide the basis for transparency in pricing. In these liquid markets users can acquire the spectrum that best suits their needs and they will pay for it an economic price determined collectively by the market. We will discuss scenarios where spectrum trading will happen through brokers who continuously monitor the utilisation of different frequency bands and negotiate between those who need to buy or sell spectrum. The brokers may also have the role of a market maker and as such may be required to continuously quote the price of spectrum bands on the basis of their supply and demand situation. We will discuss scenarios where spectrum could become an asset class not only traded for hedging purposes but perhaps for speculation as well. Major investment funds may want to include spectrum in their investment portfolios for enhanced diversification and risk management.","PeriodicalId":6630,"journal":{"name":"2017 15th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2022-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77919060","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Keynote speaker 主讲人
R. Koetter
Les Todres, PhD is a Clinical Psychologist and Professor of Qualitative Research and Psychotherapy at the Centre for Qualitative Research, Bournemouth University, UK. His previous occupational roles have included head of a student counselling service and director of a clinical psychology training programme. He has also worked within NHS clinics and GP practices in the United Kingdom. He has publishes in the area of Phenomenological Psychology and Integrative Psychotherapy.
{"title":"Keynote speaker","authors":"R. Koetter","doi":"10.1109/WIOPT.2008.4586162","DOIUrl":"https://doi.org/10.1109/WIOPT.2008.4586162","url":null,"abstract":"Les Todres, PhD is a Clinical Psychologist and Professor of Qualitative Research and Psychotherapy at the Centre for Qualitative Research, Bournemouth University, UK. His previous occupational roles have included head of a student counselling service and director of a clinical psychology training programme. He has also worked within NHS clinics and GP practices in the United Kingdom. He has publishes in the area of Phenomenological Psychology and Integrative Psychotherapy.","PeriodicalId":6630,"journal":{"name":"2017 15th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82310242","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Ad-Hoc, Mobile, and Wireless Networks: 19th International Conference on Ad-Hoc Networks and Wireless, ADHOC-NOW 2020, Bari, Italy, October 19–21, 2020, Proceedings Ad-Hoc,移动和无线网络:第19届Ad-Hoc网络和无线国际会议,ADHOC-NOW 2020,意大利巴里,2020年10月19-21日,论文集
G. Boggia, G. Piro, Y. Jararweh, C. Campolo
{"title":"Ad-Hoc, Mobile, and Wireless Networks: 19th International Conference on Ad-Hoc Networks and Wireless, ADHOC-NOW 2020, Bari, Italy, October 19–21, 2020, Proceedings","authors":"G. Boggia, G. Piro, Y. Jararweh, C. Campolo","doi":"10.1007/978-3-030-61746-2","DOIUrl":"https://doi.org/10.1007/978-3-030-61746-2","url":null,"abstract":"","PeriodicalId":6630,"journal":{"name":"2017 15th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74191658","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 19
Retraction Note to: Mobility Aided Context-Aware Forwarding Approach for Destination-Less OppNets 无目的地OppNets的移动辅助上下文感知转发方法
Vishnupriya Kuppusamy, A. Udugama, Anna Förster
{"title":"Retraction Note to: Mobility Aided Context-Aware Forwarding Approach for Destination-Less OppNets","authors":"Vishnupriya Kuppusamy, A. Udugama, Anna Förster","doi":"10.1007/978-3-030-31831-4_48","DOIUrl":"https://doi.org/10.1007/978-3-030-31831-4_48","url":null,"abstract":"","PeriodicalId":6630,"journal":{"name":"2017 15th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73695341","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Ad-Hoc, Mobile, and Wireless Networks: 18th International Conference on Ad-Hoc Networks and Wireless, ADHOC-NOW 2019, Luxembourg, Luxembourg, October 1–3, 2019, Proceedings Ad-Hoc,移动和无线网络:第18届Ad-Hoc网络和无线国际会议,ADHOC-NOW 2019,卢森堡,卢森堡,2019年10月1-3日,会议录
M. Palattella, S. Scanzio, S. Ergen, E. Bertino
{"title":"Ad-Hoc, Mobile, and Wireless Networks: 18th International Conference on Ad-Hoc Networks and Wireless, ADHOC-NOW 2019, Luxembourg, Luxembourg, October 1–3, 2019, Proceedings","authors":"M. Palattella, S. Scanzio, S. Ergen, E. Bertino","doi":"10.1007/978-3-030-31831-4","DOIUrl":"https://doi.org/10.1007/978-3-030-31831-4","url":null,"abstract":"","PeriodicalId":6630,"journal":{"name":"2017 15th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78440709","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 6
An economic analysis of wireless network infrastructure sharing 无线网络基础设施共享的经济分析
Liang Zheng, Jiasi Chen, Carlee Joe-Wong, C. Tan, M. Chiang
Internet service providers (ISPs) struggle to invest in upgrading their networks to catch up with growing mobile data demand, while users have to face significant data overage fees. Pooling ISPs' network infrastructures can potentially enable better user experience and lower prices. For example, Google recently launched a cross-carrier MVNO (mobile virtual network operator) data plan called Project Fi, where users' devices can automatically access either of two partner cellular networks or any available open WiFi network. We consider the economic impact of cross-carrier MVNOs on the mobile data market. We begin by analyzing a network selection strategy that optimizes cross-carrier users' costs. We then study ISPs' behavior, deriving the prices that partner ISPs charge the cross-carrier MVNO and that the cross-carrier MVNO charges its end users. Although the cross-carrier MVNO may lose money from selling data, it can offset this loss with side revenue, e.g., advertisement revenue when users consume more content. We derive conditions under which the cross-carrier MVNO achieves a profit and its users reduce their costs. Finally, we use a real-world network quality dataset to simulate users' network selection behavior and demonstrate the benefits of the ISP competition brought by the cross-carrier MVNO.
互联网服务提供商(isp)努力投资升级其网络,以满足不断增长的移动数据需求,而用户不得不面对巨额的数据超限费。汇集互联网服务提供商的网络基础设施可能会带来更好的用户体验和更低的价格。例如,谷歌最近推出了一项名为Project Fi的跨运营商MVNO(移动虚拟网络运营商)数据计划,用户的设备可以自动访问两个合作伙伴的蜂窝网络或任何可用的开放WiFi网络。我们考虑了跨运营商mvno对移动数据市场的经济影响。我们首先分析优化跨运营商用户成本的网络选择策略。然后,我们研究了isp的行为,得出合作isp向跨运营商MVNO收取的价格,以及跨运营商MVNO向其最终用户收取的价格。尽管跨运营商MVNO可能会因为销售数据而亏损,但它可以用附带收入来抵消这种损失,例如,当用户消费更多内容时,广告收入。推导了跨载波MVNO实现盈利和用户降低成本的条件。最后,我们使用一个真实的网络质量数据集来模拟用户的网络选择行为,并展示了跨运营商MVNO带来的ISP竞争的好处。
{"title":"An economic analysis of wireless network infrastructure sharing","authors":"Liang Zheng, Jiasi Chen, Carlee Joe-Wong, C. Tan, M. Chiang","doi":"10.23919/WIOPT.2017.7959885","DOIUrl":"https://doi.org/10.23919/WIOPT.2017.7959885","url":null,"abstract":"Internet service providers (ISPs) struggle to invest in upgrading their networks to catch up with growing mobile data demand, while users have to face significant data overage fees. Pooling ISPs' network infrastructures can potentially enable better user experience and lower prices. For example, Google recently launched a cross-carrier MVNO (mobile virtual network operator) data plan called Project Fi, where users' devices can automatically access either of two partner cellular networks or any available open WiFi network. We consider the economic impact of cross-carrier MVNOs on the mobile data market. We begin by analyzing a network selection strategy that optimizes cross-carrier users' costs. We then study ISPs' behavior, deriving the prices that partner ISPs charge the cross-carrier MVNO and that the cross-carrier MVNO charges its end users. Although the cross-carrier MVNO may lose money from selling data, it can offset this loss with side revenue, e.g., advertisement revenue when users consume more content. We derive conditions under which the cross-carrier MVNO achieves a profit and its users reduce their costs. Finally, we use a real-world network quality dataset to simulate users' network selection behavior and demonstrate the benefits of the ISP competition brought by the cross-carrier MVNO.","PeriodicalId":6630,"journal":{"name":"2017 15th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85291230","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 16
Self-similarity in urban wireless networks: Hyperfractals 城市无线网络中的自相似性:超分形
P. Jacquet, D. Popescu
We introduce a model of Poisson patterns of fixed and mobile nodes on lines designed for urban wireless networks. The pattern obeys to "Hyperfractal" rules of dimension larger than 2. The hyperfractal pattern is best suitable for capturing the traffic over the streets and highways in a city. We show that the network capacity under ad hoc routing algorithms scales much better than with the classic uniform Poisson shot model. The scaling effect depends on the hyperfractal dimensions. We show this results in two different routing models: nearest neighbor routing with no collision, minimum delay routing model assuming slotted Aloha and signal to interference ratio (SIR) capture condition, power-path loss and Rayleigh fading. The novelty of the model is that, in addition to capturing the irregularity and variability of the node configuration, it exploits self-similarity, a characteristic of urban wireless networks.
本文介绍了城市无线网络线路上固定节点和移动节点的泊松模式模型。图案遵循维数大于2的“超分形”规则。超分形模式最适合用于捕捉城市街道和高速公路上的交通。研究表明,自组织路由算法下的网络容量比经典的均匀泊松模型有更好的扩展。标度效应取决于超分形维数。我们在两种不同的路由模型中展示了这一结果:无碰撞的最近邻路由,最小延迟路由模型,假设有槽Aloha和信号干扰比(SIR)捕获条件,功率路径损耗和瑞利衰落。该模型的新颖之处在于,除了捕捉节点配置的不规则性和可变性之外,它还利用了自相似性,这是城市无线网络的一个特征。
{"title":"Self-similarity in urban wireless networks: Hyperfractals","authors":"P. Jacquet, D. Popescu","doi":"10.23919/WIOPT.2017.7959939","DOIUrl":"https://doi.org/10.23919/WIOPT.2017.7959939","url":null,"abstract":"We introduce a model of Poisson patterns of fixed and mobile nodes on lines designed for urban wireless networks. The pattern obeys to \"Hyperfractal\" rules of dimension larger than 2. The hyperfractal pattern is best suitable for capturing the traffic over the streets and highways in a city. We show that the network capacity under ad hoc routing algorithms scales much better than with the classic uniform Poisson shot model. The scaling effect depends on the hyperfractal dimensions. We show this results in two different routing models: nearest neighbor routing with no collision, minimum delay routing model assuming slotted Aloha and signal to interference ratio (SIR) capture condition, power-path loss and Rayleigh fading. The novelty of the model is that, in addition to capturing the irregularity and variability of the node configuration, it exploits self-similarity, a characteristic of urban wireless networks.","PeriodicalId":6630,"journal":{"name":"2017 15th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73372941","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 12
Identification and insight into a long transitory phase in random-access protocols 识别和洞察随机访问协议中的长过渡阶段
C. Cano, D. Malone
In this work we show that random-access protocols, which are used in a range of networks (e.g. WiFi, power line communications and Internet of Things), may experience a high-throughput, extremely long (of the order of hours) transitory phase. This behaviour is not highlighted by common analysis techniques and experimental evaluations, which can lead to incorrect prediction of network performance. We identify factors that led to this transitory behaviour being overlooked in previous work. Via numerical analysis and experimental evaluation, we establish under which conditions this transitory phase occurs. Additionally, we give insight into the duration of this transitory period and its statistical properties.
在这项工作中,我们展示了在一系列网络(例如WiFi,电力线通信和物联网)中使用的随机访问协议可能会经历高吞吐量,极长(数小时)的过渡阶段。通常的分析技术和实验评估没有强调这种行为,这可能导致对网络性能的错误预测。我们确定了导致这种短暂行为在以前的工作中被忽视的因素。通过数值分析和实验评估,我们确定了在什么条件下会发生这一过渡阶段。此外,我们还深入了解了这一过渡时期的持续时间及其统计特性。
{"title":"Identification and insight into a long transitory phase in random-access protocols","authors":"C. Cano, D. Malone","doi":"10.23919/WIOPT.2017.7959898","DOIUrl":"https://doi.org/10.23919/WIOPT.2017.7959898","url":null,"abstract":"In this work we show that random-access protocols, which are used in a range of networks (e.g. WiFi, power line communications and Internet of Things), may experience a high-throughput, extremely long (of the order of hours) transitory phase. This behaviour is not highlighted by common analysis techniques and experimental evaluations, which can lead to incorrect prediction of network performance. We identify factors that led to this transitory behaviour being overlooked in previous work. Via numerical analysis and experimental evaluation, we establish under which conditions this transitory phase occurs. Additionally, we give insight into the duration of this transitory period and its statistical properties.","PeriodicalId":6630,"journal":{"name":"2017 15th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80107759","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Discounted-rate utility maximization (DRUM): A framework for delay-sensitive fair resource allocation 贴现率效用最大化(DRUM):延迟敏感的公平资源分配框架
A. Eryilmaz, Irem Koprulu
We introduce a new optimization framework, built over a discounted-rate metric, that captures the sensitivities of wireless users to time-variations in their fairness measure of rate allocations. The resulting, so-called, Discounted-Rate Utility Maximization (DRUM) formulation not only accommodates traditional long-term and less-explored instant fairness concepts in its extremes, but also encompasses all intermediate degrees of sensitivity to fluctuations in the users' rate allocations. After introducing the versatile DRUM formulation, we fully characterize its solution in the instantly-fair and long-term-fair extremes for the general class of ω-weighted α-fair utility functions. These solutions reveal the non-trivial impact of fading channel statistics and the utility function parameters on the rate allocations, even under perfectly symmetric network conditions. In particular, we demonstrate that the rate allocations lie between the maximum and the harmonic mean of the fading-channel rates. To achieve rates in-between these extremes, we also address the general solution of DRUM by proposing a novel low-complexity dynamic rate allocation algorithm that does not require the knowledge of the channel statistics. This algorithm is proven to achieve the optimal performance of the instantly-fair and long-term-fair solutions as the discount parameter approaches its lower and upper limits, respectively. We also study the fairness and rate allocation characteristics of our algorithm for intermediate values of the discount parameter in a Rayleigh-Fading environment.
我们引入了一个新的优化框架,建立在一个折现率指标,捕捉无线用户对时间变化的敏感性,在他们的公平衡量速率分配。由此产生的所谓折现率效用最大化(DRUM)公式不仅容纳了传统的长期和较少探索的即时公平概念的极端情况,而且还包含了对用户费率分配波动的所有中间敏感程度。在介绍了通用的DRUM公式后,我们在ω-加权α-公平效用函数的一般类别的即时公平和长期公平极值中充分表征了其解决方案。这些解决方案揭示了即使在完全对称的网络条件下,衰落信道统计数据和效用函数参数对速率分配的重要影响。特别地,我们证明了速率分配介于衰减信道速率的最大值和谐波平均值之间。为了实现介于这两个极端之间的速率,我们还通过提出一种新的低复杂度动态速率分配算法来解决DRUM的一般解决方案,该算法不需要了解信道统计信息。当贴现参数分别接近其下限和上限时,该算法实现了即时公平解和长期公平解的最优性能。在瑞利衰落环境下,我们还研究了该算法对折扣参数中间值的公平性和速率分配特性。
{"title":"Discounted-rate utility maximization (DRUM): A framework for delay-sensitive fair resource allocation","authors":"A. Eryilmaz, Irem Koprulu","doi":"10.23919/WIOPT.2017.7959921","DOIUrl":"https://doi.org/10.23919/WIOPT.2017.7959921","url":null,"abstract":"We introduce a new optimization framework, built over a discounted-rate metric, that captures the sensitivities of wireless users to time-variations in their fairness measure of rate allocations. The resulting, so-called, Discounted-Rate Utility Maximization (DRUM) formulation not only accommodates traditional long-term and less-explored instant fairness concepts in its extremes, but also encompasses all intermediate degrees of sensitivity to fluctuations in the users' rate allocations. After introducing the versatile DRUM formulation, we fully characterize its solution in the instantly-fair and long-term-fair extremes for the general class of ω-weighted α-fair utility functions. These solutions reveal the non-trivial impact of fading channel statistics and the utility function parameters on the rate allocations, even under perfectly symmetric network conditions. In particular, we demonstrate that the rate allocations lie between the maximum and the harmonic mean of the fading-channel rates. To achieve rates in-between these extremes, we also address the general solution of DRUM by proposing a novel low-complexity dynamic rate allocation algorithm that does not require the knowledge of the channel statistics. This algorithm is proven to achieve the optimal performance of the instantly-fair and long-term-fair solutions as the discount parameter approaches its lower and upper limits, respectively. We also study the fairness and rate allocation characteristics of our algorithm for intermediate values of the discount parameter in a Rayleigh-Fading environment.","PeriodicalId":6630,"journal":{"name":"2017 15th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82321288","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 7
A maximum dispersion approach for rate feasibility problems in SINR model SINR模型中速率可行性问题的最大离散方法
K. S. Prabh
In this paper, we propose a maximum dispersion based approach for the problem of determining the feasibility of a set of single-hop rates in SINR model. Recent algorithmic work on capacity maximization has focused on maximizing the number of simultaneously scheduled links. We show that such an approach is not suitable for the problem. We present a polynomial time algorithm to determine the feasibility. We present several simulation results to evaluate the proposed approach. The results confirm that maximum dispersion-based approach is well suited for the problem and that such an approach performs significantly better than the existing work.
在本文中,我们提出了一种基于最大色散的方法来确定SINR模型中一组单跳速率的可行性问题。最近关于容量最大化的算法工作主要集中在最大化同时调度的链路数量上。我们证明这种方法不适合解决这个问题。我们提出了一个多项式时间算法来确定可行性。我们给出了几个仿真结果来评估所提出的方法。结果表明,基于最大色散的方法非常适合于该问题,并且该方法的性能明显优于现有的方法。
{"title":"A maximum dispersion approach for rate feasibility problems in SINR model","authors":"K. S. Prabh","doi":"10.23919/WIOPT.2017.7959908","DOIUrl":"https://doi.org/10.23919/WIOPT.2017.7959908","url":null,"abstract":"In this paper, we propose a maximum dispersion based approach for the problem of determining the feasibility of a set of single-hop rates in SINR model. Recent algorithmic work on capacity maximization has focused on maximizing the number of simultaneously scheduled links. We show that such an approach is not suitable for the problem. We present a polynomial time algorithm to determine the feasibility. We present several simulation results to evaluate the proposed approach. The results confirm that maximum dispersion-based approach is well suited for the problem and that such an approach performs significantly better than the existing work.","PeriodicalId":6630,"journal":{"name":"2017 15th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88369491","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
期刊
2017 15th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1