首页 > 最新文献

2017 IEEE 86th Vehicular Technology Conference (VTC-Fall)最新文献

英文 中文
Network Coded Cooperation Based on Relay Selection with Imperfect CSI 基于不完全CSI中继选择的网络编码合作
Pub Date : 2017-09-01 DOI: 10.1109/VTCFall.2017.8287999
A. Heidarpour, M. Ardakani, C. Tellambura
In this paper, we investigate the performance of network coded cooperation (NCC) systems based on relay selection in the presence of imperfect channel state information (CSI). Specifically, we consider an uplink cellular scenario with $mathcal{N}$ sources, $mathcal{M}$ relays and a single destination. The relays adopt decode and forward (DF) relaying and use maximum distance separable (MDS) codes as their encoding vectors. We investigate the impact of imperfect CSI on outage probability and asymptotic and finite-SNR diversity-multiplexing tradeoff (DMT) of the system under consideration. Simulation results are further presented to corroborate the analytical findings and provide insight into the system design where imperfect CSI and finite SNR regime are taken into account.
本文研究了在不完全信道状态信息(CSI)存在下,基于中继选择的网络编码合作(NCC)系统的性能。具体来说,我们考虑了一个具有$mathcal{N}$源、$mathcal{M}$中继和单个目的地的上行蜂窝场景。继电器采用译码转发(DF)中继,采用最大距离可分离码(MDS)作为编码矢量。我们研究了不完全CSI对系统的中断概率和渐近有限信噪比分集复用权衡(DMT)的影响。仿真结果进一步证实了分析结果,并为考虑不完美CSI和有限信噪比制度的系统设计提供了见解。
{"title":"Network Coded Cooperation Based on Relay Selection with Imperfect CSI","authors":"A. Heidarpour, M. Ardakani, C. Tellambura","doi":"10.1109/VTCFall.2017.8287999","DOIUrl":"https://doi.org/10.1109/VTCFall.2017.8287999","url":null,"abstract":"In this paper, we investigate the performance of network coded cooperation (NCC) systems based on relay selection in the presence of imperfect channel state information (CSI). Specifically, we consider an uplink cellular scenario with $mathcal{N}$ sources, $mathcal{M}$ relays and a single destination. The relays adopt decode and forward (DF) relaying and use maximum distance separable (MDS) codes as their encoding vectors. We investigate the impact of imperfect CSI on outage probability and asymptotic and finite-SNR diversity-multiplexing tradeoff (DMT) of the system under consideration. Simulation results are further presented to corroborate the analytical findings and provide insight into the system design where imperfect CSI and finite SNR regime are taken into account.","PeriodicalId":375803,"journal":{"name":"2017 IEEE 86th Vehicular Technology Conference (VTC-Fall)","volume":"302 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115372128","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}
引用次数: 4
A Search-Free Algorithm for Precoder Selection in FD-MIMO Systems with DFT-Based Codebooks 基于dft码本的FD-MIMO系统预编码器选择的无搜索算法
Pub Date : 2017-09-01 DOI: 10.1109/VTCFall.2017.8288030
F. Penna, Hongbin Cheng, Jungwon Lee
In this paper, we propose a novel method for selecting the precoding matrix indicator (PMI) from a DFT-based codebook, such as the one specified for LTE full dimension (FD) MIMO. While conventional approaches are based on explicit codebook search, our method directly estimates the best PMI from the singular vectors of the channel matrix. The key idea is to exploit the DFT structure to formulate the PMI selection problem as the estimation of the linear phase ramping of a sequence. The main advantage of the proposed method is that its complexity does not scale with the number of PMI candidates, while achieving performance comparable or superior to that of state-of-the-art search-based approaches.
在本文中,我们提出了一种从基于dft的码本中选择预编码矩阵指示器(PMI)的新方法,例如LTE全维(FD) MIMO指定的预编码矩阵指示器。传统方法基于显式码本搜索,而我们的方法直接从通道矩阵的奇异向量中估计最佳PMI。关键思想是利用DFT结构将PMI选择问题表述为序列的线性相位斜坡的估计。所提出的方法的主要优点是其复杂性不随PMI候选项的数量而增加,同时实现了与最先进的基于搜索的方法相当或更好的性能。
{"title":"A Search-Free Algorithm for Precoder Selection in FD-MIMO Systems with DFT-Based Codebooks","authors":"F. Penna, Hongbin Cheng, Jungwon Lee","doi":"10.1109/VTCFall.2017.8288030","DOIUrl":"https://doi.org/10.1109/VTCFall.2017.8288030","url":null,"abstract":"In this paper, we propose a novel method for selecting the precoding matrix indicator (PMI) from a DFT-based codebook, such as the one specified for LTE full dimension (FD) MIMO. While conventional approaches are based on explicit codebook search, our method directly estimates the best PMI from the singular vectors of the channel matrix. The key idea is to exploit the DFT structure to formulate the PMI selection problem as the estimation of the linear phase ramping of a sequence. The main advantage of the proposed method is that its complexity does not scale with the number of PMI candidates, while achieving performance comparable or superior to that of state-of-the-art search-based approaches.","PeriodicalId":375803,"journal":{"name":"2017 IEEE 86th Vehicular Technology Conference (VTC-Fall)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115474708","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}
引用次数: 3
Load Balancing Oriented Computation Offloading in Mobile Cloudlet 面向负载均衡的移动Cloudlet计算卸载
Pub Date : 2017-09-01 DOI: 10.1109/VTCFall.2017.8288336
Danhui Yao, Lin Gui, Fen Hou, Fei Sun, Daihui Mo, Hangguan Shan
The limited computing ability of mobile device constrains its performance on complex mobile applications. Mobile cloud computing (MCC) has therefore emerged to migrate computation-intensive tasks to remote clouds or mobile cloudlets. Most strategies allocate tasks with minimal response time yet few consider the load of the nodes. In this paper, we focus on the load balancing problem for nodes when they conduct offloading. We first establish a five-tuple characterized task model to capture the response time of offloaded tasks. Then, we formulate the task allocation problem as an integer linear problem (ILP) under certain conditions. Furthermore, we propose a two-step appointment- driven strategy to solve this problem with minimal task response time. Specifically, a modified genetic algorithm (GA) is adopted to coordinate the load of the nodes. Simulations are conducted to prove the feasibility of our strategy and evaluate the performance of load coordination.
移动设备有限的计算能力制约了其在复杂移动应用中的性能。因此,移动云计算(MCC)的出现是为了将计算密集型任务迁移到远程云或移动云。大多数策略以最小的响应时间分配任务,但很少考虑节点的负载。本文主要研究节点卸载时的负载均衡问题。我们首先建立了一个五元组特征任务模型来捕获卸载任务的响应时间。然后,在一定条件下,将任务分配问题表述为整数线性问题(ILP)。此外,我们提出了一种两步预约驱动策略,以最小的任务响应时间来解决这一问题。具体来说,采用一种改进的遗传算法(GA)来协调节点的负载。通过仿真验证了该策略的可行性,并对负载协调的性能进行了评价。
{"title":"Load Balancing Oriented Computation Offloading in Mobile Cloudlet","authors":"Danhui Yao, Lin Gui, Fen Hou, Fei Sun, Daihui Mo, Hangguan Shan","doi":"10.1109/VTCFall.2017.8288336","DOIUrl":"https://doi.org/10.1109/VTCFall.2017.8288336","url":null,"abstract":"The limited computing ability of mobile device constrains its performance on complex mobile applications. Mobile cloud computing (MCC) has therefore emerged to migrate computation-intensive tasks to remote clouds or mobile cloudlets. Most strategies allocate tasks with minimal response time yet few consider the load of the nodes. In this paper, we focus on the load balancing problem for nodes when they conduct offloading. We first establish a five-tuple characterized task model to capture the response time of offloaded tasks. Then, we formulate the task allocation problem as an integer linear problem (ILP) under certain conditions. Furthermore, we propose a two-step appointment- driven strategy to solve this problem with minimal task response time. Specifically, a modified genetic algorithm (GA) is adopted to coordinate the load of the nodes. Simulations are conducted to prove the feasibility of our strategy and evaluate the performance of load coordination.","PeriodicalId":375803,"journal":{"name":"2017 IEEE 86th Vehicular Technology Conference (VTC-Fall)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124254572","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}
引用次数: 9
Cache Placement Solutions in Software-Defined Radio Access Networks 软件定义无线接入网络中的缓存放置解决方案
Pub Date : 2017-09-01 DOI: 10.1109/VTCFall.2017.8288091
Ngoc-Dung Dào, H. Farmanbar, Han Zhang
In this paper, we present low-complexity algorithms for cache placement problem in software-defined radio access networks. Our key design target is that the packet delay from any cache to its associated users is below a threshold. This feature is a significant improvement compared to conventional approaches relying on the average hop count. We introduce a traffic engineering solution for joint multiserver selection and rate allocation. This algorithm is used to minimize the cache placement cost function, such as delivery cost per bit. Our cache placement method allows prediction of user throughput and thus the network throughput. Extensive simulation results verify that our method can give optimal or near optimal network throughput while guaranteeing packet delay performance.
本文针对软件定义无线接入网络中的缓存放置问题,提出了一种低复杂度的算法。我们的主要设计目标是从任何缓存到其关联用户的数据包延迟低于阈值。与依赖于平均跳数的传统方法相比,该特性是一个显著的改进。介绍了一种联合多服务器选择和速率分配的流量工程解决方案。该算法用于最小化缓存放置成本函数,如每比特的传输成本。我们的缓存放置方法允许预测用户吞吐量,从而预测网络吞吐量。大量的仿真结果验证了我们的方法可以在保证包延迟性能的同时提供最优或接近最优的网络吞吐量。
{"title":"Cache Placement Solutions in Software-Defined Radio Access Networks","authors":"Ngoc-Dung Dào, H. Farmanbar, Han Zhang","doi":"10.1109/VTCFall.2017.8288091","DOIUrl":"https://doi.org/10.1109/VTCFall.2017.8288091","url":null,"abstract":"In this paper, we present low-complexity algorithms for cache placement problem in software-defined radio access networks. Our key design target is that the packet delay from any cache to its associated users is below a threshold. This feature is a significant improvement compared to conventional approaches relying on the average hop count. We introduce a traffic engineering solution for joint multiserver selection and rate allocation. This algorithm is used to minimize the cache placement cost function, such as delivery cost per bit. Our cache placement method allows prediction of user throughput and thus the network throughput. Extensive simulation results verify that our method can give optimal or near optimal network throughput while guaranteeing packet delay performance.","PeriodicalId":375803,"journal":{"name":"2017 IEEE 86th Vehicular Technology Conference (VTC-Fall)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124264594","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
Energy Efficiency Fairness in Heterogeneous Cellular Networks with Wireless Power Transfer 无线能量传输异构蜂窝网络的能量效率公平性
Pub Date : 2017-09-01 DOI: 10.1109/VTCFall.2017.8288121
Jing Zhang, Guoheng Liu, Yan Liao, Qingjie Zhou, Qiang Li
This paper studies the fairness for energy efficient in multi-tier downlink heterogeneous cellular networks (HCNs), where user equipments (UEs) can receive information and harvest energy from wireless power transfer. To balance the UEs received information and harvested energy in HCNs, we proposed an energy-efficiency-based proportionally fairness utility function. Based on the analysis for transmission rate and harvested energy of UEs, we show the energy-efficiency-based proportionally fairness is concave function for received threshold when association probability is fixed. Exploiting alternative programming for joint association probability and received threshold, we propose an efficient iterative algorithm for obtaining the suboptimal solution. Simulation results demonstrate the energy efficiency of multi-tier downlink HCNs improvement brought by the proposed suboptimal association probability and received threshold compared to the scheme that received threshold is low.
本文研究了多层下行异构蜂窝网络(HCNs)的能效公平性,在该网络中,用户设备可以从无线电力传输中接收信息并获取能量。为了平衡ue在hcn中接收到的信息和收获的能量,我们提出了一个基于能效的比例公平效用函数。通过对ue的传输速率和收获能量的分析,证明了当关联概率固定时,基于能效的比例公平性是接收阈值的凹函数。利用联合关联概率和接收阈值的备选规划,提出了一种求解次优解的高效迭代算法。仿真结果表明,与接收阈值较低的方案相比,所提出的次优关联概率和接收阈值方案提高了多层下行hcn的能效。
{"title":"Energy Efficiency Fairness in Heterogeneous Cellular Networks with Wireless Power Transfer","authors":"Jing Zhang, Guoheng Liu, Yan Liao, Qingjie Zhou, Qiang Li","doi":"10.1109/VTCFall.2017.8288121","DOIUrl":"https://doi.org/10.1109/VTCFall.2017.8288121","url":null,"abstract":"This paper studies the fairness for energy efficient in multi-tier downlink heterogeneous cellular networks (HCNs), where user equipments (UEs) can receive information and harvest energy from wireless power transfer. To balance the UEs received information and harvested energy in HCNs, we proposed an energy-efficiency-based proportionally fairness utility function. Based on the analysis for transmission rate and harvested energy of UEs, we show the energy-efficiency-based proportionally fairness is concave function for received threshold when association probability is fixed. Exploiting alternative programming for joint association probability and received threshold, we propose an efficient iterative algorithm for obtaining the suboptimal solution. Simulation results demonstrate the energy efficiency of multi-tier downlink HCNs improvement brought by the proposed suboptimal association probability and received threshold compared to the scheme that received threshold is low.","PeriodicalId":375803,"journal":{"name":"2017 IEEE 86th Vehicular Technology Conference (VTC-Fall)","volume":"35 38","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120821429","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
Spectral Efficiency Maximization for Massive Multiuser MIMO Downlink TDD Systems via Data Power Allocation with MRT Precoding 基于MRT预编码的海量多用户MIMO下行TDD系统的频谱效率最大化
Pub Date : 2017-09-01 DOI: 10.1109/VTCFall.2017.8288018
O. Saatlou, M. Ahmad, M. Swamy
This paper studies the problem of maximizing the spectral efficiency in a massive multi-user MIMO downlink (DL) system where the base station employs a large number of antennas and serves single-antenna users in one cell, assuming time- division duplex transmission. In order to maximize the spectral efficiency in a DL transmission, a new method for power allocation among users is proposed based on the water-filling approach. To this end, a lower bound on the achievable rate is derived for each user in the presence of maximum- ratio transmission precoding and employed in defining the spectral efficiency. Since maximizing the spectral efficiency is an NP-hard problem, an effective algorithm is also proposed to find Karush-Kuhn-Tucker (local maximum) points. The performance of the proposed power allocation method is verified by conducting simulations and shown to be superior to other existing methods in terms of higher spectral efficiency.
本文研究了大规模多用户MIMO下行链路系统中频谱效率最大化的问题,该系统中基站采用大量天线,在一个小区中为单天线用户服务,假设采用时分双工传输。为了最大限度地提高DL传输中的频谱效率,提出了一种基于注水法的用户间功率分配新方法。为此,导出了在最大比传输预编码存在的情况下每个用户可达到的速率的下界,并用于定义频谱效率。由于谱效率最大化是一个np困难问题,因此提出了一种寻找Karush-Kuhn-Tucker(局部最大值)的有效算法。通过仿真验证了所提出的功率分配方法的性能,并表明该方法在更高的频谱效率方面优于其他现有方法。
{"title":"Spectral Efficiency Maximization for Massive Multiuser MIMO Downlink TDD Systems via Data Power Allocation with MRT Precoding","authors":"O. Saatlou, M. Ahmad, M. Swamy","doi":"10.1109/VTCFall.2017.8288018","DOIUrl":"https://doi.org/10.1109/VTCFall.2017.8288018","url":null,"abstract":"This paper studies the problem of maximizing the spectral efficiency in a massive multi-user MIMO downlink (DL) system where the base station employs a large number of antennas and serves single-antenna users in one cell, assuming time- division duplex transmission. In order to maximize the spectral efficiency in a DL transmission, a new method for power allocation among users is proposed based on the water-filling approach. To this end, a lower bound on the achievable rate is derived for each user in the presence of maximum- ratio transmission precoding and employed in defining the spectral efficiency. Since maximizing the spectral efficiency is an NP-hard problem, an effective algorithm is also proposed to find Karush-Kuhn-Tucker (local maximum) points. The performance of the proposed power allocation method is verified by conducting simulations and shown to be superior to other existing methods in terms of higher spectral efficiency.","PeriodicalId":375803,"journal":{"name":"2017 IEEE 86th Vehicular Technology Conference (VTC-Fall)","volume":"96 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124986241","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}
引用次数: 3
Constellation Design for Quadrature Spatial Modulation 正交空间调制星座设计
Pub Date : 2017-09-01 DOI: 10.1109/VTCFall.2017.8287934
Binh T. Vo, Ha H. Nguyen, H. Tuan
This paper considers constellation design for quadrature spatial modulation (QSM) to minimize the average probability of error. Different than the constellation design previously obtained for spatial modulation (SM), it is shown that, the error performance of QSM not only depends on the Euclidean distances between the amplitude-phase modulation (APM) symbols and the energies of APM symbols, but also on the in-phase and quadrature components of the QSM symbols. The analysis of the union bound of the average error probability reveals that at a very large number of transmit antennas, the optimal constellations for QSM converge to a quadrature phase-shift keying (QPSK) constellation. Simulation results demonstrate the performance superiority of the obtained constellations over the standard PSK and QAM constellations, as well as the constellations specifically designed for SM.
为使正交空间调制(QSM)的平均误差概率最小化,提出了星座设计方法。与以往空间调制星座设计不同的是,空间调制星座的误差性能不仅取决于幅相调制符号与幅相调制符号能量之间的欧氏距离,还取决于幅相调制符号的同相分量和正交分量。对平均误差概率的联合界分析表明,在发射天线数量非常大的情况下,QSM的最优星座收敛为正交相移键控(QPSK)星座。仿真结果表明,所得星座的性能优于标准PSK和QAM星座,也优于专为SM设计的星座。
{"title":"Constellation Design for Quadrature Spatial Modulation","authors":"Binh T. Vo, Ha H. Nguyen, H. Tuan","doi":"10.1109/VTCFall.2017.8287934","DOIUrl":"https://doi.org/10.1109/VTCFall.2017.8287934","url":null,"abstract":"This paper considers constellation design for quadrature spatial modulation (QSM) to minimize the average probability of error. Different than the constellation design previously obtained for spatial modulation (SM), it is shown that, the error performance of QSM not only depends on the Euclidean distances between the amplitude-phase modulation (APM) symbols and the energies of APM symbols, but also on the in-phase and quadrature components of the QSM symbols. The analysis of the union bound of the average error probability reveals that at a very large number of transmit antennas, the optimal constellations for QSM converge to a quadrature phase-shift keying (QPSK) constellation. Simulation results demonstrate the performance superiority of the obtained constellations over the standard PSK and QAM constellations, as well as the constellations specifically designed for SM.","PeriodicalId":375803,"journal":{"name":"2017 IEEE 86th Vehicular Technology Conference (VTC-Fall)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126135006","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}
引用次数: 4
Optimal Resource Allocation for Data Offloading in Energy-Harvesting Small-Cell Networks 能量收集小蜂窝网络中数据卸载的最优资源分配
Pub Date : 2017-09-01 DOI: 10.1109/VTCFall.2017.8288116
Yutong Yan, L. Qian, Yuan Wu, Weidang Lu
Offloading data traffic from the conventional macro- cell base stations to densely deployed small-cell base stations (SBSs) has been emerging as a promising technique to support the explosion of data traffic with reduced energy consumption and improved quality of service provision. In this paper, we study the joint spectrum allocation and power allocation problem for the data offloading in energy-harvesting downlink small-cell networks. First, we formulate the resource allocation problem under the revenue maximization criterion, which is expressed as the difference between the total utility across users and the total power payment. By proving the convexity of the problem, we can compute the solution efficiently. Numerical results show that the energy-efficiency can be improved while alleviating the burden of macro-cell base station through using the resource allocation scheme proposed for data offloading.
将数据流量从传统的宏蜂窝基站卸载到密集部署的小蜂窝基站(SBSs)已经成为一种有前途的技术,可以在降低能耗和提高服务提供质量的同时支持数据流量的爆炸式增长。本文研究了能量采集下行链路小蜂窝网络中数据卸载的联合频谱分配和功率分配问题。首先,我们建立了收益最大化准则下的资源分配问题,收益最大化准则表示为用户之间的总效用与总电力支付之差。通过证明问题的凸性,我们可以有效地计算出解。数值结果表明,采用本文提出的数据卸载资源分配方案可以在减轻宏蜂窝基站负担的同时提高能效。
{"title":"Optimal Resource Allocation for Data Offloading in Energy-Harvesting Small-Cell Networks","authors":"Yutong Yan, L. Qian, Yuan Wu, Weidang Lu","doi":"10.1109/VTCFall.2017.8288116","DOIUrl":"https://doi.org/10.1109/VTCFall.2017.8288116","url":null,"abstract":"Offloading data traffic from the conventional macro- cell base stations to densely deployed small-cell base stations (SBSs) has been emerging as a promising technique to support the explosion of data traffic with reduced energy consumption and improved quality of service provision. In this paper, we study the joint spectrum allocation and power allocation problem for the data offloading in energy-harvesting downlink small-cell networks. First, we formulate the resource allocation problem under the revenue maximization criterion, which is expressed as the difference between the total utility across users and the total power payment. By proving the convexity of the problem, we can compute the solution efficiently. Numerical results show that the energy-efficiency can be improved while alleviating the burden of macro-cell base station through using the resource allocation scheme proposed for data offloading.","PeriodicalId":375803,"journal":{"name":"2017 IEEE 86th Vehicular Technology Conference (VTC-Fall)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125552080","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
Using the Fireworks Algorithm for ML Detection of Nonlinear OFDM 用Fireworks算法进行非线性OFDM的ML检测
Pub Date : 2017-09-01 DOI: 10.1109/VTCFall.2017.8287944
João Guerreiro, M. Beko, R. Dinis, P. Montezuma
Orthogonal frequency division multiplexing (OFDM) schemes have high envelope fluctuations and peak- to-average power ratio (PAPR), making them very prone to nonlinear distortion effects, which can affect significantly the performance when conventional receivers are employed. However, it was recently shown that strong nonlinear distortion effects on OFDM signals do not necessarily lead to performance degradation. In fact, nonlinear OFDM schemes can outperform linear ones when optimum maximum likelihood (ML) receivers are employed. In this paper, we considered OFDM schemes with strong nonlinear distortion effects and we proposed a low- complexity detection scheme able to approach the optimum ML performance. Our technique is based on the fireworks algorithm (FWA) and allows excellent trade-offs between performance and complexity.
正交频分复用(OFDM)方案具有较高的包络波动和峰值平均功率比(PAPR),很容易受到非线性失真的影响,在使用传统接收机的情况下,这将严重影响其性能。然而,最近的研究表明,对OFDM信号的强烈非线性失真效应并不一定会导致性能下降。事实上,当采用最优最大似然(ML)接收机时,非线性OFDM方案的性能优于线性OFDM方案。在本文中,我们考虑了具有强非线性失真效应的OFDM方案,并提出了一种能够接近最佳机器学习性能的低复杂度检测方案。我们的技术基于烟花算法(fireworks algorithm, FWA),可以在性能和复杂性之间进行很好的权衡。
{"title":"Using the Fireworks Algorithm for ML Detection of Nonlinear OFDM","authors":"João Guerreiro, M. Beko, R. Dinis, P. Montezuma","doi":"10.1109/VTCFall.2017.8287944","DOIUrl":"https://doi.org/10.1109/VTCFall.2017.8287944","url":null,"abstract":"Orthogonal frequency division multiplexing (OFDM) schemes have high envelope fluctuations and peak- to-average power ratio (PAPR), making them very prone to nonlinear distortion effects, which can affect significantly the performance when conventional receivers are employed. However, it was recently shown that strong nonlinear distortion effects on OFDM signals do not necessarily lead to performance degradation. In fact, nonlinear OFDM schemes can outperform linear ones when optimum maximum likelihood (ML) receivers are employed. In this paper, we considered OFDM schemes with strong nonlinear distortion effects and we proposed a low- complexity detection scheme able to approach the optimum ML performance. Our technique is based on the fireworks algorithm (FWA) and allows excellent trade-offs between performance and complexity.","PeriodicalId":375803,"journal":{"name":"2017 IEEE 86th Vehicular Technology Conference (VTC-Fall)","volume":"85 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126606117","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}
引用次数: 5
Know Thy Neighbor - A Data-Driven Approach to Neighborhood Estimation in VANETs 了解你的邻居——一种数据驱动的邻域估计方法
Pub Date : 2017-09-01 DOI: 10.1109/VTCFall.2017.8288303
Karsten Roscher, Thomas Nitsche, R. Knorr
Current advances in vehicular ad-hoc networks (VANETs) point out the importance of multi-hop message dissemination. For this type of communication, the selection of neighboring nodes with stable links is vital. In this work, we address the neighbor selection problem with a data-driven approach. To this aim, we apply machine learning techniques to a massive data-set of ETSI ITS message exchange samples, obtained from simulated traffic in the highly detailed Luxembourg SUMO Traffic (LuST) Scenario. As a result, we present classification methods that increase neighbor selection accuracy by up to 43% compared to the state of the art.
当前车载自组织网络(vanet)的发展表明了多跳消息分发的重要性。对于这种类型的通信,选择具有稳定链路的相邻节点至关重要。在这项工作中,我们用数据驱动的方法解决了邻居选择问题。为此,我们将机器学习技术应用于ETSI ITS消息交换样本的大量数据集,这些数据集来自非常详细的卢森堡相扑交通(LuST)场景中的模拟交通。因此,我们提出的分类方法与现有方法相比,将邻居选择精度提高了43%。
{"title":"Know Thy Neighbor - A Data-Driven Approach to Neighborhood Estimation in VANETs","authors":"Karsten Roscher, Thomas Nitsche, R. Knorr","doi":"10.1109/VTCFall.2017.8288303","DOIUrl":"https://doi.org/10.1109/VTCFall.2017.8288303","url":null,"abstract":"Current advances in vehicular ad-hoc networks (VANETs) point out the importance of multi-hop message dissemination. For this type of communication, the selection of neighboring nodes with stable links is vital. In this work, we address the neighbor selection problem with a data-driven approach. To this aim, we apply machine learning techniques to a massive data-set of ETSI ITS message exchange samples, obtained from simulated traffic in the highly detailed Luxembourg SUMO Traffic (LuST) Scenario. As a result, we present classification methods that increase neighbor selection accuracy by up to 43% compared to the state of the art.","PeriodicalId":375803,"journal":{"name":"2017 IEEE 86th Vehicular Technology Conference (VTC-Fall)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126618388","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}
引用次数: 4
期刊
2017 IEEE 86th Vehicular Technology Conference (VTC-Fall)
全部 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